Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Path loop fibration and its connecting isomorphisms

Example

For a based space (X,x0), let PX={α:IX:α(0)=x0} and ΩX={αPX:α(1)=x0} with the ordinary compact-open subspace topologies, or their specified kified versions. Endpoint evaluation gives the Hurewicz fibration ΩXPXX, with contractible total space. Its connecting map gives group isomorphisms πn(X,x0)πn1(ΩX,cx0) for n2 and a pointed-set bijection π1(X,x0)π0(ΩX,cx0). The last bijection sends a loop to its reverse-loop component under our terminal-lift convention. No AC is used.

Facts & Assumptions

[F1]

Mapping-path replacement is Hurewicz and contracts to its original domain by shrinking paths. Mapping path factorization

[F2]

Homotopy fibers use the specified endpoint conditions and path topology. Homotopy fiber of a map

[F3]

The fibration LES is exact through components, with terminal-point connecting convention. Long exact sequence of homotopy groups of a fibration

Verification

Given: A based space (X,x0) and the displayed path spaces with basepoint the constant path.

1.1

Apply F1 to the based map from one point to X. Its mapping-path total space identifies with PX and its fiber over x0 with ΩX by F2. The contraction is D(α,t)(s)=α((1t)s), with D(,0)=id and D(,1)=cx0; it fixes the constant path and is jointly continuous by the F1 proof. Thus every based cube in PX contracts rel boundary by this formula, so its positive homotopy groups vanish and its component set is a singleton.

F1F2
1.2

For a cube b(u,t) representing a class in X, a terminal-point lift is b~(u,t)(s)=b(u,1(1t)s). It starts at x0 as a path in s, ends at b(u,t), is constant when t=1 or u is on its boundary, and is continuous by the same interval evaluation/transposition as F1. Its distinguished face is u(sb(u,1s)). For n=1 this is precisely the reverse loop. This directly verifies the orientation rather than assuming a sign-free identification.

F1F2F3
2.1

For n2, the exact segment πn(PX)πn(X)πn1(ΩX)πn1(PX) has zero outer groups by step 1.1. Hence is both injective and onto. In degree one, exactness shows onto π0(ΩX), since PX has one component. More explicitly the F3 action is transitive, and its stabilizer is the image of the zero group π1(PX); therefore its orbit map, and its composite with loop inversion, are bijections.

F3step 1.1
3.1

A based space is nonempty. If X is one point all groups and component sets in the assertion are trivial; additional components of a general X need not be reached by PXX and do not affect its based sequence. The computations explicitly include the constant loop, both time endpoints, and degree one without inventing a group law on a general component set. All lifts and contractions used here are specified formulas, hence choice-free.

step 1.1step 2.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

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