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 be a bounded chain complex of finite-dimensional vector spaces over a field , and let be a chain map. Then Both sums are finite. No AC is required.
Facts & Assumptions
The basis-independent trace of an endomorphism of a finite-dimensional vector space defines basis-independent trace, including trace zero on the zero space.
For and , gives , including zero-size matrices.
If and is a linear subspace of , then is finite-dimensional, , and if and only if proves finite-dimensionality of subspaces and extension of an independent subset to a basis in finite dimension without AC.
Proof
Given: as stated, with . Choose integers outside which ; a zero complex is permitted.
Put and . The chain identity gives . The chain-map identity makes both subspaces invariant under : if then , and is again a boundary. By [F3], choose a finite basis of , extend it to a basis of , then extend to a basis of . Let and be the spans of the two added blocks. Thus Only the finitely many degrees require bases; elsewhere use empty bases.
In this ordered three-block basis, invariance from step 1.1 gives a block upper triangular matrix for . Denote its diagonal blocks by on , on the quotient represented by , and on the quotient represented by . Summing diagonal entries gives The map sending a vector to its class is bijective: the direct sum supplies unique representatives. In these quotient coordinates is exactly the induced homology endomorphism, since the other part of lies in . Hence by [F1]. No invariance of itself is assumed.
The differential restricts to an isomorphism . It is injective because , and it is onto because any equals the differential of the component of . For , the and components of are cycles and are killed by . The chain-map equation therefore reads Consequently in the chosen bases, and [F2] gives . This holds also when both spaces are zero.
Combining steps 2.1 and 2.2 yields Multiply by and sum for . The boundary terms cancel in adjacent degrees: the coefficient of in the two sums is . The possible unmatched terms are and , both zero because and respectively. This proves the displayed formula, and homology outside this range is zero since its chain group is zero.
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 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.
Depends on
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
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
- Hatcher, Algebraic Topology, Hopf trace formula, p.180 (standard reference, not scraped)