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.
The trivial principal bundle has a nullhomotopic classifying map
Claim
Assume AC. Let be a well-pointed topological group of CW type and let be a CGWH space. Under the classification of numerable principal -bundles over , the product bundle corresponds to the constant homotopy class in . Consequently a numerable principal -bundle over is trivial if and only if its classifying map is nullhomotopic.
Facts & Assumptions
Assuming AC, for well-pointed of CW type and CGWH, pullback along homotopic maps gives isomorphic numerable principal bundles, and pullback gives a bijection from to their isomorphism classes (Numerable principal bundles are classified by maps to BG).
The fiber of over is the right -torsor (Milnor's infinite-join model of EG).
Verification
Given: AC, and as in the Claim, and the constant map with value .
The constant pullback has total space
is equivariantly isomorphic to by . Thus the constant homotopy class maps to the trivial bundle. [F2]
If is nullhomotopic, [F1] gives , so its pullback is trivial. Conversely, if is trivial, then it has the same bundle class as ; injectivity of the classification bijection gives . This proves both directions, including disconnected because the constant map uses the same based orbit on every component.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- Dale Husemoller, Fibre Bundles, Third Edition (standard reference, not scraped)