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.
Negative Laurent powers are cleared by Hopf-line stabilization
Statement
Assume AC. If
is Laurent-polynomial clutching data for a bundle over , then is polynomial. In the fixed clutching convention this multiplication tensors the glued bundle by . The original -class is recovered by multiplying by the inverse unit .
Facts & Assumptions
Given: AC, , and normalized Laurent clutching data supplied by Uniform Laurent approximation through bundle automorphisms.
Under the fixed convention, transition maps multiply under tensor product (Clutching construction for bundles over a suspension).
The external product pulls the Hopf line from to (External product in complex K-theory).
For , one has and hence (Hopf-line calculation of K⁰(S²)).
AC is inherited from [F2] for the reduced product convention and from [F3]; the exponent-clearing calculation itself is finite algebra.
Proof
Multiplication gives , whose exponents range from to . On the scalar is nonzero, so remains an automorphism.
The line has transition . By [F1] and [F2], tensoring the bundle with multiplies its transition by . Therefore in .
By [F3], is a unit with . Multiplying the equality in step 2.1 by this unit gives , so clearing the negative powers loses no class information. This includes , when no change occurs.
Depends on
Used by
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
- Hatcher, Vector Bundles & K-Theory, proof of Theorem 2.2 (standard reference, not scraped)