LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14

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.

Freudenthal identifies the eventual suspension system for spheres

Statement

For integers $k \geq 0$ and $n \geq 1$ , the sphere-system bonding map

$E : π_{n + k} (S^{n}) ⟶ π_{n + k + 1} (S^{n + 1})$

is an isomorphism when $n > k + 1$ and is a surjection when $n = k + 1$ .

Facts & Assumptions

[F1]

Every based map $S^{j} \to S^{n}$ with $0 \leq j < n$ is based nullhomotopic, including the path-connectedness assertion at $j = 0$ (Lower-dimensional sphere maps are based nullhomotopic). With the standard two-cell CW structure, $S^{n}$ is therefore $(n - 1)$ -connected for $n \geq 1$ .

[F2]

For $n \geq 1$ , Freudenthal says that suspension $π_{i} (X) \to π_{i + 1} (Σ X)$ is an isomorphism for $1 \leq i < 2 n - 1$ and a surjection for $i = 2 n - 1$ when $X$ is an $(n - 1)$ -connected based CW complex. In degree zero it instead gives a bijection of the two singleton pointed sets (Freudenthal suspension theorem).

[F3]

The stable-stem definition uses the reduced-suspension bonding map determined by $S^{1} \land S^{n} ≅ S^{n + 1}$ (Stable stems of the sphere).

[F4]

Collapsing a nonempty contractible CW subcomplex is a weak homotopy equivalence (CW quotients and collapse of a contractible subcomplex).

Proof

Given: Integers $k \geq 0$ and $n \geq 1$ .

1.1

Apply [F2] to $X = S^{n}$ using [F1] and set $i = n + k$ . The isomorphism inequality becomes [F1, F2] $n + k < 2 n - 1 ⟺ n > k + 1.$

F1F2

1.2

The endpoint equation $n + k = 2 n - 1$ is exactly $n = k + 1$ , so [F2] gives the claimed surjection there and makes no injectivity claim.

2.1

The quotient from the two-cone suspension to the reduced suspension collapses precisely the basepoint track, a nonempty contractible CW subcomplex. By [F4] it induces an isomorphism on the displayed homotopy group, while [F3] identifies the resulting reduced-suspension map with the sphere-system bonding map. Thus the computed range applies to that system itself. $□$

F3F4step 1.1step 1.2

Depends on

Used by

The zero stable stem is the integers Example
The sphere prespectrum groups are the classical stable stems Proposition

Dependency tree · two levels

23 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

J. P. May, A Concise Course in Algebraic Topology (standard reference, not scraped)