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.
The finite Thom detector is a homotopy isomorphism through 2r−2
Statement
Assume AC. For r≥2, f_r induces π_i(T_r)≅π_i(P_r) for 1≤i≤2r−2. On π_{r+n}, for 0≤n≤r−2, the target is F₂^{B_n} and its coordinates are evaluation on the chosen stable Thom classes.
Facts & Assumptions
Given: AC; a rank ; the detector ; and the target , a finite product of Eilenberg–Mac Lane spaces .
The Thom space is a nonempty -connected CW complex, and the finite product target is path-connected and simply connected with the stated homotopy groups (Universal real Thom spaces are (r−1)-connected, A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice, Eilenberg--Mac Lane space, Higher homotopy groups are functorial and based homotopy invariant).
The arbitrary-target finite-range comparison replaces the target by a relative CW approximation and applies the simply connected CW comparison with (Finite-range comparison with an arbitrary simply connected target, Integral homology comparison gives finite-range homotopy comparison for simply connected CW complexes), using the integral homology isomorphism below and surjection at (The finite Thom detector is an integral homology isomorphism below 2r−1).
Eilenberg–Mac Lane representability identifies the coordinate evaluations of the detector (Eilenberg--Mac Lane spaces represent singular cohomology); AC underlies the model choices (The Axiom of Choice).
Proof
By the connectivity lemma, is a simply connected CW complex. The target P_r is a finite product of K(F₂,q) with q≥r≥2, hence path-connected and simply connected; we do not assume its ordinary product topology is a CW topology. Apply the arbitrary-target extension by relative CW approximation to replace by a CW extension pair, then the integral homology-to-homotopy comparison theorem with . The integral comparison supplies the exact homology hypotheses, so induces isomorphisms for , namely through . The same comparison also gives surjectivity at ; only the isomorphisms through are needed here, and no conclusion at is supplied.
A factor K(F₂,r+d_b) has its only nonzero positive homotopy group F₂ in degree r+d_b. Coordinatewise homotopy groups of a finite product are the products of the factor groups, as proved in the finite-product homotopy computation. Hence at i=r+n the target is F₂^{B_n}. The induced coordinate on a sphere class [α:S^{r+n}→T_r] is ⟨m_{r,b}, α_*[S^{r+n}]{F₂}⟩ = ⟨α^*m{r,b},[S^{r+n}]_{F₂}⟩, by representability and the normalized fundamental class. The cutoff i≤2r−2 is equivalent to r≥n+2.
Depends on
- The Axiom of Choice
- Finite Thom classifying detector map
- Universal real Thom spaces are (r−1)-connected
- The finite Thom detector is an integral homology isomorphism below 2r−1
- Finite-range comparison with an arbitrary simply connected target
- Integral homology comparison gives finite-range homotopy comparison for simply connected CW complexes
- A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice
- Higher homotopy groups are functorial and based homotopy invariant
- Eilenberg--Mac Lane space
- Eilenberg--Mac Lane spaces represent singular cohomology
Used by
Dependency tree · two levels
53 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)