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 connected CW pair has a model without low relative cells

Statement

Let n1 and let (X,A) be an (n1)-connected CW pair with A and supplied characteristic maps. There are, without any choice principle, a CW complex Z containing the given A as a subcomplex, with no cells of ZA below dimension n, and a weak homotopy equivalence Q:ZX satisfying QA=idA.

Assuming the Axiom of Choice, this Q is a homotopy equivalence rel A: there is R:XZ equal to the identity on A, with RQidZ and QRidX through homotopies fixing A pointwise. Choice is used to produce these homotopies, not to construct the weak model.

Facts & Assumptions

[F1]

Connectivity of a CW pair includes component-surjectivity and the positive relative trivialities. Long exact sequence of relative homotopy groups gives exactness at every eligible group and pointed-set term.

[F2]

High relative cells do not change lower homotopy gives lower homotopy isomorphisms, the endpoint surjection and component control when attaching cells of dimension at least n, without choice or a basepoint-vertex restriction.

[F3]

Cellular attachments with finite boundary support form a CW complex gives the CW topology and map-out criterion for supplied ascending-dimensional attachments. Compact CW images have finite cell support without choice gives finite support for each compact attaching sphere.

[F4]

Transfinite recursion gives specified class-function recursion on the natural numbers using Replacement, without AC.

[F5]

Cellular approximation for maps of CW pairs gives based cellular representatives for finite sphere sources without choice, and arbitrary-source approximation rel a cellular subcomplex under AC. Cubical and spherical models of higher homotopy agree identifies based spheres and boundary-constant disks with the homotopy groups.

[F6]

The construction in CW approximation of an arbitrary space supplies the finite sphere CW models and the explicit cone-to-disk descent of a based nullhomotopy used below. Its proof gives these elementary constructions without assuming a CW target or a homology comparison.

[F7]

Higher homotopy basepoint transport and moving homotopies gives transport and the effect of a moving-basepoint homotopy; its actual radial-shell formula commutes with continuous postcomposition.

[F8]

Cellular mapping cylinders and relative cylinders are CW complexes gives the relative CW cylinder, its endpoint subcomplexes, and retraction isomorphisms at all basepoints.

[F9]

Vanishing relative homotopy extends an inverse over cells gives a source-fixing compression from vanishing relative groups and a component bijection, with AC for arbitrary relative cells.

[F10]

Weak homotopy equivalence requires component bijectivity and isomorphisms at every source basepoint.

[A1]

The Axiom of Choice is assumed only for the rel-A homotopy-equivalence conclusion, in the two arbitrary-cell applications of [F5] and [F9].

Proof

Given: The pair and n in the statement. Identify A with its given subspace of X.

1.1

If n2, the inclusion AX induces isomorphisms on πi for 1i<n1 and a surjection on πn1 at every aA. Indeed the two adjacent relative terms vanish for the isomorphism assertion, while the following relative term vanishes for the surjection, so [F1] gives these assertions by exactness. It is also bijective on components: surjectivity is in the definition, and if a,bA are joined in X, the path from a to b represents a relative degree-one class based at b. Its triviality and exactness at π0(A,b) put a in the component of b within A. If n=1, only component-surjectivity is needed and asserted at this initial stage.

F1given
1.2

Put Zk=A with its inclusion map to X for 0k<n. For each kn attach to Zk1 one k-disk for every actual pair (a,b) consisting of a cellular map a:Sk1Zk1 and a continuous b:DkX with bSk1=Qk1a. Extend Qk1 over that disk by its stored b. For k=1 the sphere has two vertices, so a specifies two vertices of A. For positive-dimensional spheres use the finite based CW model of [F6]. There is no selection of homotopy-class representatives or nullhomotopies: all actual extension data are labels of cells, including constant-boundary data.

F3F6given
2.1

Each boundary in step 1.2 has finite cell support by [F3] and is cellular into dimension k1. Its specified extension agrees on that boundary. Applying the assembly lemma in [F3] at each stage therefore gives a CW complex Zk and a continuous Qk, with earlier stages as closed subcomplexes. The indexing collections are sets of maps, cut out of the appropriate power sets by continuity, cellularity and the boundary equation. The successor operation is specified from the previous history; on invalid histories it may be assigned a fixed empty value. Thus [F4] collects the sequence, even though the cell sets grow and need not lie in a fixed ambient set in advance. Its weak attachment union Z is CW by [F3], and its compatible disk maps give a continuous Q:ZX fixed on A. It has only new cells of dimensions at least n, and every vertex belongs to A.

F3F4step 1.2
3.1

Every point of Z has a path to a vertex of A. One can use [F2] for (Z,A) with the lower bound one to reach A, and then for (A,A0) with the same lower bound to reach a vertex; these are arguments for one specified point. Component-surjectivity of Q follows from that of AX. If n2, [F2] makes π0(A)π0(Z) bijective, and step 1.1 gives the same for AX; hence π0(Q) is bijective. If n=1 and two points of Z have images joined in X, join each to a vertex as above and obtain a path b in X between the two vertex images. The endpoint map a:S0A=Z0 is cellular, so the actual pair (a,b) labels an edge attached at stage one. This edge joins the vertices in Z, proving component injectivity in this case as well.

F1F2step 1.1step 1.2step 2.1
3.2

Fix a vertex vA and a positive degree in. By [F5], each based class of πi(X,v) has a disk representative b:DiX constant at v on its boundary. The constant cellular map a:Si1{v}Zi1 with this b is one of the stage-i labels. Its characteristic disk descends to a based sphere in Z because its boundary is constant. Its composite with Q represents the given class, using the same disk-boundary quotient model. Thus Q is surjective in every in. If n2 and i=n1, surjectivity instead follows from step 1.1 and the factorization AZQX.

F5step 1.1step 1.2step 2.1
3.3

For a positive degree in1, let a based sphere u:SiZ at v have nullhomotopic composite with Q. Apply the finite-source clause of [F5] fixing its basepoint vertex to make u based-homotopic to a cellular map a:SiZ. It lands in ZiZi: all old cells of A are already present, and newly attached cells after stage i have higher dimension. By the subcomplex topology, a is a continuous cellular map into Zi. The composite Qa has a based nullhomotopy, by composing the approximation homotopy with Q and then the stipulated nullhomotopy. Collapsing the terminal sphere in its cylinder and using (z,t)(1t)z identifies its cone with Di+1, giving a continuous b:Di+1X extending Qa. The actual quotient and compact-Hausdorff verification for this descent is in [F6]. Since i+1n, the pair (a,b) occurs at stage i+1. Its characteristic disk extends a in Z. Composing that disk with (z,t)(1t)z+ts0, where s0 is its marked boundary point, gives a based nullhomotopy of a fixing s0. Thus u is based null. The homomorphism Q has trivial kernel and is injective in these degrees, including the nonabelian degree-one case.

F5F6step 1.2step 2.1
4.1

For 1i<n1, [F2] identifies πi(A,v) with πi(Z,v), and step 1.1 identifies it with πi(X,v). Since the composite is the original inclusion, Q is an isomorphism in these remaining degrees. The range is empty for n=1,2. Combined with steps 3.2–3.3, Q is an isomorphism in every positive degree at every vertex of A.

F2step 1.1step 2.1step 3.2step 3.3
5.1

For arbitrary zZ, fix one path c from a vertex vA to z, whose existence was proved in step 3.1. Transport [F7] gives isomorphisms from groups at z to groups at v, and from groups at Q(z) to those at Q(v). The square with the maps induced by Q commutes: the radial-shell representative has its original map on its core and the path on its shell, and postcomposition replaces these by their composites with Q. Conjugating the vertex isomorphism in step 4.1 by these transport maps proves that Q is an isomorphism at z. No family of paths for all z is selected. Together with step 3.1 this proves the weak-equivalence assertion [F10], so far without AC.

F7F10step 3.1step 4.1
6.1

Now assume [A1]. The restriction QA is cellular. Apply the arbitrary-source clause of [F5] to obtain a cellular F:ZX and a homotopy E:QF fixed on A. For each source point the actual track of E and [F7] show that F differs from the isomorphism Q only by a transport isomorphism. The component functions agree by their tracks. Thus F is a weak equivalence, still literally the identity on A.

F5F7A1step 5.1
7.1

Form the relative cylinder W of F in [F8], with inclusions j:ZW, k:XW agreeing on A, retraction r:WX and homotopy D:idWkr fixing k(X). The equations rj=F and the component and all-basepoint isomorphisms of r show that j is weak. Exactness [F1] now gives πi(W,Z,j(z))=0 for every zZ and i1. Explicitly, in degrees i2 injectivity on the preceding absolute group makes the relative boundary zero, so a relative class comes from πi(W); surjectivity from πi(Z) makes that image zero. In degree one, component injectivity makes the relative boundary distinguished, so exactness puts each relative class in the image of π1(W); surjectivity from π1(Z) makes this image the distinguished point. This argument treats the relative degree-one set as pointed and retains the component bijection separately.

F1F8step 6.1
8.1

Apply [F9] under [A1] to the CW inclusion j. It gives ρ:WZ with ρj=idZ and K:idWjρ fixing j(Z). Put R=ρk:XZ. Then RA=idA. The homotopies ρDj and rKk run respectively from idZ to RF and from idX to FR, by rj=F, rk=idX and ρj=idZ. Both fix A: D fixes k(X), K fixes j(Z), and all endpoint maps restrict to the common identity on A. Finally composing the homotopy E on the left and right with R, and concatenating with reversals of these two homotopies, gives RQidZ and QRidX rel A. This proves the promised relative equivalence for the original Q.

F9A1step 6.1step 7.1
9.1

Empty extension sets in step 1.2 attach no cells; no initial vertices were adjoined, which is essential for the no-low-cell claim. The hypothesis A supplies the setting for the stated based groups, but no preferred point of A was selected. The case n=1 uses actual stage-one paths for component injectivity; the critical degree n11 uses the original pair surjection and stage-n kernel-killing cells. Lower and higher ranges are separately proved. Arbitrarily high-dimensional cells of A are all present from the start, so they do not invalidate ZiZi. If the original pair is equal, the all-data construction may still add cells, but all the conclusions follow from the same argument. The only AC uses occur in steps 6.1 and 8.1, for cellular approximation and compression over arbitrary cell sets. Every earlier construction and every test on one sphere, path or nullhomotopy is choice-free.

F3F4A1step 1.2step 2.1step 3.1step 3.2step 3.3step 4.1step 5.1step 6.1step 8.1

Depends on

Used by

Dependency tree · two levels

41 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