This is work in progress by John Baez and James Dolan. based in part on material from week218 of This Week’s Finds.
In Zeta functions, we discussed a way to categorify the Hasse-Weil zeta function of a scheme. Another class of mathematical objects that have zeta functions are dynamical systems. The simplest example is the Artin–Mazur zeta function of a discrete dynamical system. A discrete dynamical system is simply a set equipped with a bijection , and its Artin–Mazur zeta function is
where is the set of fixed points of the th iterate of . Mathematically, we can also think of a discrete dynamical system as a -set: a set equipped with an action of the additive group . Any -set gives a species for which a -structure on a finite set is a way of making it into a -set and equipping it with a -set map to . We shall show that the Dirichlet series of this species is equal to the Artin–Mazur zeta function .
We shall also explain how any Hasse–Weil species gives rise to a sequence of -sets, one for each prime. Each of these gives a species as above, and under some mild conditions we can multiply these (using the ‘Dirichlet product’ of species) to recover the Hasse–Weil species. As we shall see, this explains why the zeta functions of such Hasse–Weil species have Euler factorizations.
Suppose we have a -set , or in other words, a set equipped with a bijection
We can form three closely related sequences as follows:
the number of fixed points of ;
the number of orbits of cardinality ;
the number of invariant multisubsets of weight .
The last is perhaps the least familiar, but it is the most closely connected to zeta functions. In applications to number theory, if we start with a function
as discussed above. Then for each prime , we obtain a set , where is the algebraic closure of . This algebraic closure is equipped with an automorphism
called the Frobenius automorphism. Since is a functor, this makes into a -set where
is given by
It then turns out that….
fixed points of correspond to homomorphisms . The reason is that can be seen as precisely the fixed points of .
orbits of cardinality correspond to prime ideals of order in the ring localized at (???)
invariant multisubsets of weight correspond to ideals of order in localized at (???)
Next:
Let be the set of fixed points of , and let be the cardinality of this set.
Let be the number of -orbits of having cardinality .
Let be the number of invariant multi-subsets of of weight .
Here a multi-subset of a set is a function , and its weight is , which could be infinite. Any subset gives a multi-subset where is the characteristic function of , and then the weight of this multi-subset is the cardinality of .
As we shall see, if one of the above sequences consist of finite numbers, they all do. We say a -set is tame if all these sequences consist of finite numbers.
Some of the above sequences arise naturally from the generating functions of certain structure types. For example, we can “cyclically order” a finite set by drawing it as a little circle of dots with arrows pointing clockwise from each dot to the next. (For convenience we decree that there are no ways to cyclically order the empty set.) A cyclically ordered set is automatically a -set in an obvious way. So, here is a type of structure we can put on a finite set: cyclically ordering it and equipping the resulting -set with a morphism to a fixed -set . And, we have:
Proposition: The power series
is the generating function for the structure type “being cyclically ordered and equipped with a morphism to the -set ”.
Proof: Given an -element set, there are ways to cyclically order it if , and none if . After having chosen a cyclic ordering, to specify a -equivariant map to we simply map a chosen point to any element of . So there are to do this, and the generating function of “being cyclically ordered and equipped with a morphism to the -set ” is as described.
Proposition: The power series
is the generating function for the structure type “being a -set over ”.
Proof: For any structure type there is a structure type “being partitioned into nonempty parts, each equipped with an -structure”, which is called and satisfies
So, by the previous proposition,
is the generating function for “being partitioned into nonempty parts, each equipped with a cyclic ordering and a morphism to the -set ”. But this is just a long way of saying: “being made into a -set and equipped with a morphism to the -set — or in category-theoretic jargon, “being a -set over ”.