Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The Lefschetz number of the identity is Euler characteristic

Statement

For every finite CW complex X, L(idX)=χ(X). If X is nonempty and contractible, these invariants equal 1 and its identity fixes every point. For the empty complex both invariants are 0. No AC is required.

Facts & Assumptions

[F1]

Lefschetz number of a finite CW self-map defines the rational homology trace sum.

[F2]

Euler characteristic of a finite CW complex defines χ(X)=n(1)ncn(X) from the numbers of cells.

[F3]

Hopf trace formula equates alternating chain and homology traces for bounded finite-dimensional complexes.

[F4]

Relative homology of consecutive CW skeleta gives one copy of the coefficient group per cell in the corresponding cellular degree.

[F5]

Cellular maps induce cellular chain maps identifies cellular-map homology with the induced singular homology map.

[F6]

Contractible nonempty spaces have the homology of a point gives the homology of a point for a nonempty contractible space, with arbitrary abelian coefficients.

Proof

Given: A finite CW complex X with cn cells in dimension n.

1.1

Its rational cellular chain group Cn=Hn(Xn,Xn1;Q) has dimension cn by [F4]. There are finitely many nonzero groups, since X has finitely many cells. The identity map preserves every skeleton and induces the identity map of each relative group. Its cellular chain trace in degree n is therefore the sum of the cn diagonal entries equal to one, namely cn, with trace zero if cn=0. By [F5], the induced homology map is the singular homology identity.

F4F5given
2.1

Apply [F3] to the identity chain map in step 1.1. Its homology trace sum is L(idX) by [F1], and its chain trace sum is n(1)ncn=χ(X) by [F2]. This proves the equality over Q directly; no change-of-coefficients identification with integral ranks is needed.

F1F2F3step 1.1
3.1

If X is nonempty and contractible, [F6] gives its rational homology as that of a point. For completeness, the singular chain group of a point is Q in each nonnegative degree, with its unique simplex as basis. In positive degree n the boundary is multiplication by j=0n(1)j, which is 1 for even n and 0 for odd n. Thus in every positive degree the kernel equals the image from the next degree; in degree zero the boundary from degree one is zero. Consequently only H0=Q survives. The identity therefore has trace 1 in degree zero and no other nonzero traces, so [F1] gives L=1, and step 2.1 gives χ=1. Every xX satisfies idX(x)=x; nonemptiness supplies a fixed point without any choice family. This is consistent with the nonzero-Lefschetz sufficient condition, but the identity's fixed point is already explicit.

F1F6step 2.1
4.1

If X is empty, there are no cells or singular simplices, so both sums are zero. If X is a singleton, step 3.1 gives 1; for a finite discrete space the same degree-zero identity matrix has one diagonal 1 per point. Missing dimensions and zero cellular groups are covered by step 1.1. Degenerate singular simplices at a point are exactly the generators used in step 3.1 and do not produce unwanted higher homology. The proof is a finite alternating sum, with no infinite endpoint or limiting convention; the boundedness required by [F3] was verified in step 1.1. All basis choices in that theorem are finite, so this example is choice-free.

F1F2F3step 1.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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