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

Mapping path factorization

Statement

Every continuous f:XY factors as f=pfjf, where jf:XEf is a homotopy equivalence and pf:EfY is a Hurewicz fibration. This holds for all ordinary spaces and, with the specified kified constructions, in CGWH. No surjectivity onto components disjoint from f(X) is asserted. The result is choice-free.

Facts & Assumptions

[F1]

Ef, jf, rf and pf are the continuous mapping-path maps. Mapping path space replacement of a map

[F2]

Hurewicz HLP means a jointly continuous lift with its exact initial map. Hurewicz and serre fibrations

[F3]

Interval evaluation and transposition preserve continuity, ordinarily and after the stated kification. Interval exponential law and quotient homotopies

Proof

Given: The map f and F1 constructions; for HLP, initial map v:ZEf, v(z)=(x(z),γz), and H:Z×IY with H(z,0)=γz(1).

1.1

Direct evaluation gives pfjf=f and rfjf=idX. The formula D((x,γ),t)=(x,sγ((1t)s)) is continuous by F3 applied to its adjoint. It remains in Ef because its path starts at f(x), begins at (x,γ) and ends at jfrf(x,γ). It fixes every constant path. Thus jf and rf are homotopy inverses, even with a strong deformation retraction onto jf(X).

F1F3
1.2

For the given HLP problem define ηz,t:IY by ηz,t(s)=γz((1+t)s) if (1+t)s1, and ηz,t(s)=H(z,(1+t)s1) if (1+t)s1. Both domains are closed and cover Z×I×I. At their intersection the values are γz(1)=H(z,0), so F3–F4 prove the joint continuity of the adjoint. All arguments of H lie in [0,t]. In particular no division by t occurs at t=0.

F3F4given
2.1

Transpose step 1.2 and put H~(z,t)=(x(z),ηz,t). The path begins at γz(0)=f(x(z)), so this lands continuously in Ef. At t=0 it is exactly (x(z),γz), and pfH~(z,t)=ηz,t(1)=H(z,t), including t=0 by compatibility. Hence F2 holds for every parameter space, and the same adjoint formulas establish the CG version.

F1F2F3step 1.2
3.1

Empty X makes all initial-map test domains empty. A one-point X gives the usual based path space; a one-point Y reduces the deformation to the identity of X. Both deformation endpoints and both path endpoints were checked above. Existence of a path in Ef forces its final point into a component meeting f(X), explaining the absence of a surjectivity claim. Every operation was a formula, not a path selection. Together steps 1.1 and 2.1 establish the factorization.

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