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 based loop space of BG recovers G weakly
Statement
Assume AC. For a well-pointed topological group of CW type, path lifting in Milnor's bundle gives a continuous based endpoint-label map
Put . Under the canonical identification , the maps induced by are the connecting homomorphisms of Milnor's bundle; on components they give its connecting pointed-set map. Both and are weak homotopy equivalences. If and have CW type, they are based homotopy equivalences. Thus a chosen homotopy inverse exists under those stronger hypotheses. No point-set connecting map independent of the chosen lifting function is asserted.
Facts & Assumptions
Milnor's is a numerable principal bundle and is contractible (Milnor's join model is a contractible free G-space).
Assuming AC, a numerable bundle is a Hurewicz fibration, so its lifting function gives a continuous endpoint map on based loops (Numerable fiber bundles are hurewicz fibrations).
The fibration long exact sequence includes for and the exact component segment . Its boundary is computed by choosing a lift ending at the basepoint and restricting to the opposite face; the resulting class is independent of the lift. Under the library convention its component boundary is the inverse of the forward endpoint label (Long exact sequence of homotopy groups of a fibration).
Assuming AC, Whitehead promotes a weak equivalence between CW models to a homotopy equivalence (Whitehead theorem).
Inversion is a based homeomorphism of a topological group.
AC is used by the lifting-function and Whitehead suppliers, and nowhere else in this argument (The Axiom of Choice).
Proof
Given: The Milnor bundle, based by and with its fiber identified by , and [A1].
By [A1, F1, F2], lift a loop from . Its endpoint lies in and is uniquely ; define and . The lifting function is continuous and sends the constant loop to , so both maps are continuous and based. The exact AC expenditure is the well-ordering used by [F2] to construct the lifting function for a numerable bundle.
We compare the chosen map with the class-level boundary in [F3]. Let a based -family of loops be given. The lifting function produces a continuous family starting at and ending at . Right-translate the whole -th lift by . The translated family still covers , now ends at , and its initial face is . This is precisely the lift-and-restrict representative used to define the connecting homomorphism in [F3]. Hence, for every , agrees with the connecting homomorphism after ; the same argument for a single loop gives the asserted map on components. Notice that this compares induced classes, not two point-set maps obtained from unrelated lifting choices.
Contractibility gives for every and one component. Exactness in [F3] therefore makes
an isomorphism for every , while the component segment makes a bijection. Repeating the translated-lift comparison of Step 2.1 after rebasing at a representative loop gives the same isomorphisms at every basepoint. Thus is a weak homotopy equivalence. By [F5], is one as well. [F1, F3, F5, step 2.1]
If both spaces have CW type, choose based CW models under [A1]. The induced comparison of models is weak by Step 3.1, so [F4] supplies a based homotopy inverse; transporting it through the model equivalences makes a based homotopy equivalence. Composing with inversion gives the same conclusion for . Besides the lifting-function use in Step 1.1, AC is spent here exactly through [F4]. Without those CW-type hypotheses, only the proved weak equivalences are asserted.
Depends on
Used by
Dependency tree · two levels
28 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
- James Davis and Paul Kirk, Lecture Notes in Algebraic Topology (standard reference, not scraped)
- Haynes Miller, MIT 18.906 Algebraic Topology II lecture notes (standard reference, not scraped)