On the primitive subspace of Lando framed graph bialgebra

Lando framed graph bialgebra is generated by framed graphs modulo 4-term relations. We provide an explicit set of generators of its primitive subspace and a description of the set of relations between the generators. We also define an operation of leaf addition that endows the primitive subspace of Lando algebra with a structure of a module over the ring of polynomials in one variable and construct a 4-invariant that satisfies a simple identity with respect to the vertex-multiplication.


Introduction
The theory of finite-type knot invariants was first proposed by V. Vassiliev [18], who introduced a filtration on the space of knot invariants with finite-dimensional components.A similar filtration on invariants of plane curves was later proposed by Arnold in [1].In both cases, the graded vector spaces associated with these filtrations can be realized as subspaces of the duals to the finite-dimensional spaces of chord diagrams [2,9], with the framing added in the case of plane curves.These associated graded spaces are known as the spaces of (framed) weight systems.
Despite significant progress, the study of the space of the finite type invariants for knots and plane curves remains incomplete.For example, even the dimensions of the spaces of weight systems are only known for the first few terms [6,14].However, the existence of the structure of a commutative cocommutative connected bialgebra of a finite type, rich combinatorics, and its unexpected relations to other mathematical concepts (e.g.Lie algebras) make these spaces an extremely interesting object of study.
One such relation is the existence of a map from a dual of a quotient of the algebra generated by graphs on  vertices to the degree  grading component of the space of weight systems.This map was first described in [8] and then extended to the framed case in [9].The above-mentioned quotient of the algebra of graphs is referred to as the Lando framed graph bialgebra, or simply the Lando bialgebra.The dimensions of the graded components of the Lando bialgebra are not known in general, see [15,16].The linear functions on the Lando bialgebra are known as framed 4-invariants.The state of the art of the study of 4-invariants can be found in [7].
The theory of weight systems is more developed than the theory of 4-invariants, with three different realizations of the space of weight systems (algebras , ℬ and  of [4]), each with its advantages and disadvantages.For two of these realizations, the description of the corresponding primitive subspace is direct in the sense that the generators and relations are known.However, for the Lando bialgebra, the current state-of-the-art description of the primitive subspace is not direct -we can only say that it is generated by images of the generators of the graph space under the projection operator (see [8]).
In this note, we introduce a graph-theoretic analogue of algebra .Our proposed construction gives a more direct description of its primitive subspace in terms of generators and relations.We also introduce a graph-theoretic counterpart of the well-known operation of bubble insertion and propose a new 4-invariant.
This note is dedicated to the memory of S.V. Duzhin, who introduced the theory of finite-type knot invariants to the author.I am grateful to B. Bychkov for valuable discussions and D. Fomichev for implementing computer codes to verify the constructions in this note.I am also grateful to Jacob Mostovoy, and the anonymous referee, whose comments allowed me to make the text clearer.
Below, K is a characteristic 0 field.
1 Bialgebra structures on the spaces generated by isomorphism classes of framed finite simple graphs Definition 1.1.The framing on a finite graph is a function  from the set of its vertices to F 2 .
The framed graphs have a naturally defined notion of framing preserving isomorphism.We will refer to the equivalence classes of framed finite simple graphs, as just framed graphs.S.A. Joni and G.C. Rota [5] have proposed to endow the vector space spanned by the framed graphs with the structure of a commutative cocommutative connected bialgebra of finite type over K: Definition 1.2.The graded bialgebra   ℛ over K is spanned by framed graphs.The grading is given by the number of vertices of the graph.The product on   ℛ is the extension by linearity of the disjoint union of graphs.The unit element is the empty graph, the counit element maps the empty graph to 1, and all the other graphs to 0. The coproduct is given by where the sum is taken over all possible ways to split the set of vertices of Γ into two disjoint subsets  and .We denote by Γ  (Γ  , respectively), the full subgraph of Γ generated by the set of vertices  (, respectively).
We define the following algebra closely related to   ℛ .
Below we will refer to the edges with coloring  (coloring , respectively) as to black (respectively, red) edges 1 .
We define the following commutative cocommutative connected bialgebra of finite type structure on the vector space spanned by the colored framed graphs: Definition 1.4.The graded bialgebra   over K is spanned by colored framed graphs.The grading is given by the number of vertices of the graph.The product on   is the extension by the linearity of the disjoint union of graphs.The unit element is the empty graph, the counit element maps the empty graph to 1, and all other graphs to 0. The coproduct is given by where the sum is taken over all possible ways to split the set of vertices of graph Γ into two disjoint subsets  and , such that no vertex from  is connected to a vertex from  by a red edge.We denote by Γ  (Γ  , respectively), the full subgraph of Γ generated by the set of vertices  (, respectively), respecting the coloring of the edge.
The proof that the introduced operations define a bialgebra structure is a routine verification of the axioms, which we omit.
The algebra   ℛ admits an injective graded bialgebra map  to the algebra   .Namely, every framed graph is mapped to itself all the edges colored black.
In this note, we use the following convention for visualizing the elements of   .The color of an edge of a depicted graph corresponds to the value of the coloring function on it.Capital letters indicate the framings of the vertices.Small letters stand for subsets of vertices of   ; the subsets corresponding to different letters are not necessarily disjoint.A small letter written on an edge endpoint indicates that, besides the edges that are drawn explicitly, this vertex is also connected to each vertex from the subset denoted by that letter.The parts of the graphs that are omitted from the picture are assumed to be the same.
We define   to be the ideal of   spanned by all the possible elements of the form: 1 We follow [11] in the choice of the colors.

𝑥
where   means the number of edges with state  in .
The map  evaluated on any element of   is 0.Moreover, its restriction on the image of  is a two-sided inverse to .As any element of   modulo   is equivalent to a linear combination of graphs with all the edges colored black, the isomorphism on the level of algebras follows.
The ideal which implies that the bialgebra structure on the quotient   /  is well-defined.The fact that the map  is a coalgebra morphism is a routine check we omit.
According to the Milnor-Moore theorem [12] any commutative cocommutative graded connected bialgebra  of finite type over K with the coproduct operation ∆ is isomorphic to the symmetric algebra of its primitive subspace, that is, the graded subspace of  formed by the elements  ∈  such that Given a bialgebra , we will denote its primitive subspace by  .
In particular, it follows that the restrictions of the maps  and  to the corresponding primitive subspaces are graded linear isomorphisms.It turns out that the primitive subspace of   /  admits a simple description.
Proposition 1.2.The primitive subspace of   /  is generated by the connected framed graphs with all the edges colored red.
Proof.Using the relations, we can represent any element of   /  as a linear combination of classes of the graphs with all the edges colored red.On the other hand, the class of any connected framed graph with all the edges colored red is a primitive element.Also, the relations allow us to represent any element of the factor as a disjoint union of connected framed graphs colored red.The assertion follows.
The isomorphism between   ℛ and   /  implies the following formula for the projection operator from   ℛ to the subspace of its primitive elements.
Proposition 1.3.Let   ℛ is a linear endomorphism of   ℛ defined on the generators as where the summation goes along all possible pairs Γ ′′ ⊂ Γ ′ of subgraphs of Γ, such that Γ ′ is connected, and Γ ′′ a spanning subgraph of Γ.
The map   ℛ is a projection on the primitive subspace along the subspace of decomposable elements.
Proof.The map   ℛ is the composition of the following operations: the isomorphism , the realization of the resulting element as a linear combination of the framed graphs with all the edges colored red, the projection   , which is defined on the graphs with all the edges colored red as
This formula is an alternative version of the projection formula [8,13].The reader is invited to compare this statement with the Remark to section 2.2 of [7] -it describes, implicitly, the result of applying  to a primitive element of   /  .
We would like to remark that the algebra   /  admits one more projection to the subspace of primitives: a graph with all the edges colored red is mapped to the join of its connected components.It would be interesting to get an explicit description of its kernel.
Recall, that the Lando framed graph bialgebra ℒ (or just the Lando bialgebra, [8,9]) is defined as the quotient of   ℛ by the biideal ℱ  ℛ generated by 4-elements, usually written in the form.
Γ − Γ ′  − (−1)  () ( Γ − Γ′  ).This formula has the following meaning.Let Γ be a graph, and let ,  be two of its vertices joined by an edge.Then Γ ′  denotes the graph obtained from Γ by erasing the edge between  and .The graph Γ is obtained from Γ by the following operation: for every vertex  different from ,  and connected by an edge with , the vertices  and  are joined by an edge in Γ if and only if the vertices  and  are not joined in Γ.The adjacencies of all other possible pairs of vertices in Γ and Γ are the same.The graph Γ′  is obtained from Γ by erasing the edge between  and .Finally, the framing of the vertex  in both Γ and Γ′  is set to  () +  ().Using the isomorphism between   ℛ and   /  any 4-element can be written as a class of the following element of   : Here, the vertex  has framing , the vertex  has framing ,  and  are subsets of vertices of the graph that are joined by edges to the corresponding vertices ( ∩  can be non-empty), and  △  denotes the symmetric difference of the corresponding sets of vertices.The difference between the left-hand side and the right-hand side of the expression is the following: in the graph on the right the edges of the graph that connected elements of  ∩  to the vertex of framing  are erased, but the edges between the vertices forming  ∖  and the vertex of framing  are added.Moreover, the framing  is changed to  +  (recall, that the framing takes values in F 2 , so we can add the values).In the following, any depicted element of   means its class modulo   .
The following proposition describes the image ℱ  ℛ under the isomorphism .
Proposition 1.4.ℱ  = (ℱ  ℛ ) is the graded biideal of   /  generated by the elements: where the subsets , ,  of vertices of the unshown part of the graph are pairwise disjoint.
Modulo   , every graph with a black edge can be presented as a sum of the same graph with the corresponding edge colored red and the same graph with the corresponding edge removed.The inclusion-exclusion principle implies that the element from the hypothesis is the following combination of the 4-elements The fact that every 4-element can be realized as a linear combination of the elements of the type under discussion is obvious.
Notice that as the constructed elements form a biideal of   /  , the primitive subspace of  = (  /  )/ℱ  admits a realization as the quotient of  (  /  ) by its intersection with ℱ  .Clearly, ℱ  is graded by the number of connected components, so the intersection consists precisely of all elements of ℱ  that admit a realization as a linear combination of connected graphs.It provides an explicit description of the primitive subspace of the Lando bialgebra in terms of generators and relations.
This construction allows us to answer in part exercise 8 of Chapter 14 of [4].Namely, we claim that the space ℒ in its realization as a quotient  = (  /  )/ℱ  can be treated as an analogue of the algebra .Indeed: • there is a natural inclusion of ℒ to this space which is in fact isomorphism; • the generators of the primitive subspace are connected graphs.
The elements of   can be naturally treated as analogues of the STU-relations.
It was shown in [6] that the bialgebra ℒ carries the structure of a Hopf module over its subbialgebra ℒ generated by the graphs with the framing identically equal to 0. Namely, the Larson-Sweedler theorem [10] implies that ℒ is a free ℒ-module generated by the subbialgebra of the graphs with the framing identically equal to 1. Denote the latter subbialgebra by  ℒ.
Theorem 1.5.The primitive subspace  ℒ admits a direct sum decomposition where the subspace  ℒ consists of a linear combination of graphs whose framing is identically equal to 0, and   ℒ consists of a linear combination of graphs whose framing is identically equal to 1.
The structural results of [6] imply that the subspace   ℒ is isomorphic to the subspace of   generated by the connected graphs with red edges only, such that the framing of at least one vertex is 1.
Using the developed framework, we can give an alternative definition of the framed chromatic polynomial.It is defined as the multiplicative function obeying the following relations : For  = 0 the right-hand part vanishes identically.
Recall, that the forest algebra  [3] is defined as the subalgebra of ℒ generated by trees with all the vertices having framing 0. Clearly, its image under the isomorphism  is the subalgebra of  also generated by trees with all the vertices framing 0 and all the edges colored red.The previous proposition trivially implies the structural result of [3]: Theorem 2.2.The forest algebra  is a subbialgebra of  with the dimension one primitive subspace in every grading.
Indeed, it says that any tree can be obtained by a sequence of leaf attachments to the graph on a single vertex.The resulting tree does not depend on the choice of the vertices which we attach the leaves at each step of the construction.Also, we deduce the following: Theorem 2.3.There is a well-defined action of  on   defined on the generators as follows.For a tree  with the framing of all the vertices identically equal to 0 and a connected graph Γ, choose a vertex  of  and a vertex  of Γ, and join the chosen vertices  and  by an edge.
In particular, we see, that the subspaces   ℒ have at least one non-trivial generator in every grading component: it can be obtained by the action of a tree on  vertices on a single vertex graph with the framing of the vertex 1.For every natural  the obtained element is non-zero, as the framed chromatic polynomial [6] takes on it a non-zero value.
The leaf attachment operation is an intersection graph counterpart of the operation of bubble insertion [4].P. Vogel in [19] provides a construction of a non-trivial element of the kernel of the operation of bubble insertion.It would be interesting to know if the described action of  on   is free.
3 A 4-invariant related to the number of 3-colorings of a graph.
As the elements of the Lando bialgebra can be either expressed in terms of graphs whose all edges are black or in terms of graphs whose all edges are red, the same invariant of graphs may produce two different 4-invariants.
For instance, it is known that the values of the chromatic polynomial (that is, the numbers of -colorings of the vertices of a graph) are 4-invariants of graphs [3,7].On the other hand, the number of 3-colorings of a graph may be used to produce a new 4-invariant as follows.
For a generating element Γ of  represented by a graph with red edges only, define (Γ) to be equal the number of proper 3-colorings of Γ multiplied by 2 −(Γ) (−1)  , where (Γ) is the Euler characteristics of Γ, and  is the sum of framings of all the vertices of Γ. Proof.We have to check that the linear extension of  to the ideal ℱ  vanishes identically.
The map that multiplies a framed graph by (−1)  and sets the framing of all the vertices to 0 is a well-defined map on the quotient modulo the 4-elements.so, for simplicity, we assume, that from now on all the vertices have framing 0.
The elements (2) can be generated as follows.The initial data is the tuple (Γ, , , ), where Γ is a graph,  -a vertex of Γ, and ,  are two disjoint subsets of vertices of Γ such that no vertex of  ∪  is adjacent to .
In particular, the operation of the leaf attachment multiplies the value of  by 2. It is known [17] that sl 2 -weight system has a similar multiplicativity property with respect to the vertex-multiplication.
As a conclusion, we notice that for  = 4 the grading component   4 has at least 4 linearly independent elements represented by graphs with all the edges colored red with supports given by a chain  4 and a cycle  4 and various framings of their vertices.They differ by the values of the framed chromatic polynomial and invariant  on them.The existence of the action of the tree algebra on   implies, that for any  ≥ 4 the dimension dim    is greater or equal to 4.

1 ) 2
++|∩|  +  +   ∪  .Leaf attachmentLet us discuss a simple corollary of the relations in  .Theorem 2.1.The following identity holds: The relations applied to the edge connecting the vertex of framing  to the vertex of framing  read:

Theorem 3 . 1 .
The function  extends by linearity to a 4-invariant.
The inclusion  :   ℛ →   gives rise to a bialgebra isomorphism  :   ℛ →   /  , where the bialgebra structure on   /  is induced from   .Proof.We define the map   to   ℛ on the generators as follows.Let  be the set of the red edges of graph Γ.To every red edge of the graph,, we assign one of two states: state  corresponds to changing the color of the corresponding edge to black, and state  corresponds to removing the edge.For a collection of states  ∈ {; }  , denote by Γ  the graph obtained from Γ by removing the edges for which the value of  is  and painting the rest of the edges black.Interpret this graph as an element of   ℛ .Define