Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Weak homotopy equivalences induce integral homology isomorphisms without choice

Statement

Every weak homotopy equivalence f:XY of topological spaces induces isomorphisms Hk(X;Z)Hk(Y;Z) for all k0, without any choice principle. More generally, if AX, BY, f(A)B, and both f and fA:AB are weak homotopy equivalences, then the induced maps Hk(X,A;Z)Hk(Y,B;Z) are isomorphisms. No separation or CW hypothesis is imposed on these spaces.

Facts & Assumptions

[F1]

A weak equivalence has vanishing mapping-cylinder relative groups defines the ordinary mapping cylinder, embeds its source as its free end, and proves the component and relative-group criterion without choice.

[F2]

Relative cubical disk model and compression compresses a null relative disk into its subspace while fixing its whole boundary, at its actual marked boundary image, also in degree one.

[F3]

Relative CW inclusions are cofibrations extends a homotopy from a CW subcomplex into an arbitrary target by an explicit choice-free construction. Every natural-number-indexed list of nonempty sets has a choice function on its family of values allows finitely many witness selections after a finite enumeration.

[F4]

Cellular attachments with finite boundary support form a CW complex constructs finite CW complexes from supplied finite attachments and gives the map-out criterion.

[F5]

Relative singular homology describes finite relative cycles and their equivalence. The singular chain homotopy formula gives g#f#=P+P, with its separate degree-zero formula and the explicit prism chains.

[F6]

Long exact sequence of a pair gives the pair sequence. Its connecting map is induced by the boundary of a lifted chain, and therefore commutes with continuous maps of pairs.

Proof

Given: The map and, for the relative conclusion, the subspaces and two weak-equivalence hypotheses. All chains have integer coefficients.

1.1

First let (T,S) be any pair for which every component of T meets S and every positive relative group at every sS is trivial. For a finite CW pair (K,L) and u:(K,L)(T,S), we construct a homotopy rel L into S. Order the finitely many cells of KL by dimension. At a zero-cell, choose a path from its current image into S. At a positive-dimensional cell, once its boundary has image in S, apply [F2] based at the image of its marked boundary point to compress its characteristic disk, fixing the entire boundary. At each dimension these finitely many homotopies and the stationary map on LKd1 agree on the attachment identifications. They give a homotopy on LKd, and [F3] extends it to K. A finite concatenation finishes. These operations use finitely many existential witnesses, justified by [F3], and no infinite family of choices. If K=L the homotopy is stationary. If S is empty, the component hypothesis forces T empty and only the empty-domain case occurs.

F2F3given
1.2

Let c=σnσσ be one relative k-cycle in (T,S), with finite support and cCk1(S). Form the finite collection Ej of all distinct singular j-simplices obtained as ordered face restrictions of its support, for 0jk. Attach one geometric j-simplex for each member τEj, identifying its ith face with the simplex labeled by τδi using the order-preserving affine map. The face identities ensure agreement on intersections of faces. The construction proceeds by increasing dimension, so interiors are never identified and the boundaries land in the previously constructed finite skeleton. A simplex is a disk with boundary a sphere: radially project from its barycenter, using on each unit direction the first intersection with a face, whose distance is the minimum of the finitely many positive intersection parameters. This gives the continuous radial disk parametrization, including the origin. Thus [F4] applies and gives a finite CW complex K with characteristic simplex maps eτ. There is a continuous map v:KT whose composite with eτ is τ, by the same face agreements. This construction includes degenerate singular simplices as distinct cells in their own dimensions; it never collapses their interiors merely because their images are degenerate.

F4F5given
2.1

Put c~=σnσeσCk(K). The literal equality eτδi=eτδi shows that the coefficient of each characteristic (k1)-simplex in c~ equals the corresponding coefficient of c. Distinct labels in the same dimension have disjoint open cells, hence distinct characteristic maps. Let L be the union of the cells labeled by the nonzero terms of c and all their faces. These labels have images in S, so v(L)S; it is a subcomplex by construction. Therefore c~Ck1(L) and v#c~=c. For k=0, take L= and use that the degree-zero boundary is zero. A zero chain represents zero directly and requires no simplex construction.

F4F5step 1.2
3.1

Apply step 1.1 to v:(K,L)(T,S). Its endpoint w has image in S. The prism identity [F5] applied to c~ gives w#c~c=Pc~+Pc~. The first term on the left is a chain in S. The last term is also a chain in S, since the homotopy on L stays in S. Thus c is zero modulo boundaries and chains in S. In degree zero the last term is absent and the same conclusion follows. This proves Hk(T,S)=0 for every k0. Only the finitely many cells associated with the particular chain were compressed; no simultaneous choice over all cycles has been made.

F5step 1.1step 2.1
4.1

Apply [F1] to the given weak equivalence, with T=Mf and S=j(X). Its component bijection and vanishing relative groups are precisely the hypotheses of step 1.1. Thus Hk(Mf,j(X))=0. Exactness [F6] makes j:Hk(X)Hk(Mf) both injective and surjective, including k=0 (the sequence ends with the relative degree-zero cokernel). Let k:YMf be the target inclusion and define r:MfY by r(k(y))=y and r([x,s])=f(x). These formulas respect the mapping-cylinder relation, so [F7] makes r continuous, with rk=idY and rj=f. The formulas D(k(y),t)=k(y) and D([x,s],t)=[x,(1t)s] likewise respect the relation and descend by [F7] to a homotopy from the identity to kr. The prism identity [F5] therefore makes r and k inverse homology maps in every degree. Since rj=f, the homomorphism f=rj is an isomorphism. Empty spaces are handled as in [F1]: a weak map from the empty space forces its target empty, and their chain groups are zero.

F1F5F6F7step 3.1
5.1

For the relative conclusion, use the pair sequences and their naturality [F6]. For k1 write the five consecutive terms as Hk(A)Hk(X)qXHk(X,A)δXHk1(A)Hk1(X) and similarly for (Y,B). All vertical maps except possibly the middle one are isomorphisms by step 4.1. To prove surjectivity of that middle map F, let bHk(Y,B). Lift δYb uniquely to aHk1(A). Its image in Hk1(X) is zero by commutativity and injectivity there. Exactness supplies cHk(X,A) with δXc=a. Then bFc has zero boundary, so equals qYy for some yHk(Y). Lift y=fx using its isomorphism; now F(c+qXx)=b. For injectivity, if Fc=0, injectivity on Hk1(A) gives δXc=0, so c=qXx. Since qYfx=0, write fx=iBb with bHk(B); lift b=fAa and use injectivity on Hk(X) to obtain x=iAa. Hence c=0. In degree zero the relative groups are the cokernels of H0(A)H0(X) and H0(B)H0(Y); the two isomorphisms induce an isomorphism of cokernels, since lifting a representative proves surjectivity and lifting its subspace preimage proves injectivity. This also covers empty subspaces.

F6step 4.1
6.1

The proof includes arbitrary disconnected spaces because the compression hypothesis is imposed at each actual boundary basepoint, and zero-cells use component-surjectivity. It includes one simplex, cancelling coefficients, constant simplices and equal pairs. Both kernel and image arguments were supplied in steps 4.1–5.1, with no degree-one abelianness assumption on relative homotopy. All homotopies run on a finite domain for each test chain, and the mapping-cylinder deformation is a formula. Thus no AC, countable selection or chosen family of representatives enters either conclusion.

F1F2F3step 1.1step 1.2step 3.1step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

52 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