Shuffle relations for Hodge and motivic correlators
Abstract.
The Hodge correlators are functions of several complex variables, defined by (Goncharov, 2008) by an explicit integral formula. They satisfy some linear relations: dihedral symmetry relations, distribution relations, and the shuffle relations.
We found new second shuffle relations. When , where are the -th roots of unity, they are expected to give almost all relations.
When run through a finite subset of , the Hodge correlators describe the real mixed Hodge-Tate structure on the pronilpotent completion of the fundamental group . The latter is a Lie algebra in the category of mixed -Hodge-Tate structures. The Hodge correlators are lifted to canonical elements in the Tannakian Lie coalgebra of this category. We prove that these elements satisfy the second shuffle relations.
Let . The pronilpotent fundamental group is the Betti realization of the motivic fundamental group, which is a Lie algebra in the category of mixed Tate motives over . The Hodge correlators are lifted to elements in the Tannakian Lie coalgebra of the category of mixed Tate motives. We prove the second shuffle relations for these motivic elements.
The universal enveloping algebra of was described by Goncharov via motivic multiple polylogarithms, which obey a similar yet different set of double shuffle relations. Motivic correlators have several advantages: they obey dihedral symmetry relations at all points, not only at roots of unity; they are defined for any curve, and the double shuffle relations admit a generalization to elliptic curve; and they describe elements of the motivic Lie coalgebra rather than its universal enveloping algebra.
1. Introduction and main results
1.1. Summary
The Hodge correlators are functions of several complex variables, defined by an explicit integral formula in [G6]. They satisfy some linear relations: the dihedral symmetry relations, the distribution relations, and the shuffle relations.
We found new relations, called second shuffle relations. When , where are the -th roots of unity, they should give almost all relations: the results of [G7] suggest that the other relations are sporadic, i.e., cannot be described by universal formulae.
When run through a finite subset of , the Hodge correlators are the canonical real periods of the mixed Hodge-Tate structures on the pronilpotent completion of the fundamental group , with the tangential base point at . The latter is a Lie algebra in the category of mixed -Hodge-Tate structures. The Hodge correlators describe the real mixed Hodge structure on this Lie algebra tensored over by .
The category of mixed -Hodge-Tate structures is canonically equivalent to the category of representations of a graded Lie algebra over . Let us take its image in the representation defining , and consider the graded dual Lie coalgebra . The Hodge correlators were lifted in [G6] to canonical elements
(1) |
The real numbers are the canonical real periods of these elements. We prove that our new relations can be lifted to relations on the elements (1).
Let . The Lie algebra is the Betti realization of the motivic fundamental group . The latter is a Lie algebra in the category of mixed Tate motives over , defined in [DG]. This category is identified with the category of representations of the motivic Galois Lie algebra. Just like in the Hodge case, we take the image of this Lie algebra in the representation provided by the motivic fundamental group, and consider the graded dual Lie coalgebra . In [G6], the elements (1) were lifted to elements
(2) |
We prove that our relations can be upgraded to linear relations on these elements.
The universal enveloping algebra for the Lie coalgebra was described in [G4] via motivic multiple polylogarithms. The motivic double shuffle relations for them were proved in [G5]. The explicit relation between motivic correlators and multiple polylogarithms is an interesting open problem.
The multiple polylogarithms obey a similar system of double shuffle relations, but the dihedral symmetry relation holds only at roots of unity. The combinatorics of those relations, originally described by [G2]-[G4], were studied further by [R].
The motivic correlator description of has several advantages. Most importantly, motivic correlators are defined for any algebraic curve, not only , and the double shuffle relations admit a generalization to elliptic curves [M]. The motivic correlators obey double shuffle and cyclic symmetry relations at all points. Motivic correlators describe elements of the Lie coalgebra rather than its universal enveloping algebra. Finally, they give the best way to describe the mysterious connection between the Lie coalgebra and modular manifolds [G7].
Acknowledgements
I am grateful to A.B. Goncharov for introducing me to this problem, for many helpful discussions and explanations, and for comments on a draft of this paper.
This material is based upon work supported by the National Science Foundation under grant DMS-1440140 while the author was in residence at the Mathematical Sciences Research Institute in Berkeley, California, during the Fall 2019 semester. The author also acknowledges support from NSF grants DMS-1107452, 1107263, 1107367 “RNMS: Geometric Structures and Representation Varieties” (the GEAR Network).
1.2. Hodge correlators and shuffle relations
We describe a family of functions of several complex variables, the Hodge correlators ([G6]).111In this paper, “Hodge correlators” will refer only to Hodge correlators associated to the curve . Our main result is a set of functional equations on the Hodge correlators and the Hodge-theoretic and motivic upgrades of these relations.
1.2.1. Definition
Let . We define the Hodge correlator of weight , .
Draw a disc in the plane with a sequence of points placed counterclockwise around the boundary, and label by the value . Choose a plane trivalent tree inside the disc with leaves at the labeled boundary vertices. Such a tree has interior vertices and edges . The embedding into the plane gives a canonical orientation (a choice of component of , i.e., ordering of the edges up to even permutation).
Let us assign to each edge a function on
Precisely, to an edge , assign , where is the coordinate on corresponding to a vertex . Then fix the coordinate at each boundary vertex to be . Abusing notation, also denote by the restriction of to with the boundary coordinates fixed.
Setting , we define:
(3) |
This expression is independent of the numbering of the edges. The Hodge correlator is defined as the sum of these integrals over all plane trivalent trees :
It takes values in . The simplest example, in weight 1, is shown in Fig. 1.2.1.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/64777839-4cd4-4e2f-a206-db11375d7f46/x1.png)
Figure 1.2.1. .
In weight 2, the Hodge correlators are given by
This integral is described by the Feynman diagram in Fig. 1.2.1.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/64777839-4cd4-4e2f-a206-db11375d7f46/x2.png)
Figure 1.2.1.
Recall the single-valued version of the dilogarithm, called the Bloch-Wigner function:
The weight 2 Hodge correlator integral can be calculated explicitly as
(4) |
1.2.2. Properties
The Hodge correlators satisfy dihedral symmetry relations:
One can show using (3) that the Hodge correlators are invariant under an additive shift of the arguments. In weight , they are also invariant under a multiplicative shift:
Furthermore, the Hodge correlators satisfy shuffle relations: for and ,
(5) |
where is the set of -shuffles, consisting of the permutations such that
For example, the -shuffle relation states:
the -shuffle relation is:
The shuffle relations may be considered “easy” because they hold on the level of the sum over trees of the integrands in (3).
1.2.3. Second shuffle relation
We found another relation on the Hodge correlators. Together, the two relations form the double shuffle relations. To state the new relations, we must introduce some notation.
Because of the multiplicative invariance (in weight ) of Hodge correlators, it is possible and convenient to introduce an inhomogeneous notation for them, where the arguments are represented by the quotients between successive nonzero values and the number of 0s between them. Precisely, given such that , define
This definition is illustrated in Fig. 1.2.3.
![]() |
![]() |
Figure 1.2.3. .
Define the depth of an expression to be one less than the number of arguments in the multiplicative notation, that is, in the formula above.
Our new shuffle relation states:
(6) |
That is, we shuffle two ordered sets of expressions , while leaving the segment fixed. For example the -shuffle relation begins:
![]() |
![]() |
To describe the lower-depth terms, we need the notion of quasishuffle. Let and be two ordered sets. A quasishuffle of and is a sequence of slots and a placement of each element of in a slot, such that each slot is filled with one of:
-
•
some ,
-
•
some ,
-
•
a pair ,
and the sequence of slots containing the and the sequence of slots containing the are ordered left to right. If and share a slot, they are said to collide. If no elements collide, the quasishuffle is said to be a shuffle.
Let and with the natural orders. Then, equivalently, the quasishuffles are the surjective maps that are strictly increasing on and .
Indices collide with indices whenever . Let be the set of such quasishuffles.
A quasishuffle is a shuffle if . Recall the set of -shuffles . We naturally identify with the subset of the shuffles in .
The lower-depth terms in (6) come in two kinds:
-
(1)
Terms coming from the -quasishuffles that are not proper shuffles. Whenever the segments and collide, we get a new segment in their place – a 0 is inserted – and the term picks up a negative sign.
For the -shuffle relation, there is only one quasishuffle that is not a shuffle. In this quasishuffle, the two segments and collide:
-
(2)
Two extra terms: one where the segments appear in order and the remaining segments collapse; another where the segments appear in order and collapse. These terms come with a negative sign.
For the -shuffle relation:
In summary, the -shuffle relation states, for and ,
It is already a nontrivial relation, which is not easy to prove from the definition (3) even for .
By formula (4), Hodge correlators in weight 2 are expressed in a simple way in terms of the Bloch-Wigner function . The -shuffle relation with is equivalent to the five-term relation,
According to [B3], this is essentially the only functional equation for . It follows that the dihedral symmetry and shuffle relations are the only relations between the Hodge correlators in weight 2.
For further illustration, let us write out the -shuffle relation for the Hodge correlator
where and will be shuffled with :
-
(0)
There are three terms from the shuffles:
-
(1)
There are two terms from the quasishuffles that are not shuffles:
-
(2)
There are two additional terms:
The full relation is then
where the terms in the three rows match the pictures above.
We now write out the general relation:
Theorem 1.
-
(a)
Suppose that and that not all or not all . Then the Hodge correlators satisfy the relation:
where
-
(b)
The Hodge correlators satisfy all specializations of this relation as any subset of the approaches 0.
1.2.4. Applications
Corollary 2 ([GR], Proposition 2.8).
For , every Hodge correlator of weight is a linear combination of Hodge correlators of weight and depth at most .
Precisely, for , we have
(7) |
In weight 3, we deduce the Hodge correlator version of relations (27) and (29) from [GR].
Corollary 3.
The Hodge correlators in weight 3 satisfy the relations:
(8) | ||||
(9) |
We have noted that the double shuffle and dihedral symmetry relations give all relations between Hodge correlators in weight 2.
In weight 3, the Hodge correlators of depth 1 are expressed in terms of the single-valued trilogarithm (see §6.0.4). By the results of [GR], the relations (9) imply the general functional equation for ([G1]). We conclude that the double shuffle relations for Hodge correlators imply all functional equations for and .
1.3. Quasidihedral Lie coalgebras
Let be an abelian group. We use the multiplicative notation for ; the identity element is . Typically, will be the multiplicative group of a field or the group of -th roots of unity . We adjoin to a formal element 0, where for .
We define the quasidihedral Lie coalgebra . It generalizes the dihedral Lie coalgebra of [G3]; the latter is the associated graded for the depth filtration of of . The aim of the construction of is twofold:
-
(1)
It is the main combinatorial ingredient in the proof of the double shuffle relations for correlators.
-
(2)
The Lie coalgebra describes the coproduct of motivic correlators.
1.3.1. Cyclic Lie coalgebra
Let be the -vector space with basis indexed by
Let be the tensor algebra of over . We impose a grading by weight, where has weight . Then define the cyclic Lie coalgebra, as a vector space, by
It is positively graded and generated in weight by elements modulo the relation . We can represent these elements by elements of written counterclockwise at marked points on a circle.
The coproduct on is defined on such a generator by splitting the circle into two arcs that share exactly one point. That is, consider a line inside the circle, starting at a marked point and ending between two marked points. It splits the circle into two parts, representing generators and , and the coproduct of is the sum of over all such cuts.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/64777839-4cd4-4e2f-a206-db11375d7f46/x17.png)
Precisely, the coproduct is defined by
(10) |
It respects the weight grading and satisfies the co-Jacobi identity.
We will write elements of as
Also introduce a notation, analogous to that for Hodge correlators, for with :
1.3.2. Relations
A first shuffle in is an element of the form
Define
The scaling relations we impose are:
-
(1)
In weight 1, we have and for .
-
(2)
In weight , multiplicative invariance:
The distribution relations are the following. For , let denote the -torsion of . Suppose that is finite and divides , and suppose are divisible by (note is always divisible by ). Let be the number of 0s among the . Then the relation is
(11) |
except in the case that and .
The following is immediate from the constructions of [G3] (Theorem 4.3).
Theorem 4.
The first shuffles, scaling relations, and distribution relations generate a coideal in . The coproduct on descends to a well-defined coproduct on .
Abusing notation, denote also by and the images in of the elements in .
A second shuffle in is an element of the form suggested by Theorem 1:
where
Define the quasidihedral Lie coalgebra
Then we prove:
Theorem 5.
The second shuffles form a coideal in . The coproduct on descends to a well-defined coproduct on .
Theorem 5 provides us with a Lie coalgebra generated by sequences of elements of that satisfies dihedral symmetry, scaling, and the two shuffle relations.
Let the subspace of generated by elements where not all are equal. It is a subcoalgebra, which we call the restricted cyclic Lie coalgebra. The image of in is the restricted quasidihedral Lie coalgebra, denoted .
The Hodge correlators satisfy cyclic symmetry, first shuffle, distribution, and scaling relations. Equivalently, the function factors through and a map
An equivalent form of Theorem 1 is that, restricted to the set of arguments where not all or not all , this function factors through the quotient .
1.3.3. Depth filtration
The Lie coalgebra is filtered by the depth, where a generator has depth if it includes elements of (not counting 0s). Consider . In this coalgebra, the second shuffle relations lose their lower-depth terms.
1.4. Relations for motivic correlators: Hodge realization
We present the construction of motivic correlators of [G6] and state our main result in this setting.
This section concerns the Hodge realization of motivic correlators. They are objects in the fundamental Lie coalgebra of the category of -mixed Hodge structures, and are Hodge-theoretic upgrades of the Hodge correlator functions.
1.4.1. Summary
In [G6], given any collection of complex numbers , the Hodge correlators were upgraded to elements of the Tannakian Lie coalgebra of the category of real mixed Hodge structures:
(12) |
Furthermore, if follows easily from the construction of the upgraded Hodge correlators (12) that they satisfy the dihedral and first shuffle relations, and that their coproduct in the coalgebra is given precisely by the formula (10).
One of the main results of this paper is that the elements (12) satisfy the second shuffle relations. In other words, they provide a map of Lie coalgebras .
1.4.2. Hodge-theoretic setup
Let of be the tensor category of -mixed Hodge-Tate structures and the category of -pure Hodge-Tate structures. Every object of is filtered by weight, and is generated by the simple objects , the pure Hodge-Tate structures of weight . The cohomology of a punctured projective line is a mixed Hodge-Tate structure, nontrivial in weights 0 and 1.
The Galois Lie algebra of the category of mixed Hodge-Tate structures, , is the algebra of tensor derivations of the functor . It is a graded Lie algebra in the category , and is equivalent to the category of graded -modules in . Let be its graded dual. A canonical period map
was defined in [G6].
Let , a finite set of punctures containing , and a distinguished tangent vector at . The pronilpotent completion of the fundamental group carries a mixed Hodge-Tate structure, depending on , and thus there is a map
1.4.3. Hodge correlator coalgebra
The Hodge correlator coalgebra is defined by [G6] as
Note that . If is the fundamental class, we write for .
The relations are the following:
-
(1)
Cyclic symmetry: .
-
(2)
(First) shuffle relations:
-
(3)
Take the quotient by the weight elements .
There is a Lie coalgebra structure on , defined by the same formula as for the cyclic Lie coalgebra:
(13) |
An action of the graded dual Lie algebra by derivations on was constructed by [G6]. The action
is injective. Its image consists of the special derivations , those which act by 0 on the loop around and preserve the conjugacy classes of all the loops .
Dualizing this map composed with the action of , we get the Hodge correlator map of Lie coalgebras:
We will also write for , and similarly define
1.4.4. Period map and Hodge correlator functions
Recall that the Hodge correlator functions satisfy cyclic symmetry and shuffle relations, so we may also denote by the function
The dual to the Hodge correlator , an element of , is called the Green operator . It can be viewed as a special derivation of , and defines a real mixed Hodge structure on . An element provides a framing , and is the element of induced by this framing.
As made precise by a main result of [G6], factors through the Hodge correlator map to and the period map , and the resulting mixed Hodge structure on coincides with the standard one.
Theorem 6 ([G6], Theorem 1.12).
-
(a)
Let be homogeneous of weight . Then , where is the canonical period map .
-
(b)
The mixed Hodge structure on determined by the dual Hodge correlator map coincides with the standard mixed Hodge structure on .
1.4.5. Second shuffle relations
We state the version of the main result for the Hodge correlators, on the level of the map .
Theorem 7.
-
(a)
Restricted to the subspace of generated by elements with not all equal, the map factors through .
-
(b)
Suppose that and that not all or not all . Then the Hodge correlators satisfy the relation:
where
-
(c)
The Hodge correlators satisfy all specializations of this relation as any subset of the approaches 0.
1.5. Relations for motivic correlators over a number field
We now state the most general version of the result by upgrading the constructions of the previous section from mixed Hodge structures to mixed motives over a number field.
1.5.1. Motivic setup
Let be a number field and the category of mixed Tate motives over . It is generated by objects for , where is the Tate motive, pure of weight . This induces a canonical weight filtration on objects of . There is a functor , where is the category of pure motives over .
The fundamental (motivic Tate) Lie algebra is the algebra of tensor derivations of the functor , a graded Lie algebra in the category , and is equivalent to the category of graded -modules.
An embedding induces a realization functor and a map .
Let , a finite set of punctures containing , and the distinguished tangent vector at . Deligne and Goncharov’s motivic fundamental group ([DG]) is a prounipotent group scheme in the category . The Hodge realization of its Lie algebra is . As it is an object in , there is an action .
1.5.2. Motivic correlator coalgebra
The construction of the Hodge correlator coalgebra can be upgraded to the motivic setting. The definition of the motivic correlator coalgebra mimics that of its Hodge realization:
a graded Lie coalgebra in the category of pure motives over , where the relations imposed are the cyclic symmetry, first shuffles, and quotient by weight . Then is isomorphic to the algebra of special derivations of , and there is a map
We will write for , and likewise .
Let us describe how motivic correlators are related to Hodge correlators. Fix an embeding . The Hodge realization provides coalgebra maps and
and thus a period map
By Theorem 6, it coincides with the composition
We can summarize the objects and maps defined thus far as follows:
Under certain conditions, relations on motivic correlators hold can be proven by showing that they hold in the Hodge realization under any complex embedding. This is a key fact in the proof of the motivic upgrade of our relations on Hodge correlators:
Lemma 8.
Let be a rational curve over . Suppose has weight , , and for every embedding . Then .
1.5.3. Dependence on
If , there is an induced inclusion .
The following diagram commutes:
This allows us to write down elements of without explicitly specifying .
1.5.4. Second shuffle relations
We are ready to state the most general version of the main result.
Theorem 9.
Let be a number field.
-
(a)
Restricted to the subspace of generated by elements with not all equal, the map factors through .
-
(b)
Suppose that and that not all or not all . Then the motivic correlators satisfy the same relation as in Theorem 7, with replaced by .
-
(c)
The motivic correlators satisfy all specializations of this relation as any subset of the approaches 0.
2. Background: Hodge and motivic correlators
2.1. Hodge realization of motivic correlators
2.1.1. Mixed Hodge theory
We recall the relevant definitions from [D3]. A real mixed Hodge structure consists of the following data:
-
(1)
A real vector space ;
-
(2)
An increasing weight filtration on ;
-
(3)
A decreasing Hodge filtration on its complexification , with conjugate ,
such that and induce a pure real Hodge structure of weight on , i.e.,
A mixed Hodge structure is a mixed Hodge-Tate structure if for . For the real mixed Hodge structures that are Tate, which are the ones we consider, the associated graded pure Hodge-Tate structures are trivial in odd weight. Therefore, we reindex the filtration by semiweight (so has weight , rather than ).
Mixed Hodge-Tate structures are iterated extensions of the one-dimensional pure mixed Hodge-Tate structures of weight , denoted . Equivalently, in the category of real mixed Hodge-Tate structures, the subcategory of mixed Hodge-Tate structures is the full subcategory generated by the simple objects .
The map provides a fiber functor from mixed to pure real Hodge-Tate structures:
The Tannakian reconstruction theorem implies that there is a graded Lie algebra in the category such that is equivalent to the category of finite-dimensional graded -modules in . Specifically, , the graded Lie algebra in of tensor derivations of the functor . That is, every mixed Hodge-Tate structure determines an action
Let be the graded dual of .
The simple objects of the category are , and is free on
A framing of a mixed Hodge-Tate structure of weight consists of a pair of morphisms , . The isomorphism classes of framed real mixed Hodge-Tate structures generate a Hopf algebra , with the structure defined by [BGSV], which is canonically isomorphic to the dual to the universal enveloping algebra of . An element of of weight is represented by a framed real mixed Hodge-Tate structure of weight , modulo products in , that is,
(14) |
The are trivial for and 1-dimensional for , in which case
According to [G6], a choice of generators of satisfying amounts to a map
and thus defines a canonical period map
Such generators were originally defined by Deligne for the larger category of real mixed Hodge structures ([D3]). However, we use the different set of generators proposed by Goncharov ([G6]), the Green’s operators . They have the property that, for Hodge structures varying over a base, the Griffiths transversality condition needed to define variations of Hodge structures is expressed by a Maurer-Cartan differential equation on the , which is essential for the construction of Hodge correlators. Contrary to this, the differential equations for Deligne’s generators are difficult to write.
A variation of real mixed Hodge-Tate structures on a complex variety is a variation of the linear data of real mixed Hodge-Tate structure that satisfies the Griffiths transversality condition. Precisely, it is a real vector bundle with flat connection with a weight filtration on and a Hodge filtration on such that and induce a real mixed Hodge-Tate structure over each point of and .
A consequence of the transversality condition is that for , is rigid in the category of variations of mixed Hodge-Tate structures over : if the coproduct of a variation of Hodge-Tate structures of weight is 0, then the variation is isomorphic to a constant one.
2.1.2. Pronilpotent fundamental group
Let , a finite set of punctures containing , and a distringuished tangent vector at . Let be the classical fundamental group. The group algebra is a free group generated by loops around the points of . Let be the augmentation ideal. Then form a Hopf algebra
with coproduct defined by for . The subset of primitive elements is denoted . It is actually a pronilpotent Lie algebra, the Mal’cev completion of .
There is a canonical weight filtration on , where the loops around punctures lie in weight . This induces a weight filtration on , and we have
Furthermore, let be the free Lie algebra generated by . Then there is a canonical isomorphism
There is a real mixed Hodge-Tate structure on , which depends on the choice of the tangent vector , and thus an action .
2.1.3. Correlators in families
The construction of the Hodge correlator coalgebra (§1.4.3) can be performed over a base. Let be a smooth family of genus 0 curves. Generalizing from the case of a point, one simply replaces the punctures by nonintersecting sections and the tangential base point by a nonvanishing section factoring through a distinguished section . This construction yields a family of coalgebras
(15) |
We will denote this coalgebra by when the objects vary over .
The Green’s function , used in the definition of the Hodge correlator, becomes a distribution on with logarithmic singularities along the relative divisors , , and . As we explain below, the higher-weight correlators also determine smooth variations over the base. In particular, the period map is upgraded to a map
and the map to a map
to the fundamental Lie coalgebra of the category of variations of real mixed Hodge-Tate structures.
The case of specialization at intersecting sections, as well as degeneration to nodal curves, is related to the behavior of the Hodge structure on at the boundary of the moduli space of Riemann surfaces with punctures. We will examine this question in §4.
As vary over the moduli space of Riemann surfaces of genus with distinct marked points and a tangential base point , we get a family of framed -mixed Hodge structures on . Theorem 6 is generalized to the following.
Theorem 10 ([G6], Theorem 1.12).
-
(a)
There is a flat connection on making it a variation of mixed Hodge structures over .
-
(b)
This variation coincides with the standard variation of mixed Hodge structures on .
A consequence of Theorem 10 is that the coalgebra structure on should translate into differential equations on the periods over . We now describe these equations.
Extend the period map to a map
where and . Then we have a diagram that commutes in weight :
(16) |
For the simplest example, consider the Hodge correlator as varies over . Noting that , we have
and indeed, by (4), .
We emphasize that the sections have so far required to be nonintersecting. In §4 we will prove a specialization theorem, which allows to pass to the boundary of . It will imply the statement about periods:
Theorem 11.
The Hodge correlators are continuous on .
2.1.4. Distribution relations
The formula expressing how the Hodge correlators transform under endomorphisms of appears in [G6], Lemma 12.3. We translate this result to our setting, showing that it gives a relation of the form (11).
Consider the map , (). Let . Then there is an induced map
where
That is, each point is pulled back to the sum of its preimages, counted with multiplicity. The factor comes from the degree of the induced map on .
Then the diagram commutes:
For example, in weight 1, we have
where a branch of the square root has been chosen. On the level of periods, this becomes the equality
2.2. Motivic correlators over a number field
2.2.1. Mixed motives
Let be a number field. There is a semisimple abelian category of Grothendieck pure motives over and a functor assigning to every smooth projective variety over the sum of its motivic cohomology objects:
Every Weil cohomology theory factors through and a realization functor :
This category is graded by the weight, where the weight of is . There is an invertible Tate object of weight ; we write for the Tate twist . The various realization functors respect the weight. For example, for a variety over and a fixed embedding , the carries a pure Hodge structure of weight . For with good reduction modulo , the Frobenius automorphism acts on with eigenvalues of norm .
There is a conjectural category of mixed motives that should extend this construction to arbitrary varieties over . The desired properties of were conjectured by Beilinson [B2], see also Deligne [D2]. It is expected to be an abelian tensor category, in which every object has a canonical weight filtration . There should be a fiber functor such that is pure of weight .
The Hodge realization of a mixed motive should be a mixed Hodge structure. Deligne [D1] showed that for any complex variety , there is a mixed Hodge structure on . In this way, is a motivic lift of the associated graded functor from mixed to pure real Hodge structures: .
The full tensor subcategory of generated by is the category of mixed Tate motives . Such a category with desirable properties has been constructed by [DG]. If is a rational curve, then is a mixed Tate motive. The simple objects of are , , and every object of is an iterated extension of these objects. They satisfy
The real Hodge realizations of mixed Tate motives are mixed Hodge-Tate structures. The images of the , the real mixed Hodge-Tate structures generate the subcategory in .
We will consider only the mixed Tate motives. As in the Hodge realization, the associated graded objects of the weight filtration are trivial in odd weight, so we reindex the filtration by semiweight (so has weight , rather than ).
2.2.2. Fundamental Lie algebra and period map
Assume the mixed motivic formalism above. The Tannakian reconstruction theorem implies that there would be a negatively graded Lie algebra in the category , the fundamental (motivic Tate) Lie algebra, such that is canonically equivalent to the category of finite-dimensional graded -modules in . That is, for any , there is an action by derivations . We prefer to study its graded dual .
This Lie coalgebra breaks into isotypical components over the isomorphism classes of simple Tate objects of :
As a consequence, the cohomology of can be expressed as Ext-groups in the category of mixed motives:
For a number field, the in are trivial for ; equivalently, is free on the generators .
Fix an embedding . The Hodge realization functor induces a Lie coalgebra morphism . This means that there is a period map .
For every integer , there is the Beilinson regulator map
where is complex conjugation. By Beilinson’s theorem ([B1]) it coincides for with the Borel regulator on , i.e., the diagram commutes:
Borel’s theorem states that this regulator map – the second row in the diagram – is injective [B4]. So there is an injective map on the first cohomology of the fundamental Lie coalgebras
In particular, we get the following basic theorem, which plays a crucial role in this paper:
Theorem 12.
If is of weight at least 2 with and for every embedding , then .
Specifically, we obtain Lemma 8:
Lemma.
Let be a rational curve over . Suppose has weight , , and for every embedding . Then .
Proof.
is an element of with coproduct 0. The canonical period of its Hodge realization in coincides with the correlator period . By Theorem 12, it is 0. ∎
This does not hold in weight 1. For example, choose to be an element of that is not a root of unity, but has norm 1 under every complex embedding (e.g., and ). Then has coproduct 0 and period under both of the embeddings . However, the object is not 0 as an element of .
2.2.3. Distribution relations
Suppose are such that splits in for all . Then the distribution relations from §2.1.4 hold:
where is taken with multiplicity if .
3. Construction of the quasidihedral Lie coalgebra
3.1. Definitions
For an abelian group , we defined the Lie coalgebra as the quotient of the tensor algebra of by cyclic symmetry, first shuffle, distribution, and scaling relations.
Recall Theorem 5:
Theorem.
The second shuffles form a coideal in . The coproduct on descends to a well-defined coproduct on .
The proof of this theorem is the goal of this section.
The extra term in the scaling relation in weight 1, and the presence of terms of lower depth in the coproduct formula (10), makes the proof more difficult than that in [G3]’s construction of the dihedral Lie coalgebra. We find Theorem 5 to be a small combinatorial miracle. Unfortunately, we do not know a simpler proof.
3.1.1. Generating functions
The second shuffle relations can be expressed in a compact form in terms of generating functions. This simplifies their proof.
We package the elements of into a generating function as follows:
(17) |
where and the are formal variables.
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/64777839-4cd4-4e2f-a206-db11375d7f46/x18.png)
We allow multisets of variables to appear in place of the : if , then
(18) |
where in the last expression . The corresponding operation on the correlator coefficients is combining adjacent segments of 0s, with additional 0s being inserted between them, such as
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/64777839-4cd4-4e2f-a206-db11375d7f46/x19.png)
There is a useful identity
Lemma 13.
(19) |
Proof.
Clear by comparing the coefficients of .
∎
Theorem 5 can then be expressed in terms of the generating functions:
Theorem.
The subspace of generated by elements of the form
where
forms a coideal.
3.1.2. Coproduct
Let us write down the formula defining the coproduct (10) in terms of the elements .
Lemma 14.
Let and suppose . Then
(20) | ||||
(21) | ||||
(22) |
where
(23) |
and the sums are taken over cyclic permutations of the indices .
If , this formula holds modulo terms of the form .
Proof.
Classify the terms of by the common point of the two resulting parts and . Let be the point counterclockwise from the segment . Up to cyclic symmetry, any cut is either:
![]() |
![]() |
(a) | (b) |
Figure 3.1.2.
We first write the terms arising from these cuts modulo elements of form .
Case (a) contributes the terms (20) and case (b) contributes the terms (21), noting that modulo elements of the form the have cyclic symmetry.
Now we handle the terms (22). Let be the weight. Consider the terms of the coproduct.
Such elements, of form , fall into two cases, depending on which point is present in but not in .
-
(1)
0 on the segment (from to ).
-
(2)
.
If , the are invariant under scaling. If , then the cyclic permutation of the arguments and in (23) modifies those terms by an element of weight 1, so the expressions in (22) are determined up to .
In case (1), we have
The only nonzero terms that appear are (cut clockwise of ) and (cut counterclockwise of ).
On the other hand, (20) produces no terms for these two cuts (they correspond to to and ). Thus this case contributes the terms
which are the terms in (22).
In case (2),
Let and be the elements formed by and the point clockwise and counterclockwise from , respectively. Then the resulting terms are and .
If , then , while (20) contributes . Thus we get an added term
If , then , while (21) contributes 0. Thus we get a term .
Similarly, we get terms if and if .
Collecting terms, the total contribution from this case is , where
(24) |
Reindexing, we get exactly the terms of (22). ∎
We remark that if a cyclic permutation is applied to the arguments in (20), so that it is written
then the terms in (22) disappear.
Then there is the following formula for the coproduct of generating functions:
Lemma 15.
Suppose and let . Then
(25) | ||||
(26) | ||||
(27) |
where
(28) | ||||
(29) | ||||
(30) |
If , this formula holds modulo terms of the form .
3.1.3. Dual generating function and homogeneity
For a more complete analogy with the generating functions for multiple polylogarithms (§6), we define a dual generating function :
(31) |
where the formal variables satisfy the relation . The pair of generating functions resemble those used by [G3] in the definition of the dihedral Lie coalgebra.
The duality is made clear by the following statement:
Lemma 16.
-
(a)
The generating functions are related by
(32) -
(b)
For , the generating functions are homogeneous in the (invariant under a shift ), and the are homogeneous in the (invariant under a shift ).
-
(c)
Both generating functions are invariant under cyclic permutation of the indices.
Proof.
Part (a) is clear from the definitions.
For , (c) is clear from the scaling relations imposed in . For , (b) is also immediate. Part (c) for would follow easily from (a) and (b,c) for , recalling that .
The nontrivial part is (b) for . We must show
Consider the coefficient of on each side. If , the coefficients on both sides are equal. If , the coefficient on the left side is precisely a first shuffle relation (where the 0s indexed by the variable are shuffled with all other points, with the point 1 remainining fixed), while the right side is 0. ∎
The first shuffle relation imposed in can be expressed in terms of the :
Lemma 17.
The generating functions obey a shuffle relation for :
(33) |
Proof.
Similar to the previous lemma. It follows from the shuffle relation on the coefficients, where we fix and shuffle the and the zeros indexed by with the other points. ∎
3.2. Proof of Theorem 5
3.2.1. Summary of the proof
The proof of the Theorem 5 will be by induction on the depth of the second shuffles.
Define
where with , and
(34) | ||||
(35) | ||||
(36) |
We must show that the elements form a coideal, i.e., their coproducts vanish modulo other elements of this form.
To make the notation more transparent, when and are fixed, we will relabel
so that we consider elements
The main steps will be the following:
Throughout the proof, in a term appearing in the definition of , call the segment the distinguished segment (i.e., in (34) and the collapsed segments in (35) and (36)). In the following lemmas, we will always use the following classification of terms of the coproduct of a generating function (see Fig. 3.2.1).
-
(1)
Terms where one of the parts or contains the distinguished segment (i.e., the distinguished segment is not cut). In this case, we always write the term in the form , where contains the distinguished segment.
-
(a)
Cut from a point to the segment ().
-
(b)
Cut from a point to the segment ().
-
(c)
Cut from a 0 on the segment to the segment ().
-
(d)
Cut from a 0 on the segment to the segment ().
-
(a)
-
(2)
Terms where the distinguished segment is cut. In this case, we always write , where contains the point and the point .
-
(a)
Cut from a point to the distinguished segment.
-
(b)
Cut from a 0 on the segment to the distinguished segment ().
-
(c)
Cut from a 0 on the distinguished segment to the segment ().
-
(a)
3.2.2. Step 0
As stated in Step 0 above, we fix and , the , , , and the , , , and let be the three terms of the expression defining : (34), (35), and (36), respectively.
We may assume , , and , by the following:
Lemma 18 (Step 0).
The shuffle relations for imply the shuffle relations for general index sets.
Proof.
Obvious by induction using (19). ∎
Lemma 19 (Step 1).
Modulo shuffle relations of lower depth and elements , .
Lemma 20 (Step 2).
Modulo lower-depth shuffle relations and terms ,
(37) |
3.2.3. Proof of Step 1
Lemma-Computation 21 (Step 1(a)).
Modulo shuffle relations of lower depth and elements , is given by the sum of expressions
Group all terms of by the type of cut as defined in the outline above. Some computational lemmas will simplify the contributions to coming from the cuts of each type. The contribution of cuts (1a/b/c/d) is computed in Lemma 22, and cuts (2a/b/c) are dealt with in Lemma 26.
Lemma-Computation 22.
The contribution of cuts of type (1a/b/c/d) to , modulo shuffle relations of lower depth and elements , is given by (63) below.
The cuts of types (1a) and (1b) contribute terms of the form (25), while cuts of types (1c) and (1d) contribute terms of the form (26) below.
Consider the upper parts of terms as shown in Fig. 3.2.1; by cyclic invariance modulo we may write
Let be the new segment arising from the cut (that is, the bracketed segment in (25) or (26)).
We say that appears in if either the segment or some is present in as one of the (), and similarly for . Then the set of segments that do not appear in (“appear below g”) is determined by the and consists of consecutively indexed elements and , i.e., and , where by convention if no appear, and likewise for .
Group the terms by the sequence of segments . To shorten notation, write
There are three cases:
-
(1)
and : at least two and two appear below (Lemma-Computation 23).
-
(2)
or : only ’s or only ’s appear below (Lemma-Computation 24).
-
(3)
or : only one or only one appear below (Lemma-Computation 25).
We compute the contribution of each case in the next three lemmas.
Lemma-Computation 23.
Case 1 ( and ) contributes 0 to .
Proof.
Consider a term coming from a cut in Case 1.
Let be minimal such that appears in , and be maximal such that appears in . Define in the analogous way. For example, for cuts of type (1a), ; for cuts of type (1c),
where is the segment that contains the vertex of the cut.
Notice that and , and implies .
Group all terms of coming from Case 1 by the type of cut and by . These groups can be expressed in terms of
for some . Indeed, the arrangements of segments that may occur in the lower part of the cut, given and , are precisely the quasishuffles. Applying the lower-weight shuffle relations, this expression becomes
(38) |
Fix , and introduce the notation
The expressions in (38) can be rewritten with and .
Now let us collect these terms coming from different cuts and show that they yield 0. By symmetry, it suffices to show this for three kinds of terms : where and ; where and ; and where and .
Look at the terms with and (all that are not in are in ). They arise from cuts (1a) and (1b) where the cut segment is or and from cuts (1c) and (1d) where the cut segment and the segment containing the vertex are and , or vice versa. These cases give:
the sum of which is 0 by (19).
The terms with and (all that are not in , except the last, are in ) come from three sources:
-
•
cuts of type (1a) where the cut segment is either or ;
-
•
cuts of type (1c) and (1d) where the segment containing the vertex and the segment that is cut are and , or vice versa;
-
•
cuts of type (1c) and (1d) where the segment containing the vertex and the segment that is cut are and , or vice versa.
A similar computation shows their total contribution is 0.
Finally, consider terms with and (all not in except the first and last are in ). They arise from cuts of type (1c) and (1d), where the segment is either or and the segment is either or , yielding four cases:
The sum of their contributions is also 0.
∎
Lemma-Computation 24.
Proof.
Suppose that . The cuts of types (1a), (1b), (1c), and (1d) contribute
(39) | ||||
(40) | ||||
(41) | ||||
(42) |
respectively. ∎
By symmetry, analogous expressions will result if .
Lemma-Computation 25.
Proof.
Suppose , so only one segment occurs below .
If , then it is easy to see that only cuts of type (1a) and (1b) contribute nonzero terms, and that the (1a) terms cancel with the (1b) terms. So assume .
The cuts of type (1a) fall into three classes depending on which segment is cut: (i) , (ii) , or (iii) . The first two contribute
(43) | ||||
(44) |
respectively, where we have used that the sequences that may occur in the lower part of the cut are precisely the shuffles of and appearing below , except the cut segment . Finally, the third class gives
(45) |
where we have applied (19) to break the generating functions with into ones with only or .
The cuts of type (1c) fall into five classes, depending on the segment where the vertex of the cut lies and the segment that is cut: (i) vertex on and is cut, (ii) vertex on and is cut, (iii) vertex on and is cut, (iv) vertex on and is cut, (v) vertex on and is cut. They contribute the following terms:
(46) | ||||
(47) | ||||
(48) | ||||
(49) | ||||
(50) |
The cuts (1b) and (1d) contribute antisymmetric terms, i.e., and are exchanged and becomes . The entire contribution of case 3 is then the
The expression (43) with its symmetrization cancels to 0.
The remaining terms form the contribution of Case 3, and are simplified to
(51) | |||||
(52) |
Analogous expressions result if . ∎
Proof of Lemma 22.
Consider first the expressions of the form , arising from (39) and (51). (The notation ), which by definition depends on and , is unambiguous here since no appear in the expression for ) when .) We claim that for fixed and , the sum of these terms over all is precisely
(53) |
Indeed, the term that appears on the left side for a fixed is if and if
. The quasishuffles for which the underlined segment collides with no provides the terms with , while the quasishuffles for which the underlined segment collides with some provide the terms with .
In a similar way, the expressions with , coming from (52) and (41), yield
(54) |
The expressions with and give the antisymmetric terms.
Applying the shuffle relations of lower depth to (53) and (54), we get the total contribution of cases 2 and 3 for fixed and :
(55) | |||
(56) | |||
(57) |
Notice that this expression does not depend on , and all but one of the segments in each generating function depends only on the or only on the .
Reindexing leads to cancelation of all terms except the term in (55) where and the term in (56) where . That is, if and , then this expression becomes
(58) | ||||
(59) | ||||
(60) |
If or , the following terms remain, respectively:
(61) | ||||
(62) |
Identical terms , , with the and exchanged appear in the cases .
So the total contribution of cuts of type 1 is
(63) |
finishing the computation. ∎
Lemma-Computation 26.
Computation of cuts of type (2).
Proof.
A cut of type (2a/b/c) divides the circle into a left part and a right part (see Fig. 3.2.1). Let be maximal such that appears in and minimal such that appears in , with or if the corresponding segments do not appear. Define in the same manner, for the .
Let
and define and in a similar way for the . (As usual, one interprets these expressions as 0 if the index set is empty.) Also let
Consider cuts (2a) for fixed . For such cuts,
The that occur in the resulting terms are exactly the quasishuffles of and . The analogous statement holds for . The contribution of cuts (2a) is
(64) |
Now look at cuts (2b) and (2c). The non-distinguished segment containing the vertex or the cut is either (), (), or (). The terms coming from the sum of (2b) and (2c) are, for these three cases respectively,
(65) | ||||
(66) | ||||
(67) |
Let us assemble the terms of the form and coming from application of the shuffle relations to the and . (The terms and are symmetrical.)
The terms , for and , are:
Summing this over leaves
(68) | |||||
(69) |
If , then from (64) and (66) we also have the terms
(70) | ||||
(71) |
The last term is . The remaining term and (70) mostly cancel when summed over , leaving only
(72) |
If , there are terms
(73) |
Finally, also produces 0.
Thus the sum of terms is
(74) |
Similarly, terms of the form give
(75) |
The terms where , are, similarly:
(76) |
If , we get the terms
(77) |
If , there are terms
(78) |
The case , again contributes 0.
The terms are symmetrical.
Proof of Lemma 21.
Lemma-Computation 27 (Step 1(b)).
Modulo elements , and are given by expression (97) below and its symmetric expression, respectively.
Proof of Lemma 27.
We compute .
Recall that the distinguished segment of is . We use the above classification of cuts of type (1a/b/c/d) and (2a/b/c).
Consider first the terms coming from cuts of type (1). For each such term, let be the minimal and maximal indices of that do not appear in . For fixed , the cuts of type (1a), (1b), and (1c/d) produce precisely the expressions (58), (59), and (60) above. Thus the contribution of cuts of type (1) is , and the total contribution is
(85) |
Next, we look at cuts of type (2). We will need a simplified formula for terms where either the vertex or the cut are on a segment indexed with . If and the vertex is at a nonzero point, we get terms of the form
Applying (19), it is easy to show by induction that, for general , the resulting terms are
(86) |
For example, if , this becomes
agreeing with the formula following directly from (19) that has been used in the previous computations.
Similarly, if the vertex is on some segment , the term for ,
expands into
(87) |
Finally, if the vertex is at a 0 on the segment and the cut is on the segment , we get terms
(88) |
These identities can also be shown combinatorially, by interpreting the definition of the multiple generating functions in terms of collapsing segments.
For a term coming from a cut of type (2), let be the maximal index of appearing in and the minimal index in , so for cuts (2a) and for cuts (2b/c). By (86), for fixed , the cuts of type (2a) contribute
(89) | ||||
(90) |
By (87), the cuts of type (2b) contribute
(91) | ||||
(92) |
By (88), the cuts of type (2c) contribute
(93) | ||||
(94) | ||||
(95) |
The sum of expressions (91), (93), and (95) simplifies to
(96) |
Then, letting be the sum of expressions (89), (90), (92), (94), and (96), the coproduct of is
(97) |
The coproduct of is the symmetric expression. ∎
3.2.4. Proof of Step 2
Here we show the terms of weight coming from are 0.
Proof.
We first examine the relevant terms of . Let us compute the coefficient occurring with . These come from shuffles containing segment , a segment , and the segment (where we write ).
Inspect the generating functions of depth 1 that appeared in the proof of Lemma 19. All generating functions in the lower half of cuts (1a/b/c/d) were written in a form where is the first segment counterclockwise of the distinguished segment, rather than with the segment counterclockwise of the vertex of the cut as in (25)).
So, by the remark following Lemma 15,
the terms (30) vanish in the coproduct, so the terms arising from these cuts are canceled by the lower-depth shuffle relations in Lemma 19. Similarly, for cuts of type (2), we only have terms (28) contributing the coefficient of .
For quasishuffles in which appears, the terms (29) where some appears immediately clockwise of gives terms
(98) |
where denotes the sum over only those quasishuffles where collapses with .
The terms (29) where either or some appears immediately clockwise of sum to
(99) |
Finally, the terms (28) contribute to the terms
(100) |
where denotes the the quasishuffles in which does not collapse with any .
For quasishuffles in which some appears, the terms (29) contribute 0, since they arise from cuts of segments containing no 0s. The terms (28) give
(101) | ||||
(102) |
For the segment , which includes a factor of , we get a contribution of
(103) |
from (28) and
from (29), with three terms, depending on which segment (, , or ) appears clockwise of . By the lower-depth shuffle relations, this simplifies to
(104) | ||||
(105) |
The terms (98) cancel with (102). Summing (101) over and adding to (100) results in
(106) |
Thus is the sum of (99), (103), (104), (105) and (106). Applying lower-depth shuffle relations and (19), this sum simplifies to
(107) | ||||
(108) | ||||
(109) |
Now let us compute the coefficient occuring with in . For the segment in , (28) and (29) contribute the terms
(110) | |||||
(111) |
where the second term appears only if .
The distinguished segment contributes only a term (28). By an argument similar to that in Lemma 27, this term can be written
(112) |
Combining (107)-(112), we find that
Therefore, adding the symmetric terms for the ,
modulo lower-depth shuffle relations and elements .
∎
3.2.5. Conclusion
We are ready to use the coproduct we have computed to reduce the proof of the relations to a simple base case.
Proof of Theorem 5(a).
We induct on the depth . When or , is identically 0.
If , taking coproduct on both sides of (37) and using that , one deduces that modulo shuffle relations of depth and terms .
When no terms are present in the coproduct, Lemma 18 and Lemma 37 imply that lies in the ideal generated by lower-depth relations.
These terms appear only in a base case: the constant term of the shuffle relation for . Showing the coproduct of this term is 0 amounts to proving the identity
(113) |
We compute directly that the left side of (113) is
The theorem is proved. ∎
4. Specialization theorem for Hodge correlators
We now study how the Hodge correlators over a base behave when the sections collide. This will require extending the theory of Hodge correlators to nodal curves.
4.0.1. The correlator Lie coalgebra for nodal curves
Recall the moduli space of distinct points and a distinguished tangent vector on . Its Deligne-Mumford compactification consists of the nodal curves of genus 0, i.e., those whose dual graph is a tree and in which every component is a punctured projective line. with marked points and a distinguished tangent vector .
Let be a genus 0 nodal curve with a set of punctures . Let be the dual tree of , with vertices indexed by corresponding to , rooted at the component with the base point , oriented away from the root (write if is an edge). Choose a coordinate on each such that the point joining the component to its parent is , and the base point on is at with tangent vector . Let be the set of punctures on . Let .
We define the correlator Lie coalgebra for the nodal curve by
(114) |
where is the tangent vector at .
It coincides with the usual definition if is smooth, justifying the notation. If is not smooth, it is different from , the coalgebra naively defined as the tensor algebra of modulo cyclic symmetry and shuffle relations with a coefficient. They are related in the following way. For each , there is a surjective coalgebra morphism to the component of the direct sum corresponding to :
To define it on a generator , let be the common parent of the components containing the . If , the -th component of the map is 0. Otherwise, set
extended to preserve the tensor product. That is, points in remain, while points in components below collapse to the nearest node on . Evidently this map preserves the coproduct and defining relations. Taking the direct sum of the maps , we have produced a coalgebra morphism:
It preserves the decomposition of the domain by .
In particular, if vary over a base , and the variation extends to , with , then we have a degeneration map
(115) |
where the first map simply applies the induced map on and the second map is the quotient defined above. The composition forgets the way in which the sections in collided at boundary of .
4.0.2. Specialization theorem
Recall that an element of over a base determines, by the map , a variation of Hodge structures over , and, by the period map , a smooth function on . The maps and also exist for a nodal curve, extended by linearity from the definition (114).
Theorem 28.
Suppose is a family of curves extending to , with a normal crossings divisor, and suppose of weight .
-
(a)
The Deligne’s canonical extension to of the variation of framed mixed Hodge structures determined by is independent of the normal vector to . Thus there is a specialized map .
-
(b)
This specialized map coincides with the Hodge correlator of the degeneration map:
-
(c)
Let be a local equation for . Then
Proof.
Let be a generator of weight . For any a normal vector to , we get the specialized framed mixed Hodge-Tate structure .
We must show that:
-
(1)
The periods of extend continuously to .
-
(2)
The coproduct of does not depend on the direction of specialization at any smooth point of .
-
(3)
The periods of the specializations (i.e., the limits of the periods at ) coincide with the periods of the degeneration to .
We will prove (1-3) by induction on the weight. First, let us see how they imply the result.
Assuming (2), the coproduct of is independent of . Because the coproduct commutes with , this element is independent of up to , which is 1-dimensional and controlled by the period. By (1), the period is independent of the direction of specialization, which gives (a). By (3), it coincides with the period of the degeneration, which gives (b). Then (c) follows by the definitions from (b).
To show (1), we let be a set of smooth local equations for and prove that can be represented locally as a polynomial in the such that the terms with appearing in positive degree have coefficients vanishing along (tame logarithmic singularities). This will follow from the differential equations on the periods. Note that in weight 1, the period of has a (not tame) logarithmic singularity along . In weight , we proceed by induction.
Consider a simple element (). Suppose that not all collide on , so we must only consider the summand of the nodal corresponding to the component containing the base point. The terms of can be grouped into those of two forms:
-
(i)
, where not all sections in and in collide to the same section on ;
-
(ii)
, where not all sections in collapse on , but and coincide on .
By the inductive hypothesis, the specialization of does not depend on the direction of specialization: for terms (i), and satisfy (2), while in terms (ii) the vanish under specialization to . This gives (2).
For (1), from the differential equations on the periods (16), we see that is a sum of terms that are smooth over with logarithmic singularities along (from type (i)) and terms that vanish along by the inductive hypothesis (from type (ii)). We conclude that has tame logarithmic singularities along .
If all collide on , we simply pass to their common parent component and apply the same argument.
We conclude with (3). We have shown that the specializations of and its coproduct to exist at every point and their periods are independent of , and thus the specialized period map is equal to the period of the degeneration up to adding a constant for each smooth component of the smooth locus of . We must show the constant 0.
It is enough to show this for a lowest-codimension boundary stratum in . We are done by the next lemma.
∎
Lemma 29.
Let be a proper subset of () and with if and either or . Let
Then
is continuous at .
Proof.
For , this amounts to continuity of at 1.
In the proof of Theorem 28 it was established that
is independent of the , for generic . Let us integrate this difference over , with respect to the standard measures of volume 1 on .
The limit is uniform in the directions (), and so
To conclude, it suffices to show that
(116) |
for all .
For any tree entering into the Feynman integral expression for (116), choose a pair of boundary vertices (without loss of generality, labeled and ) incident to a common internal vertex with corresponding variable , and let be variable corresponding to the third vertex incident to . Then the integral over the contains the term
Exchanging the two integrals and noting that changes sign under the involution
we conclude that this expression is 0. ∎
The specialization theorem states is that when the punctures labeling an element of collide, only the nearest possible to the base point component of the resulting nodal curve determines the limit Hodge correlator. We obtain as a corollary Theorem 11:
Theorem.
The Hodge correlators are continuous on .
For example, is continuous with a tame logarithmic singularity at 1, but has no limit as .
5. The second shuffle relations
5.1. Proofs of Theorems 7 and 9
In this section we will prove the second shuffle relations for Hodge and motivic correlators.
5.1.1. Proof for Hodge correlators
Recall Theorem 7:
Theorem.
-
(a)
Restricted to the subspace of generated by elements with not all equal, the map factors through .
-
(b)
Suppose that and that not all or not all . Then the Hodge correlators satisfy the relation:
where
-
(c)
The Hodge correlators satisfy all specializations of this relation as any subset of the approaches 0.
Proof.
For fixed , , and , consider the -second shuffle relation in (b). It is a family of framed mixed Hodge-Tate structures over
To show (b), it suffices to show the family is trivial as an element of over every point of , except at if all . This is equivalent to (a) by the definitions, as the Hodge correlators are already known to satisfy the defining relations in .
Each term of this relation is an element
where each is either 0 or monomial in the . By Theorem 10, it is a variation of framed mixed Hodge-Tate structures over
We first show by induction on the weight that all such variations is trivial.
In the base case , there are no second shuffle relations.
For the induction hypothesis, suppose and (b) holds in weights . Fix , , and and let be the variation defined above. By the induction hypothesis, vanishes, and thus, by rigidity, is a constant variation, determined pointwise as an element of by the period. We show the period is 0.
The specialization theorem (§4) implies that the period of is continuous away from the main diagonal in . Unless all or all , in no term of the relation (b) do all points collide to the main diagonal. By Corollary 11, the specialization of the period at is equal to the substitution . Under this substitution, the period of each term of the relation becomes
Therefore, is trivial over .
Because is dense in , the relation at all points – except if all – follows by the specialization theorem. This completes the proof of (b) and (c). ∎
Applying the period map, we immediately obtain Theorem 1:
Theorem.
-
(a)
Suppose that and that not all or not all . Then the Hodge correlators satisfy the relation:
where
-
(b)
The Hodge correlators satisfy all specializations of this relation as any subset of the approaches 0.
5.1.2. Proof for motivic correlators
Recall Theorem 9:
Theorem.
Let be a number field.
-
(a)
Restricted to the subspace of generated by elements with not all equal, the map factors through .
-
(b)
Suppose that and that not all or not all . Then the motivic correlators satisfy the same relation as in Theorem 7, with replaced by .
-
(c)
The motivic correlators satisfy all specializations of this relation as any subset of the approaches 0.
Proof.
Fix an embedding . It induces a map , which we also denote by .
Denoting by the subalgebras generated by elements where not all are equal, we have the diagram
where the lower half commutes by Theorem 7 and the vertical maps are induced by .
It is necessary to show the dashed arrow is well-defined, i.e., that vanishes on the kernel of the map .
Commutativity of the diagram for every embedding implies the result. Precisely, we argue by induction.
In weight 1, then there are no first or second shuffles, and the shuffle relations are mapped to 0 by . Indeed, we have and , since
For the inductive step, if , homogeneous of weight , vanishes in , then under every embedding , and by the inductive hypothesis. By Lemma 8, . ∎
5.2. Applications
5.2.1. Additive shuffle relation
Specializing all to 1 in the second shuffle relation, where all , we extract an additive second shuffle relation, which does not have lower-depth terms:
Corollary 30.
Let . The additive shuffle
is a constant independent of .
It is easy to see that this constant is 0 if is even. If is odd, it is equal, in particular, to a sum of Hodge correlators at roots of unity.
5.2.2. Proofs of Corollaries 2 and 3
Recall Corollary 2
Corollary ([GR], Proposition 2.8).
For , every Hodge correlator of weight is a linear combination of Hodge correlators of weight and depth at most .
Precisely, for , we have
(117) |
Proof.
By multiplicative invariance, we may assume . Then this is precisely the -second shuffle relation applied to the segments
and
where the segment is left fixed. Indeed, the two summations come from the shuffles and the additional quasishuffles, with the remaining terms giving the left side and the last summand.
All terms on the right side have at least two coinciding arguments. After an additive shift, they have at least two arguments equal to 0, so they are equal to those of depth at most . ∎
Recall Corollary 3:
Corollary.
The Hodge correlators in weight 3 satisfy the relations:
(118) | ||||
(119) |
Proof.
Apply the -second shuffle relation to the segments and , keeping the segment fixed:
Multiplicative invariance and the first shuffle relation imply
Rearranging terms and applying additive invariance gives (118).
6. Appendix: Multiple polylogarithms
We review the properties of multiple polylogarithms ([G2]).
It is well known that these functions obey a family of double shuffle relations similar to our relations for the Hodge correlators. However, they do not enjoy some of their other properties. They are multi-valued and do not satisfy dihedral symmetry relations. The shuffle relations between multiple polylogarithms involve products, while for Hodge correlators they are linear.
6.0.1. Multiple polylogarithms
The multiple polylogarithms are defined by
(120) |
(The depth of this formal expression is and the weight is .) These series converge for and have analytic continuations to multivalued functions with singularities on . The multivalued structure is encoded by a smooth variation of mixed Hodge-Tate structures of weight over a dense open subset of .
When , the multiple polylogarithms are the classical polylogarithms . Their monodromy and associated mixed Hodge-Tate structures are well understood ([H]).
We can form an algebra generated over by the multiple polylogarithms, filtered by the weight and the depth. The expression (120) yields expansions for products of polylogarithms, which shows that has a well-defined multiplication. For example,
Notice that the left side and all terms on the right side have weight ; however, the left side and the first two terms on the right side have depth 2, while has depth 1.
The general relation is:
(121) |
Expressions (121) are called first shuffle relations for multiple polylogarithms. It is convenient to express them with generating functions. Let
then
(122) |
To describe the lower-depth terms in the right side of (121), one needs to work with the set of quasishuffles . Then
(123) |
where
Such relations are easily proved by interpreting the terms as the simplicial decomposition of the product of an -simplex and an -simplex.
6.0.2. Iterated integrals
The analytic continuation of the multiple polylogarithms has a presentation in terms of iterated integrals. Let
where is a path from 0 to . Here, for 1-forms ,
is Chen’s iterated path integral ([C]). Then ([G2], Theorem 2.1)
(124) |
Iterated path integrals also satisfy a shuffle product formula, whose terms correspond to the top-dimensional cells of a decomposition of the product of two simplices:
This gives a different kind of shuffle relations (second shuffle relations) on the iterated integrals , which can also be expressed in terms of generating functions. Let
(125) |
so
(126) |
Then
(127) |
6.0.3. Double shuffle relations
6.0.4. Relation to Hodge correlators
In depth 1, the Hodge correlators are related to the multiple polylogarithms. We have seen this in weights 1 and 2. In higher weight, define a single-valued version of the polylogarithm by
where , close relatives of the Bernoulli numbers, are the coefficients of the Taylor expansion . Then
(128) |
The precise relationship between the multiple polylogarithms and Hodge correlators in depth is unknown.
References
- [B1] A.A. Beilinson. Higher regulators and values of L-functions. Journal of Soviet Mathematics, 30(2):2036–2070, 1985.
- [B2] A.A. Beilinson. Height pairing between algebraic cycles. In -theory, arithmetic, and geometry, volume 1289 of LNM, pages 1–26. Springer, 1987.
- [B3] S.J. Bloch. Higher regulators, algebraic K-theory, and zeta functions of elliptic curves. 1978.
- [B4] A. Borel. Stable real cohomology of arithmetic groups. Annales scientifiques de l’École Normale Supérieure, 7(2):235–272, 1974.
- [BGSV] A. Beilinson, A.B. Goncharov, V. Schechtman, and A. Varchenko. Aomoto dilogarithms, mixed Hodge structures and motivic cohomology of pairs of triangles on the plane. In The Grothendieck Festschrift, volume 86, pages 131–172. Birkhäuser Boston, 1990.
- [C] K.-T. Chen. Iterated path integrals. Bull. AMS, 83(5):831–879, 09 1977.
- [D1] P. Deligne. Théorie de Hodge: III. Publications Mathématiques de l’IHÉS, 44:5–77, 1974.
- [D2] P. Deligne. A quoi servent les motifs? In Motives, volume 55 of Symp. Pure Math., pages 142–151. AMS, 1994.
- [D3] P. Deligne. Structures de Hodge mixtes réeles. In Motives, volume 55 of Symp. Pure Math., pages 509–514. AMS, 1994.
- [DG] P. Deligne and A.B. Goncharov. Groupes fondamentaux motiviques de Tate mixte. Ann. Sci. École Normale Sup., 2003.
- [G1] A.B. Goncharov. Geometry of configurations, polylogarithms and motivic cohomology. Advances in Mathematics, 114:197–318, 1995.
- [G2] A.B. Goncharov. Multiple polylogarithms, cyclotomy and modular complexes. Math. Res. Lett., 5:497–516, 1998. arXiv:1105.2076.
- [G3] A.B. Goncharov. The dihedral Lie algebras and Galois symmetries of . Duke Math. Journal, 110(3):397–487, 2001.
- [G4] A.B. Goncharov. Multiple polylogarithms and mixed Tate motives. 2001. arXiv:math/0103059.
- [G5] A.B. Goncharov. Periods and mixed motives. 2002. arXiv:math/0202154.
- [G6] A.B. Goncharov. Hodge correlators. arxiv:0803.0297v4, 2008.
- [G7] A.B. Goncharov. Motivic fundamental group of and modular manifolds. 2019. arXiv:1910.10321.
- [GR] A.B. Goncharov and D. Rudenko. Motivic correlators, cluster varieties, and Zagier’s conjecture on . 2018. arXiv:1803.08585.
- [H] R.M. Hain. Classical polylogarithms. 1992. arXiv:9202.022v2.
- [M] N. Malkin. Double shuffle relations for elliptic motivic correlators. 2020. To appear.
- [R] G. Racinet. Doubles mélanges des polylogarithmes multiples aux racines de l’unité. Publications Mathématiques de l’IHÉS, 95(1):185–231, 2002.