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

Fibration sequence is natural

Statement

Let p:(E,e0)→(B,b0) and p′:(E′,e0′)→(B′,b0′) be Serre fibrations, and let based maps u:E→E′, v:B→B′ satisfy p′u=vp strictly. Then u restricts to uF:F→F′ and the induced maps commute with every arrow in the two fibration LESs, including the pointed-set tail. They also preserve the component actions: uF∗(c⋅α)=uF∗(c)⋅v∗(α). No AC is needed.

Facts & Assumptions

[F1]

The fibration LES includes the component action defined by lifted path endpoints. Long exact sequence of homotopy groups of a fibration

[F2]

Connecting classes are independent of representative and lift. The fibration connecting map is independent of lift and representative

[F3]

Based maps induce functorial homotopy and component maps. Higher homotopy groups are functorial and based homotopy invariant

Proof

Given: The two based fibrations and strictly commuting square of the statement.

1.1F3given

If e∈F, then p′u(e)=vp(e)=v(b0)=b0′, so restriction defines the continuous based uF. The identities ui=i′uF and p′u=vp imply commutation of the inclusion and projection squares in all degrees by F3, including maps of component sets.

1.2F2given

For a based cube b in B choose a lift a constant at e0 on its J faces. Then ua lifts vb and is constant at e0′ on those faces. On the distinguished face its restriction is uF composed with the restriction of a. F2 therefore gives ∂p′v∗[b]=uF∗∂p[b]. In degree one this is equality of the components of the initial endpoints, so the same calculation covers that square.

1.3F1given

If a lifts a loop γ beginning at e∈F, then ua lifts vγ beginning at uF(e) and ends at uF(a(1)). The independence of component lifts in F1 therefore gives the action identity on every component, without selecting a compatible family of lifting functions.

2.1step 1.1step 1.2step 1.3∎

Steps 1.1–1.3 establish all arrows and the action. Basepoints exclude empty based fibers but no connectedness or surjectivity is needed; components not meeting the image of uF cause no change in the formulas. For point spaces and constant cubes the equations remain identities; degree zero stays a pointed-set assertion. Every choice above is one representative or lift for one equality, hence no AC.

Depends on

Dependency tree · 2 levels

Sources