Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Hurewicz and serre fibrations

Definition

Let I=[0,1]. A continuous map p:EB has the homotopy lifting property for X if for every continuous f:XE and H:X×IB satisfying H(x,0)=p(f(x)), there exists a continuous H~:X×IE such that H~(x,0)=f(x),p(H~(x,t))=H(x,t). Homotopies have the meaning of Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints. Neither uniqueness nor stationarity over constant base paths is part of this condition.

A Hurewicz fibration in ordinary spaces has this property for every topological space X, with ordinary products. A Serre fibration has it for each finite-dimensional closed disk Dn, n0; D0 is one point. The relative CW formulation is established in the following proposition, with AC for arbitrary cell families.

In the CGWH convention of Compactly generated conventions for based homotopy, a Hurewicz fibration tests every CGWH space and all constructions use k-products and kified subspaces. Products with I have their ordinary topology. An assertion explicitly about all ordinary spaces uses the first convention, not merely the restricted test class. Disk tests agree in these conventions.

We do not impose surjectivity. For example the map from the empty space to any B has the property: only the empty parameter space admits an initial map into its domain. Both conditions include prescribed-initial-point path lifting by taking X=D0, so an image that meets a path component meets that entire component. For the unique map to an empty base the domain is empty. These are quantified definitions and use no choice principle.

Depends on

Used by

Dependency tree · two levels

10 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