motivic-euler-product
A short introduction to motivic Euler products for my own need
Counting with infinite products
This note is about one kind of formula: an infinite product whose expansion counts something. The objects being counted come with a notion of “prime”, and every object is built from primes in exactly one way. Before any geometry, here is an example that only involves words.
Lyndon words
Fix an alphabet with letters, ordered , and compare words lexicographically, with a proper prefix counting as smaller (so ). There are words of length , so
A rotation of a word , with and nonempty, is the word . A Lyndon word is a nonempty word that is strictly smaller than all of its rotations. With the alphabet :
- is a Lyndon word, because its rotations and are both larger.
- is not, because its rotation is smaller.
- is not, because rotating it by two letters gives back. In general a Lyndon word is never a power of a shorter word.
The shortest Lyndon words on two letters are:
| length | Lyndon words | count |
|---|---|---|
| 1 | , | 2 |
| 2 | 1 | |
| 3 | , | 2 |
| 4 | , , | 3 |
Lyndon words behave like prime numbers.
Theorem (Chen–Fox–Lyndon). Every word can be written in exactly one way as
where each is a Lyndon word.
A proof is in Chapter 5 of Lothaire’s Combinatorics on Words. To find the factorization by hand, note that is the longest prefix of that is a Lyndon word. Take it off and repeat on what remains. For example,
Since the factors must appear in decreasing order, their order carries no information. A word is therefore the same thing as a finite multiset of Lyndon words. In this analogy, words play the role of positive integers, Lyndon words play the role of primes, and length plays the role of size: the length of a word is the sum of the lengths of its factors.
The Euler product
Unique factorization of integers gives . Unique factorization of words gives, in the same way,
where is the length of . The number of letters no longer appears on the right. It is hidden in the index set, because it determines how many Lyndon words there are of each length.
The right-hand side is an infinite product, so we should say what it means. Expanding it means choosing one term from each factor, with only finitely many of the exponents nonzero, and multiplying the choices together. A choice is a finite multiset of Lyndon words, in which occurs times. It contributes when the total length equals . There are only finitely many Lyndon words of length at most , so only finitely many factors can contribute to , and every coefficient is a finite count. By the theorem, the choices contributing are exactly the words of length , so the coefficient is .
Here is the check for and , listing every way to choose Lyndon words of total length 3:
| shape | choices | count |
|---|---|---|
| one of length 3 | , | 2 |
| one of length 2, one of length 1 | , | 2 |
| three of length 1 | , , , | 4 |
The total is .
The identity is useful because its two sides are not equally easy to understand. The left side is trivial. The right side involves the number of Lyndon words, which we do not know yet. Call it for length . Grouping the factors by length gives
Take logarithms and use :
Comparing the coefficients of gives . Möbius inversion then gives
For this gives , which agrees with the table. When is a prime power, the same is also the number of monic irreducible polynomials of degree over . This is not a coincidence, and we will come back to it.
A sanity check: no repeated factors
Here is a small variation to try in your head. Call a word squarefree if no Lyndon word occurs twice in its factorization, that is, if strictly. This is the analogue of a squarefree integer. (It is not the usual meaning of “square-free word” in combinatorics on words, which forbids any block of the form .) Let be the number of squarefree words of length .
Each Lyndon word is now used either zero times or once, so each factor of the Euler product shrinks to two terms:
To evaluate this, write . The denominators multiply to the Euler product. The numerators multiply to the reciprocal of the Euler product with replaced by . So
and therefore for . For this predicts squarefree words of length 2, and of length 3. The first is easy: of , , , , the words and repeat a factor. Which four of the eight words of length 3 are squarefree?
Squarefree integers make up a fraction of all integers. Here the squarefree words make up exactly a fraction of the words of each length . The computation also used nothing about infinite products except that they can be multiplied, divided and substituted into like finite products. That is allowed because each coefficient only involves finitely many factors.
What if the answers are not numbers?
In every identity so far, the coefficient of is the size of a finite set: the words of length , or the squarefree words of length . Taking the size throws away almost everything about the set. All we remember is how many elements it has.
So we can ask what happens if we keep more. Let the coefficients live in some other ring, whose elements remember more about the sets of objects being counted, and ask which of the identities above still hold there. What should an infinite product even mean in such a ring, when we cannot simply count the ways to expand it?
The rest of this note answers these questions for one particular choice of ring, the Grothendieck ring of varieties. The answer is the motivic Euler product.
Zeta functions of varieties
Most algebraic geometers first meet a product of this kind without the words “Euler product”. It is the zeta function of a variety over a finite field, as in the statement of the Weil conjectures (for instance, Appendix C of Hartshorne). This section rewrites that zeta function as an Euler product, and finds the Lyndon word identity inside it.
Throughout, is a scheme of finite type over , for instance a variety. Symmetric powers will need more, and we will say so when they appear. The letter is reused on purpose: has elements, and it will soon serve as an alphabet.
Counting points over finite fields
Write for the number of points of with coordinates in . The zeta function of is
The simplest example is the affine line. Here , so and
This is the left-hand side of the Lyndon word identity. Similarly, has points over , and .
As defined, has nothing to do with products, and the exponential and the factor look like tricks to make the examples come out nicely. The real reason for them is that is an Euler product, whose primes are the closed points of .
Closed points are primes
A closed point of has a residue field , which is a finite extension of . The degree of is . For example, the closed points of are the monic irreducible polynomials , and the degree of the point is the degree of .
Geometrically, a closed point of degree is an orbit of size of the Frobenius acting on . For instance, if is odd and is not a square, the closed point of is the pair of conjugate points .
Closed points determine the point counts. A point of over is the same as a closed point together with an embedding of fields . Such an embedding exists exactly when divides , and then there are of them. So if is the number of closed points of degree ,
This is the same relation as for Lyndon words, and the same computation, read backwards, turns it into a product:
In other words,
There are finitely many closed points of each degree (since ), so as before each coefficient involves only finitely many factors. The exponential and the in the definition are exactly what converts point counts into this product.
The affine line, again
The closed points of are the monic irreducible polynomials, so its Euler product is unique factorization in :
The left-hand side is the same as in the Lyndon word identity. Group the factors by degree. The exponent of is then the number of primes of size , and the left-hand side determines these exponents one degree at a time. So there are exactly monic irreducible polynomials of degree over . This is the coincidence promised earlier. There is no natural bijection with Lyndon words; both counts are forced by the same generating function.
The projective line has one more closed point, , of degree 1, and so one more factor: .
For a less innocent check, let be the affine line with a doubled origin. It is not separated, but the argument above never used separatedness. Counting directly, : there are nonzero points and two origins. Using the product, has the closed points of plus one extra origin of degree 1. Either way, .
The Euler product only sees closed points and their degrees, not how they are glued. To it, , the doubled line and all look the same: plus one rational point. In general, if is the union of a closed subscheme and its open complement , then . This property will matter later.
Zero-cycles and symmetric powers
What does the Euler product of a general count? Expanding it means choosing an exponent for each closed point , with only finitely many nonzero. Such a choice is an effective zero-cycle
as in intersection theory. So
On , an effective zero-cycle is the same as a monic polynomial: corresponds to .
Effective zero-cycles of degree are the points of a variety. Here we need to be quasi-projective, so that the quotient
exists as a variety. For the doubled line, the usual construction breaks down, because no affine open contains both origins. The quotient is then only guaranteed to exist as an algebraic space, a slightly more general kind of object than a scheme, glued in the étale topology rather than the Zariski topology. Over an algebraically closed field, its points are the unordered -tuples of points of . Over , its -points are the unordered -tuples of points of that the Frobenius maps to themselves, and these are exactly the effective zero-cycles of degree on . Therefore
For , sending an unordered -tuple of roots to the coefficients of the monic polynomial with those roots gives , by the fundamental theorem of symmetric polynomials. So the coefficient is , as it should be.
An -point of is not the same as an unordered -tuple of -points of . Take and . The variety has points over . But there are only unordered pairs of elements of . The remaining points are the pairs with . Neither point of such a pair is defined over , but the pair is. These pairs are the closed points of degree 2, and there are of them. In the Euler product, each one is a single prime contributing .
Where this leaves us
Here is the dictionary so far:
| words | over | over | |
|---|---|---|---|
| primes | Lyndon words | monic irreducible polynomials | closed points |
| size of a prime | length | degree | degree |
| objects | words | monic polynomials | effective zero-cycles |
| objects of size |
The last entry is new. The coefficient of is still a count, but what is being counted is now the set of -points of a variety, .
Now replace by , or by . Every closed point now has degree 1, and there are infinitely many of them, so and are infinite. Taking the number of points is no longer a legal move. The varieties are still there, though. Only the count has broken.
The number of points was always a compressed summary of the geometry. Over a finite field the compression happened to keep enough to make the identities above work. Over it keeps nothing. So the natural thing to do is to step back and keep track of the geometry itself, compressing only as much as the identities need. The doubled line suggests how much that is. The Euler product never distinguished it from . The only rule it used was cutting a variety into a closed piece and its open complement.
The Grothendieck ring of varieties
Fix a field . We want to attach to each variety over a class that remembers more than a number, but obeys the one rule from the previous section.
The definition
The Grothendieck ring of varieties is the abelian group generated by symbols , one for each isomorphism class of schemes of finite type over , subject to the relations
The product makes it a commutative ring, with unit . The class of the affine line gets its own name:
Two remarks on the definition. Taking shows , so nilpotents are invisible. And every scheme of finite type can be cut into affine pieces, so it makes no difference whether the generators are all such schemes or only varieties.
First computations
Cutting and pasting gives most of the classes one meets in practice.
- , since .
- , since is with a point removed.
- , since is plus the point . More generally, gives .
- The doubled line is one copy of , which is open, together with the other origin, which is a closed point. So its class is .
The last line is the identity the zeta function already suggested, now holding before any counting.
Every class above is a polynomial in with integer coefficients, because every variety above can be cut into affine spaces. Most varieties cannot, and the simplest one that cannot is an elliptic curve: a smooth projective curve of genus 1 with a chosen point . For the rest of this subsection, and is an elliptic curve, for instance the closure in of , with its point at infinity.
We can still cut. Removing leaves the affine curve given by , so . But nothing more comes out. No open piece of is isomorphic to an open piece of , since and would then be birational. This is not yet a proof that is new. Two classes can agree in through a long chain of relations without any visible decomposition, so failing to find one proves nothing. What we need is an invariant that respects the relations and tells apart from everything built out of .
Over , one such invariant is the Hodge–Deligne polynomial, a ring homomorphism that records the Hodge numbers of compactly supported cohomology. The next subsection places it among other invariants of the same kind. Here we only need two of its values:
The four terms of are the four pieces of the cohomology of : for , and for the two halves and of , and for .
Now suppose , where is any expression built from alone. It could be a polynomial. In a ring where is inverted and infinite series in converge, it could also be a quotient of polynomials, or a transcendental series such as . Whatever is, as long as can be applied to it, turns it into , an expression in the product alone. The substitution
leaves unchanged, so it leaves unchanged too. It does not leave unchanged: it sends to . So , and therefore .
The argument never asked what is. It used only that depends on alone, and that cannot see the sign change. The sign change flips the terms of odd total degree in and , which for a smooth projective variety come from cohomology in odd degree. Affine spaces have no odd cohomology, so nothing built from has any, while is two-dimensional. The same argument works for every curve of genus , whose Hodge–Deligne polynomial is . So is much larger than the polynomials in , and this is the extra information that the motivic version of an Euler product will be able to keep track of.
Counting is a ring homomorphism
Over , a closed subscheme and its open complement split the -points of into two disjoint sets, and the points of a product are pairs of points. So counting points respects both the relations and the product, and defines a ring homomorphism
The same holds over for every , so the zeta function only depends on . This is why it could not tell from the doubled line.
A single count cannot see what made the elliptic curve new. An elliptic curve over has points for some integer , and that is just a number. The counts over all together do see it. By Weil’s theorem for curves,
where and are complex numbers with , and . Compare this with . The term is the image of , like , while plays the role of . It is not constant in , and its size is at most , half a power of . A polynomial in with integer coefficients is either constant or grows at least as fast as , so this term cannot come from a polynomial in . That is the point-counting shadow of the sign argument above, and and are the shadows of and .
Over there are other invariants with the same two properties. The Euler characteristic with compact support gives with . It sends an elliptic curve to , the same as the empty variety, so on its own it cannot see at all. The Hodge–Deligne polynomial from the previous subsection gives with , and setting recovers . In each case, is the more refined object and the invariant is a compression of it. In fact is the universal target for invariants that respect cutting and pasting and products, since that is exactly how it was defined.
Where the name comes from
Grothendieck defined this group in a letter to Serre of 16 August 1964. In the same letter, the word motive appears for the first time. Grothendieck hoped for an abelian category of motives, a universal cohomology theory through which every reasonable cohomological invariant of a variety would factor. He admitted that he did not yet know how to define it. The Grothendieck ring is a crude shadow of that hope, because any reasonable category of motives receives a map from it. Kontsevich called it the ring of “poor man’s motives”. This is why objects built from classes in are called motivic.
Kapranov’s zeta function
We can now do what the previous section asked for. Let be quasi-projective over . Instead of counting the points of , keep its class. Kapranov’s motivic zeta function is
Over , applying to each coefficient recovers . For the affine line, , so
which specializes to when .
For an elliptic curve over , the answer involves more than . Let , and send an effective zero-cycle of degree to the sum of its points in the group law of . By Abel’s theorem, two such cycles have the same sum exactly when they are linearly equivalent. So the fibre over a point is the set of effective divisors linearly equivalent to , which is the projective space of lines in an -dimensional space of sections, by Riemann–Roch. This makes a -bundle over . It is the projectivization of a vector bundle, so it is a product over each piece of a suitable cutting of , and its class is . Using ,
The denominator is . The numerator is where differs from , and its middle coefficient is exactly the part of that, as we saw, cannot be written in terms of . Over , counting sends it to , and the numerator becomes . This recovers the classical zeta function of :
Over , the Hodge–Deligne polynomial sends it to , and the numerator becomes . In both cases the numerator is the one factor that could not have produced.
Over , applying instead gives Macdonald’s formula from 1962:
Read it as an Euler product. Every point of has degree 1 and contributes a factor . There are infinitely many points, but the formula behaves as if there were of them. Over , “the number of points” has not disappeared. It has become the Euler characteristic.
For an elliptic curve, , so Macdonald’s formula predicts . Applying to Kapranov’s formula, with and , gives , as it should. It also shows how much forgets: the numerator and the denominator become equal at , and cancel.
When is Kapranov’s zeta function rational?
Over , the zeta function of every is a rational function of . This is the first of the Weil conjectures, proved by Dwork in 1960. The elliptic curve shows that sometimes rationality holds before any counting: is a quotient of two polynomials in with coefficients in .
The same argument works for every smooth projective curve of genus with a rational point, as Kapranov observed. Sending a zero-cycle of degree to its class in , which is isomorphic to the Jacobian of , makes a -bundle over once , by Riemann–Roch. So for all but finitely many , and is a polynomial of degree at most in , divided by .
Two operations preserve rationality. First, if is closed with open complement , cutting according to how many of the points lie in gives , that is,
This is the motivic version of the property from the previous section. It means that turns sums of classes into products of series, so the classes with a rational zeta function form a subgroup of . Second, a lemma of Totaro gives , so . Together, these show that every combination of classes , with a curve with a rational point, has a rational zeta function.
Kapranov asked whether is rational for every . It is not. Larsen and Lunts proved in 2004 that for a smooth projective complex surface ,
where is the Kodaira dimension. One direction follows from what we have. A surface with is obtained by blowing up points, starting from or from a -bundle over a curve . Blowing up a point replaces it by a and adds to the class, so is either or , a combination of the kind above.
The other direction is the hard one, and none of the invariants we have can prove it. Counting points over turns every into a rational function, by Dwork. So does the Hodge–Deligne polynomial: if , then a Hodge-theoretic version of Macdonald’s formula gives
For the elliptic curve this is , as we found by hand. To see irrationality, Larsen and Lunts construct new ring homomorphisms from to fields. These send to and are sensitive to holomorphic differential forms, which is where the Kodaira dimension enters.
The elliptic curve is a good example here too. The surface is an abelian surface, with , so is not rational, although is. The classes with a rational zeta function form a subgroup of that contains but not . Rationality survives cutting and pasting, but not products.
How much further does this go? Here is some of what is known beyond complex surfaces.
- Higher dimension. Larsen and Lunts wrote that in dimension at least 3 the problem seems wide open. A 2025 preprint of Shein extends their necessary condition: if is smooth, projective, of dimension at least 2 over , and is rational, then and has no nonzero holomorphic forms of even degree. These conditions are not sufficient. If is a quintic threefold, then , so is irrational, and its irrationality survives setting . The fourfold has and no even-degree forms, but , so , which agrees with modulo and is irrational.
- Inverting . Because the homomorphisms of Larsen and Lunts send to , they say nothing about rationality in , the ring that appears in motivic integration. Denef and Loeser conjectured rationality there. In 2020 Larsen and Lunts disproved this with a K3 surface over whose zeta function is irrational even after inverting .
- Motives. In characteristic zero, maps to the Grothendieck ring of Chow motives. There the zeta function of every motive that is finite-dimensional in the sense of Kimura is rational, by an argument of André. This includes the motives of curves and abelian varieties, so the image of is rational. The irrationality lives in the part of that motives forget.
For surfaces, these results combine into a clean statement: is rational exactly when is a combination of classes . So here is the question this section leaves open. Is rationality of always a sign that is built, up to cutting and pasting, out of curves and affine spaces? If not, what else can produce it?
Motivic Euler products
Kapranov’s zeta function is the motivic version of , but only of its expanded form, the sum over . The product itself has no meaning yet, because has no infinite products over the points of a variety. This section explains how Margaret Bilu makes sense of such products, with more general factors than . The construction is in her thesis, published as Motivic Euler products and motivic height zeta functions (Memoirs of the AMS, 2023).
As in the introduction to Bilu’s work, take algebraically closed, so that every closed point has degree 1 and degrees play no role. We also take of characteristic zero, which avoids a technical issue with bijective morphisms below.
Expanding a product over the points of a variety
Let be a quasi-projective variety, and let be a family of quasi-projective varieties with morphisms . For a point , write for the fibre of over . We want to define
where the coefficient of in the factor at is the class of . The coefficients may vary with . When they do not, that is, when for varieties , every factor is the same series .
Expand the product as we did for Lyndon words, by choosing one term from each factor, with all but finitely many choices equal to . In degree 1, a choice is a point together with the term . Taken together, these choices form itself, so the coefficient of is . In degree 2, there are two kinds of choice. Either two distinct points each contribute a term of degree 1, or one point contributes . The choices of the second kind form . The choices of the first kind form the variety of unordered pairs of points of lying over distinct points of . So the coefficient of should be
where the subscript means the open subset where the two points have distinct images in .
In general, the choices contributing to are sorted by a partition of . Write , where is the number of points that contribute their term of degree , so that . Bilu defines
where the subscript again means that the images of all points in are pairwise distinct, and permutes the factors equal to . A point of is a finite set of distinct points of , with of them labelled , together with a point of for each labelled . That is exactly a choice of one term from each factor. Then
This is the expansion of the Lyndon word product, with one difference. There, the choices contributing to formed a finite set, and we kept its size. Here they form a variety, and we keep its class.
When every is itself, the space is the space of configurations of distinct points of , with of them labelled .
At this point the right-hand side is only a notation, and it has to be shown that it behaves like a product. Bilu proves that it does. For instance, if is closed with complement , then the product over is the product over times the product over , which generalizes .
First examples
Finitely many points. Let be two points. The coefficient of has two parts. For , the pairs over distinct points of are the pairs over and over , which identifies, giving . For , we get . The coefficient is
which is the coefficient of in the ordinary product of the two factors at and . In general, over a finite set of points the motivic Euler product is the ordinary product.
Kapranov’s zeta function. Take for every , so that every factor is . A point of is a set of distinct points, of them labelled . Sending it to gives an effective zero-cycle of degree whose multiplicities are recorded by , and every effective zero-cycle arises from exactly one in exactly one way. So is cut into locally closed pieces, one for each , and maps bijectively onto its piece. In characteristic zero this is enough for the two to have the same class. Therefore , and
For and , the two pieces of are the monic quadratics with distinct roots, , and those with a double root, . Their classes are and .
The elliptic curve. Combining this with the earlier computation,
The left side treats all points of alike. The group law, Abel’s theorem and Riemann–Roch only entered when we evaluated it. The coefficient of is a small check: is cut into , the pairs of distinct points, and the diagonal, a copy of . Since , this gives .
Constant coefficients. When , the product is often written as a power,
This is the power structure of Gusein-Zade, Luengo and Melle-Hernández (2004), and Bilu’s product generalizes it to coefficients that vary with . In this notation, . Over , applying turns the power into an ordinary power with exponent . For this is Macdonald’s formula, and the earlier remark that the formula behaves “as if there were points” becomes literally true.
Counting points. The definition also makes sense over , where degrees come back. An -point of is a configuration that the Frobenius maps to itself. Its points fall into Frobenius orbits, which are closed points of . All the points of an orbit carry the same label , and their decorations together form a -point of . A closed point labelled contributes . So counting points gives
an Euler product over closed points in the sense of the previous section. For this is . This is the sense in which the motivic Euler product lifts the classical one.
Squarefree zero-cycles and configuration spaces
In the squarefree sanity check for words, each Lyndon word could be used at most once, and each factor became . The motivic analogue is the product with and for , that is, each point is used at most once. Only partitions with all labels equal to contribute, and is then the unordered configuration space
of distinct points of . So
On , is the space of monic squarefree polynomials of degree , the complement in of the discriminant hypersurface. Squarefree words have become squarefree polynomials.
We evaluated the product for words using . The motivic version of this identity has a geometric meaning. Every multiplicity can be written in exactly one way as with . So every effective zero-cycle can be written in exactly one way as , with squarefree and effective. The map
is therefore a bijection on points, and in characteristic zero this gives . In terms of generating functions, this is a result of Vakil and Wood:
The same argument with , , shows that the zero-cycles with all multiplicities less than have generating function .
The affine line. Here , so
This is the formula for squarefree words, with replaced by . Over it says that there are monic squarefree polynomials of degree . Over it can be compared with topology. Arnold showed that for , the rational cohomology of is in degree 0 and in degree 1, the latter spanned by the class of of the discriminant, which has Hodge type . By Poincaré duality, the compactly supported cohomology is one class of type in degree and one of type in degree . The Hodge–Deligne polynomial is therefore , which is .
The elliptic curve. Expanding gives
The second agrees with the direct computation above. In the third, the product appears, coming from the zero-cycles in . Over , applying gives , which is for . So for every , as the formulas confirm.
How often is a zero-cycle squarefree?
For words, the squarefree ones made up a fraction of the words of each length , and for integers the fraction is . Motivically, , so after inverting the squarefree polynomials make up a fraction of all monic polynomials of degree .
The Euler product suggests what to expect for a variety of dimension . Dividing by leaves . The symmetric powers grow like , which suggests evaluating at . Then each point contributes a factor , the “probability” that it does not occur twice, independently of the other points, and the product of these factors is . This is the analogue of .
Vakil and Wood proved that this heuristic is correct. If is rational of dimension , then the classes are invertible in a suitable completion of , and in that completion
For , , so the limit is , as computed above. More generally, the fraction of zero-cycles with all multiplicities less than tends to , the analogue of the density of -th-power-free integers.
Updated