Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Double-mapping-cylinder homotopy pushout and path-space homotopy pullback

Definition

Let f:AB and g:AC be continuous maps of CGWH spaces. Their double-mapping-cylinder homotopy pushout is the model P=k((B⨿(A×I)⨿C)/((a,0)f(a), (a,1)g(a))). Write u:BP and v:CP for the structure maps, and h:A×IP for h(a,t)=[a,t]. In fact this ordinary quotient is already CGWH, as verified below.

For continuous u:BP and v:CP, their path-space homotopy pullback is the model B×PhC=k{(b,ω,c)B×C(I,P)×C:ω(0)=u(b), ω(1)=v(c)}, where the braces first have the ordinary subspace topology, C(I,P) is the kified interval mapping space, and the outer k gives the compactly generated topology.

For the double-mapping-cylinder structure maps there is a canonical comparison η:AB×PhC,η(a)=(f(a),h(a,),g(a)). For a0A, base the target at the actual triple η(a0). Then η is based. The endpoints u(f(a0)) and v(g(a0)) need not coincide in P; its intervening cylinder path, not an assumed equality of these endpoints, is part of the target basepoint. These constructions and maps are continuous and choice-free.

Facts & Assumptions

[F1]

Compactly generated conventions for based homotopy defines k, CGWH spaces, k-products and the mapping-space topology. Mapping cylinder and mapping cone fixes the unreduced attachment convention used at both ends.

[F2]

Interval exponential law and quotient homotopies gives continuous evaluation and the interval exponential correspondence, including kified mapping spaces for CG parameters.

[F3]

Compact generation preserves the cylinder and closed pushouts proves that ordinary cylinders of CGWH spaces and pushouts along their closed subspaces are CGWH, with the endpoint target a closed embedded subspace.

[F4]

Kification, compact tests, and finite constructions gives finite k-products, finite coproducts, closed subspaces, and the equivalence of continuity into a space and its kification for a CG source.

[F5]

Weak Hausdorff diagonals and closed quotients gives closed k-diagonals and CGWH mapping spaces, finite k-products and closed subspaces.

Verification

Given: The displayed maps and CGWH spaces; for the based assertion a specified a0A.

1.1

The subspace A×{0,1} is closed in the ordinary CGWH cylinder A×I by [F3]. It is the coproduct of two copies of A and hence CGWH by [F4, F5]. Map it to the CGWH coproduct B⨿C by (a,0)f(a) in its B summand and (a,1)g(a) in its C summand. These formulas are continuous on the two clopen endpoint pieces. Applying [F3] to this one closed pushout gives the ordinary quotient in the definition, already CGWH. Kification therefore does not change it. The quotient maps restricted to B,C,A×I give continuous u,v,h, with the pointwise endpoint identities h(a,0)=u(f(a)) and h(a,1)=v(g(a)). This constructs the model without treating either original map f,g as an inclusion.

F1F3F4F5given
1.2

For arbitrary u,v as in the pullback definition, put R=B×kC(I,P)×kC. It is CGWH by [F4, F5], since C(I,P) is CGWH by [F5]. Evaluation at each endpoint is continuous by [F2]. The two continuous maps from R to P×kP sending a triple to (u(b),ω(0)) and to (v(c),ω(1)) therefore have closed inverse images of the k-diagonal of P, by [F5]. Their intersection D is a closed CGWH subspace of R. It has exactly the underlying set specified for B×PhC.

F2F4F5given
2.1

The topology on D is precisely the kification of the stated ordinary subspace. Let Q0 denote that ordinary subspace of B×C(I,P)×C. Its coordinates make the map kQ0R continuous by the product and CG-source criteria of [F4], and it lands in D, hence is continuous into that subspace. Conversely the continuous coordinates of DR give a continuous map from D to the ordinary product, landing in Q0. Thus DQ0 is continuous. Since D is CG by step 1.2, [F4] lifts this map continuously to kQ0. These maps are the identity on the underlying triples in both directions, so they are inverse homeomorphisms. This proves both the claimed topology and the CGWH property of the homotopy-pullback model.

F4F5step 1.2
2.2

For the structure maps from step 1.1, the continuous cylinder map h:A×IP has continuous adjoint ah(a,) into C(I,P) by [F2], since A is CG. Together with continuous f,g, this defines a continuous map into the ordinary triple product. Its values satisfy both endpoint equations by step 1.1, so it factors continuously into Q0. The CG-source criterion of [F4] makes it continuous into kQ0=B×PhC, which is exactly η. No path is selected between arbitrary endpoints: its middle coordinate is the given cylinder track.

F2F4step 1.1
3.1

At a0 the displayed formula gives exactly η(a0), so the comparison is based with the specified target point. This point contains a path and two endpoints, not a single common point of P. If A is empty, the pushout is B⨿C, and the comparison is the unique map from the empty space; no basepoint clause is asserted. If A is nonempty, existence of f,g makes B,C nonempty and each η(a) supplies its own pullback point. Zero or one available paths between other endpoints impose no extra existence assumption on this subspace definition. Constant maps and singleton source or target spaces satisfy the same endpoint formulas. Both interval endpoints are checked in step 1.1; no homotopy group or degree convention is involved. Quotients, coordinate products, closed equality sets, and currying specify every map directly, so the construction uses no choice principle.

F1F2F4step 1.1step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

20 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