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.
Tautological lines over projective spaces
Example
For or , the tautological line over has fiber the line represented by its base point. For finite , its inclusion in has Grassmannian classifying map the standard finite-stage inclusion
For this map is the identity of or .
Facts & Assumptions
Given: or and .
consists of lines in , and its tautological bundle has fiber that line (Stiefel spaces, Grassmannians, and tautological bundles).
The stable Grassmannians are denoted and in the real and complex models, respectively (Real and complex vector bundles are classified by stable Grassmannians).
Verification
For finite , by definition is the quotient of by nonzero scalar multiplication, so a point is exactly a line . Hence , and the set is exactly the tautological bundle in [F1]. For , both projective space and its tautological line are the filtered unions of these finite stages inside ; no expression is used.
For finite , the displayed bundle inclusion sends its fiber over to the same line in . Taking image planes therefore sends to itself under the standard finite-stage inclusion, and pulling back returns the original pairs . At the same assertion is the identity on the filtered union.
For , the finite-stage inclusions unite to the identity on . The classifying-space notation in [F2] gives and , while step 1.1 gives and . All identifications are direct and use no choice principle.
Depends on
Used by
Dependency tree · two levels
12 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, §§1.1–1.2 (standard reference, not scraped)
- Milnor and Stasheff, Characteristic Classes, §§2 and 5 (standard reference, not scraped)