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.1

Iterate the interval transpose of F1 n times. A boundary-constant a:InX 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.

F1F2
2.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(2s11,u), so the component operation matches the cubical group operation of F3. Evaluation also commutes with based postcomposition, giving naturality.

F1F2F3step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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