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.
Thom spaces of trivial line and plane bundles
Example
For the standard oriented trivial real bundles, Their Thom classes are the once- and twice-suspended units, and their Thom isomorphisms are the corresponding relative suspension isomorphisms.
Facts & Assumptions
Given: A space , a commutative ring , and the standard ordered orientations of and .
Thom spaces of zero and trivial bundles calculates the Thom space of a trivial rank- bundle as .
Thom isomorphism for a trivial oriented bundle constructs its normalized class by the ordered relative suspension and proves cup by it is an isomorphism over arbitrary without AC.
Verification
Put in [F1]. The pair is , its quotient is , and [F2]'s fiber generator is the connector of on the two boundary endpoints. Thus its pullback to the product is the suspended unit and cup by it is the one-fold relative suspension isomorphism.
Put . The quotient is , the ordered generator is the second connector applied to the rank-one generator, and [F2] gives the twice-iterated suspension isomorphism. This fixes the orientation sign rather than choosing an unspecified generator.
For empty the spaces are the one-point based space and cohomology maps are zero; for a point base the spaces are and . The zero ring, zero/unit classes, both interval endpoints, the two coordinate orders and both suspension endpoints are explicit in steps 1.1–1.2. All connectors are finite and formulaic, so no AC is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- May, A Concise Course in Algebraic Topology, Chapter 23 §5 (standard reference, not scraped)