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

Pullbacks of fibrations are fibrations

Statement

Let p:EB be a Hurewicz or Serre fibration and g:AB continuous. The pullback projection q:gEA, where gE={(a,e):g(a)=p(e)} and q(a,e)=a, is a fibration of the same type. Use ordinary subspaces and products in ordinary spaces, and kified subspaces and k-products in CGWH. No surjectivity or AC is required.

Proof

Given: Continuous v:XgE and H:X×IA with qv=H(,0), for an allowed test space X.

1.1

Write v=(vA,vE). Then pvE=gvA=gH(,0). By F1 the base homotopy gH has a lift L:X×IE with L(,0)=vE and pL=gH. This uses exactly the original test class: every space for ordinary Hurewicz, every CGWH space for its CG version, or every disk for Serre.

F1F2
2.1

Set H~(x,t)=(H(x,t),L(x,t)). Its coordinates are continuous, it lands in the pullback by pL=gH, and F2–F3 give continuity. In CGWH this is the same categorical pairing into the kified pullback; the CG source property gives the kified target map. Its initial value is (vA,vE)=v, and qH~=H. Thus it solves the required HLP problem.

F2F3step 1.1
3.1

Empty parameter spaces have the empty lift; if the pullback is empty, every allowable initial-map problem has empty parameter space. Disk dimension zero is included in step 1.1. Constant base maps, point bases, t=0 and t=1 satisfy the same equations, with no uniqueness or regularity needed. Only one existential HLP witness is used; no indexed selections are made. This proves the claim for both types.

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

16 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