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.
Torsion Eilenberg–Mac Lane spaces are rationally acyclic
Statement
Assume AC. If T is any torsion abelian group and n≥1, every CW K(T,n) has H_0(K(T,n);Q)=Q and H_j(K(T,n);Q)=0 for j>0. No cardinality or finite-type restriction is imposed.
Facts & Assumptions
Given: AC; a torsion abelian group and an integer ; a CW model ; the weak-join model for finite subgroups ; and the actual path fibration with contractible total space.
Rationalization is exact and identifies integral homology tensored with with rational homology, so vanishing of rational homology tests acyclicity (Rationalization is exact and commutes with singular homology).
The weak-join construction gives CW models with discrete covering and weakly contractible total space (The weak-join model is a CW K(G,1)); covering maps have unique path and homotopy lifting (Lifting criterion for maps from path-connected locally path-connected spaces, Two lifts from a connected space that agree at one point agree everywhere), and cellular maps induce cellular chain maps (Cellular maps induce cellular chain maps, Cellular homology computes singular homology).
Weak equivalences induce integral homology isomorphisms and homotopy equivalences induce homology isomorphisms (Weak homotopy equivalences induce integral homology isomorphisms without choice, Homotopy equivalences induce isomorphisms on singular homology); the mapping-path factorization and fibration exact sequence compute the strict loop fiber of the path fibration (Mapping path factorization, Long exact sequence of homotopy groups of a fibration).
CW approximation attaches to a prescribed based vertex and marked Eilenberg–Mac Lane models are unique (CW approximation of an arbitrary space, Existence and homotopy uniqueness of Eilenberg--Mac Lane spaces); the rational Serre sequence of a fibration over a simply connected base converges to the abutment (Homological Serre spectral sequence) and a contractible nonempty space has the homology of a point (Contractible nonempty spaces have the homology of a point).
AC chooses the finite subgroups, their generators, the CW models and the approximations (The Axiom of Choice).
Proof
A finitely generated subgroup F of T is finite: if its generators have orders d_1,...,d_r, the product of those cyclic groups surjects onto F. For finite F, the covering J(F)→B_wF has |F| sheets. For each singular simplex, sum all its lifts to obtain a chain map τ. Existence and uniqueness of based lifts apply because a simplex is simply connected; restriction to a face bijects its lift set with that face's lift set. Thus ∂τ=τ∂ and p_#τ=|F| id, including degree zero. These are exactly the lift-sum identities proved in the published transfer supplier. On rational homology, τ_* is injective because p_τ_=|F| id. The map J(F)→* is a weak equivalence by the weak-join lemma; the published weak-equivalence/homology lemma and the rationalization lemma give zero positive rational homology of J(F). Therefore B_wF has zero positive rational homology. A rational cellular cycle in B_wT has finite support. Row 3 places all its cells in B_wF for one finitely generated, hence finite, subgroup F. The cellular differential agrees with that in B_wF, and the inclusion of cellular chain groups is injective, so the same chain is a cycle in B_wF. It bounds there by the preceding paragraph, hence bounds in B_wT. Cellular/singular comparison proves positive rational acyclicity. Marked CW uniqueness identifies B_wT with every chosen K(T,1), and homotopy invariance transfers the result.
Take the actual path fibration ΩK(T,n)→PK(T,n)→K(T,n), with contractible total, from the mapping-path supplier. Its exact sequence shows its loop fiber is path-connected and has T as its only positive homotopy group, in degree n−1. Apply the relative version of CW approximation with a prescribed vertex mapping to the constant loop, obtaining a based weak equivalence L→ΩK(T,n). L is a marked CW K(T,n−1). Its rational homology is that of the loop fiber by the published weak-equivalence/homology lemma and the rationalization lemma, and is acyclic by the induction hypothesis. The base K(T,n) is simply connected. In the rational Serre sequence only the row b=0 remains, with E^2_{a,0}=H_a(K(T,n);Q). No differential can enter that row, and every outgoing target is zero. Strong convergence and contractibility of the total force H_a(K(T,n);Q)=0 for a>0. Path-connectedness gives H_0=Q. This is a finite induction for each specified n, and requires no homotopy equivalence from a CW complex to the strict loop fiber.
Depends on
- Rationalization is exact and commutes with singular homology
- The weak-join model is a CW K(G,1)
- Lifting criterion for maps from path-connected locally path-connected spaces
- Two lifts from a connected space that agree at one point agree everywhere
- Weak homotopy equivalences induce integral homology isomorphisms without choice
- Cellular homology computes singular homology
- Cellular maps induce cellular chain maps
- Existence and homotopy uniqueness of Eilenberg--Mac Lane spaces
- Homotopy equivalences induce isomorphisms on singular homology
- Mapping path factorization
- Long exact sequence of homotopy groups of a fibration
- CW approximation of an arbitrary space
- Homological Serre spectral sequence
- Contractible nonempty spaces have the homology of a point
- The Axiom of Choice
Used by
Dependency tree · two levels
89 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)
- Allen Hatcher, Algebraic Topology (standard reference, not scraped)