meow-thematics
index
┌─[ cynthia :: meow-thematics]
└─[ ~notesmotivic-euler-product] >
Type help for commands. Enter runs the command. Tab completes commands and paths. Shift+Tab or Escape leaves the input. Press colon anywhere outside a text field to focus this command line; s opens site search.

Tab complete · Esc leave

motivic-euler-product

A short introduction to motivic Euler products for my own need

  • mathematics
  • counting

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 qq letters, ordered a<b<⋯a < b < \cdots, and compare words lexicographically, with a proper prefix counting as smaller (so a<aba < ab). There are qnq^n words of length nn, so

∑n≥0qntn=11−qt.\sum_{n \ge 0} q^n t^n = \frac{1}{1 - qt}.

A rotation of a word w=uvw = uv, with uu and vv nonempty, is the word vuvu. A Lyndon word is a nonempty word that is strictly smaller than all of its rotations. With the alphabet {a,b}\{a, b\}:

  • aabaab is a Lyndon word, because its rotations abaaba and baabaa are both larger.
  • abaaba is not, because its rotation aabaab is smaller.
  • abababab is not, because rotating it by two letters gives abababab back. In general a Lyndon word is never a power of a shorter word.

The shortest Lyndon words on two letters are:

lengthLyndon wordscount
1aa, bb2
2abab1
3aabaab, abbabb2
4aaabaaab, aabbaabb, abbbabbb3

Lyndon words behave like prime numbers.

Theorem (Chen–Fox–Lyndon). Every word ww can be written in exactly one way as

w=ℓ1ℓ2⋯ℓk,ℓ1≥ℓ2≥⋯≥ℓk,w = \ell_1 \ell_2 \cdots \ell_k, \qquad \ell_1 \ge \ell_2 \ge \cdots \ge \ell_k,

where each ℓi\ell_i is a Lyndon word.

A proof is in Chapter 5 of Lothaire’s Combinatorics on Words. To find the factorization by hand, note that ℓ1\ell_1 is the longest prefix of ww that is a Lyndon word. Take it off and repeat on what remains. For example,

aba=ab⋅a,bab=b⋅ab,baab=b⋅aab,abab=ab⋅ab,bba=b⋅b⋅a.aba = ab \cdot a, \qquad bab = b \cdot ab, \qquad baab = b \cdot aab, \qquad abab = ab \cdot ab, \qquad bba = b \cdot b \cdot a.

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 ∑nn−s=∏p(1−p−s)−1\sum_n n^{-s} = \prod_p (1 - p^{-s})^{-1}. Unique factorization of words gives, in the same way,

11−qt=∏ℓ Lyndon11−t∣ℓ∣=∏ℓ Lyndon(1+t∣ℓ∣+t2∣ℓ∣+⋯ ),\frac{1}{1 - qt} = \prod_{\ell \text{ Lyndon}} \frac{1}{1 - t^{|\ell|}} = \prod_{\ell \text{ Lyndon}} \left(1 + t^{|\ell|} + t^{2|\ell|} + \cdots\right),

where ∣ℓ∣|\ell| is the length of ℓ\ell. The number of letters qq 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 tmℓ∣ℓ∣t^{m_\ell |\ell|} from each factor, with only finitely many of the exponents mℓm_\ell nonzero, and multiplying the choices together. A choice is a finite multiset of Lyndon words, in which ℓ\ell occurs mℓm_\ell times. It contributes tnt^n when the total length ∑ℓmℓ∣ℓ∣\sum_\ell m_\ell |\ell| equals nn. There are only finitely many Lyndon words of length at most nn, so only finitely many factors can contribute to tnt^n, and every coefficient is a finite count. By the theorem, the choices contributing tnt^n are exactly the words of length nn, so the coefficient is qnq^n.

Here is the check for q=2q = 2 and n=3n = 3, listing every way to choose Lyndon words of total length 3:

shapechoicescount
one of length 3aabaab, abbabb2
one of length 2, one of length 1{ab,a}\{ab, a\}, {ab,b}\{ab, b\}2
three of length 1{a,a,a}\{a,a,a\}, {a,a,b}\{a,a,b\}, {a,b,b}\{a,b,b\}, {b,b,b}\{b,b,b\}4

The total is 2+2+4=8=232 + 2 + 4 = 8 = 2^3.

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 M(d)M(d) for length dd. Grouping the factors by length gives

11−qt=∏d≥1(11−td)M(d).\frac{1}{1 - qt} = \prod_{d \ge 1} \left( \frac{1}{1 - t^d} \right)^{M(d)}.

Take logarithms and use −log⁡(1−x)=∑k≥1xk/k-\log(1 - x) = \sum_{k \ge 1} x^k / k:

∑n≥1qnn tn=∑d≥1M(d)∑k≥1tdkk.\sum_{n \ge 1} \frac{q^n}{n}\, t^n = \sum_{d \ge 1} M(d) \sum_{k \ge 1} \frac{t^{dk}}{k}.

Comparing the coefficients of tnt^n gives qn=∑d∣nd M(d)q^n = \sum_{d \mid n} d\, M(d). Möbius inversion then gives

M(n)=1n∑d∣nμ(d) qn/d.M(n) = \frac{1}{n} \sum_{d \mid n} \mu(d)\, q^{n/d}.

For q=2q = 2 this gives 2,1,2,3,6,9,…2, 1, 2, 3, 6, 9, \dots, which agrees with the table. When qq is a prime power, the same M(n)M(n) is also the number of monic irreducible polynomials of degree nn over Fq\mathbb{F}_q. 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 ℓ1>ℓ2>⋯>ℓk\ell_1 > \ell_2 > \cdots > \ell_k 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 uuuu.) Let sns_n be the number of squarefree words of length nn.

Each Lyndon word is now used either zero times or once, so each factor of the Euler product shrinks to two terms:

∑n≥0sntn=∏ℓ Lyndon(1+t∣ℓ∣).\sum_{n \ge 0} s_n t^n = \prod_{\ell \text{ Lyndon}} \left(1 + t^{|\ell|}\right).

To evaluate this, write 1+x=1−x21−x1 + x = \dfrac{1 - x^2}{1 - x}. The denominators multiply to the Euler product. The numerators multiply to the reciprocal of the Euler product with tt replaced by t2t^2. So

∏ℓ Lyndon(1+t∣ℓ∣)=∏ℓ Lyndon1−t2∣ℓ∣1−t∣ℓ∣=1−qt21−qt,\prod_{\ell \text{ Lyndon}} \left(1 + t^{|\ell|}\right) = \prod_{\ell \text{ Lyndon}} \frac{1 - t^{2|\ell|}}{1 - t^{|\ell|}} = \frac{1 - qt^2}{1 - qt},

and therefore sn=qn−qn−1s_n = q^n - q^{n-1} for n≥2n \ge 2. For q=2q = 2 this predicts 22 squarefree words of length 2, and 44 of length 3. The first is easy: of aaaa, abab, baba, bbbb, the words aa=a⋅aaa = a \cdot a and bb=b⋅bbb = b \cdot b repeat a factor. Which four of the eight words of length 3 are squarefree?

Squarefree integers make up a fraction 1/ζ(2)=6/π21/\zeta(2) = 6/\pi^2 of all integers. Here the squarefree words make up exactly a fraction 1−1/q1 - 1/q of the words of each length n≥2n \ge 2. 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 tnt^n is the size of a finite set: the words of length nn, or the squarefree words of length nn. 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, XX is a scheme of finite type over Fq\mathbb{F}_q, for instance a variety. Symmetric powers will need more, and we will say so when they appear. The letter qq is reused on purpose: Fq\mathbb{F}_q has qq elements, and it will soon serve as an alphabet.

Counting points over finite fields

Write Nm=#X(Fqm)N_m = \# X(\mathbb{F}_{q^m}) for the number of points of XX with coordinates in Fqm\mathbb{F}_{q^m}. The zeta function of XX is

ZX(t)=exp⁡(∑m≥1Nmm tm).Z_X(t) = \exp\left( \sum_{m \ge 1} \frac{N_m}{m}\, t^m \right).

The simplest example is the affine line. Here A1(Fqm)=Fqm\mathbb{A}^1(\mathbb{F}_{q^m}) = \mathbb{F}_{q^m}, so Nm=qmN_m = q^m and

ZA1(t)=exp⁡(∑m≥1qmm tm)=11−qt.Z_{\mathbb{A}^1}(t) = \exp\left( \sum_{m \ge 1} \frac{q^m}{m}\, t^m \right) = \frac{1}{1 - qt}.

This is the left-hand side of the Lyndon word identity. Similarly, P1\mathbb{P}^1 has qm+1q^m + 1 points over Fqm\mathbb{F}_{q^m}, and ZP1(t)=1(1−t)(1−qt)Z_{\mathbb{P}^1}(t) = \dfrac{1}{(1 - t)(1 - qt)}.

As defined, ZXZ_X has nothing to do with products, and the exponential and the factor 1/m1/m look like tricks to make the examples come out nicely. The real reason for them is that ZXZ_X is an Euler product, whose primes are the closed points of XX.

Closed points are primes

A closed point xx of XX has a residue field κ(x)\kappa(x), which is a finite extension of Fq\mathbb{F}_q. The degree of xx is deg⁡x=[κ(x):Fq]\deg x = [\kappa(x) : \mathbb{F}_q]. For example, the closed points of A1\mathbb{A}^1 are the monic irreducible polynomials P∈Fq[T]P \in \mathbb{F}_q[T], and the degree of the point is the degree of PP.

Geometrically, a closed point of degree dd is an orbit of size dd of the Frobenius acting on X(F‾q)X(\overline{\mathbb{F}}_q). For instance, if qq is odd and a∈Fqa \in \mathbb{F}_q is not a square, the closed point T2−aT^2 - a of A1\mathbb{A}^1 is the pair of conjugate points ±a\pm\sqrt{a}.

Closed points determine the point counts. A point of XX over Fqm\mathbb{F}_{q^m} is the same as a closed point xx together with an embedding of fields κ(x)↪Fqm\kappa(x) \hookrightarrow \mathbb{F}_{q^m}. Such an embedding exists exactly when deg⁡x\deg x divides mm, and then there are deg⁡x\deg x of them. So if ada_d is the number of closed points of degree dd,

Nm=∑d∣md ad.N_m = \sum_{d \mid m} d\, a_d.

This is the same relation as qn=∑d∣nd M(d)q^n = \sum_{d \mid n} d\, M(d) for Lyndon words, and the same computation, read backwards, turns it into a product:

log⁡∏x closed11−tdeg⁡x=∑d≥1ad∑k≥1tdkk=∑m≥1(∑d∣md ad)tmm=∑m≥1Nmm tm.\log \prod_{x \text{ closed}} \frac{1}{1 - t^{\deg x}} = \sum_{d \ge 1} a_d \sum_{k \ge 1} \frac{t^{dk}}{k} = \sum_{m \ge 1} \Bigl( \sum_{d \mid m} d\, a_d \Bigr) \frac{t^m}{m} = \sum_{m \ge 1} \frac{N_m}{m}\, t^m.

In other words,

ZX(t)=∏x closed11−tdeg⁡x.Z_X(t) = \prod_{x \text{ closed}} \frac{1}{1 - t^{\deg x}}.

There are finitely many closed points of each degree (since ad≤Nda_d \le N_d), so as before each coefficient involves only finitely many factors. The exponential and the 1/m1/m in the definition are exactly what converts point counts into this product.

The affine line, again

The closed points of A1\mathbb{A}^1 are the monic irreducible polynomials, so its Euler product is unique factorization in Fq[T]\mathbb{F}_q[T]:

11−qt=∏P monic irreducible11−tdeg⁡P.\frac{1}{1 - qt} = \prod_{P \text{ monic irreducible}} \frac{1}{1 - t^{\deg P}}.

The left-hand side is the same as in the Lyndon word identity. Group the factors by degree. The exponent of 1/(1−td)1/(1 - t^d) is then the number of primes of size dd, and the left-hand side determines these exponents one degree at a time. So there are exactly M(d)M(d) monic irreducible polynomials of degree dd over Fq\mathbb{F}_q. 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, ∞\infty, of degree 1, and so one more factor: ZP1(t)=11−t⋅ZA1(t)Z_{\mathbb{P}^1}(t) = \frac{1}{1 - t} \cdot Z_{\mathbb{A}^1}(t).

For a less innocent check, let XX be the affine line with a doubled origin. It is not separated, but the argument above never used separatedness. Counting directly, Nm=qm+1N_m = q^m + 1: there are qm−1q^m - 1 nonzero points and two origins. Using the product, XX has the closed points of A1\mathbb{A}^1 plus one extra origin of degree 1. Either way, ZX=ZP1Z_X = Z_{\mathbb{P}^1}.

The Euler product only sees closed points and their degrees, not how they are glued. To it, P1\mathbb{P}^1, the doubled line and A1⊔Spec⁡Fq\mathbb{A}^1 \sqcup \operatorname{Spec} \mathbb{F}_q all look the same: A1\mathbb{A}^1 plus one rational point. In general, if XX is the union of a closed subscheme YY and its open complement UU, then ZX=ZY⋅ZUZ_X = Z_Y \cdot Z_U. This property will matter later.

Zero-cycles and symmetric powers

What does the Euler product of a general XX count? Expanding it means choosing an exponent mx≥0m_x \ge 0 for each closed point xx, with only finitely many nonzero. Such a choice is an effective zero-cycle

D=∑xmx [x],deg⁡D=∑xmxdeg⁡x,D = \sum_x m_x\, [x], \qquad \deg D = \sum_x m_x \deg x,

as in intersection theory. So

ZX(t)=∑n≥0#{effective zero-cycles of degree n on X} tn.Z_X(t) = \sum_{n \ge 0} \#\{\text{effective zero-cycles of degree } n \text{ on } X\}\, t^n.

On A1\mathbb{A}^1, an effective zero-cycle is the same as a monic polynomial: ∑PmP [P]\sum_P m_P\, [P] corresponds to ∏PPmP\prod_P P^{m_P}.

Effective zero-cycles of degree nn are the points of a variety. Here we need XX to be quasi-projective, so that the quotient

Sym⁡nX=Xn/Sn\operatorname{Sym}^n X = X^n / S_n

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 nn-tuples of points of XX. Over Fq\mathbb{F}_q, its Fq\mathbb{F}_q-points are the unordered nn-tuples of points of X(F‾q)X(\overline{\mathbb{F}}_q) that the Frobenius maps to themselves, and these are exactly the effective zero-cycles of degree nn on XX. Therefore

ZX(t)=∑n≥0#(Sym⁡nX)(Fq) tn.Z_X(t) = \sum_{n \ge 0} \# (\operatorname{Sym}^n X)(\mathbb{F}_q)\, t^n.

For A1\mathbb{A}^1, sending an unordered nn-tuple of roots to the coefficients of the monic polynomial with those roots gives Sym⁡nA1≅An\operatorname{Sym}^n \mathbb{A}^1 \cong \mathbb{A}^n, by the fundamental theorem of symmetric polynomials. So the coefficient is qnq^n, as it should be.

An Fq\mathbb{F}_q-point of Sym⁡nX\operatorname{Sym}^n X is not the same as an unordered nn-tuple of Fq\mathbb{F}_q-points of XX. Take X=A1X = \mathbb{A}^1 and n=2n = 2. The variety Sym⁡2A1≅A2\operatorname{Sym}^2 \mathbb{A}^1 \cong \mathbb{A}^2 has q2q^2 points over Fq\mathbb{F}_q. But there are only q(q+1)/2q(q+1)/2 unordered pairs of elements of Fq\mathbb{F}_q. The remaining (q2−q)/2(q^2 - q)/2 points are the pairs {α,αq}\{\alpha, \alpha^q\} with α∈Fq2∖Fq\alpha \in \mathbb{F}_{q^2} \setminus \mathbb{F}_q. Neither point of such a pair is defined over Fq\mathbb{F}_q, but the pair is. These pairs are the closed points of degree 2, and there are M(2)=(q2−q)/2M(2) = (q^2 - q)/2 of them. In the Euler product, each one is a single prime contributing t2t^2.

Where this leaves us

Here is the dictionary so far:

wordsA1\mathbb{A}^1 over Fq\mathbb{F}_qXX over Fq\mathbb{F}_q
primesLyndon wordsmonic irreducible polynomialsclosed points
size of a primelengthdegreedegree
objectswordsmonic polynomialseffective zero-cycles
objects of size nnqnq^nqnq^n#(Sym⁡nX)(Fq)\#(\operatorname{Sym}^n X)(\mathbb{F}_q)

The last entry is new. The coefficient of tnt^n is still a count, but what is being counted is now the set of Fq\mathbb{F}_q-points of a variety, Sym⁡nX\operatorname{Sym}^n X.

Now replace Fq\mathbb{F}_q by C\mathbb{C}, or by F‾p\overline{\mathbb{F}}_p. Every closed point now has degree 1, and there are infinitely many of them, so #X(C)\#X(\mathbb{C}) and #(Sym⁡nX)(C)\#(\operatorname{Sym}^n X)(\mathbb{C}) are infinite. Taking the number of points is no longer a legal move. The varieties Sym⁡nX\operatorname{Sym}^n X 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 C\mathbb{C} 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 P1\mathbb{P}^1. 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 kk. We want to attach to each variety XX over kk a class [X][X] that remembers more than a number, but obeys the one rule from the previous section.

The definition

The Grothendieck ring of varieties K0(Vark)K_0(\mathrm{Var}_k) is the abelian group generated by symbols [X][X], one for each isomorphism class of schemes XX of finite type over kk, subject to the relations

[X]=[Y]+[X∖Y]for every closed subscheme Y⊆X.[X] = [Y] + [X \setminus Y] \qquad \text{for every closed subscheme } Y \subseteq X.

The product [X]⋅[X′]=[X×kX′][X] \cdot [X'] = [X \times_k X'] makes it a commutative ring, with unit 1=[Spec⁡k]1 = [\operatorname{Spec} k]. The class of the affine line gets its own name:

L=[A1].\mathbb{L} = [\mathbb{A}^1].

Two remarks on the definition. Taking Y=XredY = X_{\mathrm{red}} shows [X]=[Xred][X] = [X_{\mathrm{red}}], 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.

  • [An]=Ln[\mathbb{A}^n] = \mathbb{L}^n, since An=A1×⋯×A1\mathbb{A}^n = \mathbb{A}^1 \times \cdots \times \mathbb{A}^1.
  • [Gm]=L−1[\mathbb{G}_m] = \mathbb{L} - 1, since Gm\mathbb{G}_m is A1\mathbb{A}^1 with a point removed.
  • [P1]=L+1[\mathbb{P}^1] = \mathbb{L} + 1, since P1\mathbb{P}^1 is A1\mathbb{A}^1 plus the point ∞\infty. More generally, Pn=An⊔Pn−1\mathbb{P}^n = \mathbb{A}^n \sqcup \mathbb{P}^{n-1} gives [Pn]=1+L+⋯+Ln[\mathbb{P}^n] = 1 + \mathbb{L} + \cdots + \mathbb{L}^n.
  • The doubled line is one copy of A1\mathbb{A}^1, which is open, together with the other origin, which is a closed point. So its class is L+1=[P1]\mathbb{L} + 1 = [\mathbb{P}^1].

The last line is the identity the zeta function already suggested, now holding before any counting.

Every class above is a polynomial in L\mathbb{L} 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 OO. For the rest of this subsection, k=Ck = \mathbb{C} and EE is an elliptic curve, for instance the closure in P2\mathbb{P}^2 of y2=x3−xy^2 = x^3 - x, with OO its point at infinity.

We can still cut. Removing OO leaves the affine curve E0E_0 given by y2=x3−xy^2 = x^3 - x, so [E]=[E0]+1[E] = [E_0] + 1. But nothing more comes out. No open piece of EE is isomorphic to an open piece of A1\mathbb{A}^1, since EE and P1\mathbb{P}^1 would then be birational. This is not yet a proof that [E][E] is new. Two classes can agree in K0(Vark)K_0(\mathrm{Var}_k) 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 [E][E] apart from everything built out of L\mathbb{L}.

Over C\mathbb{C}, one such invariant is the Hodge–Deligne polynomial, a ring homomorphism e:K0(VarC)→Z[u,v]e : K_0(\mathrm{Var}_{\mathbb{C}}) \to \mathbb{Z}[u, v] 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:

e(L)=uv,e([E])=1−u−v+uv=(1−u)(1−v).e(\mathbb{L}) = uv, \qquad e([E]) = 1 - u - v + uv = (1 - u)(1 - v).

The four terms of e([E])e([E]) are the four pieces of the cohomology of EE: 11 for H0H^0, −u-u and −v-v for the two halves H1,0H^{1,0} and H0,1H^{0,1} of H1H^1, and uvuv for H2H^2.

Now suppose [E]=f(L)[E] = f(\mathbb{L}), where f(L)f(\mathbb{L}) is any expression built from L\mathbb{L} alone. It could be a polynomial. In a ring where L\mathbb{L} is inverted and infinite series in L−1\mathbb{L}^{-1} converge, it could also be a quotient of polynomials, or a transcendental series such as ∑n≥0L−n2\sum_{n \ge 0} \mathbb{L}^{-n^2}. Whatever ff is, as long as ee can be applied to it, ee turns it into f(uv)f(uv), an expression in the product uvuv alone. The substitution

u↦−u,v↦−vu \mapsto -u, \qquad v \mapsto -v

leaves uvuv unchanged, so it leaves f(uv)f(uv) unchanged too. It does not leave e([E])e([E]) unchanged: it sends 1−u−v+uv1 - u - v + uv to 1+u+v+uv1 + u + v + uv. So e([E])≠e(f(L))e([E]) \ne e(f(\mathbb{L})), and therefore [E]≠f(L)[E] \ne f(\mathbb{L}).

The argument never asked what ff is. It used only that f(L)f(\mathbb{L}) depends on L\mathbb{L} alone, and that e(L)=uve(\mathbb{L}) = uv cannot see the sign change. The sign change flips the terms of odd total degree in uu and vv, which for a smooth projective variety come from cohomology in odd degree. Affine spaces have no odd cohomology, so nothing built from L\mathbb{L} has any, while H1(E)H^1(E) is two-dimensional. The same argument works for every curve of genus g≥1g \ge 1, whose Hodge–Deligne polynomial is 1−gu−gv+uv1 - gu - gv + uv. So K0(VarC)K_0(\mathrm{Var}_{\mathbb{C}}) is much larger than the polynomials in L\mathbb{L}, 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 k=Fqk = \mathbb{F}_q, a closed subscheme and its open complement split the Fq\mathbb{F}_q-points of XX 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

#:K0(VarFq)→Z,[X]↦#X(Fq),L↦q.\# : K_0(\mathrm{Var}_{\mathbb{F}_q}) \to \mathbb{Z}, \qquad [X] \mapsto \#X(\mathbb{F}_q), \qquad \mathbb{L} \mapsto q.

The same holds over Fqm\mathbb{F}_{q^m} for every mm, so the zeta function ZXZ_X only depends on [X][X]. This is why it could not tell P1\mathbb{P}^1 from the doubled line.

A single count cannot see what made the elliptic curve new. An elliptic curve EE over Fq\mathbb{F}_q has q+1−aq + 1 - a points for some integer aa, and that is just a number. The counts over all Fqm\mathbb{F}_{q^m} together do see it. By Weil’s theorem for curves,

#E(Fqm)=qm+1−αm−βm,\#E(\mathbb{F}_{q^m}) = q^m + 1 - \alpha^m - \beta^m,

where α\alpha and β\beta are complex numbers with α+β=a\alpha + \beta = a, αβ=q\alpha \beta = q and ∣α∣=∣β∣=q|\alpha| = |\beta| = \sqrt{q}. Compare this with e([E])=1−u−v+uve([E]) = 1 - u - v + uv. The term qm=(αβ)mq^m = (\alpha\beta)^m is the image of L\mathbb{L}, like uvuv, while αm+βm\alpha^m + \beta^m plays the role of u+vu + v. It is not constant in mm, and its size is at most 2qm/22q^{m/2}, half a power of qmq^m. A polynomial in qmq^m with integer coefficients is either constant or grows at least as fast as qmq^m, so this term cannot come from a polynomial in L\mathbb{L}. That is the point-counting shadow of the sign argument above, and α\alpha and β\beta are the shadows of uu and vv.

Over C\mathbb{C} there are other invariants with the same two properties. The Euler characteristic with compact support gives χc:K0(VarC)→Z\chi_c : K_0(\mathrm{Var}_{\mathbb{C}}) \to \mathbb{Z} with L↦1\mathbb{L} \mapsto 1. It sends an elliptic curve to 00, the same as the empty variety, so on its own it cannot see EE at all. The Hodge–Deligne polynomial from the previous subsection gives e:K0(VarC)→Z[u,v]e : K_0(\mathrm{Var}_{\mathbb{C}}) \to \mathbb{Z}[u, v] with L↦uv\mathbb{L} \mapsto uv, and setting u=v=1u = v = 1 recovers χc\chi_c. In each case, [X][X] is the more refined object and the invariant is a compression of it. In fact K0(Vark)K_0(\mathrm{Var}_k) 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 K0(Vark)K_0(\mathrm{Var}_k) are called motivic.

Kapranov’s zeta function

We can now do what the previous section asked for. Let XX be quasi-projective over kk. Instead of counting the points of Sym⁡nX\operatorname{Sym}^n X, keep its class. Kapranov’s motivic zeta function is

ZXmot(t)=∑n≥0[Sym⁡nX] tn∈K0(Vark)[[t]].Z^{\mathrm{mot}}_X(t) = \sum_{n \ge 0} [\operatorname{Sym}^n X]\, t^n \in K_0(\mathrm{Var}_k)[[t]].

Over Fq\mathbb{F}_q, applying #\# to each coefficient recovers ZX(t)Z_X(t). For the affine line, Sym⁡nA1≅An\operatorname{Sym}^n \mathbb{A}^1 \cong \mathbb{A}^n, so

ZA1mot(t)=∑n≥0Lntn=11−Lt,Z^{\mathrm{mot}}_{\mathbb{A}^1}(t) = \sum_{n \ge 0} \mathbb{L}^n t^n = \frac{1}{1 - \mathbb{L} t},

which specializes to 1/(1−qt)1/(1 - qt) when L↦q\mathbb{L} \mapsto q.

For an elliptic curve EE over kk, the answer involves more than L\mathbb{L}. Let n≥1n \ge 1, and send an effective zero-cycle DD of degree nn to the sum of its points in the group law of EE. By Abel’s theorem, two such cycles have the same sum exactly when they are linearly equivalent. So the fibre over a point pp is the set of effective divisors linearly equivalent to (n−1)O+p(n - 1)O + p, which is the projective space of lines in an nn-dimensional space of sections, by Riemann–Roch. This makes Sym⁡nE\operatorname{Sym}^n E a Pn−1\mathbb{P}^{n-1}-bundle over EE. It is the projectivization of a vector bundle, so it is a product over each piece of a suitable cutting of EE, and its class is [E] [Pn−1][E]\,[\mathbb{P}^{n-1}]. Using ∑n≥1[Pn−1] tn=t/((1−t)(1−Lt))\sum_{n \ge 1} [\mathbb{P}^{n-1}]\, t^n = t / \bigl((1 - t)(1 - \mathbb{L}t)\bigr),

ZEmot(t)=1+[E] t(1−t)(1−Lt)=1+([E]−1−L)t+Lt2(1−t)(1−Lt).Z^{\mathrm{mot}}_E(t) = 1 + \frac{[E]\, t}{(1 - t)(1 - \mathbb{L} t)} = \frac{1 + \bigl([E] - 1 - \mathbb{L}\bigr) t + \mathbb{L} t^2}{(1 - t)(1 - \mathbb{L} t)}.

The denominator is ZP1mot(t)Z^{\mathrm{mot}}_{\mathbb{P}^1}(t). The numerator is where EE differs from P1\mathbb{P}^1, and its middle coefficient [E]−1−L[E] - 1 - \mathbb{L} is exactly the part of [E][E] that, as we saw, cannot be written in terms of L\mathbb{L}. Over Fq\mathbb{F}_q, counting sends it to −a-a, and the numerator becomes 1−at+qt2=(1−αt)(1−βt)1 - at + qt^2 = (1 - \alpha t)(1 - \beta t). This recovers the classical zeta function of EE:

ZE(t)=(1−αt)(1−βt)(1−t)(1−qt).Z_E(t) = \frac{(1 - \alpha t)(1 - \beta t)}{(1 - t)(1 - qt)}.

Over C\mathbb{C}, the Hodge–Deligne polynomial sends it to −u−v-u - v, and the numerator becomes (1−ut)(1−vt)(1 - ut)(1 - vt). In both cases the numerator is the one factor that L\mathbb{L} could not have produced.

Over C\mathbb{C}, applying χc\chi_c instead gives Macdonald’s formula from 1962:

∑n≥0χc(Sym⁡nX) tn=1(1−t)χc(X).\sum_{n \ge 0} \chi_c(\operatorname{Sym}^n X)\, t^n = \frac{1}{(1 - t)^{\chi_c(X)}}.

Read it as an Euler product. Every point of X(C)X(\mathbb{C}) has degree 1 and contributes a factor 1/(1−t)1/(1 - t). There are infinitely many points, but the formula behaves as if there were χc(X)\chi_c(X) of them. Over C\mathbb{C}, “the number of points” has not disappeared. It has become the Euler characteristic.

For an elliptic curve, χc(E)=0\chi_c(E) = 0, so Macdonald’s formula predicts 11. Applying χc\chi_c to Kapranov’s formula, with [E]↦0[E] \mapsto 0 and L↦1\mathbb{L} \mapsto 1, gives (1−2t+t2)/(1−t)2=1(1 - 2t + t^2)/(1 - t)^2 = 1, as it should. It also shows how much χc\chi_c forgets: the numerator (1−ut)(1−vt)(1 - ut)(1 - vt) and the denominator (1−t)(1−uvt)(1 - t)(1 - uvt) become equal at u=v=1u = v = 1, and cancel.

When is Kapranov’s zeta function rational?

Over Fq\mathbb{F}_q, the zeta function of every XX is a rational function of tt. This is the first of the Weil conjectures, proved by Dwork in 1960. The elliptic curve shows that sometimes rationality holds before any counting: ZEmot(t)Z^{\mathrm{mot}}_E(t) is a quotient of two polynomials in tt with coefficients in K0(Vark)K_0(\mathrm{Var}_k).

The same argument works for every smooth projective curve CC of genus gg with a rational point, as Kapranov observed. Sending a zero-cycle of degree nn to its class in Pic⁡nC\operatorname{Pic}^n C, which is isomorphic to the Jacobian JJ of CC, makes Sym⁡nC\operatorname{Sym}^n C a Pn−g\mathbb{P}^{n-g}-bundle over JJ once n≥2g−1n \ge 2g - 1, by Riemann–Roch. So [Sym⁡nC]=[J] [Pn−g][\operatorname{Sym}^n C] = [J]\,[\mathbb{P}^{n-g}] for all but finitely many nn, and ZCmot(t)Z^{\mathrm{mot}}_C(t) is a polynomial of degree at most 2g2g in tt, divided by (1−t)(1−Lt)(1 - t)(1 - \mathbb{L}t).

Two operations preserve rationality. First, if Y⊆XY \subseteq X is closed with open complement UU, cutting Sym⁡nX\operatorname{Sym}^n X according to how many of the nn points lie in YY gives [Sym⁡nX]=∑i+j=n[Sym⁡iY] [Sym⁡jU][\operatorname{Sym}^n X] = \sum_{i + j = n} [\operatorname{Sym}^i Y]\,[\operatorname{Sym}^j U], that is,

ZXmot(t)=ZYmot(t)⋅ZUmot(t).Z^{\mathrm{mot}}_X(t) = Z^{\mathrm{mot}}_Y(t) \cdot Z^{\mathrm{mot}}_U(t).

This is the motivic version of the property ZX=ZY⋅ZUZ_X = Z_Y \cdot Z_U from the previous section. It means that ZmotZ^{\mathrm{mot}} turns sums of classes into products of series, so the classes with a rational zeta function form a subgroup of K0(Vark)K_0(\mathrm{Var}_k). Second, a lemma of Totaro gives [Sym⁡n(X×Am)]=Lmn[Sym⁡nX][\operatorname{Sym}^n(X \times \mathbb{A}^m)] = \mathbb{L}^{mn} [\operatorname{Sym}^n X], so ZX×Ammot(t)=ZXmot(Lmt)Z^{\mathrm{mot}}_{X \times \mathbb{A}^m}(t) = Z^{\mathrm{mot}}_X(\mathbb{L}^m t). Together, these show that every combination of classes [C] Lm[C]\,\mathbb{L}^m, with CC a curve with a rational point, has a rational zeta function.

Kapranov asked whether ZXmotZ^{\mathrm{mot}}_X is rational for every XX. It is not. Larsen and Lunts proved in 2004 that for a smooth projective complex surface XX,

ZXmot(t) is rational  ⟺  κ(X)=−∞,Z^{\mathrm{mot}}_X(t) \text{ is rational} \iff \kappa(X) = -\infty,

where κ\kappa is the Kodaira dimension. One direction follows from what we have. A surface with κ=−∞\kappa = -\infty is obtained by blowing up points, starting from P2\mathbb{P}^2 or from a P1\mathbb{P}^1-bundle over a curve CC. Blowing up a point replaces it by a P1\mathbb{P}^1 and adds L\mathbb{L} to the class, so [X][X] is either 1+L+L2+mL1 + \mathbb{L} + \mathbb{L}^2 + m\mathbb{L} or [C](1+L)+mL[C](1 + \mathbb{L}) + m\mathbb{L}, 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 Fq\mathbb{F}_q turns every ZXmotZ^{\mathrm{mot}}_X into a rational function, by Dwork. So does the Hodge–Deligne polynomial: if e([X])=∑p,qep,q upvqe([X]) = \sum_{p, q} e_{p,q}\, u^p v^q, then a Hodge-theoretic version of Macdonald’s formula gives

∑n≥0e([Sym⁡nX]) tn=∏p,q(1−upvqt)−ep,q.\sum_{n \ge 0} e([\operatorname{Sym}^n X])\, t^n = \prod_{p, q} \left(1 - u^p v^q t\right)^{-e_{p,q}}.

For the elliptic curve this is (1−ut)(1−vt)/((1−t)(1−uvt))(1 - ut)(1 - vt)/\bigl((1 - t)(1 - uvt)\bigr), as we found by hand. To see irrationality, Larsen and Lunts construct new ring homomorphisms from K0(VarC)K_0(\mathrm{Var}_{\mathbb{C}}) to fields. These send L\mathbb{L} to 00 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 E×EE \times E is an abelian surface, with κ=0\kappa = 0, so ZE×EmotZ^{\mathrm{mot}}_{E \times E} is not rational, although ZEmotZ^{\mathrm{mot}}_E is. The classes with a rational zeta function form a subgroup of K0(VarC)K_0(\mathrm{Var}_{\mathbb{C}}) that contains [E][E] but not [E]2[E]^2. 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 XX is smooth, projective, of dimension at least 2 over C\mathbb{C}, and ZXmotZ^{\mathrm{mot}}_X is rational, then κ(X)=−∞\kappa(X) = -\infty and XX has no nonzero holomorphic forms of even degree. These conditions are not sufficient. If YY is a quintic threefold, then κ(Y)=0\kappa(Y) = 0, so ZYmotZ^{\mathrm{mot}}_Y is irrational, and its irrationality survives setting L=0\mathbb{L} = 0. The fourfold X=Y×P1X = Y \times \mathbb{P}^1 has κ(X)=−∞\kappa(X) = -\infty and no even-degree forms, but [X]=[Y]+L[Y][X] = [Y] + \mathbb{L}[Y], so ZXmot(t)=ZYmot(t) ZYmot(Lt)Z^{\mathrm{mot}}_X(t) = Z^{\mathrm{mot}}_Y(t)\, Z^{\mathrm{mot}}_Y(\mathbb{L}t), which agrees with ZYmot(t)Z^{\mathrm{mot}}_Y(t) modulo L\mathbb{L} and is irrational.
  • Inverting L\mathbb{L}. Because the homomorphisms of Larsen and Lunts send L\mathbb{L} to 00, they say nothing about rationality in K0(Vark)[L−1]K_0(\mathrm{Var}_k)[\mathbb{L}^{-1}], 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 Q\mathbb{Q} whose zeta function is irrational even after inverting L\mathbb{L}.
  • Motives. In characteristic zero, K0(Vark)K_0(\mathrm{Var}_k) 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 ZE×EmotZ^{\mathrm{mot}}_{E \times E} is rational. The irrationality lives in the part of K0(Vark)K_0(\mathrm{Var}_k) that motives forget.

For surfaces, these results combine into a clean statement: ZXmotZ^{\mathrm{mot}}_X is rational exactly when [X][X] is a combination of classes [C] Lm[C]\,\mathbb{L}^m. So here is the question this section leaves open. Is rationality of ZXmotZ^{\mathrm{mot}}_X always a sign that XX 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 ∏x1/(1−tdeg⁡x)\prod_x 1/(1 - t^{\deg x}), but only of its expanded form, the sum over nn. The product itself has no meaning yet, because K0(Vark)K_0(\mathrm{Var}_k) 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 1/(1−t)1/(1 - t). 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 kk algebraically closed, so that every closed point has degree 1 and degrees play no role. We also take kk of characteristic zero, which avoids a technical issue with bijective morphisms below.

Expanding a product over the points of a variety

Let XX be a quasi-projective variety, and let X=(Xi)i≥1\mathcal{X} = (X_i)_{i \ge 1} be a family of quasi-projective varieties with morphisms Xi→XX_i \to X. For a point x∈Xx \in X, write Xi,xX_{i,x} for the fibre of XiX_i over xx. We want to define

∏x∈X(1+X1,x t+X2,x t2+⋯ ),\prod_{x \in X} \left(1 + X_{1,x}\, t + X_{2,x}\, t^2 + \cdots\right),

where the coefficient of tit^i in the factor at xx is the class of Xi,xX_{i,x}. The coefficients may vary with xx. When they do not, that is, when Xi=X×YiX_i = X \times Y_i for varieties YiY_i, every factor is the same series 1+[Y1] t+[Y2] t2+⋯1 + [Y_1]\,t + [Y_2]\,t^2 + \cdots.

Expand the product as we did for Lyndon words, by choosing one term from each factor, with all but finitely many choices equal to 11. In degree 1, a choice is a point xx together with the term X1,x tX_{1,x}\,t. Taken together, these choices form X1X_1 itself, so the coefficient of tt is [X1][X_1]. In degree 2, there are two kinds of choice. Either two distinct points x≠yx \ne y each contribute a term of degree 1, or one point xx contributes X2,x t2X_{2,x}\,t^2. The choices of the second kind form X2X_2. The choices of the first kind form the variety of unordered pairs of points of X1X_1 lying over distinct points of XX. So the coefficient of t2t^2 should be

[(X1×X1)∗/S2]+[X2],\left[ (X_1 \times X_1)_* / S_2 \right] + [X_2],

where the subscript ∗* means the open subset where the two points have distinct images in XX.

In general, the choices contributing to tnt^n are sorted by a partition π\pi of nn. Write π=(ni)i≥1\pi = (n_i)_{i \ge 1}, where nin_i is the number of points that contribute their term of degree ii, so that n=∑ii nin = \sum_i i\, n_i. Bilu defines

Conf⁡π(X)=(∏i≥1Xini)∗/∏i≥1Sni,\operatorname{Conf}^\pi(\mathcal{X}) = \Bigl( \prod_{i \ge 1} X_i^{n_i} \Bigr)_* \Big/ \prod_{i \ge 1} S_{n_i},

where the subscript ∗* again means that the images of all ∑ini\sum_i n_i points in XX are pairwise distinct, and SniS_{n_i} permutes the nin_i factors equal to XiX_i. A point of Conf⁡π(X)\operatorname{Conf}^\pi(\mathcal{X}) is a finite set of distinct points of XX, with nin_i of them labelled ii, together with a point of Xi,xX_{i,x} for each xx labelled ii. That is exactly a choice of one term from each factor. Then

∏x∈X(1+X1,x t+X2,x t2+⋯ ):=1+∑n≥1∑π⊢n[Conf⁡π(X)]tn∈K0(Vark)[[t]].\prod_{x \in X} \left(1 + X_{1,x}\, t + X_{2,x}\, t^2 + \cdots\right) := 1 + \sum_{n \ge 1} \sum_{\pi \vdash n} \left[\operatorname{Conf}^\pi(\mathcal{X})\right] t^n \in K_0(\mathrm{Var}_k)[[t]].

This is the expansion of the Lyndon word product, with one difference. There, the choices contributing to tnt^n formed a finite set, and we kept its size. Here they form a variety, and we keep its class.

When every XiX_i is XX itself, the space Conf⁡π(X)\operatorname{Conf}^\pi(\mathcal{X}) is the space Conf⁡πX\operatorname{Conf}^\pi X of configurations of distinct points of XX, with nin_i of them labelled ii.

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 Y⊆XY \subseteq X is closed with complement UU, then the product over XX is the product over YY times the product over UU, which generalizes ZXmot=ZYmot⋅ZUmotZ^{\mathrm{mot}}_X = Z^{\mathrm{mot}}_Y \cdot Z^{\mathrm{mot}}_U.

First examples

Finitely many points. Let X={p,q}X = \{p, q\} be two points. The coefficient of t2t^2 has two parts. For π=(n1=2)\pi = (n_1 = 2), the pairs over distinct points of XX are the pairs over (p,q)(p, q) and over (q,p)(q, p), which S2S_2 identifies, giving X1,p×X1,qX_{1,p} \times X_{1,q}. For π=(n2=1)\pi = (n_2 = 1), we get X2=X2,p⊔X2,qX_2 = X_{2,p} \sqcup X_{2,q}. The coefficient is

[X1,p] [X1,q]+[X2,p]+[X2,q],[X_{1,p}]\,[X_{1,q}] + [X_{2,p}] + [X_{2,q}],

which is the coefficient of t2t^2 in the ordinary product of the two factors at pp and qq. In general, over a finite set of points the motivic Euler product is the ordinary product.

Kapranov’s zeta function. Take Xi=XX_i = X for every ii, so that every factor is 1+t+t2+⋯=1/(1−t)1 + t + t^2 + \cdots = 1/(1 - t). A point of Conf⁡πX\operatorname{Conf}^\pi X is a set of distinct points, nin_i of them labelled ii. Sending it to ∑ii⋅(points labelled i)\sum_i i \cdot (\text{points labelled } i) gives an effective zero-cycle of degree nn whose multiplicities are recorded by π\pi, and every effective zero-cycle arises from exactly one π\pi in exactly one way. So Sym⁡nX\operatorname{Sym}^n X is cut into locally closed pieces, one for each π\pi, and Conf⁡πX\operatorname{Conf}^\pi X maps bijectively onto its piece. In characteristic zero this is enough for the two to have the same class. Therefore ∑π⊢n[Conf⁡πX]=[Sym⁡nX]\sum_{\pi \vdash n} [\operatorname{Conf}^\pi X] = [\operatorname{Sym}^n X], and

∏x∈X11−t=ZXmot(t).\prod_{x \in X} \frac{1}{1 - t} = Z^{\mathrm{mot}}_X(t).

For X=A1X = \mathbb{A}^1 and n=2n = 2, the two pieces of Sym⁡2A1≅A2\operatorname{Sym}^2 \mathbb{A}^1 \cong \mathbb{A}^2 are the monic quadratics with distinct roots, Conf⁡(n1=2)A1\operatorname{Conf}^{(n_1 = 2)} \mathbb{A}^1, and those with a double root, Conf⁡(n2=1)A1≅A1\operatorname{Conf}^{(n_2 = 1)} \mathbb{A}^1 \cong \mathbb{A}^1. Their classes are L2−L\mathbb{L}^2 - \mathbb{L} and L\mathbb{L}.

The elliptic curve. Combining this with the earlier computation,

∏x∈E11−t=1+([E]−1−L)t+Lt2(1−t)(1−Lt).\prod_{x \in E} \frac{1}{1 - t} = \frac{1 + \bigl([E] - 1 - \mathbb{L}\bigr) t + \mathbb{L} t^2}{(1 - t)(1 - \mathbb{L} t)}.

The left side treats all points of EE alike. The group law, Abel’s theorem and Riemann–Roch only entered when we evaluated it. The coefficient of t2t^2 is a small check: Sym⁡2E\operatorname{Sym}^2 E is cut into Conf⁡2E\operatorname{Conf}^2 E, the pairs of distinct points, and the diagonal, a copy of EE. Since [Sym⁡2E]=[E](1+L)[\operatorname{Sym}^2 E] = [E](1 + \mathbb{L}), this gives [Conf⁡2E]=L [E][\operatorname{Conf}^2 E] = \mathbb{L}\,[E].

Constant coefficients. When Xi=X×YiX_i = X \times Y_i, the product is often written as a power,

∏x∈X(1+[Y1] t+[Y2] t2+⋯ )=(1+[Y1] t+[Y2] t2+⋯ )[X].\prod_{x \in X} \left(1 + [Y_1]\,t + [Y_2]\,t^2 + \cdots\right) = \left(1 + [Y_1]\,t + [Y_2]\,t^2 + \cdots\right)^{[X]}.

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 xx. In this notation, ZXmot(t)=(1−t)−[X]Z^{\mathrm{mot}}_X(t) = (1 - t)^{-[X]}. Over C\mathbb{C}, applying χc\chi_c turns the power into an ordinary power with exponent χc(X)\chi_c(X). For 1/(1−t)1/(1 - t) this is Macdonald’s formula, and the earlier remark that the formula behaves “as if there were χc(X)\chi_c(X) points” becomes literally true.

Counting points. The definition also makes sense over Fq\mathbb{F}_q, where degrees come back. An Fq\mathbb{F}_q-point of Conf⁡π(X)\operatorname{Conf}^\pi(\mathcal{X}) is a configuration that the Frobenius maps to itself. Its points fall into Frobenius orbits, which are closed points of XX. All the points of an orbit carry the same label ii, and their decorations together form a κ(x)\kappa(x)-point of Xi,xX_{i,x}. A closed point xx labelled ii contributes tideg⁡xt^{i \deg x}. So counting points gives

∏x closed(1+∑i≥1#Xi,x(κ(x)) tideg⁡x),\prod_{x \text{ closed}} \Bigl( 1 + \sum_{i \ge 1} \#X_{i,x}(\kappa(x))\, t^{i \deg x} \Bigr),

an Euler product over closed points in the sense of the previous section. For Xi=XX_i = X this is ∏x1/(1−tdeg⁡x)=ZX(t)\prod_x 1/(1 - t^{\deg x}) = Z_X(t). 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 1+t∣ℓ∣1 + t^{|\ell|}. The motivic analogue is the product with X1=XX_1 = X and Xi=∅X_i = \emptyset for i≥2i \ge 2, that is, each point is used at most once. Only partitions with all labels equal to 11 contribute, and Conf⁡πX\operatorname{Conf}^\pi X is then the unordered configuration space

Conf⁡nX=(Xn)∗/Sn\operatorname{Conf}^n X = (X^n)_* / S_n

of nn distinct points of XX. So

∏x∈X(1+t)=∑n≥0[Conf⁡nX] tn.\prod_{x \in X} (1 + t) = \sum_{n \ge 0} [\operatorname{Conf}^n X]\, t^n.

On A1\mathbb{A}^1, Conf⁡nA1\operatorname{Conf}^n \mathbb{A}^1 is the space of monic squarefree polynomials of degree nn, the complement in An\mathbb{A}^n of the discriminant hypersurface. Squarefree words have become squarefree polynomials.

We evaluated the product for words using 1+x=(1−x2)/(1−x)1 + x = (1 - x^2)/(1 - x). The motivic version of this identity has a geometric meaning. Every multiplicity m≥0m \ge 0 can be written in exactly one way as m=ε+2km = \varepsilon + 2k with ε∈{0,1}\varepsilon \in \{0, 1\}. So every effective zero-cycle DD can be written in exactly one way as D=D1+2D2D = D_1 + 2D_2, with D1D_1 squarefree and D2D_2 effective. The map

⨆a+2b=nConf⁡aX×Sym⁡bX→Sym⁡nX,(D1,D2)↦D1+2D2,\bigsqcup_{a + 2b = n} \operatorname{Conf}^a X \times \operatorname{Sym}^b X \to \operatorname{Sym}^n X, \qquad (D_1, D_2) \mapsto D_1 + 2D_2,

is therefore a bijection on points, and in characteristic zero this gives [Sym⁡nX]=∑a+2b=n[Conf⁡aX] [Sym⁡bX][\operatorname{Sym}^n X] = \sum_{a + 2b = n} [\operatorname{Conf}^a X]\,[\operatorname{Sym}^b X]. In terms of generating functions, this is a result of Vakil and Wood:

∑n≥0[Conf⁡nX] tn=ZXmot(t)ZXmot(t2),that is,∏x∈X(1+t)=∏x∈X1−t21−t.\sum_{n \ge 0} [\operatorname{Conf}^n X]\, t^n = \frac{Z^{\mathrm{mot}}_X(t)}{Z^{\mathrm{mot}}_X(t^2)}, \qquad \text{that is,} \qquad \prod_{x \in X} (1 + t) = \prod_{x \in X} \frac{1 - t^2}{1 - t}.

The same argument with m=ε+akm = \varepsilon + ak, 0≤ε<a0 \le \varepsilon < a, shows that the zero-cycles with all multiplicities less than aa have generating function ZXmot(t)/ZXmot(ta)Z^{\mathrm{mot}}_X(t)/Z^{\mathrm{mot}}_X(t^a).

The affine line. Here ZA1mot(t)=1/(1−Lt)Z^{\mathrm{mot}}_{\mathbb{A}^1}(t) = 1/(1 - \mathbb{L}t), so

∑n≥0[Conf⁡nA1] tn=1−Lt21−Lt,[Conf⁡nA1]=Ln−Ln−1(n≥2).\sum_{n \ge 0} [\operatorname{Conf}^n \mathbb{A}^1]\, t^n = \frac{1 - \mathbb{L}t^2}{1 - \mathbb{L}t}, \qquad [\operatorname{Conf}^n \mathbb{A}^1] = \mathbb{L}^n - \mathbb{L}^{n-1} \quad (n \ge 2).

This is the formula for squarefree words, with qq replaced by L\mathbb{L}. Over Fq\mathbb{F}_q it says that there are qn−qn−1q^n - q^{n-1} monic squarefree polynomials of degree nn. Over C\mathbb{C} it can be compared with topology. Arnold showed that for n≥2n \ge 2, the rational cohomology of Conf⁡nC\operatorname{Conf}^n \mathbb{C} is Q\mathbb{Q} in degree 0 and Q\mathbb{Q} in degree 1, the latter spanned by the class of dlog⁡d \log of the discriminant, which has Hodge type (1,1)(1,1). By Poincaré duality, the compactly supported cohomology is one class of type (n,n)(n, n) in degree 2n2n and one of type (n−1,n−1)(n-1, n-1) in degree 2n−12n - 1. The Hodge–Deligne polynomial is therefore (uv)n−(uv)n−1(uv)^n - (uv)^{n-1}, which is e(Ln−Ln−1)e(\mathbb{L}^n - \mathbb{L}^{n-1}).

The elliptic curve. Expanding ZEmot(t)/ZEmot(t2)Z^{\mathrm{mot}}_E(t)/Z^{\mathrm{mot}}_E(t^2) gives

[Conf⁡1E]=[E],[Conf⁡2E]=L [E],[Conf⁡3E]=[E](1+L+L2)−[E]2.[\operatorname{Conf}^1 E] = [E], \qquad [\operatorname{Conf}^2 E] = \mathbb{L}\,[E], \qquad [\operatorname{Conf}^3 E] = [E](1 + \mathbb{L} + \mathbb{L}^2) - [E]^2.

The second agrees with the direct computation above. In the third, the product [E]2=[E×E][E]^2 = [E \times E] appears, coming from the zero-cycles x+2yx + 2y in Sym⁡3E\operatorname{Sym}^3 E. Over C\mathbb{C}, applying χc\chi_c gives ∑nχc(Conf⁡nX) tn=(1+t)χc(X)\sum_n \chi_c(\operatorname{Conf}^n X)\, t^n = (1 + t)^{\chi_c(X)}, which is 11 for EE. So χc(Conf⁡nE)=0\chi_c(\operatorname{Conf}^n E) = 0 for every n≥1n \ge 1, as the formulas confirm.

How often is a zero-cycle squarefree?

For words, the squarefree ones made up a fraction 1−1/q1 - 1/q of the words of each length n≥2n \ge 2, and for integers the fraction is 1/ζ(2)=6/π21/\zeta(2) = 6/\pi^2. Motivically, [Conf⁡nA1]=Ln(1−L−1)[\operatorname{Conf}^n \mathbb{A}^1] = \mathbb{L}^n (1 - \mathbb{L}^{-1}), so after inverting L\mathbb{L} the squarefree polynomials make up a fraction 1−L−11 - \mathbb{L}^{-1} of all monic polynomials of degree nn.

The Euler product suggests what to expect for a variety XX of dimension dd. Dividing ∏x(1+t)\prod_x (1 + t) by ∏x1/(1−t)\prod_x 1/(1 - t) leaves ∏x(1−t2)\prod_x (1 - t^2). The symmetric powers grow like Lnd\mathbb{L}^{nd}, which suggests evaluating at t=L−dt = \mathbb{L}^{-d}. Then each point contributes a factor 1−L−2d1 - \mathbb{L}^{-2d}, the “probability” that it does not occur twice, independently of the other points, and the product of these factors is ZXmot(L−2d)−1Z^{\mathrm{mot}}_X(\mathbb{L}^{-2d})^{-1}. This is the analogue of ∏p(1−p−2)=1/ζ(2)\prod_p (1 - p^{-2}) = 1/\zeta(2).

Vakil and Wood proved that this heuristic is correct. If XX is rational of dimension dd, then the classes [Sym⁡nX][\operatorname{Sym}^n X] are invertible in a suitable completion of K0(Vark)[L−1]K_0(\mathrm{Var}_k)[\mathbb{L}^{-1}], and in that completion

lim⁡n→∞[Conf⁡nX][Sym⁡nX]=1ZXmot(L−2d).\lim_{n \to \infty} \frac{[\operatorname{Conf}^n X]}{[\operatorname{Sym}^n X]} = \frac{1}{Z^{\mathrm{mot}}_X(\mathbb{L}^{-2d})}.

For X=A1X = \mathbb{A}^1, ZA1mot(L−2)=1/(1−L−1)Z^{\mathrm{mot}}_{\mathbb{A}^1}(\mathbb{L}^{-2}) = 1/(1 - \mathbb{L}^{-1}), so the limit is 1−L−11 - \mathbb{L}^{-1}, as computed above. More generally, the fraction of zero-cycles with all multiplicities less than aa tends to ZXmot(L−ad)−1Z^{\mathrm{mot}}_X(\mathbb{L}^{-ad})^{-1}, the analogue of the density 1/ζ(a)1/\zeta(a) of aa-th-power-free integers.

Updated

← Back to NotesBack to top ↑

Search this space

Titles, tags, and everything you’ve read here. Enter opens the first result.Search titles, tags, and page text. Tap a result to open it.

Start typing to search the whole site.

Command

Type a command
❯
Type help for commands. Enter runs the command. Tab completes commands and paths. Shift+Tab or Escape leaves the input. Press colon anywhere outside a text field to focus this command line; s opens site search.

Theme