A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Brouwer Fixed Point Theorem (Homological Proof)

Research Depth 111 in the knowledge graph I know this Set as goal
1topic build on this
488prerequisites beneath it
See this on the map →
Degree Theory for Maps of SpheresSingular Homology Groups+1 moreThe Lefschetz Fixed Point Theorem
algebraic-topology brouwer-fixed-point applications degree-theory

Core Idea

The Brouwer fixed point theorem states that every continuous map f : Dn -> Dn has a fixed point: there exists x in Dn with f(x) = x. The homological proof proceeds by contradiction: if f had no fixed point, we could construct a retraction r : Dn -> Sn-1 = boundary(Dn), but no such retraction exists because it would force the identity on H_{n-1}(Sn-1) = Z to factor through H_{n-1}(Dn) = 0. This argument showcases how algebraic topology converts a geometric claim into an algebraic impossibility.

Explainer

The Brouwer fixed point theorem is one of the most famous results in topology, with applications across mathematics, economics (Nash equilibrium), and physics. The statement is simple: every continuous map from the closed n-disk Dn to itself has at least one fixed point. The proof using homology is clean, elegant, and illustrates the "algebraic topology method" perfectly: assume the conclusion fails, derive an algebraic consequence, and show the algebraic consequence is impossible.

The proof has two steps. Step 1: show that if f : Dn -> Dn has no fixed point, then there exists a retraction r : Dn -> Sn-1 (a continuous map that is the identity on Sn-1). Construction: for each x in Dn, since f(x) != x, the ray from f(x) through x is well-defined and intersects Sn-1 at a unique point r(x). When x is already on Sn-1, the ray from f(x) through x hits the boundary at x itself (since f(x) is in Dn, which is "behind" x relative to the outward direction). So r is the identity on Sn-1, making it a retraction.

Step 2: show that no retraction Dn -> Sn-1 can exist. If r : Dn -> Sn-1 is a retraction and i : Sn-1 hookrightarrow Dn is the inclusion, then r compose i = id on Sn-1. On homology: r_* compose i_* = id_* on H_{n-1}(Sn-1) = Z. But i_* : H_{n-1}(Sn-1) -> H_{n-1}(Dn), and H_{n-1}(Dn) = 0 (since Dn is contractible), so i_* is the zero map. Therefore r_* compose i_* = 0, but id_* is the identity on Z. The identity on Z is not the zero map. Contradiction.

This proof is a paradigm of the algebraic topology method. The original problem (existence of a fixed point) is a statement about continuous maps between geometric objects. Algebraic topology translates it into a statement about group homomorphisms (the identity on Z cannot factor through the zero group), which is obviously true. The "hard work" is done by the homology functor: it converts the geometric situation (no retraction exists) into an algebraic impossibility (a nonzero map cannot factor through zero). The proof works uniformly in all dimensions, unlike approaches based on the fundamental group (which only work in dimension 2) or on smooth approximation and Sard's theorem (which require more technical machinery).

The Brouwer theorem generalizes in several directions. The Lefschetz fixed point theorem replaces the disk with any compact polyhedron and gives a numerical criterion (the Lefschetz number) for the existence of fixed points. The Schauder fixed point theorem extends Brouwer to infinite-dimensional convex compact sets in Banach spaces. In economics, the Brouwer theorem (via its close relative, the Kakutani fixed point theorem) is the key ingredient in proving the existence of Nash equilibria in game theory. In numerical analysis, the Brouwer theorem guarantees the existence of solutions to certain systems of nonlinear equations. The homological proof not only establishes the theorem but explains WHY it is true: the disk has the "wrong" homology to admit a retraction onto its boundary.

Practice Questions 4 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic and Transcendental ElementsSplitting FieldsFinite FieldsGalois GroupsFundamental Theorem of Galois TheorySecond Isomorphism Theorem for GroupsDirect Products of GroupsClassification of Finite Abelian GroupsChain Complexes and the Boundary OperatorExact Sequences in Homological AlgebraThe Snake LemmaRelative Homology and the Long Exact Sequence of a PairThe Excision TheoremThe Mayer-Vietoris SequenceHomology of SpheresHigher Homotopy GroupsThe Hurewicz TheoremDegree Theory for Maps of SpheresBrouwer Fixed Point Theorem (Homological Proof)

Longest path: 112 steps · 488 total prerequisite topics

Prerequisites (3)

Leads To (1)