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 zero-dimensional Clifford cokernel is Z
Example
For with the trivial grading, a finite-dimensional graded module is . Its Grothendieck group is by . For the odd generator satisfies and identifies the even and odd components of every graded module. Conversely, for every , with is a graded -module. Therefore the restriction image is the diagonal subgroup and by even dimension minus odd dimension.
Facts & Assumptions
Given: Finite-dimensional real graded modules and the restriction homomorphism .
retains even and odd dimensions as separate summands, and (Clifford-module restriction cokernels A_n).
A graded Clifford action sends even generators to parity-preserving maps and odd generators to parity-reversing maps (Real graded Clifford-module bundles and their Grothendieck groups).
Verification
In a graded -module, the odd generator maps to and to by [F2]. Since , these restrictions are inverse up to sign, so . Thus every restricted class has equal two coordinates. The explicit module with satisfies , so its restriction is ; hence the image in the Grothendieck group is exactly .
The homomorphism , , is surjective and has kernel . By [F1], its quotient is , so the induced map is an isomorphism and sends a graded module to its even dimension minus its odd dimension.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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
- M. F. Atiyah, R. Bott, and A. Shapiro, Clifford Modules, Topology 3, Supplement 1 (1964) (standard reference, not scraped)
- Jost-Hinrich Eschenburg and Bernhard Hanke, Bott–Thom isomorphism, Hopf bundles and Morse theory (2021) (standard reference, not scraped)
- M. F. Atiyah, K-Theory (lectures, notes by D. W. Anderson, 1967), with K-Theory and Reality reprint (standard reference, not scraped)