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

Cofibrations are characterized by a retraction of the mapping cylinder strip

Statement

For i:AX in CGWH, let R=Xi(A×I), identifying (a,0) with i(a), and let c:RX×I send x to (x,0) and (a,t) to (i(a),t). Unbased HEP is equivalent to the existence of s:X×IR with sc=idR. It forces i to be a closed embedding. For a closed inclusion this is the retraction criterion for X×{0}A×I. The based version holds with the basepoint track collapsed in both R and the cylinder, and based HEP also forces i to be a closed embedding.

Facts & Assumptions

Proof

Given: The spaces, maps, and hypotheses in the statement above.

1.1

The attachment A×{0}A×I is closed, so R is CGWH by F2. Use R as target in HEP, with the initial copy of X and the homotopy a,t[a,t]. The required extension s satisfies sc=id on each summand, hence on R. Conversely, compatible data f,h induce a continuous d:RZ by F4, and ds is the required extension.

F1F2F4
2.1

A left inverse s makes c injective and gives a continuous inverse from its image. Moreover c(R)={z:cs(z)=z}, closed by F3; hence c is a closed embedding. The free end A×{1} embeds closed in R: it is disjoint from the attaching end and every closed subset of it has closed saturated image in the quotient. Its image under c is i(A)×{1}. Restricting the resulting closed embedding to the endpoint identifies i as a closed embedding.

F2F3F4step 1.1
3.1

When i is a closed inclusion, both X×{0} and A×I are closed in the cylinder. A function out of their union is continuous exactly when its restrictions are continuous and agree on the overlap, by finite closed pasting. Thus its subspace topology is the pushout topology of R, and c is the inclusion of that strip. The first equivalence becomes exactly the ordinary strip-retraction criterion.

F2F4step 1.1step 2.1
4.1

For based HEP replace R and X×I by their reduced versions, collapsing the closed basepoint tracks. They are CGWH by F2. The same universal test uses based maps and yields a left inverse; conversely the composite extension is based. Thus c is again a closed embedding by the equalizer argument. In each reduced space an endpoint copy is a closed embedding: a closed endpoint subset has saturation itself if it misses the basepoint, and its union with the collapsed track if it contains it. Applying this to the free copies of A and X recovers i as a closed embedding. All cylinder homotopies descend with their actual topology by F5.

F1F2F3F4F5step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

23 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