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

A weak equivalence has vanishing mapping-cylinder relative groups

Statement

Let f:X→Y be a continuous map of arbitrary topological spaces. Give Mf=(Y⊔(X×I))/((x,0)∼f(x)) its ordinary quotient topology, and put j(x)=[x,1]. Identify X with this embedded copy. Then f is a weak homotopy equivalence if and only if π0(j) is bijective and πn(Mf,X,j(x)) is trivial for every x∈X and every n≥1. Here relative degree one is a one-element pointed set, not a group. No CW, separation or choice hypothesis is required for this criterion.

Facts & Assumptions

[F1]

Weak homotopy equivalence specifies bijectivity on components and group isomorphisms at all source basepoints.

[F2]

Long exact sequence of relative homotopy groups gives exactness for arbitrary based pairs, including the pointed-set tail, with no assertion of terminal component surjectivity.

[F3]

Interval exponential law and quotient homotopies says that an arbitrary quotient map times the ordinary interval is quotient.

[F4]

Higher homotopy groups are functorial and based homotopy invariant gives induced homomorphisms and equality for based homotopies.

[F5]

Higher homotopy basepoint transport and moving homotopies gives the isomorphism βγ:πn(V,γ(1))→πn(V,γ(0)) and the identity u∗=βγv∗ for a homotopy from u to v with basepoint track γ.

Proof

Given: The continuous map f and the displayed ordinary quotient. Let k:Y→Mf be the other endpoint inclusion.

1.1F6given

Both endpoint inclusions are closed embeddings, including for non-Hausdorff spaces. They are continuous injective maps. For a closed C⊆X, the inverse image of j(C) under the quotient map is just C×{1}, closed in the disjoint union. Thus j(C) is closed in Mf, which proves that j is a closed embedding. For closed E⊆Y, the inverse image of k(E) is E⊔(f−1(E)×{0}), also closed. Thus k is a closed embedding. In particular the subspace pair in the statement really uses the given topology of X.

1.2F3F6given

Define r:Mf→Y by r(k(y))=y and r([x,s])=f(x). The defining maps on the disjoint summands are continuous and respect the identifications, so [F6] makes r continuous, with rj=f and rk=idY. The formulas D(k(y),t)=k(y),D([x,s],t)=[x,(1−t)s] agree at the gluing end and descend continuously by [F3]. They define a homotopy from idMf to kr, fixing k(Y) pointwise. Each z∈Mf is joined by its track to k(r(z)), so π0(k)π0(r) is the identity; the other composite is the identity because rk is. Therefore π0(r) is bijective.

2.1F4F5step 1.2

Fix x∈X and put y=f(x). At the basepoint k(y) the homotopy D is based. Thus [F4] and rk=id show that k∗:πn(Y,y)⟶πn(Mf,k(y)) is an isomorphism with inverse induced by r. At the source endpoint j(x), the track is γx(t)=[x,1−t], running from j(x) to k(y). Apply [F5] to D, now with domain based at j(x): idπn(Mf,j(x))=βγx k∗ r∗. Both βγx and the displayed k∗ are isomorphisms. Consequently r∗:πn(Mf,j(x))→πn(Y,y) is their inverse composite, and is an isomorphism for every n≥1. This uses the actual track; it does not mistake k for a based inverse at j(x).

3.1F1F2F4step 1.2step 2.1

Since f=rj, steps 1.2 and 2.1 imply that f is weak precisely when j is bijective on components and induces isomorphisms on all positive groups at each x∈X. Suppose first these conditions hold. For n≥2 and α∈πn(Mf,X,j(x)), its boundary belongs to the kernel of πn−1(X,x)→πn−1(Mf,j(x)). That kernel is trivial, so exactness [F2] puts α in the image of πn(Mf,j(x)). Surjectivity from πn(X,x) then makes this image trivial by exactness at πn(Mf,j(x)). Thus α is the distinguished element. This reasoning also works for n=2, without assuming that the relative group is abelian.

3.2F1F2F4step 1.2step 2.1

Conversely suppose the component condition and all the relative trivialities in the statement. Fix x∈X and n≥1. In the exact segment πn+1(Mf,X,j(x))⟶πn(X,x)→j∗πn(Mf,j(x))⟶πn(Mf,X,j(x)), the left and right relative terms are trivial. Exactness at πn(X,x) gives a trivial kernel, so its homomorphism j∗ is injective. Exactness at πn(Mf,j(x)) gives surjectivity, since the next map takes everything to the distinguished element. This includes n=1, whose rightmost term is only a pointed set. Hence j∗ is an isomorphism in every positive degree. Combining with the separately assumed component bijection and steps 1.2 and 2.1 proves that f is weak.

4.1F2step 3.1

In relative degree one let α be any path class from a point of X to j(x). Its boundary is a component of X mapping to the component of j(x). Injectivity of π0(j) implies that this boundary is the distinguished component of x. Exactness of the pointed tail [F2] puts α in the image of π1(Mf,j(x)). Surjectivity of π1(X,x)→π1(Mf,j(x)) and exactness at the latter group show that its whole image in the relative pointed set is the distinguished point. Therefore π1(Mf,X,j(x)) has one element. This argument uses no subtraction or group operation on that pointed set.

5.1step 1.1step 1.2step 2.1step 3.1step 4.1step 3.2∎

If X is empty, Mf=Y and relative basepoint assertions are vacuous, but component bijectivity on either side forces Y empty. Thus the equivalence still holds. Equal endpoint images or a constant map cause no problem in the quotient formulas: the free end remains embedded, and the deformation fixes every point of the included target. The homotopy has exactly the stated values at t=0,1 and each source basepoint uses its explicitly prescribed track. All arguments are formulas, exactness or an argument at one arbitrary point/class. No selection of representatives or choice principle is used. Steps 3.1 and 4.1 prove the forward direction, and step 3.2 proves the converse.

Depends on

Dependency tree · 2 levels

Sources