Wednesday, 7 May 2008

zeta functions - Is there an analogue of the Lefschetz fixed point theorem for discrete dynamical systems?

Background/Motivation



Let (X,f) be a discrete dynamical system. For now, X is just a set and f is just a function f:XtoX. Suppose that fn has a finite number of fixed points for every n. Then the dynamical (Artin-Mazur) zeta function zetaf is given by



displaystylezetaf(t)=expleft(sumnge1fractextFixfnntnright).



The coefficients of zetaf(t) have a nice combinatorial interpretation that seems to have homological significance. A particularly famous case of this construction is that X is the set of points of a variety over overlinemathbbFp and f is the Frobenius map; then zetaf is a local zeta function, since textFixfn is precisely the number of points of the variety over mathbbFpn.



Now give X the additional structure of a compact triangulable space and let f be continuous. Again suppose that fn has a finite number of fixed points for every n and let i(f,x) denote the index of a fixed point x, and let L(f) be the sum of the indices i(f,x) over all fixed points of x. Thus L(f) generalizes the number textFixf to the case that the indices are not all equal to 1. Similarly one defines the Lefschetz zeta function by



displaystylezetaf(t)=expleft(sumnge1fracL(fn)ntnright).



The Lefschetz fixed point theorem is then equivalent to the statement that zetaf is equal to the alternating product of the characteristic polynomial of the induced action of f on the singular homology groups Hk(X,mathbbQ); in particular, zetaf is rational because there are finitely many such groups. Weil famously suggested that if one could define an analogue of singular homology for varieties over finite fields, an analogue of the Lefschetz fixed point theorem would prove the Weil conjectures. This was eventually done, and is known as etale cohomology.



However, I'm interested in a simpler dynamical system than a variety over a finite field. Let G be a finite (directed, possibly with loops) graph, let X(G) be the set of aperiodic closed walks on G with a distinguished vertex, and let f:X(G)toX(G) be the function which sends the distinguished vertex of an aperiodic closed walk to the next vertex in the walk. (An aperiodic closed walk is analogous to a point together with all of its Galois conjugates, and f is conjugation.) Then textFixfn is precisely the number of closed walks of length n on G. A basic result in algebraic combinatorics then tells us that textFixfn=texttrmathbfAn, where mathbfA is the adjacency matrix of G, and this is equivalent to the statement that



displaystylezetaf(t)=frac1det(mathbfImathbfAt).



What this suggests to me is that there is an analogue of the Lefschetz zeta function at work and that it is telling me that X(G) has one nontrivial homology group on which f acts as mathbfA, but I don't know if this is a reasonable interpretation. Hence my questions!



Edit, 1/8/10: Let me give an example where I can introduce another "homology group." Let H be a proper subgraph of G, and let X(G,H) denote the set of aperiodic closed walks on G with a distinguished vertex and with the property that at least one edge or vertex of the closed walk is not in H; f is the same as above. If mathbfB denotes the adjacency matrix of H, it then follows that textFixfn=texttrleft(mathbfAnmathbfBnright), hence



displaystylezetaf(t)=fracdet(mathbfImathbfBt)det(mathbfImathbfAt).



Questions



  • What is a sensible definition of the (say, integral) homology of a discrete dynamical system without any further structure? What conditions on X are necessary to ensure that there are only finitely many homology groups, and do they hold for X(G) and/or X(G,H)?


  • Under what conditions does an analogue of the Lefschetz fixed point theorem hold for this homology theory, and can it be made to correctly reproduce the X(G) and X(G,H) computations above?


No comments:

Post a Comment