- Open Access
A Brouwer fixed-point theorem for graph endomorphisms
Fixed Point Theory and Applications volume 2013, Article number: 85 (2013)
We prove a Lefschetz formula for graph endomorphisms , where G is a general finite simple graph and ℱ is the set of simplices fixed by T. The degree of T at the simplex x is defined as , a graded sign of the permutation of T restricted to the simplex. The Lefschetz number is defined similarly as in the continuum as , where is the map induced on the k th cohomology group of G. The theorem can be seen as a generalization of the Nowakowski-Rival fixed-edge theorem (Nowakowski and Rival in J. Graph Theory 3:339-350, 1979). A special case is the identity map T, where the formula reduces to the Euler-Poincaré formula equating the Euler characteristic with the cohomological Euler characteristic. The theorem assures that if is nonzero, then T has a fixed clique. A special case is the discrete Brouwer fixed-point theorem for graphs: if T is a graph endomorphism of a connected graph G, which is star-shaped in the sense that only the zeroth cohomology group is nontrivial, like for connected trees or triangularizations of star shaped Euclidean domains, then there is clique x which is fixed by T. If is the automorphism group of a graph, we look at the average Lefschetz number . We prove that this is the Euler characteristic of the chain and especially an integer. We also show that as a consequence of the Lefschetz formula, the zeta function is a product of two dynamical zeta functions and, therefore, has an analytic continuation as a rational function. This explicitly computable product formula involves the dimension and the signature of prime orbits.
MSC:58J20, 47H10, 37C25, 05C80, 05C82, 05C10, 90B15, 57M15, 55M20.
Brouwer’s fixed-point theorem assures that any continuous transformation on the closed ball in Euclidean space has a fixed point. First tackled by Poincaré in 1887 and by Bohl in 1904  in the context of differential equations , then by Hadamard in 1910 and Brouwer in 1912 , in general, it is now a basic application in algebraic topology [4–6]. It has its use for example in game theory: the Kakutani generalization  has been used to prove Nash equilibria . It is also useful for the theorem of Perron-Frobenius in linear algebra , which is one of the mathematical foundations for the page rank used to measure the relevance of nodes in a network. More general than Brouwer is Lefschetz’ fixed-point theorem  from 1926, which assures that if the Lefschetz number of a continuous transformation on a manifold is nonzero, then T has a fixed point. In 1928, Hopf  extended this to arbitrary finite Euclidean simplicial complexes and proved that if T has no fixed point then . The third chapter of  and  provides more history. Brouwer’s theorem follows from Lefschetz because a manifold M homeomorphic to the unit ball has and is trivial for so that assures the existence of a fixed point.
Since Brouwer’s fixed-point theorem has been approached graph theoretically with hexagonal lattices  or using results on graph colorings like the Sperner lemma , it is natural to inquire for a direct combinatorial analogue on graphs without relating to any Euclidean structure. But already the most simple examples like rotation on a triangle show that an automorphism of a graph does not need to have a fixed vertex, even if the graph is a triangularization of the unit disc. Indeed, many graph endomorphisms in contractible graphs do not have fixed points. Even the one-dimensional Brouwer fixed-point theorem, which is equivalent to the intermediate value theorem does not hold: a reflection on a two point graph does not have a fixed vertex.
The reason for the failure is that searching for fixed vertices is too narrow. We do not have to look for fixed points but fixed simplices. These fundamental entities are also called cliques in graph theory. This is natural since already the discrete exterior algebra deals with functions on the set of simplices of the graph G, where is the set of vertices is the number edges, the set of triangles in G etc. The Euler characteristic is the graded cardinality of . The role of tensors in the continuum is played by functions on . A k-form in particular is an antisymmetric function on . The definition of the exterior derivative is already the Stokes theorem in its core because for a k-simplex x, the boundary is the union of -dimensional simplices in x, which form the boundary of x. The definition of exterior derivative tells that df evaluated at a point x is the same than f evaluated at the boundary point δx. We see that in graph theory, the term ‘point’ comes naturally when used for cliques of the graph.
Because of the atomic nature of cliques, we therefore prove a Lefschetz formula which holds for graph endomorphisms of finite simple graphs and where the simplices are the basic ‘points’. Despite the discrete setting, the structure of the proof is close to Hopf’s approach to the classical Lefschetz theorem . More text book proofs can now be found in [12, 15, 16]. While the definition of Lefschetz number goes over directly, it was the definition of the degree = index of a map at a fixed simplex, which we needed to look for. Direct discretizations of the classical definition of the Kronecker-Brower degree do not work. We found that the degree (which we also often call index)
leads to a theorem. In this definition, is the dimension of the complete graph and is the signature of the permutation induced on x. With this definition, every cyclic permutation on a simplex has index 1 and the sum of the indices over all fixed subsimplices of a simplex is 1 for any permutation T. This matches that for any automorphism of a simplex . The main result is the Lefschetz formula
where is the subset of which is fixed by T. The proof uses the Euler-Poincaré formula, which is the special case when T is the identity. A second part is to verify that for a fixed-point free map . A final ingredient is to show for two T-invariant disjoint simplex sets , . The Lefschetz number applied to the fixed point set is the Euler characteristic and equal to the sum of indices, the Lefschetz number applied to ℋ is zero.
The probabilistic link  between Poincaré-Hopf and Gauss-Bonnet obtained by integrating over all injective functions f on the vertex set V motivates to look for an analogue of Gauss-Bonnet in this context. This is possible: define a Lefschetz curvature on the set of simplices x of G as the rational number
It is an almost immediate consequence of the Lefschetz formula that the Gauss-Bonnet type formula
holds, where is the average over of all automorphisms. It is a graph invariant which refers to the symmetry group of the graph. Unlike the Euler characteristic, it can be nonzero for odd dimensional graphs. For one-dimensional geometric graphs, for example, is the number of connected components and the curvature on each edge or vertex of is constant . For complete graphs, the Lefschetz curvature is concentrated on the set of vertices and constant . An other extreme case is when is trivial, where curvature is 1 for even-dimensional simplices and −1 for odd-dimensional simplices. The Gauss-Bonnet type formula (1) is then just a reformulation of the Euler-Poincaré formula because is then the cohomological Euler characteristic.
While behaves more like a spectral invariant of the graph as the latter also depends crucially on symmetries, we will see that is the Euler characteristic of the quotient chain of the graph by its automorphism group. The quotient chain is a discrete analogue of an orbifold. In the case , for example, where we have 6 automorphisms, the Lefschetz numbers are with the identity , the rotations and reflections of two vertices give . The average is the Euler characteristic of . For the complete graph , which has the same 6 automorphisms, the Lefschetz numbers are and again . The proof that is a Euler characteristic only uses the Burnside lemma in group theory and is much simpler than the analogous result for orbifolds.
Since the Lefschetz number is a weighted count of fixed points, the Lefschetz number of the iterate is a weighted count of periodic orbits. The Lefschetz zeta function
encodes this. It is an algebraic version of the Artin-Mazur  zeta function, which in dynamical systems theory is studied frequently . Actually, as we will see in this article, the Lefschetz formula implies that the Lefschetz zeta function of a graph automorphism is the product of two zeta functions defined in dynamical systems theory. It therefore has a product formula. This formula is a finite product over all possible prime periods
where rsp. is the number of odd-dimensional prime periodic orbits for which has positive rsp. negative signature and rsp. are the number of even-dimensional prime periodic orbits for which has positive rsp. negative signature.
The zeta function (or rather its analytic continuation given by the rational function in the form of the just mentioned product formula) contains the Lefschetz numbers of iterates of the map because it defines a Taylor series with periodic coefficients
For the zeta function of a reflection at a circular graph , for example, where , the right-hand side is so that for odd n. An immediate consequence of product formulas for dynamical zeta functions is a product formula, which is in the case of the identity again just a reformulation of the Euler-Poincaré formula. As in number theory, where the coefficients in Dirichlet L-series are multiplicative characters, also dynamical zeta functions have coefficients which are multiplicative by definition. When using the degree , this is not multiplicative because of the dimension factor . We can split the permutation part from the dimension part, however, and write a product formula for the zeta function which involves two dynamical zeta functions.
Because graphs have finite automorphism groups , one can define a zeta function of the graph as
As the Lefschetz zeta function of a transformation, the graph zeta function is a rational function. For a reflection T at a circular graph , for example, we have because , and so that . For a graph with a trivial automorphism group, we have . These examples prompt the question about the role of the order of the zero or of pole at . The order at is important wherever zeta functions appear, in particular, for the original Riemann zeta function, which has a pole of order 1. An other example is for subshifts of finite type with Markov matrix A, where the Bowen-Lanford formula  writes the dynamical zeta function as , which by Perron-Frobenius has a pole of order k at if A has k irreducible components.
The proof of the discrete Lefschetz formula is graph theoretical and especially does not involve any limits. Like Sperner’s lemma, it would have convinced the intuitionist Brouwer: both sides of the Lefschetz formula can be computed in finitely many steps. The Lefschetz formula is also in this discrete incarnation a generalization of the Euler-Poincaré formula, which is a linear algebra result in the case of graphs. If we look at the set of all the simplices of a graph, then this set can be divided into a set ℱ, which is fixed and a set which wander under the dynamics. The fixed simplices can be dealt with combinatorically.
Let us see what happens in the special case when T acts on a complete graph G and where x is the simplex, which is the entire graph. Understanding this is crucial. The Lefschetz fixed-point formula is . Let us see the proof: the permutation T induced on G decomposes into cycles , which all are subsimplices of G. Since also arbitrary unions of simplices are simplices, the transformation T fixes simplices, which is the set of all subsets except the empty set which does not count as a fixed point. We have because the order of the cyclic permutation cancels the dimensional grading. Next and in general
where is the number of orbits in y. In other words, depends on the dimension of the ‘orbit simplex’. Since and , we have , which agrees with .
As we realized in July 2012, our fixed-point theorem generalizes the Nowakowski-Rival fixed-edge theorem , which tells that a graph endomorphism of a simple connected graph with no loops has either a fixed edge or vertex. By adding loops, this is a fixed-edge theorem. The Nowakowski-Rival theorem is a consequence of the discrete Brouwer theorem in the case of trees which is contractible. In , the theorem was generalized to a commutative family of such maps.
2 The Lefschetz number
Given a finite simple graph we denote by the set of complete subgraphs of G. Elements in are called cliques. The set is the set of all triangles in G, the set of edges and the set of vertices. If the cardinality of is denoted by , then the Euler characteristic of G is defined as
a finite sum.
To get the discrete exterior bundle, define a k-form as a function on , which is antisymmetric in its arguments. The set of all k-forms is a vector space of dimension . The exterior derivative is defined as , where denotes a variable taken away. A form is closed if . It is exact if . The vector space of closed forms modulo exact forms is the cohomology group of dimension , the Betti number. The cohomological Euler characteristic of G is defined as
The sign ambiguity of forms can be fixed by defining an orientation on G. The later assigns a constant n-form 1 to each maximal n-dimensional simplex; a simplex being maximal if it is not contained in a larger simplex. G is orientable if one can find an orientation, which is compatible on the intersection of maximal simplices. If G should be nonorientable, we can look at a double cover of G and define as . A graph automorphism lifts to the cover and a fixed point in the cover projects down to a fixed point on G. Our results do not depend on whether G is orientable or not.
Example Let G be a triangle. The vector space of 0-forms is three-dimensional, the space of 1-forms three-dimensional and the space of 2 forms one-dimensional. An orientation is given by defining . This induces orientations on the edges .
A graph endomorphism is a map T of V such that if then . If T is invertible, then f is called a graph automorphism. Denote by the induced map on the vector space . As a linear map, it can be described by a matrix, once a basis is introduced on .
Remark We can focus on graph automorphisms because the image is T-invariant and T restricted to the attractor for sufficiently large n is an automorphism. This is already evident when ignoring the graph structure and looking at permutations of finite sets only.
The following definition is similar as in the continuum.
Definition Given a graph endomorphism on a simple graph G, define the Lefschetz number as
where is the map T induces on .
Examples (1) For the identity map T, the number is the cohomological Euler characteristic of G. Denote by the set of fixed points of T. In the same way as the classical Lefschetz-Hopf theorem, we have then , where is the index of the transformation.
(2) If G is a zero dimensional graph, a graph without edges, and T is a permutation of V, then it is an automorphism and is equal to the number of fixed points of T. The reason is that only is nontrivial and has dimension . The transformation is the permutation defined by T and is the number of fixed points.
(3) If G is a complete graph, then any permutation is an automorphism. Only is nontrivial and has dimension 1 and .
(4) The tetractys is a graph of order 10 which is obtained by dividing a triangle into 9 triangles. The automorphism group is the symmetry group of the triangle. Again, since only is nontrivial, for all automorphisms. For rotations, there is only one fixed point, the central triangle. For reflections, we have 2 vertices, 2 edges and 3 triangles fixed.
(5) For a cyclic graph with , both and are nontrivial. If T preserves orientation and is not the identity, then there are no fixed points. The Lefschetz number is 0. For the reflection T, the Lefschetz number is 2. Any reflection has either 2 edges or two vertices or a vertex and an edge fixed.
(6) The Petersen graph has order 10 and size 15 has a Euler characteristic −5 and an automorphism group of 120 elements. The Lefschetz number of the identity is −5, there are 24 automorphisms with and 80 automorphisms with and 15 automorphisms with . The sum of all Lefschetz numbers is 120 and the average Lefschetz number therefore is 1. We will call this and see that it is , where is the quotient chain which is here a graph consisting of one point only.
3 Lefschetz fixed point theorem
Definition Denote by the set of simplices x which are invariant under the endomorphism T. A simplex is invariant if . In this case, is a permutation of the simplex.
Definition For a fixed simplex x in the graph G and an endomorphism T, define the index
where is the signature of the permutation T induces on x. The integer is the determinant of the corresponding permutation matrix.
Remarks (1) In the continuum, the inner structure of a fixed point is accessible through the derivative and classically, is the index of a fixed point.
(2) Is there a formal relation between the continuum and the discrete? In the continuum, we have where p is the characteristic polynomial of . In the discrete, we have where p is the characteristic polynomial of the permutation matrix −P of T restricted to x.
Examples (1) If x is a 0-dimensional simplex (a vertex), then for every fixed point x and the sum of indices agrees with .
(2) If x is a 1-dimensional simplex (an edge) and f is the identity, then . If f flips two point in , then .
(3) Let G be a cyclic graph with . An automorphism is either a rotation or a reflection. We have in the orientation preserving case and in the orientation reversing case. For any invariant simplex, we have .
(4) If G is a wheel graph and T is a rotation, then there is one fixed point and . The index of the fixed point is 1 as any 0-dimensional fixed point has index 1.
Theorem 3.1 (Lefschetz formula)
For any graph endomorphism T of a simple graph G with fixed point set , we have
Examples (1) For the identity map , we have as in the continuum. The formula rephrases the Euler-Poincaré formula telling that the homological Euler characteristic is the graph theoretical Euler characteristic because and every x is a fixed point.
(2) Assume G is a 1-dimensional circular graph with . If T is orientation preserving, then the Lefschetz number is 0, otherwise it is 2 and we have two fixed points. Lets compute in the orientation preserving case: the space is R and the map T induces the identity on it. The space consists of all constant functions on edges and T induces −Id. If T is orientation reversing, then the left hand side is . Indeed we have then two fixed points.
(3) Assume G is an octahedron and T is an orientation preserving automorphims of G, then on and on are both the identity and since is trivial, the Lefschetz number is 2. There are always at least two fixed simplices. It is possible to have two triangles or two vertices invariant.
(4) The Lefschetz number of any map induced on the wheel graphs is 1 because only is nontrivial. Any endomorphism has at least one fixed point.
(5) If G is the icosahedron, then there are automorphims, which have just two triangles fixed. Also two fixed points are possible.
(6) Assume T is an orientation reversing map, a reflection on an octahedron. We do not need to have a fixed point. Indeed, the map T induced on is −1 and the Lefschetz number is .
(7) If G consists of two triangles glued together at one edge, then . Take T which exchanges the two triangles. This leaves the central edge invariant. The Lefschetz number of T is 1.
(8) For a complete graph , any permutation is a graph automorphism. The Lefschetz number is 1 because only is nontrivial. The index of any cyclic subsimplex is 1. As in the identity case, we have , which is the . As mentioned in the Introduction, one can see this special case as a Euler-Poincaré formula for the orbit graph because T on every cyclic orbit y is a cyclic permutation with .
The classical Poincaré lemma in Euclidean space assures that for a region homeomorphic to a star-shaped region only is nonzero. This motivates to define the following.
Definition A graph is called star-shaped if all vector spaces are trivial for .
Examples (1) Given an arbitrary graph , then the pyramid construction
(2) Any tree G is star-shaped as there are no triangles in the tree making trivially vanish for . The vector space is trivial because there are no loops.
(3) The complete graph is star-shaped.
(4) The cycle graph is not star-shaped for .
(5) Any finite simply connected and connected subgraph of an infinite hexagonal graph is star-shaped.
(6) The icosahedron and octahedron are both not star-shaped. Actually, any orientable 2-dimensional geometric graph (a graph where each unit sphere is a 1-dimensional circular graph) is not star-shaped as Poincaré duality holds for such graphs.
As in the continuum, the Brouwer fixed-point theorem follows.
Theorem 3.2 (Brouwer fixed point)
A graph endomorphism T on a connected star-shaped graph G has a fixed clique.
Proof We have because only is nontrivial and G is connected. Apply the Lefschetz fixed-point theorem. □
We can restrict ourself to graph automorphisms because an endomorphism T restricted to the attractor of T is an automorphism. Any fixed point of T is obviously in the attractor so that the sum in the Lefschetz formula does not change when looking at T on instead of T on G. Also the Lefschetz number does not change as any invariant cohomology class, an eigenvector w of the linear map on the vector space must be supported on .
The set decomposes into two sets, the union of the set ℱ of simplices which are fixed and the set of simplices which are not fixed by the automorphism T. It is possible that some elements in can be a subsimplex of an element in ℱ. For a cyclic rotation on the triangle , for example, the triangle itself is in ℱ but its vertices are in .
To see the Lefschetz number more clearly, we extend T to . Given a k-simplex x, it has an orbit x, , which will eventually circle in a loop since is a map on a finite set.
Definition The Euler characteristic of a subset of is defined as
The Lefschetz number L of T restricted to an invariant set is defined as
where is the map induced on the linear subspace generated by functions on .
Remarks (1) The linear subspace generated by functions on is in general not invariant under the exterior derivative d: a function supported on has df, which is defined on and not on in general.
(2) We have , where the left-hand side is the Euler characteristic of the super graph and the right-hand side the Euler characteristic of the graph. Note, however, that there are subsets of which are not graphs. For a triangle for example, we can look at the set of edges and get the Euler characteristic .
Lemma 4.1 (Additivity of L)
Assume , are disjoint subsets of and assume both are T-invariant. Then
Especially, for ,
Remark The vertex sets defined by two subsets do not need to be disjoint. For a triangle , for example, and are disjoint sets in even so every is a subgraph of every nonempty subset of .
We only have to show that
Let be the set of l-simplices in , the set of simplices in . The sets are T invariant for . Any member of a cohomology class is a function on can be decomposed as where has support in etc. The matrix is a block matrix and the trace is the sum of the traces of the blocks. □
Corollary 4.2 Assume , are T-invariant subsets of , then
Proof Write and apply Lemma 4.1 twice for the disjoint sets and then , which has the union . □
Lemma 4.3 If T has no fixed point in , then . More generally, if T has no fixed points on .
Proof Given a simplex x, the orbit is T-invariant and . To see this, note that is trivial for . There are two possibilities: either is connected, or has connectivity components. In the first case, the orbit graph has a retraction to a cyclic subgraph so that and . In that case, , are both identities on , and . In the second case, is n-dimensional and is the only cohomology, which is nontrivial. The map T is a cyclic permutation matrix on which has trace zero. For two T-invariant sets , the intersection is also invariant and also has zero Lefschetz number. Therefore, the Lefschetz number of the union of all orbits is zero by Lemma 4.1. □
The next lemma assures that for any finite simple graph G, the graph theoretical Euler characteristic is equal to the cohomological Euler characteristic.
Lemma 4.4 (Euler-Poincaré formula)
If T is the identity, then .
In other words, for any simple graph, the cohomological Euler characteristic is the same than the graph theoretical Euler characteristic.
Proof This is linear algebra [23, 24]: denote by the vector space of m-forms on G. It has dimension . The kernel of dimension and range of dimension . From the rank-nullity theorem in linear algebra , we get
From the definition of the cohomology groups of dimension , we get
Adding Equations (2) and (3) gives
Summing this up over m (using , for )
which implies . □
Lemma 4.5 (Fixed point)
If ℱ is the set of simplices in G fixed by T then
Proof Because every is fixed we have a disjoint union and . Because T is the identity on each fixed point, we have and the second equality holds. □
Examples (1) If there are n maximal invariant simplices, which do not intersect, then . This follows from the additivity of L and the fact that T restricted to a simplex has , independent of T.
(2) Let . Let T be a permutation with two cyclic orbits y, z of order 3, 4 inside. The transformation has 3 fixed points x, y, z in total. We have and , and the sum is .
Now, we are ready to prove the theorem.
Proof The fixed point set ℱ of T is invariant and satisfies . The set of simplices, which are not fixed satisfies .
Example To illustrate the proof, we look at an example, where we split a triangle into 4 triangles and rotate it by 60 degrees. The fixed point set ℱ consists of the central triangle alone and the complement . The fixed point set consists only of one point, the central triangle . All other parts of the supergraph move, including the edges and vertices of the triangle itself.
5 Lefschetz curvature
We have seen in  that averaging the Poincaré-Hopf index theorem formula 
over a probability space of all injective functions leads to Gauss-Bonnet 
It is therefore natural to look at the average as a curvature when we sum up over all stabilizer elements in .
Definition Define the Lefschetz curvature of a simplex as
and the average Lefschetz number
when averaging over all automorphisms.
The number has an interpretation as the expected index of fixed points of a graph if we chose a random automorphism in the automorphism group. It is a lower bound for the expected number of fixed points of a random automorphism on a graph.
Examples (1) For a cycle graph with , half of the automorphisms have and half have . The average Lefschetz number is 1.
(2) For a complete graph , all automorphisms satisfy so that the average Lefschetz number is 1.
(3) For the Petersen graph G, the average Lefschetz number is 1.
If the Lefschetz formula is compared with the Poincaré-Hopf formula, then is an analogue of Euler curvature and the next result is an analogue of Gauss-Bonnet but where we sum over all simplices in G. The Lefschetz curvature is a nonlocal property. It does not depend only on a small neighborhood of the point, but on the symmetries which fix the point = simplex.
Theorem 5.1 (Average Lefschetz)
Proof Use the Lefschetz fixed-point theorem to sum over :
Remark Unlike the Gauss-Bonnet theorem, this Gauss-Bonnet type theorem sums over all possible simplices , not only vertices V of the graph. The Lefschetz curvature is constant on each orbit of the automorphism group and the sum over all curvatures over such an equivalence class is an integer 1 or −1. Theorem 5.2 is the Euler-Poincaré formula in disguise since we will interpret as an Euler characteristic of an ‘orbifold’ chain.
Examples (1) If G is the complete graph , then is the full permutation group and since for all T, we also have . Now lets compute the Lefschetz curvature. For every fixed x we have and averaging over all T gives zero except if x is a vertex, where
The Lefschetz curvature of a vertex is the same than the Euler curvature of a vertex. The curvature is zero on for because the indices of even odd dimensional permutations cancel.
(2) If G is star-shaped then for all T and . It reflects the Brouwer analogue that every transformation has a fixed point. If G is a star graph , then the automorphism group is . For the center point for all transformations and . All other points have . While the Euler curvature is positive at the spikes and negative in the center, the Lefschetz curvature is entirely concentrated at the center.
(3) If for , then is the dihedral group. For reflections we have , for the rotations, . Therefore, . The stabilizer group consists always of two elements whether it is a vertex or edge and in both cases. We have and . The curvature is located both on vertices and edges. Unlike the Euler curvature, the Lefschetz curvature is now nonzero.
(4) If G is the wheel graph with , then again is the dihedral group. We still have but now for all automorphisms. The center vertex has the full automorphism group as stabilizer group and for any transformation. Therefore, at the center and everywhere else. The center has grabbed all curvature.
(5) If G has a trivial automorphism group, then is the Euler characteristic. Also each stabilizer group is trivial and so that . In this case, the curvature is spread on all simplices, even-dimensional ones have positive curvature and odd-dimensional ones have negative curvature. It is amusing that the Euler-Poincaré formula can now be seen as a Gauss-Bonnet formula for Lefschetz curvature.
(6) For the octahedron G, the orientation preserving automorphisms T satisfy . They are realized as rotations if the graph is embedded as a convex regular polygon. The orientation reversing automorphisms have . The average Lefschetz number is and the Lefschetz curvature is constant 1 at every point.
(7) We can look at the Erdoes-Rényi probability space  of graphs G on a vertex set with edges. The number is a random variable on . We computed the expectation for small n as follows: , , , , . Like the expectation of Euler characteristic of random graphs, the expectation of is expected to oscillate more and more as . While takes values 1 or 2 in the case , there are graphs on 6 vertices, where the maximal Lefschetz number is 3 and the minimal Lefschetz number is 0. The computation for is already quite involved since we have 32,768 graphs and look at all the automorphisms and for each automorphism find all fixed points.
We will now show that the average Lefschetz number obtained by averaging over the automorphism group is always an integer, since it is the Euler characteristic of a chain, which is an integer.
Definition Let be the orbigraph (a chain) defined by the automorphism group acting on G. Two vertices are identified if there is an automorphism mapping one into the other.
Remarks (1) is not a graph in general. It sometimes is a multigraph, possibly with loops  but in general, it is only a chain.
(2) If geometric graphs G in which unit spheres have topological properties from spheres and fixed dimension are considered discrete analogues of manifolds and ℬ is a subgroup of automorphisms of G, then plays the role of an orbifold. Examples are geometric graphs with boundary, where each unit sphere is either sphere-like or a half-sphere of the same fixed dimension.
Theorem 5.2 (Average Lefschetz is Euler characteristic)
The Lefschetz number satisfies and is an integer.
Proof The proof uses elementary group theory and Theorem 3.1.
(1) The Burnside lemma for the finite group acting on assures
where is the set of fixed points of T and is the set of simplices in .
(2) The number of a simplex is equal to the index for every simplex y which projects onto x: we have seen in the Introduction that the dimension of the simplex of satisfies
(3) Let be the set of simplices x, which are mapped under to an even dimensional simplex. These are the simplices y for which have index 1 independent of T. Similarly, let be the set of simplices which are projected to an odd dimensional simplex. All these simplices have negative index for all . We therefore know that we have a partition and that for any and every the index is equal to where .
(4) We can now use the Burnside lemma restricted to invariant sets , and get
where is the set of fixed simplices y of T for which .
(5) Let now the set of simplices in which have dimension k. We use the Lefschetz fixed point formula to finish the proof:
Remarks (1) Since and κ is constant on each orbit, the Lefschetz curvature of a simplex x can be rewritten as where is the simplex after identification with and is the orbit of x under the automorphism group. Since , the Gauss-Bonnet type formula (Theorem 5.1) can also be seen to an Euler-Poincaré formula in general. The number encodes so the orbit length of x under the automorphism group .
(2) One can also see this as graded summation of an elementary result in linear algebra (see , p.21): if a finite group acts linearly on a finite dimensional vector space V, then . Let be the inclusion. Define . The image of f is in ℱ. If is the projection then . If , then for all so that . Therefore and . If is cyclic this simplifies to .
(3) The proof Theorem 5.1 does not require to be a graph. If A is a group acting as automorphism on G, then is only a chain, not a graph.
Examples (1) Let G be the complete graph . Its automorphism group has n! elements. The orbifold graph is a single point. The average Lefschetz number is 1.
(2) Let G be cycle graph . The automorphism group is the dyadic group with 2n elements. The orbigraph is again a single point. The average Lefschetz number is 1.
(3) Let G be the discrete graph . Its automorphism group is the full permutation group again. The orbifold graph is a single point. The average Lefschetz number is 1.
(4) Let G be the octahedron. Its automorphism group has 48 elements. The orbigraph is again a single point and the average Lefschetz number is 1.
Remark The analogue statement for manifolds needs more algebraic topology like the Leray-Serre spectral sequence : if a manifold G has a finite group of symmetries, then the average Lefschetz number of all the symmetry transformations T is the Euler characteristic of the orbifold .
6 Lefschetz zeta function
Having a Lefschetz number, it is custom to define a Lefschetz zeta function which encodes the Lefschetz numbers of iterates of the graph automorphism T. Zeta functions are one of those objects which are interesting in any mathematical field, whether it is number theory, complex analysis, topology, dynamical systems or algebraic geometry. In the case of graph theory, it is a situation where one can see basic ideas like analytic continuation work. For any pair , where T is an automorphism of a finite simple graph, we can construct an explicit rational function . The product formula we will derive allows to compute this function by hand for small graph dynamical systems.
Definition The Lefschetz zeta function of an automorphism T of a graph G is defined as
For example, T is a reflection of a circular graph where and , we have
The Lefschetz zeta function is an algebraic version of the Artin-Mazur zeta function . It is already interesting for the identity since
Proposition 6.1 is a rational function.
Proof By definition we see that for every k and so
The Lefschetz formula allows to write this as a product over periodic simplex orbits. Let denote the set of fixed simplices of . Then
Since , where is the determinant of the permutation induced on the simplex, we can write this as , a quotient of two dynamical systems zeta function
with giving the sign of the permutation.
Definition Let be the set of periodic orbits of minimal period p. They are called prime orbits. Let rsp. be the number of odd dimensional prime periodic orbits for which has positive rsp. negative signature. Let rsp. be the number of odd-dimensional prime periodic orbits for which has positive (rsp.) negative signature.
One only has to remember: ‘signature and z-sign flip flop’ and ‘dimension has exponents odd on top’.
Theorem 6.2 (Product formula)
The zeta function of an automorphism T on a simple graph G is the rational function
Proof Because prime periods are smaller or equal than the product of the cycle lengths of the permutation, the product is finite. While we can follow the computation from the book  almost verbatim, there is a twist: since the permutation part of the index is multiplicative when iterating an orbit, the dimension part is not. If the dimension is odd, then each transformation step changes the sign in the inner sum of the zeta function. If we write , where is the sign of the permutation, then only the ϕ part is multiplicative. Let x be a periodic orbit of minimal period p. If we loop it q times, we can write . As in :
The definition (4) gives (substituting in the third identity):
It is in the last identity that we have split up ℱ into 4 classes, depending on whether the dimension is even or odd or whether the permutation on x is even or odd. If the signature is −1, then this produces an alternating sum before the log comes in which leads to a factor depending on the dimension. If the signature is 1, then we have factors depending on the dimension. □
Corollary 6.3 If G is the union of two disjoint graphs , and T is an automorphism of G inducing automorphisms on , then
Proof The numbers , , , are additive. □
(1) As in number theory, product formulas are typical for zeta function. The prototype is the Euler product formula or so called golden key
where was plugged in just to get formally more close to the dynamical formula above and explain the etymology of the dynamical-zeta function.
(2) One usually asks for a functional equation in the case of zeta functions. If the number of even dimensional and odd dimensional fixed points correspond, we have a symmetry .
Examples (1) For , we have and so that .
(2) For a reflection T at , we have two periodic vertex orbit of period , one periodic vertex orbit of period 2 and two edge orbits of period 2. The product formula gives
(3) For a rotation T of , we have a periodic vertex orbit of period 4 and a periodic edge orbits of period 4. The product formula gives 1. This follows also directly from the definition since for all k.
(4) For any automorphism T of the complete graph , we have so that .
(5) For the identity on the Petersen graph, we have 10 fixed vertices of index 1 and 15 edges of index −1. The identity reflects the fact that .
Finite graphs have finite automorphism groups so that one can look at
Corollary 6.4 is a rational function.
Proof It is a finite product of rational functions. □
Corollary 6.5 If G is the union of two disjoint graphs , then
Proof This follows from Corollary 6.3. □
Examples (1) We have seen for reflections and for rotations so that .
(2) If G has a trivial automorphism group, the product formula is equivalent to the Euler-Poincaré formula and .
(3) For the complete graph , we have . The order of the pole at is the size of the automorphism group.
(4) For the Petersen graph, we computed
Remark There are other zeta functions for graphs. The Ihara zeta function  is defined as , where p runs over all closed prime paths in the graph and is its length. For , it is because there are only two prime paths and both have length n. The Ihara zeta function appears unrelated to the above zeta function and is closer to the Selberg zeta function , where the geodesic flow play the role of automorphism. Both are of course isomorphism invariants. Unlike the average Lefschetz number , which is also an isomorphism invariant, the zeta function encodes more information about the graph than .
Figures 1-6 provide examples of graphs for which the Zeta function and the Lefschetz number have been computed for all automorphisms.
Bohl P: Ueber die Bewegung eines mechanischen Systems in der Nähe einer Gleichgewichtslage. J. Reine Angew. Math. 1904, 127: 179–276.
Zeidler E: Nonlinear Functional Analysis and Its Applications I. Springer, New York; 1986.
Brouwer LEJ: Über Abbildung von Mannigfaltigkeiten. Math. Ann. 1911, 71(1):97–115. 10.1007/BF01456931
Hatcher A: Algebraic Topology. Cambridge University Press, Cambridge; 2002.
Milnor J: Topology from the Differential Viewpoint. University of Virginia Press, Charlottesville; 1965.
Guillemin V, Pollack A: Differential Topology. Prentice Hall, New York; 1974.
Kakutani S: A generalization of Brouwer’s fixed point theorem. Duke Math. J. 1941, 8: 457–459. 10.1215/S0012-7094-41-00838-4
Franklin JN Classics in Applied Mathematics 37. In Methods of Mathematical Economics: Linear and Nonlinear Programming, Fixed-Point Theorems. SIAM, Philadelphia; 2002.
Lefschetz S: Introduction to Topology. Princeton University Press, Princeton; 1949.
Hopf H: A new proof of the Lefschetz formula on invariant points. Proc. Natl. Acad. Sci. USA 1928, 14: 149–153. 10.1073/pnas.14.2.149
Dieudonne J: A History of Algebraic and Differential Topology, 1900–1960. Birkhäuser, Basel; 1989.
Granas A, Dugundji J Springer Monographs in Mathematics. In Fixed Point Theory. Springer, New York; 2003.
Gale D: The game of Hex and the Brouwer fixed-point theorem. Am. Math. Mon. 1979, 86(10):818–827. 10.2307/2320146
Mazurkiewicz S, Knaster B, Kuratowski C: Ein Beweis des Fixpunktsatzes für n -dimensional Simplexe. Fundam. Math. 1929, 14: 132–137.
Jezierski J, Marzantowicz W: Homotopy Methods in Topological Fixed and Periodic Points Theory. Springer, Dordrecht; 2006.
Spanier EH: Algebraic Topology. Springer, Berlin; 1966.
Knill, O: On index expectation and curvature for networks (2012). http://arxiv.org/abs/1202.4514
Artin M, Mazur B: On periodic points. Ann. Math. 1965, 81: 82–99. 10.2307/1970384
Ruelle D CRM Monograph Series. In Dynamical Zeta Functions for Piecewise Monotone Maps of the Interval. Am. Math. Soc., Providence; 1991.
Bowen R, Lanford OE III: Zeta functions of restrictions of the shift transformation. In Global Analysis (Proc. Sympos. Pure Math., Vol. XIV, Berkeley, Calif., 1968). Am. Math. Soc., Providence; 1970:43–49.
Nowakowski R, Rival I: Fixed-edge theorem for graphs with loops. J. Graph Theory 1979, 3: 339–350. 10.1002/jgt.3190030404
Espínolaa R, Krirkb WA: Fixed point theorems in r -trees with applications to graph theory. Topol. Appl. 2006, 153: 1046–1055. 10.1016/j.topol.2005.03.001
Eckmann B: The Euler characteristic - a few highlights in its long history. Mathematical Survey Lectures: 1943–2004 1999.
Edelsbrunner H, Harer J: Computational Topology: An Introduction. Am. Math. Soc., Providence; 2010.
Knill, O: A graph theoretical Poincaré-Hopf theorem (2012). http://arxiv.org/abs/1201.1162
Knill, O: A graph theoretical Gauss-Bonnet-Chern theorem (2011). http://arxiv.org/abs/1111.5395
Erdös P, Rényi A: On random graphs. I. Publ. Math. (Debr.) 1959, 6: 290–297.
Gross JL, Tucker TW: Topological Graph Theory. Wiley, New York; 1987.
Hirzebruch F, Zagier D Mathematics Lecture Series 3. In The Atiyah-Singer Theorem and Elementary Number Theory. Publish or Perish Inc., Boston; 1974.
Ebert, J: Euler characteristic of orbifolds (2011). http://mathoverflow.net/questions/51993/euler-characteristic-of-orbifolds
Terras A Cambridge Studies in Advanced Mathematics 128. In Zeta Functions of Graphs. Cambridge University Press, Cambridge; 2011.
Thanks go to Tom Tucker for clarifying some notions on groups acting on graphs and thanks to Hao Xu for pointing out some typos in an earlier version.
The author declares that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Knill, O. A Brouwer fixed-point theorem for graph endomorphisms. Fixed Point Theory Appl 2013, 85 (2013). https://doi.org/10.1186/1687-1812-2013-85
- graph theory
- graph endormorphisms
- Lefschetz number
- Euler characteristic
- Brouwer fixed point
- dynamical zeta function