Alphabeta Math
PropositionStatement: 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.

Loop suspension adjunction on based homotopy classes

Statement

Naturally for a well-pointed based CGWH space X and a based CGWH space Y, there is a bijection [ΣX,Y][X,ΩY], where ΩY is the kified compact-open space of loops based at y0.

Facts & Assumptions

[F1]

Suspension is the quotient collapsing both ends and the basepoint track. Reduced cone suspension and cofiber sequence

[F2]

Interval transposition preserves continuity, kification, based restrictions and homotopies. Interval exponential law and quotient homotopies

Proof

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

1.1

A based map a:ΣXY pulls back to A:X×IY with A(x,0)=A(x,1)=y0 and A(x0,t)=y0. By F2 its transpose b(x)(t)=A(x,t) is continuous into the based loop space and maps x0 to the constant loop. Conversely a based b uncurries continuously and satisfies exactly those three equations, so descends to a based a by F1. Evaluation at (x,t) verifies both inverse identities.

F1F2
2.1

Apply F2 with the additional homotopy parameter: the same formulas identify homotopies fixing the basepoint in either mapping set, and their inverses preserve both endpoint maps. Thus the map bijection descends to a bijection on based homotopy classes. Replacing x by f(x) or postcomposing each value with g commutes with evaluation, proving naturality in both variables.

F1F2step 1.1

Depends on

Used by

Dependency tree · two levels

12 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