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.
Rank-zero and empty-base vector-bundle classification
Example
For every space , the rank-zero vector bundle is, up to its unique bundle isomorphism, . Thus and are singletons. If and is arbitrary, the unique empty total-space bundle and the unique map from the empty space likewise give singleton classification sets.
Facts & Assumptions
Given: a space , a field , and a nonnegative integer .
A rank- vector bundle is locally a projection (Real and complex topological vector bundles).
and are one-point spaces carrying the zero tautological bundle (Stiefel spaces, Grassmannians, and tautological bundles).
Verification
Let have rank zero. Every fiber is the one-element vector space by [F1], so is bijective. Each bundle chart is a homeomorphism over , and these local inverses glue to the inverse of . Thus is a bundle isomorphism to , and any bundle map over between two such bundles is forced fiberwise. There is exactly one rank-zero isomorphism class.
By [F2], there is exactly one map and exactly one homotopy class of such maps. Pulling back the zero tautological bundle gives the bundle in step 1.1, so the two singleton sets correspond.
Now let and allow any . A map exists only when , and local triviality is vacuous, so this is the unique rank- bundle. There is also exactly one function from to and exactly one homotopy between any two such functions. Hence both classification sets are again singletons. No choice principle is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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, Section 1.1 conventions (standard reference, not scraped)