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.
Path loop fibration and its connecting isomorphisms
Example
For a based space , let and with the ordinary compact-open subspace topologies, or their specified kified versions. Endpoint evaluation gives the Hurewicz fibration , with contractible total space. Its connecting map gives group isomorphisms for and a pointed-set bijection . The last bijection sends a loop to its reverse-loop component under our terminal-lift convention. No AC is used.
Facts & Assumptions
Mapping-path replacement is Hurewicz and contracts to its original domain by shrinking paths. Mapping path factorization
Homotopy fibers use the specified endpoint conditions and path topology. Homotopy fiber of a map
The fibration LES is exact through components, with terminal-point connecting convention. Long exact sequence of homotopy groups of a fibration
Verification
Given: A based space and the displayed path spaces with basepoint the constant path.
Apply F1 to the based map from one point to . Its mapping-path total space identifies with and its fiber over with by F2. The contraction is , with and ; it fixes the constant path and is jointly continuous by the F1 proof. Thus every based cube in contracts rel boundary by this formula, so its positive homotopy groups vanish and its component set is a singleton.
For a cube representing a class in , a terminal-point lift is . It starts at as a path in , ends at , is constant when or is on its boundary, and is continuous by the same interval evaluation/transposition as F1. Its distinguished face is . For this is precisely the reverse loop. This directly verifies the orientation rather than assuming a sign-free identification.
For , the exact segment has zero outer groups by step 1.1. Hence is both injective and onto. In degree one, exactness shows onto , since has one component. More explicitly the F3 action is transitive, and its stabilizer is the image of the zero group ; therefore its orbit map, and its composite with loop inversion, are bijections.
A based space is nonempty. If is one point all groups and component sets in the assertion are trivial; additional components of a general need not be reached by and do not affect its based sequence. The computations explicitly include the constant loop, both time endpoints, and degree one without inventing a group law on a general component set. All lifts and contractions used here are specified formulas, hence choice-free.
Depends on
Used by
Nothing in the library uses this result yet.
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
- May, A Concise Course in Algebraic Topology (standard reference, not scraped)
- Hatcher, Algebraic Topology (standard reference, not scraped)