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.
Rational homotopy comparison with one endpoint surjection implies homology comparison
Statement
Assume AC. Let f:W→X be a based map of 2-connected CW complexes and let D≥2. If π_i(f)⊗Q is an isomorphism for 2≤i≤D and a surjection for i=D+1, then H_i(f;Q) is an isomorphism for 0≤i≤D.
Facts & Assumptions
Given: AC; a based map between -connected CW complexes with , such that is an isomorphism for and a surjection for .
The mapping-path factorization gives the actual fibration , with total space homotopy equivalent to , and its exact sequence (Mapping path factorization, Long exact sequence of homotopy groups of a fibration); rationalization preserves exact sequences of abelian groups. In the segment , surjectivity of makes zero, and injectivity of makes zero; together these conditions force , by exactness (Rationalization is exact and commutes with singular homology).
The rational first-Hurewicz-after-killing-lower-torsion-homotopy lemma identifies rational homology with rational homotopy below the first nonzero group (First rational Hurewicz after killing lower torsion homotopy); the homological Serre sequence of the fibration with its edge maps given by projection and fiber inclusion converges to the abutment (Homological Serre spectral sequence, Serre edge maps come from projection and fiber inclusion).
The canonical inclusion into the mapping-path total space is a homotopy equivalence and homotopy equivalences induce homology isomorphisms (Homotopy equivalences induce isomorphisms on singular homology); AC is inherited from the rationalization and rational first-Hurewicz suppliers; any weak CW approximation used there is choice-free (The Axiom of Choice).
Proof
Let F→E_f→X be the actual mapping-path fibration. The fiber exact sequence gives F path-connected and simply connected, because π_1(W)=π_1(X)=π_2(X)=0. All groups in its relevant higher exact segments are abelian. Exactness of rationalization from the rationalization lemma gives, for 2≤j≤D, zero π_j(F)⊗Q: the adjacent map π_{j+1}(W)⊗Q→π_{j+1}(X)⊗Q is surjective, and π_j(W)⊗Q→π_j(X)⊗Q is injective. The endpoint j=D uses precisely the stipulated surjection.
Inductively apply the rational first-Hurewicz lemma to F for j=2,...,D. Its lower homotopy groups are torsion, so H_j(F;Q)=0 in that range; H_1(F;Q)=0 by simple connectivity. In the rational Serre sequence over X, every term with 0<b≤D is zero. For a≤D the bottom-row term E^2_{a,0}=H_a(X;Q) has no incoming differential and no nonzero outgoing differential: each outgoing target has fiber degree r−1≤a−1≤D−1. There are no other nonzero stable filtration terms of total degree at most D. The base edge p_*:H_i(E_f;Q)→H_i(X;Q) is therefore an isomorphism through D. The inclusion j_f:W→E_f is a homotopy equivalence and p_f j_f=f, so the asserted isomorphism is H_i(f;Q). This proves the limited comparison locally; it does not invoke a mod-torsion Whitehead theorem.
Depends on
- Rationalization is exact and commutes with singular homology
- First rational Hurewicz after killing lower torsion homotopy
- Mapping path factorization
- Long exact sequence of homotopy groups of a fibration
- Homological Serre spectral sequence
- Serre edge maps come from projection and fiber inclusion
- Homotopy equivalences induce isomorphisms on singular homology
- The Axiom of Choice
Used by
Dependency tree · two levels
56 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
- Allen Hatcher, Algebraic Topology (standard reference, not scraped)