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.
Homotopy fiber of a map
Definition
For a based continuous map , its homotopy fiber is the fiber of over : with basepoint . Its topology is the iterated subspace topology of Mapping path space replacement of a map and Fiber and fiber homotopy equivalence, or the specified kified topology in CGWH. Basedness ensures the displayed basepoint belongs to it. Unlike a literal fiber, its points include a specified path from the image to the basepoint.
For a strictly commuting square of based maps , with , the induced map is . The endpoint equations hold since and . Postcomposition on path spaces is continuous: the inverse image of the compact-open condition is ; kification gives the CG version. Hence the indicated map is continuous and preserves basepoints. Identity and composite squares give the identity and composite formulas pointwise; no path choices are required.
The existence of a basepoint excludes empty and here. When is one point, this construction is the based loop space of ; when is one point it is . These are identities of the specified path-subspace constructions, not claims that arbitrary literal fibers already have the same homotopy type.
Depends on
Used by
Dependency tree · two levels
6 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)