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.
A simply connected CW homology equivalence is a homotopy equivalence under the stated choice conditions
Example
Assume the Axiom of Choice. If is a map of simply connected CW complexes inducing isomorphisms on all integral homology groups, then is a homotopy equivalence. If are finite CW complexes, the same conclusion holds without any choice principle.
Facts & Assumptions
Cellular approximation for maps of CW pairs deforms to a cellular map, without choice when is finite and with AC otherwise.
Cellular mapping cylinders and relative cylinders are CW complexes constructs the ordinary CW mapping cylinder of a cellular map, its source subcomplex and its explicit deformation onto the target, with all-basepoint homotopy isomorphisms of the retraction. It is finite when both endpoint complexes are finite.
The singular chain homotopy formula proves homotopy invariance of induced homology maps by the prism identity. Long exact sequence of a pair supplies the pair sequence in integral homology.
Long exact sequence of relative homotopy groups supplies the based pair sequence, including its pointed-set tail. Connectivity of a CW pair requires component-surjectivity and relative vanishing at every subspace basepoint.
Relative Hurewicz comparison through a choice-free weak model gives the actual relative Hurewicz isomorphism in the first possible nonzero degree for a CW pair with nonempty simply connected subspace, without choice.
Weak homotopy equivalence requires component bijectivity and isomorphisms in every positive degree at every source basepoint. Whitehead theorem turns a weak equivalence of CW complexes into a homotopy equivalence, choice-free for finite endpoint complexes and with AC in general.
The Axiom of Choice is assumed only in the general branch. Its uses are the arbitrary-cell approximation in [F1] and the cellular approximation and compression-disk selection inside the general Whitehead theorem [F6].
Verification
Given: The map and its integral homology isomorphisms. Simply connected includes nonempty and path connected.
Apply [F1] to the empty fixed subcomplex to obtain a cellular map and a homotopy . Use its finite clause when are finite; otherwise use [A1]. By the prism identity [F3], in each homology degree, so is also a homology equivalence. Form its ordinary CW cylinder with source , target and retraction in [F2]. Then , and . Thus in homology has inverse by [F3], and is an isomorphism in every degree.
For consider . Since the rightmost map is injective, every relative class has zero boundary and comes from . Since the leftmost map is surjective, that entire image in the relative group is zero. Hence . In degree zero the relative group is the cokernel of the surjective , so it too is zero.
The space is path connected: each of its points has its cylinder track to , and is path connected. The retraction's all-basepoint homotopy isomorphisms [F2] show for every , since is simply connected. Both component sets of and are singletons. The pointed tail in [F4] therefore shows that every relative degree-one class comes from and is distinguished. Thus the CW pair is -connected in the exact sense of [F4], and its subspace is nonempty and simply connected.
Induct on the integer . Suppose the pair is -connected, starting with step 2.2. At each arbitrary , [F5] identifies with from step 2.1. Hence all these relative groups vanish, and the component condition is unchanged, so [F4] makes the pair -connected. Induction proves vanishing in every positive relative degree at every . This is induction on a property, not the selection of an infinite sequence of homotopies or inverse maps. In particular its use of [F5] is choice-free even though its all-data weak model can be infinite.
For every the exact segment has trivial outside terms by step 3.1. Exactness gives zero kernel and full image for the middle homomorphism. This also works for , whose right outside object is pointed rather than a group. The component bijection was checked in step 2.2. Thus is weak by [F6]. The retraction in [F2] is weak at all basepoints, so is weak, including its component map.
Apply Whitehead [F6] to . Under [A1] its general clause applies. For finite , its finite clause applies and requires no choice; the preceding approximation used its finite clause and the Hurewicz comparison was choice-free. Let be the resulting homotopy inverse, so and . Composing with on its two sides gives and . Concatenation gives both and , proving the conclusion for the original . These are unbased homotopies, so the approximation never required an unstated fixed basepoint.
Empty endpoint complexes are excluded by the stated meaning of simply connected; a point endpoint or an identity map satisfies the same argument. All relative homology groups, including degree zero, were checked in step 2.1, and the first induction degree meets [F5]'s simple-connectivity hypothesis by step 2.2. No finite-dimensional upper bound is needed for the induction on group vanishing. The finite branch has only finite approximation and finite Whitehead choices; the arbitrary branch uses [A1] exactly in [F1] and [F6]. Both homotopy-inverse identities are established in step 5.1, with no conclusion asserted for non-simply-connected spaces.
Depends on
- Cellular approximation for maps of CW pairs
- Cellular mapping cylinders and relative cylinders are CW complexes
- The singular chain homotopy formula
- Long exact sequence of a pair
- Long exact sequence of relative homotopy groups
- Connectivity of a CW pair
- Relative Hurewicz comparison through a choice-free weak model
- Weak homotopy equivalence
- Whitehead theorem
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
45 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 Corollary 4.33 (standard reference, not scraped)