Alphabeta Math
LemmaStatement: 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.

Hopf trace formula

Statement

Let (Ci,di)iZ be a bounded chain complex of finite-dimensional vector spaces over a field F, and let T:CC be a chain map. Then i(1)itr(Ti)=i(1)itr(Hi(T)). Both sums are finite. No AC is required.

Facts & Assumptions

[F1]

The basis-independent trace of an endomorphism of a finite-dimensional vector space defines basis-independent trace, including trace zero on the zero space.

[F2]

For AMm×n(F) and BMn×m(F), tr(AB)=tr(BA) gives tr(AB)=tr(BA), including zero-size matrices.

[F3]

If dimFV=n and U is a linear subspace of V, then U is finite-dimensional, dimFUn, and dimFU=n if and only if U=V proves finite-dimensionality of subspaces and extension of an independent subset to a basis in finite dimension without AC.

Proof

Given: F,C,d,T as stated, with diTi=Ti1di. Choose integers ab outside which Ci=0; a zero complex is permitted.

1.1

Put Zi=kerdi and Bi=imdi+1. The chain identity gives BiZi. The chain-map identity makes both subspaces invariant under Ti: if dix=0 then diTix=Ti1dix=0, and Tidi+1y=di+1Ti+1y is again a boundary. By [F3], choose a finite basis of Bi, extend it to a basis of Zi, then extend to a basis of Ci. Let Hi and Si be the spans of the two added blocks. Thus Ci=BiHiSi,Zi=BiHi. Only the finitely many degrees a,,b require bases; elsewhere use empty bases.

F3given
2.1

In this ordered three-block basis, invariance from step 1.1 gives a block upper triangular matrix for Ti. Denote its diagonal blocks by Ai on Bi, Pi on the quotient represented by Hi, and Qi on the quotient represented by Si. Summing diagonal entries gives tr(Ti)=tr(Ai)+tr(Pi)+tr(Qi). The map HiZi/Bi=Hi(C) sending a vector to its class is bijective: the direct sum supplies unique representatives. In these quotient coordinates Pi is exactly the induced homology endomorphism, since the other part of Ti(Hi) lies in Bi. Hence tr(Pi)=tr(Hi(T)) by [F1]. No invariance of Hi itself is assumed.

F1step 1.1
2.2

The differential restricts to an isomorphism Di:SiBi1. It is injective because SiZi=0, and it is onto because any dix equals the differential of the Si component of x. For sSi, the Bi and Hi components of Tis are cycles and are killed by di. The chain-map equation therefore reads DiQi=Ai1Di. Consequently Ai1=DiQiDi1 in the chosen bases, and [F2] gives tr(Ai1)=tr(QiDi1Di)=tr(Qi). This holds also when both spaces are zero.

F2step 1.1
3.1

Combining steps 2.1 and 2.2 yields tr(Ti)=tr(Hi(T))+tr(Ai)+tr(Ai1). Multiply by (1)i and sum for aib. The boundary terms cancel in adjacent degrees: the coefficient of tr(Aj) in the two sums is (1)j+(1)j+1=0. The possible unmatched terms are Aa1 and Ab, both zero because Ca1=0 and Cb+1=0 respectively. This proves the displayed formula, and homology outside this range is zero since its chain group is zero.

F1step 2.1step 2.2
4.1

If the complex is zero, every matrix and both sums are empty or zero. If it is concentrated in one degree, the differential and boundary blocks are zero and the identity reduces to Ti=Hi(T) in the same coordinates. Zero endomorphisms and zero-dimensional homology blocks give trace zero; nilpotent or non-diagonalizable maps cause no exception because only diagonal blocks, not eigenvectors, were used. The cancellation in step 3.1 is valid in characteristic two as well, where additive negatives coincide. Negative grading indices are allowed and the finite endpoint calculation is unchanged. There are no topological simplices in this algebraic statement. All basis selections in step 1.1 are in finitely many finite-dimensional spaces under [F3], so no arbitrary-index AC is used.

F1F2F3step 1.1step 2.1step 2.2step 3.1

Depends on

Used by

Dependency tree · two levels

29 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