Math 2.0

Algebraic topology Fixed points and degree Theorem

Brouwer fixed-point theorem

Builds on Closed ballContinuous mapFixed-point propertyRetractNo-retraction theoremIntermediate value theoremConvex setLefschetz fixed-point theorem

Statement

Let n≥1n \ge 1 and let Dn={x∈ℝn:∥x∥≤1}D^n = \set{x \in \R^n : \norm{x} \le 1} be the closed unit ball. Every continuous map f ⁣:Dn→Dnf \colon D^n \to D^n has a fixed point: there is x∈Dnx \in D^n with f(x)=xf(x) = x.

Remarks

The idea of the proof: suppose f(x)≠xf(x) \neq x for all xx. Send xx to the point where the ray from f(x)f(x) through xx leaves the ball; this is a continuous retraction of DnD^n onto the sphere Sn−1S^{n-1} that fixes Sn−1S^{n-1}. No such retraction exists by the no-retraction theorem, because Hn−1(Sn−1)≠0H_{n-1}(S^{n-1}) \neq 0 for n≥2n \ge 2 while DnD^n is contractible; for n=1n = 1 the intermediate value theorem applied to f(x)−xf(x) - x suffices. The theorem is also the case of a closed ball in the Lefschetz fixed-point theorem, since L(f)=1L(f) = 1 for every self-map of a contractible compact polyhedron. In the language of the fixed-point property, it says that DnD^n has this property. So does every space homeomorphic to DnD^n, such as every compact convex set of ℝn\R^n with nonempty interior. Each hypothesis matters: the translation x↦x+1x \mapsto x + 1 of the non-compact space ℝ\R has no fixed point. The rotation z↦−zz \mapsto -z of the circle S1S^1, which is compact but has a hole, has none either.

Going deeper

For a student

The theorem is the basic existence tool behind many other fixed-point results. Schauder's theorem extends it to compact convex sets in normed spaces, and Kakutani's theorem to set-valued maps, which is how Nash proved the existence of equilibria in games. Its proofs connect several subjects: degree theory, homology, the no-retraction theorem, and combinatorial arguments through Sperner's lemma.

Reading path

To understand this page from the ground up, read these 20 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Closed ball concept
  2. Compact space concept
  3. Continuous map concept
  4. Convex set concept
  5. Euler characteristic concept
  6. Fixed-point property concept
  7. Lefschetz number concept
  8. Limit point of a set definition
  9. Reduced homology concept
  10. Retract concept
  11. Simplicial complex concept
  12. Singular homology concept
  13. n-sphere object
  14. No-retraction theorem statement
  15. Lefschetz fixed-point theorem statement
  16. Limit of a function definition
  17. Continuity at a point definition
  18. Continuous function definition
  19. Intermediate value theorem statement
  20. Brouwer fixed-point theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Brouwer_fixed-point_theorem
About this page
TagN7AAJ2MW5T
URIm2://N7AAJ2MW5T
Kindstatement, theorem
WritingW0 stub
MSC55M20, 54H25
StatusThis copy of the site has no build data. Run m2 status N7AAJ2MW5T.
AboutFixed-point property
UsesClosed ball, Continuous map, Fixed-point property, Retract, No-retraction theorem, Intermediate value theorem, Convex set, Lefschetz fixed-point theorem
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.