Abstract
Brouwer’s fixed point theorem from 1911 is a basic result in topology—with a wealth of combinatorial and geometric consequences. In these lecture notes we present some of them, related to the game of HEX and to the piercing of multiple intervals. We also sketch stronger theorems, due to Oliver and others, and explain their applications to the fascinating (and still not fully solved) evasiveness problem.
Notes
- 1.
Using “he” here is not politically correct.
- 2.
This kind of problem is certainly not restricted to combinatorics. For example, if \(\mathcal{S}\) is the system of all open sets in a topological space, \(\tau (\mathcal{S})\) is the minimum size of a dense set and is called the density , while \(\nu (\mathcal{S})\) is known as the Souslin number or cellularity of the space. In 1920, Souslin asked whether a linearly ordered topological space exists (the open sets are unions of open intervals) with countable ν but uncountable τ. It turned out in the 1970s that the answer depends on the axioms one is willing to assume beyond the usual (ZFC) axioms of set theory. For example, it is yes if one assumes the continuum hypothesis; see e.g. [23].
- 3.
In fact, it suffices to require f(F) ⊆ F for each facet of P (that is, for each face of dimension dim(P) − 1), since each face is the intersection of some facets.
- 4.
See [52] for a detailed discussion of simplicial complexes, their geometric realizations, etc. In particular, we use the notation ∥K∥ for the polyhedron (the geometric realization of a simplicial complex \(\Delta\)).
References
M. Aigner, G.M. Ziegler, Proofs from THE BOOK, 5th edn. (Springer, Heidelberg, 2014)
N. Alon, Piercing d-intervals. Discret. Comput. Geometry 19, 333–334 (1998)
N. Alon, Covering a hypergraph of subgraphs. Discret. Math. 257, 249–254 (2002)
N. Alon, D. Kleitman, Piercing convex sets and the Hadwiger Debrunner ( p, q)-problem. Adv. Math. 96, 103–112 (1992)
N. Amenta, M. Bern, D. Eppstein, S.-H. Teng, Regression depth and center points. Discret. Comput. Geomet. 23, 305–323 (2000)
K. Baclawski, A. Björner, Fixed points in partially ordered sets Adv. Math. 31, 263–287 (1979)
I. Bárány, V.S. Grinberg, Block partitions of sequences. Israel J. Math. 206, 155–164 (2015)
E. Berger, KKM – a topological approach for trees. Combinatorica 25, 1–18 (2004)
E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways. Vol. 2: Games in Particular (Academic Press, London, 1982)
M.R. Best, P. van Emde Boas, H.W. Lenstra Jr., A sharpened version of the Anderaa–Rosenberg conjecture. Technical Report ZW 30/74, Mathematisch Centrum Amsterdam, Afd. Zuivere Wisk., 1974, 20 pp.
A. Björner, Combinatorics and topology. Not. Am. Math. Soc. 32, 339–345 (1985)
A. Björner, Topological methods, Chap. 34, in Handbook of Combinatorics, vol. II, ed. by R. Graham, M. Grötschel, L. Lovász (North Holland, Amsterdam), pp. 1819–1872
D. Blackwell, M.A. Girshick, Theory of Games and Statistical Decisions (Wiley, New York, 1954)
P.V.M. Blagojević, G.M. Ziegler, Beyond the Borsuk-Ulam theorem: the topological tverberg story. In this volume
B. Bollobás, Extremal Graph Theory (Academic Press, London, 1978)
B. Bollobás, S.E. Eldridge, Packings of graphs and applications to computational complexity. J. Combin. Theory Ser. B 25, 105–124 (1978)
A.V. Bondarenko, M.S. Viazovska, Spherical designs via Brouwer fixed point theorem. SIAM J. Discret. Math. 24, 207–217 (2010)
G.E. Bredon, Introduction to Compact Transformation Groups (Academic Press, New York, 1972)
G. Bredon, Topology and Geometry. Graduate Texts in Mathematics, vol. 139 (Springer, New York 1993)
L.E.J. Brouwer, Über Abbildungen von Mannigfaltigkeiten, Math. Annalen 71, 97–115 (1911)
R.F. Brown, The Lefschetz Fixed Point Theorem (Scott, Foresman and Co., Glenview, 1971)
C. Browne, HEX Strategy (A K Peters, Wellesley, 2000)
R. Engelking, General Topology (PWN, Warszawa, 1977)
G.J. Fisher, Computer recognition and extraction of planar graphs from their incidence matrix. IEEE Trans. Circuit Theory 2(CT-17), 154–163 (1966)
E.E. Floyd, On periodic maps and the euler characteristics of the associated spaces. Trans. Am. Math. Soc. 72, 138–147 (1952)
Z. Füredi, Maximum degree and fractional matching in uniform hypergraphs. Combinatorica 1, 155–162 (1981)
D. Gale, The game of Hex and the Brouwer fixed-point theorem. Am. Math. Mon. 86, 818–827 (1979)
M. Gardner. The Scientific American Book of Mathematical Games and Diversions (Simon and Schuster, New York, 1958). Reprinted in “Hexaflexagons, Probability Paradoxes, and the Tower of Hanoi” (Mathematical Association of America, Cambridge University Press, 2008)
M. Gardner, Mathematical Carnival, updated and revised edn. (Mathematical Association of America, Washington, DC, 1989)
D. Gorenstein, Finite Groups, 2nd edn. (Chelsea Publishing Company, New York, 1980). Reprint by AMS Chelsea Publishing, 2007
A. Gyárfás, J. Lehel, A Helly-type problem in trees, in Combinatorial Theory and Applications, ed. by P. Erdős et al. Colloquia Mathematica Societatis Janos Bolyai, vol. 4 (North-Holland, Amsterdam, 1970), pp. 57–1584
A. Gyárfás, J. Lehel, Covering and coloring problems for relatives of intervals. Discret. Math. 55, 167–180 (1985)
A.W. Hales, R.I. Jewett, Regularity and positional games. Trans. Am. Math. Soc. 106, 222–229 (1963)
S. Hell, On a topological fractional Helly theorem. Preprint, June 2005, 11 pp. arXiv:math/0506399
J. Hopcroft, R. Tarjan, Efficient planarity testing. J. ACM 21, 549–568 (1974)
N. Illies, A counterexample to the generalized Aanderaa–Rosenberg conjecture. Inf. Process. Lett. 7, 154–155 (1978)
T.R. Jensen, B. Toft, Graph Coloring Problems (Wiley-Interscience, New York, 1995)
J. Kahn, M. Saks, D. Sturtevant, A topological approach to evasiveness. Combinatorica 4, 297–306 (1984)
T. Kaiser, Transversals of d-intervals. Discret. Comput. Geomet. 18, 195–203 (1997)
T. Kaiser, Piercing problems and topological methods. Doctoral dissertation, Department of Applied Mathematics, Charles University, Prague, 1998
T. Kaiser, Y. Rabinovich, Intersection properties of families of convex (n, d)-bodies. Discret. Comput. Geomet. 21, 275–287 (1999)
D.J. Kleitman, D.J. Kwiatowski, Further results on the Aanderaa–Rosenberg conjecture. J. Combin. Theory Ser. B 28, 85–95 (1980)
B. Knaster, C. Kuratowski, S. Mazurkiewicz, Ein Beweis des Fixpunktsatzes für n-dimensionale Simplexe. Fundamenta Mathematicae 14, 132–137 (1929)
S. Kryński, Remarks on matroids and Sperner’s lemma. Europ. J. Comb. 11, 485–488 (1990)
B. Lindström, On Matroids and Sperner’s Lemma Europ. J. Comb. 2, 65–66 (1981)
M. de Longueville, 25 years proof of the Kneser conjecture – the advent of topological combinatorics. EMS-Newsletter 53, 16–19 (2004)
M. de Longueville, A Course in Topological Combinatorics. Universitext (Springer, New York, 2013)
L. Lovász, Matroids and Sperner’s Lemma Europ. J. Comb. 1, 65–66 (1980)
F.H. Lutz, Examples of \(\mathbb{Z}\)-acyclic and contractible vertex-homogeneous simplicial complexes. Discret. Comput. Geom. 27, 137–154 (2002)
P. Mani, Zwei kombinatorische Sätze vom Typ Sperner–Tucker–Ky Fan. Monatshefte Math. Physik 71, 427–435 (1967)
J. Matoušek, Lower bounds on the transversal numbers of d-intervals. Discret. Comput. Geom. 26, 283–287 (2001)
J. Matoušek, Using the Borsuk–Ulam Theorem, revised second printing 2008 (Springer, Berlin/Heidelberg, 2003)
K. Mehlhorn, Data Structures and Efficient Algorithms. Vol. 2: Graph Algorithms and NP-Completeness (Springer, Berlin, 1984)
K. Mehlhorn, P. Mutzel, On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. Algorithmica 16, 233–242 (1996)
C.A. Miller, Evasiveness of graph properties and topological fixed point properties. Found. Trends Theor. Comput. Sci. 7(4), 337–415 (2011)
E.C. Milner, D.J.A. Welsh, On the computational complexity of graph theoretical properties, in Proceedings of the Fifth British Combinatorial Conference, Aberdeen, 1975, ed. by C.S.J.A. Nash-Williams, J. Sheehan (Utilitas Mathematica, Winnipeg, 1976), pp. 471–487
J. Milnor, A Nobel prize for John Nash. Math. Intell. 17(3), 11–17 (1995)
J.R. Munkres, Elements of Algebraic Topology (Addison-Wesley, Reading, 1984)
J.R. Munkres, Topology. A First Course, 2nd edn. (Prentice-Hall, Englewood Cliffs, 2000)
R. Oliver, Fixed-point sets of group actions on finite acyclic complexes. Commentarii Math. Helvetii 50, 155–177 (1975)
D. Quillen, Homotopy properties of the poset of non-trivial p-subgroups of a group. Adv. Math. 28, 101–128 (1978)
R. Rivest, S. Vuillemin, A generalization and proof of the Aanderaa–Rosenberg conjecture, in Proceedings of the 7th Annual Symposium on Theory of Computing, Albuquerque, 1975 (ACM, 1976), pp. 6–11
R. Rivest, S. Vuillemin, On recognizing graph properties from adjacency matrices. Theor. Comput. Sci. 3, 371–384 (1978)
E.A. Ramos, Equipartition of mass distributions by hyperplanes. Discret. Comput. Geomet. 15, 147–167 (1996)
A.L. Rosenberg, On the time required to recognize properties of graphs: a problem. SIGACT News 5, 15–16 (1973)
J. Sgall, Solution of a covering problem related to labelled tournaments. J. Graph Theory 23, 111–118 (1996)
J.H. Shapiro, A Fixed-Point Farrago. Undergraduate Texts in Mathematics (Springer, New York, 2016)
P.A. Smith, Transformations of finite period. Ann. Math. 39, 127–164 (1938)
P.A. Smith, Fixed point theorems for periodic transformations. Am. J. Math. 63, 1–8 (1941)
S.D. Smith, Subgroup Complexes. Mathematical Surveys and Monographs, vol. 179 (American Mathematical Society, Providence, 2011)
E. Sperner, Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes. Abh. Math. Sem. Hamburg VI, 265–272 (1928)
J. Stillwell, Classical Topology and Combinatorial Group Theory. Graduate Texts in Mathematics, vol. 72, 2nd edn. (Springer, New York, 1993)
F.E. Su, Borsuk–Ulam implies Brouwer: a direct construction. Am. Math. Mon. 104, 855–859 (1997)
G. Tardos, Transversals of 2-intervals, a topological approach. Combinatorica 15, 123–134 (1995)
C. Thomassen, The Jordan–Schönflies theorem and the classification of surfaces. Am. Math. Mon. 99, 116–130 (1992)
A.C.-C. Yao, Monotone bipartite graph properties are evasive. SIAM J. Comput. 17, 517–520 (1988)
G.M. Ziegler, Shelling polyhedral 3-balls and 4-polytopes. Discret. Comput. Geomet. 19, 159–174 (1998)
G.M. Ziegler, Generalized Kneser coloring theorems with combinatorial proofs. Inventiones Math. 147, 671–691 (2002)
Acknowledgements
We are grateful to Marie-Sophie Litz and to the referees for very careful reading and a great number of very valuable comments and suggestions on the manuscript. Thanks to Moritz Firsching and Stephen D. Smith, and in particular to Penny Haxell, for additional references and very helpful explanations.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix: Fixed Point Theorems and Homology
Appendix: Fixed Point Theorems and Homology
1.1 Lefschetz’ Theorem
Fixed point theorems are “global–local tools”: From global information about a space (such as its homology) they derive local effects, such as the existence of special points where “something happens.” Of course, in applications to combinatorial problems we need to combine them with suitable “continuous–discrete tools”: From continous effects, such as topological information about continuous maps of simplicial complexes, we have to find our way back to combinatorial information. In this Appendix we assume familiarity with more Algebra and Algebraic Topology than in other parts of these lecture notes, including some basic finite group theory, chain complexes, etc. As this is meant to be a reference and survey section, no detailed proofs will be given. A main result we head for is Oliver’s Theorem A.7, which is needed in Sect. 4. On the way to this, skim or skip, depending on your tastes and familiarityFootnote 4 with these notions.
A powerful tool on our agenda (which yields a classical proof for Brouwer’s fixed point theorem and some of its extensions) is Hopf’s trace theorem. For this let V be any finite-dimensional vector space, or a free abelian group of finite rank. When we consider an endomorphism g: V ⟶ V then the trace trace(g) is the sum of the diagonal elements of the matrix that represents g. The trace is independent of the basis chosen for V. In the case when V is a free abelian group, then trace(g) is an integer.
Theorem A.1 (The Hopf trace theorem)
Let \(\Delta\) be a finite simplicial complex, let \(f: \ \|\Delta \|\ \longrightarrow \ \|\Delta \|\) be a self-map, and denote by f #i resp. f ∗i the maps that f induces on i-dimensional chain groups resp. homology groups.
Using an arbitrary field of coefficients k , one has
The same identity holds if we use integer coefficients, and compute the traces for homology in the quotients \(H_{i}(\Delta, \mathbb{Z})/T_{i}(\Delta, \mathbb{Z})\) of the homology groups modulo their torsion subgroups; these quotients are free abelian groups.
This theorem is remarkable as it allows to compute a topological invariant that depends solely on the homotopy class of f, by means of a simple combinatorial counting. The proof for this uses the definition of simplicial homology, and simple linear algebra; we refer to Munkres [58, Thm. 22.1] or Bredon [19, Sect. IV.23].
For an arbitrary coefficient field k, the Lefschetz number of the map \(f: \ \|\Delta \|\ \longrightarrow \ \|\Delta \|\) is defined as
Similarly, taking integral homology modulo torsion, the integral Lefschetz number is defined as
The universal coefficient theorems imply that one always has \(L_{\mathbb{Q}}(f) = L(f)\): Thus the integral Lefschetz number L(f) can be computed in rational homology, but it is an integer.
The Euler characteristic of a complex \(\Delta\) coincides with the Lefschetz number of the identity map \(\mbox{ id}_{\Delta }: \ \|\Delta \|\ \longrightarrow \ \|\Delta \|\),
Thus the Hopf trace theorem yields that the Euler characteristic of a finite simplicial complex \(\Delta\) can be defined resp. computed without a reference to homology, simply as the alternating sum of the face numbers of the complex \(\Delta\), where \(f_{i} = f_{i}(\Delta )\) denotes the number of i-dimensional faces of \(\Delta\):
This is then a finite sum that ends with \((-1)^{d}f_{d}(\Delta )\) if \(\Delta\) has dimension d. Thus the Hopf trace theorem applied to the identity map just reproduces the Euler–Poincaré formula. This proves, for example, the d-dimensional Euler polyhedron formula, not only for polytopes, but also for general spheres, shellable or not (as discussed in Ziegler [77]). The Hopf trace formula also has powerful combinatorial applications, see Ziegler [78]. However, for us its main consequence is the following theorem, which is a vast generalization of the Brouwer fixed point theorem.
Theorem A.2 (The Lefschetz fixed point theorem)
Let \(\Delta\) be a finite simplicial complex, and k an arbitrary field. If a self-map \(f: \ \|\Delta \|\ \longrightarrow \ \|\Delta \|\) has Lefschetz number L k (f) ≠ 0, then f and every map homotopic to f have a fixed point.
In particular, if \(\Delta\) is \(\mathbb{Z}_{p}\) -acyclic for some prime p, then every continuous map \(f: \ \|\Delta \|\ \longrightarrow \ \|\Delta \|\) has a fixed point.
(A complex is \(\mathbb{Z}_{p}\)-acyclic if its reduced homology with \(\mathbb{Z}_{p}\)-coefficients vanishes. That is, in terms of homology it looks like a contractible space, say a d-ball.)
Proof (Sketch)
For a finite simplicial complex \(\Delta\), the polyhedron \(\|\Delta \|\) is compact. So if f does not have a fixed point, there is some ɛ > 0 such that | f(x) − x | > ɛ for all \(x \in \Delta\). Now take a subdivision \(\Delta '\) of \(\Delta\) into simplices of diameter smaller than ɛ, and a simplicial approximation of error smaller than ɛ∕2, so that the simplicial approximation \(f': \Delta ' \rightarrow \Delta '\), which is homotopic to f, does not have a fixed point, either.
Now apply the trace theorem to see that L k (f) is zero, contrary to the assumption, where the induced map f ∗0 ′ = f ∗0 in 0-dimensional homology is the identity. □
Note that Brouwer’s fixed point Theorem 2.4 is the special case of Theorem A.2 when \(\Delta\) triangulates a ball.
For a reasonably large class of spaces, a converse to the Lefschetz fixed point theorem is also true: If L(f) = 0, then f is homotopic to a map without fixed points. See Brown [21, Chap. VIII].
1.2 The Theorems of Smith and Oliver
In addition to the usual game of connections between graphs, posets, complexes and spaces, we will now add groups. Namely we will discuss some useful topological effects caused by symmetry, that is, by finite group actions.
A (finite) group G acts on a (finite) simplicial complex \(\Delta\) if each group element corresponds to a permutation of the vertices of \(\Delta\), where composition of group elements corresponds to composition of permutations, in such a way that g(A) : = {gv: v ∈ A} is a face of \(\Delta\) for all g ∈ G and for all \(A \in \Delta\). This action on the vertices is extended to the geometric realization of the complex \(\Delta\), so that G acts as a group of simplicial homeomorphisms \(g: \ \|\Delta \|\ \longrightarrow \ \|\Delta \|\).
The action is faithful if only the identity element in G acts as the identity permutation. In general, the set \(G_{0}\:=\ \{g \in G:\, gv = v\mbox{ for all }v \in \mbox{ vert}(\Delta )\}\) is a normal subgroup of G. Hence we get that the quotient group G∕G 0 acts faithfully on \(\Delta\), and we usually only consider faithful actions. In this case, we can interpret G as a subgroup of the symmetry group of the complex \(\Delta\). The action is vertex transitive if for any two vertices v, w of \(\Delta\) there is a group element g ∈ G with gv = w.
A fixed point (also known as stable point) of a group action is a point \(x \in \|\Delta \|\) that satisfies gx = x for all g ∈ G. We denote the set of all fixed points by \(\Delta ^{G}\). Note that \(\Delta ^{G}\) is in general not a subcomplex of \(\Delta\).
Example A.3
Let \(\Delta = 2^{[3]}\) be the complex of a triangle, and let \(G = \mathbb{Z}_{3}\) be the cyclic group (a proper subgroup of the symmetry group \(\mathfrak{S}_{3}\)), acting such that a generator cyclically permutes the vertices, 1 ↦ 2 ↦ 3 ↦ 1.
This is a faithful action; its fixed point set consists of the center of the triangle only—this is not a subcomplex of \(\Delta\), although it corresponds to a subcomplex of the barycentric subdivision \(\mbox{ sd}(\Delta )\).
Lemma A.4 (Two barycentric subdivisions)
-
(1)
After replacing \(\Delta\) by its barycentric subdivision (informally, let \(\Delta:=\mathrm{ sd}(\Delta )\) ), we get that the fixed point set \(\Delta ^{G}\) is a subcomplex of \(\Delta\) .
-
(2)
After replacing \(\Delta\) once again by its barycentric subdivision (so now \(\Delta:=\mathrm{ sd}^{2}(\Delta ))\) , we even get that the quotient space \(\|\Delta \|/G\) can be constructed from \(\Delta\) by identifying all faces with their images under the action of G. That is, the equivalence classes of faces of \(\Delta\) , with the induced partial order, form a simplicial complex that is homeomorphic to the quotient space \(\|\Delta \|/G\) .
We leave the proof as an exercise. It is not difficult; for details and further discussion see Bredon [18, Sect. III.1].
“Smith Theory” was started by P. A. Smith [69] in the thirties. It analyzes finite group actions on compact spaces (such as finite simplicial complexes), providing relations between the structure of the group to its possible fixed point sets. Here is one key result.
Theorem A.5 (Smith [68])
If P is a p-group (that is, a finite group of order | P | = p t for a prime p and some t > 0), acting on a complex \(\Delta\) that is \(\mathbb{Z}_{p}\) -acyclic, then the fixed point set \(\Delta ^{P}\) is \(\mathbb{Z}_{p}\) -acyclic as well. In particular, it is not empty.
Proof (Sketch)
The key is that, with the preparations of Lemma A.4, the maps that f induces on the chain groups (with \(\mathbb{Z}_{p}\) coefficients) nicely restrict to the chain groups on the fixed point set \(\Delta ^{P}\). Passing to traces and using the Hopf trace theorem, one can derive that \(\Delta ^{P}\) is non-empty. A more detailed analysis leads to the “transfer isomorphism” in homology, which proves that \(\Delta ^{P}\) must be acyclic.
See Bredon [18, Thm. III.5.2] and Oliver [60, p. 157], and also de Longueville [47, Appendix D and E]. □
On the combinatorial side, one has an Euler characteristic relation due to Floyd [25] [18, Sect. III.4]:
If P is a p-group (in particular for \(P = \mathbb{Z}_{p}\)), then this implies that
using induction on t, where | P | = p t.
Theorem A.6 (Oliver [60, Lemma I])
If \(G = \mathbb{Z}_{n}\) is a cyclic group, acting on a \(\mathbb{Q}\) -acyclic complex \(\Delta\) , then the action has a fixed point.
In this case the fixed point set \(\Delta ^{G}\) has the Euler characteristic of a point, \(\chi (\Delta ^{G}) = 1\) .
Proof
The first statement follows directly from the Lefschetz fixed point theorem: Any cyclic group is generated by a single element g, this element has a fixed point, this fixed point of g is also a fixed point of all powers of g, and hence of the whole group G.
For the second part, take p t to be a maximal prime power that divides n, consider the corresponding subgroup isomorphic to \(\mathbb{Z}_{p^{t}}\), and use induction on t and the transfer homomorphism, as for the previous proof. □
Unfortunately, results like these may give an overly optimistic impression of the generality of fixed point theorems for acyclic complexes. There are fixed point free finite group actions on balls: Examples were constructed by Floyd and Richardson and others; see Bredon [18, Sect. I.8].
On the positive side we have the following result due to Oliver, which plays a central role in Sect. 4.5.
Theorem A.7 (Oliver’s Theorem I [60, Prop. I])
If G has a normal subgroup P ⊲ G that is a p-group, such that the quotient G∕P is cyclic, acting on a complex \(\Delta\) that is \(\mathbb{Z}_{p}\) -acyclic, then the fixed point set \(\Delta ^{G}\) is \(\mathbb{Z}_{p}\) -acyclic as well. In particular, it is not empty.
This is as much as we will need in this chapter. Oliver proved, in fact, a more general and complete theorem that includes a converse.
Theorem A.8 (Oliver’s Theorem II [60])
Let G be a finite group. Every action of G on a \(\mathbb{Z}_{p}\) -acyclic complex \(\Delta\) has a fixed point if and only if G has the following structure:
G has normal subgroups P ⊲ Q ⊲ G such that P is a p-group, G∕Q is a q-group (for a prime q that need not be distinct from p), and the quotient Q∕P is cyclic.
In this situation one always has \(\chi (\Delta ^{G}) \equiv 1\bmod q\) .
Notes The Lefschetz–Hopf fixed point theorem was announced by Lefschetz for a restriced class of complexes in 1923, with details appearing three years later. The first proof for the general version was by Hopf in 1929. There are generalizations, for example to Absolute Neighborhood Retracts; see Bredon [19, Cor. IV.23.5] and Brown [21, Chap. IIII]. We refer to Brown’s book [21].
We refer to Bredon [18, Chapter III] for a nice textbook treatment of Smith Theory. The book by de Longueville [47, Appendix E] also has a very accessible discussion of the fixed point theorems of Smith and Oliver. The exercises concerning fixed point sets of poset maps P → P are drawn from Baclawski and Björner [6].
1.2.1 Exercises
-
1.
Verify directly that if f maps ∥T∥ to ∥T∥, where T is a graph-theoretic tree, then f has a fixed point.
How would you derive this from the Lefschetz fixed point theorem?
-
2.
Let P be a poset (finite partially ordered set), and denote by \(\Delta (P)\) its order complex (whose faces are the totally ordered subsets). Suppose that f: P → P is an order-preserving mapping with fixed point set P f: = {x ∈ P∣f(x) = x}.
-
(a)
Show that if \(\Delta (P)\) is acyclic over some field, then
$$\displaystyle{\mu (P^{f}) = 0,}$$where μ(P f) denotes the Möbius function (reduced Euler characteristic) of \(\Delta (P^{f})\). In particular, P f is not empty.
-
(b)
Does it follow also that P f itself is acyclic?
-
(a)
-
3.
Suppose now that f: P → P is order-reversing and let P f : = {x ∈ P∣x = f 2(x) ≤ f(x)}. Show that if \(\Delta (P)\) is acyclic over some field, then
$$\displaystyle{\mu (P_{f}) = 0.}$$In particular, if f has no fixed edge (i.e., no x such that x = f 2(x) < f(x)) then f has a unique fixed point.
Rights and permissions
Copyright information
© 2017 Springer International publishing AG
About this chapter
Cite this chapter
Björner, A., Matoušek, J., Ziegler, G.M. (2017). Using Brouwer’s Fixed Point Theorem. In: Loebl, M., Nešetřil, J., Thomas, R. (eds) A Journey Through Discrete Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-44479-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-44479-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44478-9
Online ISBN: 978-3-319-44479-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)