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

The Lefschetz Fixed Point Theorem

Research Depth 112 in the knowledge graph I know this Set as goal
490prerequisites beneath it
See this on the map →
Brouwer Fixed Point Theorem (Homological Proof)Degree Theory for Maps of Spheres+2 more
algebraic-topology lefschetz-number fixed-points trace applications

Core Idea

The Lefschetz fixed point theorem generalizes the Brouwer fixed point theorem from disks to arbitrary compact polyhedra. For a continuous map f : X -> X on a compact triangulable space, the Lefschetz number L(f) = sum(-1)n tr(f_* : H_n(X; Q) -> H_n(X; Q)) is defined as the alternating sum of traces of the induced maps on rational homology. If L(f) != 0, then f has at least one fixed point. The Brouwer theorem is the special case X = Dn, where L(f) = 1 for any f (since Dn is contractible).

Explainer

The Lefschetz fixed point theorem is a far-reaching generalization of the Brouwer fixed point theorem. Where Brouwer applies only to the disk (or more generally, convex compact sets), the Lefschetz theorem works for any compact triangulable space X and gives a numerical criterion for the existence of fixed points. The key quantity is the Lefschetz number L(f) = sum_{n >= 0} (-1)n tr(f_{*,n}), where f_{*,n} : H_n(X; Q) -> H_n(X; Q) is the induced map on rational homology and tr denotes the trace of the linear map.

The theorem states: if L(f) != 0, then f has at least one fixed point. The contrapositive — if f is fixed-point-free, then L(f) = 0 — is often more useful for showing that certain maps MUST have fixed points. The converse is false: L(f) = 0 does not guarantee that f is fixed-point-free (translations on the torus have L = 0 but the identity is the only fixed-point-free map with L = 0 up to homotopy considerations).

Recovery of Brouwer's theorem: for X = Dn (the closed disk), H_0(Dn; Q) = Q and H_k(Dn; Q) = 0 for k > 0. Any map f : Dn -> Dn induces f_* = id on H_0 (since Dn is connected), so L(f) = tr(id) = 1 != 0. Therefore every continuous self-map of the disk has a fixed point — Brouwer's theorem.

For maps of spheres f : Sn -> Sn with degree d: H_0 = Q (trace 1), H_n = Q (trace d), all others zero. So L(f) = 1 + (-1)n d. For n even: L(f) = 1 + d, which is zero only when d = -1. For n odd: L(f) = 1 - d, which is zero only when d = 1. The antipodal map on S2k has degree (-1)2k+1 = -1, giving L = 0, consistent with the antipodal map being fixed-point-free. The antipodal map on S2k+1 has degree (-1)2k+2 = 1, giving L = 0 as well — and indeed the antipodal map on odd spheres is homotopic to the identity via rotation and need not have a fixed point (though it happens to be fixed-point-free).

The proof of the Lefschetz theorem uses the simplicial approximation of f and a careful count of coincidences between the map and the identity on each simplex. The trace of f_* on homology, by the Hopf trace formula, equals an alternating sum of "local fixed point indices" whenever the fixed points are isolated — the Lefschetz number is a global algebraic count of fixed points, with each fixed point weighted by a local index. When this algebraic count is nonzero, there must be at least one genuine fixed point. The theorem connects beautifully to the Euler characteristic (L(id) = chi(X)), to degree theory (via the trace on top homology), and to the Atiyah-Bott fixed point theorem in differential geometry (a smooth generalization using the Dolbeault complex). It is one of the most satisfying results in algebraic topology, demonstrating how global topological information (the traces on homology) constrains the local behavior (existence of fixed points) of continuous maps.

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)The Lefschetz Fixed Point Theorem

Longest path: 113 steps · 490 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.