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.
K-theory of a point and the empty space
Example
Choice-free,
Assuming AC for the periodic assertion, and for every integer .
Facts & Assumptions
Given: the point, the empty space, and AC only for the graded conclusion.
is the Grothendieck completion of the Whitney-sum monoid (Complex topological K⁰ by Grothendieck completion).
Reduced is the kernel of restriction to the basepoint (Reduced complex K-theory).
Under AC, Bott multiplication extends the coefficient grading with period two (Complex Bott periodicity).
Under AC, (Complex K-theory of spheres).
AC is used only in step 3.1 through [F3] and [F4].
Verification
A complex bundle over a point is a finite-dimensional complex vector space, classified by its dimension. Whitney sum adds dimensions, so [F1] completes to , with the trivial line representing .
Over , every bundle has empty total space and all are isomorphic, so the bundle monoid has one element and [F1] gives the zero group. For the point, the restriction map in [F2] is the identity of , so its kernel is zero. These calculations make no choices.
By [F3], the degree-zero group in step 1.1 repeats in every even degree. By [F4], , and [F3] repeats this zero group in every odd degree. Thus the stated graded groups follow under AC.
Depends on
Used by
Dependency tree · two levels
14 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, Vector Bundles & K-Theory, §§2.1–2.2 (standard reference, not scraped)
- May, A Concise Course in Algebraic Topology, Chapter 24 §§1–2 (standard reference, not scraped)