Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Lefschetz fixed-point theorem for finite complexes

Statement

Assume AC. Let X be a finite CW complex and f:XX continuous. If its rational Lefschetz number L(f) is nonzero, then f has a fixed point. Equivalently, a fixed-point-free self-map has Lefschetz number zero. No converse from L(f)=0 to absence of fixed points is asserted. AC enters through the Euclidean neighborhood-retract realization of X.

Facts & Assumptions

[F1]

Lefschetz number of a finite CW self-map defines the finite alternating rational homology trace sum, proves its well-definedness, and records homotopy invariance.

[F2]

Hopf trace formula equates alternating chain and homology traces for a bounded finite-dimensional chain complex over a field.

[F3]

Finite CW complexes are Euclidean neighborhood retracts embeds X as a compact Euclidean subset with a retraction from an open neighborhood, under AC.

[F4]

For AMm×n(F) and BMn×m(F), tr(AB)=tr(BA) equates the traces of rectangular products, including zero-dimensional spaces.

[F5]

The Axiom of Choice is assumed for [F3]'s nearest-point and controlled-cell-extension selections.

[F6]

Mesh of iterated simplicial barycentric subdivision tends to zero gives arbitrarily small simplex mesh and bounds each vertex star's diameter by twice the mesh, in the original Euclidean metric.

[F7]

The open star criterion produces a simplicial map turns a star-compatible vertex assignment into a simplicial map with a straight-line homotopy to the original map, the two images of each point lying in the same target simplex.

[F9]

Cellular maps induce cellular chain maps says that a map preserving skeleta induces the relative skeletal chain map and that its homology map is the singular homology map.

[F10]

Relative homology of consecutive CW skeleta identifies the relative skeletal group with one coefficient copy per cell, via the characteristic disks and their quotient spheres.

Proof

Given: X,f as stated. We prove that absence of fixed points implies L(f)=0.

1.1

If X is empty, [F1] gives L(f)=0. Otherwise apply [F3] and identify X with a compact subset of Rm, with a retraction r:OX from an open O. We may increase m to at least one. There is η>0 such that every point at distance less than η from X lies in O. To verify this directly, the balls B(x,a) with xX, a>0 and B(x,3a)O cover X. Choose finitely many covering balls B(xj,aj) and put η=minjaj. If y has distance less than η from X, take zX with yz<η and a covering ball containing z. Then yxj<η+aj2aj, so yO. These are finite choices.

F1F3F5given
2.1

Choose a positive grid length h with mh<η. Take all closed cubes of the grid hZm that meet X. There are finitely many, since X is bounded; their union contains X and lies in O by step 1.1. Triangulate every such cube compatibly as follows. In coordinates yi[0,1] measured from its lower corner, use the regions 0yπ(1)yπ(m)1, for all permutations π. Each region is a simplex: consecutive coordinate differences together with yπ(1) and 1yπ(m) are nonnegative barycentric coordinates summing to one. The vertices are the successive zero-one vectors obtained by turning on coordinates in reverse order. Equalities give the common faces, these regions cover the cube by ordering its coordinates, and on any grid face the rule reduces to the identical ordering rule in the unfixed coordinates. Thus adjacent cube triangulations agree. Include all faces and call the resulting finite Euclidean simplicial complex P. Its realization is compact by [F11], being a finite union of closed bounded simplices. These simplices, with interiors as cells, form a finite CW complex: their boundaries are unions of lower faces and finite closed-set pasting gives the weak topology. Restrict r to P and let i:XP be inclusion. Put F=ifr:PP. A fixed point y=F(y) lies in X, where r(y)=y, so is exactly a fixed point of f; conversely every fixed point of f is fixed by F.

F11step 1.1
3.1

For each degree, write A=if:Hj(X;Q)Hj(P;Q) and B=r:Hj(P;Q)Hj(X;Q). The spaces are finite-dimensional by [F1]. Composition on singular chains gives composition on homology, and ri=idX gives AB=F and BA=f. Hence [F4] proves tr(F)=tr(f) in each degree. Summing the finitely many nonzero degrees yields L(F)=L(f). No homotopy equivalence between P and X has been assumed.

F1F4step 2.1
3.2

Suppose f has no fixed point. Then F has none by step 2.1. The continuous positive function d(y)=F(y)y has a uniform positive lower bound: the open sets {y:d(y)>1/n} for positive integers n cover compact P. A finite subcover gives d(y)>1/N for all y, where N is the largest of its indices. Put ϵ=1/N. By [F6], subdivide P barycentrically to a finite complex L of mesh less than ϵ/3, using the same Euclidean metric. This also works in dimension zero, where its mesh is zero.

F6step 2.1
4.1

The inverse images under F of the open vertex stars of L cover P. By [F8] let δ>0 be a Lebesgue number. Subdivide L further to K so that 2m(K)<δ, by [F6]. Every nonempty closed vertex star of K has diameter less than δ, so is contained in F1(stL(w)) for some vertex w. Assign such a w=g(v) to each vertex v of K; there are finitely many. The open-star condition of [F7] follows, giving a simplicial g:KL and a homotopy Fg. For every point y, F(y) and g(y) lie in a common simplex of L, so F(y)g(y)m(L)<ϵ/3. If a closed simplex σ of K met g(σ), there would be x,yσ with x=g(y). Since K subdivides L, xydiamσm(L)<ϵ/3. Therefore F(y)yF(y)g(y)+xy<2ϵ/3, contradicting step 3.2. Thus g(σ)σ= for every simplex. This quantitative estimate uses the ordinary star construction, not an extra carrier assertion about relative approximation.

F6F7F8step 3.2
5.1

Regard g as a self-map of the common space K=L=P. It preserves the skeleta of K: a simplicial map takes Kn into Ln, and LnKn, because subdivision triangulates each face within itself. By [F9] it induces a chain endomorphism Tn on Cn=Hn(Kn,Kn1;Q), computing g on homology. These groups have the finite oriented simplex bases of [F10] and are zero above dimP. For an n-simplex σ, its diagonal coefficient is zero. For n=0 this says directly that its vertex is not mapped to itself. For n1, collapse every other closed n-simplex and the (n1)-skeleton to a point; the resulting continuous coordinate map qσ:Knσ/σ is continuous by finite closed-simplex pasting. On the relative group, its map is projection to the σ coordinate of [F10]: it is the characteristic quotient on σ and constant on all other generators. But qσg is constant on σ by step 4.1, so it sends the relative characteristic generator to zero in Hn(σ/σ,;Q). This proves the claimed zero coefficient, including when g collapses σ to a lower-dimensional face. Hence tr(Tn)=0 in every degree.

F9F10step 4.1
6.1

Apply [F2] to this bounded finite-dimensional rational chain complex and its endomorphism. By step 5.1 its alternating chain trace is zero, while [F9] identifies its homology trace with L(g). Thus L(g)=0. The homotopy in step 4.1 and [F1] give L(F)=L(g), and step 3.1 gives L(f)=L(F)=0. Taking the contrapositive proves the statement.

F1F2F9step 3.1step 4.1step 5.1
7.1

Empty X was handled in step 1.1. For a singleton its only self-map fixes the point and [F1] gives L=1. For a finite discrete space the conclusion is also the point-basis fixed-point count in [F1]. Zero homology groups and zero-size matrices cause no exception by [F4], and step 5.1 treats both zero-cells and collapsed simplices. The mesh inequalities are strict, so no endpoint equality is silently substituted; [F7]'s homotopy has precisely endpoints F and g. The statement's equivalent formulation is exactly the logical contrapositive proved in step 6.1, not the converse assertion that every map with a fixed point has nonzero Lefschetz number. The only arbitrary selections are [F3]'s use of [F5]; all grid, subdivision, cover and vertex selections here are finite.

F1F3F4F5F7step 1.1step 5.1step 6.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

70 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources