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.
Connectivity of a CW pair
Definition
Let be a CW pair in the sense of Skeleta, CW subcomplexes, and relative CW complexes, and let be an integer. The pair is -connected when every path component of meets and, for every and , the pointed set or group has one element. The positive relative objects are those of Relative homotopy classes and groups, and path components are those of Paths, path-connected spaces and path components. In degree one triviality concerns a pointed set. No relative is defined.
Equivalently, for every , every continuous map is homotopic into while its whole boundary is fixed. For , use and empty boundary; the clause asks for a path from its image point into .
No basepoint is chosen per component. In particular -connectedness only requires that every component meet , and does not assert that or has one component. If is empty, this definition holds precisely when is empty. If , it holds for every .
Facts & Assumptions
Relative homotopy classes and groups supplies the all-basepoint positive relative sets and their distinguished constant representatives.
Paths, path-connected spaces and path components defines path components by the path equivalence relation. Skeleta, CW subcomplexes, and relative CW complexes supplies the subspace topology on the pair.
Relative cubical disk model and compression identifies disk representatives with relative cubical classes, and proves that relative nullity is equivalent to compression into the subspace fixing the entire boundary.
Verification
Given: The pair and integer in the definition.
Suppose the component and relative-triviality conditions hold. A map of a zero-disk is a point of , whose component meets , so a path to supplies its compression. For , mark and set for the specified disk map . Its relative class based at this actual is trivial by hypothesis. By [F3] it has a homotopy into fixing the full boundary, including both endpoints when . No selected family of basepoints or paths is involved.
Conversely suppose all the stated disk-compression conditions hold. The zero-disk condition supplies a path to for any point of , so every component meets . For each , every positive relative class in degrees has a disk representative with marked boundary value by [F3]. Its stipulated boundary-fixed compression makes the class trivial by the converse in [F3]. Thus all the defining conditions hold.
If is empty and nonempty, its point disks fail the required path condition; if both are empty there are no such maps or basepoints. When , the constant homotopy of any disk map already ends in , so the compression condition holds in all degrees. For there are no positive-degree conditions; for the positive condition is exactly the pointed degree-one one. Steps 1.1–1.2 prove both formulations equivalent, including their endpoints, without any choice principle.
Depends on
Used by
- A simply connected CW homology equivalence is a homotopy equivalence under the stated choice conditions Example
- A connected CW pair has a model without low relative cells Lemma
- High relative cells do not change lower homotopy Lemma
- Relative homotopy compares with the CW quotient in the connectivity range Lemma
- Weak equivalences glue along a common connected CW subcomplex Lemma
- Absolute Hurewicz theorem at the first nonzero degree Theorem
- Blakers--Massey connectivity for a homotopy-pushout square Theorem
- Homotopy excision Theorem
Dependency tree · two levels
19 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, Algebraic Topology, printed p346, equivalent definitions of relative connectivity (standard reference, not scraped)