Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Higher homotopy groups are iterated loop components

Statement

For a based CGWH space X and n≥1, πn(X,x0)≅π0(ΩnX) naturally. The operation on components on the right is induced by concatenating the first cube coordinate of the adjoint n-loop, and this bijection respects it.

Facts & Assumptions

[F1]

Based interval transposition descends to homotopy classes. Loop suspension adjunction on based homotopy classes

[F2]

The cubical model is the based spherical homotopy set. Cubical and spherical models of higher homotopy agree

[F3]

The cube operation gives groups, abelian above degree one. Higher homotopy classes form groups and are abelian above degree one

Proof

Given: The spaces, maps, and hypotheses in the statement above.

1.1F1F2

Iterate the interval transpose of F1 n times. A boundary-constant a:In→X becomes a point of ΩnX: fixing any interval endpoint makes the appropriate loop constant. Conversely evaluation at all n parameters recovers a. The inverse identities follow one coordinate at a time. F2 identifies these with the stated spherical homotopy groups as well.

2.1F1F2F3step 1.1∎

Apply the same transpositions with a further time variable. Boundary-fixed cubical homotopies become paths in ΩnX, and paths evaluate to such homotopies. Thus the map induces inverse bijections between cube classes and components. On the two halves of coordinate 1 the evaluated concatenation is exactly a(2s1,u) or b(2s1−1,u), so the component operation matches the cubical group operation of F3. Evaluation also commutes with based postcomposition, giving naturality.

Depends on

Dependency tree · 2 levels

Sources