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 equivalences glue along a common connected CW subcomplex

Statement

Let X=A∪B be a CW complex decomposed into subcomplexes with intersection C≠∅. Suppose C is path-connected and (A,C),(B,C) are 0-connected. Let PA,PB be CW complexes containing the same CW subcomplex C, and let qA:PA→A, qB:PB→B be weak homotopy equivalences equal to the identity on C.

Then the ordinary amalgamated union P=PA∪CPB is a CW complex and the glued map q:P→X is a weak homotopy equivalence. This assertion uses no choice principle. No global homotopy inverses or global cellular approximations of qA,qB are assumed.

Facts & Assumptions

[F1]

Weak homotopy equivalence gives component bijectivity and all-basepoint isomorphisms. Connectivity of a CW pair says that 0-connectedness means that every ambient component meets the subspace.

[F2]

Cellular attachments with finite boundary support form a CW complex constructs a CW union by attaching one side's supplied relative cells to the other and gives its final map-out topology.

[F4]

Finite relative homotopy lifting across a weak equivalence lifts maps on a CW pair with finitely many relative cells, using a supplied boundary homotopy; the lift extends the boundary map exactly and constant boundary tracks stay constant. No choice is used.

[F5]

Cellular approximation for maps of CW pairs applies choice-free to a source with finitely many cells outside its fixed cellular subcomplex.

[F6]

Cellular mapping cylinders and relative cylinders are CW complexes proves the CW structure and endpoint embeddings for the relative cylinder of a cellular map fixed on C. It identifies the cells outside the source endpoint as the target cells outside C and one prism cell for every source cell outside C; finiteness follows only when both of those cell sets are finite.

[F7]

Higher homotopy basepoint transport and moving homotopies gives transport isomorphisms; its radial-shell formula commutes with postcomposition. Higher homotopy group by based cubes supplies based cubes and based nullhomotopies.

Proof

Given: All spaces and maps in the statement. Choose one point c∈C; this is one existential instantiation, not a family of choices.

1.1F1F2given

Build P from PB by adjoining the vertices and then the positive-dimensional cells of PA∖C using their supplied boundaries. The boundaries have finite support and are cellular, so [F2] proves that the result is CW with both sides as subcomplexes. Its underlying set identifies exactly the common C, and its map-out test is continuity on the two endpoint spaces agreeing on C, hence is the ordinary amalgamated topology. The maps qA,qB therefore glue continuously to q. The spaces A,B are path-connected: each point is joined to a point of C by [F1], and points of C are mutually joined. Since qA,qB induce component bijections, PA,PB are also path-connected. Thus X and P are path-connected, and q is automatically bijective on components.

2.1F3F4step 1.1

Let i≥1 and let u:(Ii,∂Ii)→(X,c) be a based cube. By [F3], its image lies in a finite subcomplex T of X. Put K=C∪T, KA=K∩A, KB=K∩B. These are subcomplexes, KA∩KB=C, and each KA,KB has finitely many cells outside C. Apply [F4] to qA, the source pair (KA,C), the inclusion KA→A, the identity C→PA and the constant homotopy on C. It gives wA:KA→PA equal to the identity on C and a homotopy from the inclusion to qAwA rel C. Do the same on the B side. The two maps and homotopies agree on C and glue continuously on K=KA∪KB: the sides are closed subcomplexes, and their cylinder products form a finite closed cover of K×I. This gives w:K→P and a homotopy inclK≃qw fixed on C. Composing with u proves that q∗[wu]=[u]. Therefore q∗:πi(P,c)→πi(X,c) is surjective.

2.2F3F5step 1.1

For injectivity, let u:(Ii,∂Ii)→(P,c) have a based nullhomotopy H after composing with q. By [F3] put the image of u in a finite source subcomplex S⊆P, and set L=C∪S, LA=L∩PA, LB=L∩PB. Each LA,LB is finite relative to C. Apply [F5] separately to qA∣LA:LA→A and qB∣LB:LB→B, fixing C, where both maps are already the cellular identity. Obtain cellular FA,FB and homotopies EA:qA∣LA≃FA, EB:qB∣LB≃FB rel C. They glue to a cellular map F:L→X and a homotopy E:q∣L≃F rel C. These are two applications of finite-relative cellular approximation; no approximation of either whole qA or qB is selected.

3.1F3step 2.2

There is a finite-relative target subcomplex K=C∪T⊆X containing the image of H and all of E. Indeed H has compact cube domain. On each of the finitely many characteristic cells of L∖C, the composite of E with its characteristic disk cylinder has compact domain by [F3], so its image lies in a finite target subcomplex. A finite union of these finite subcomplexes, together with one for H, is a finite subcomplex T. The remaining part E(C×I) is just C. This also includes the endpoints q(L),F(L). Set KA=K∩A, KB=K∩B. Then FA:LA→KA and FB:LB→KB are cellular maps of CW complexes fixed on C; corestriction is continuous because these are subspaces. The reversed homotopy E∘(u×id) followed by H is a based nullhomotopy of Fu wholly in K.

4.1F6step 2.2step 3.1

Form the relative cylinder W of F:L→K fixed on C, using [F6]. It has top inclusion j:L↪W, target inclusion k:K↪W, and retraction r:W→K with rj=F. The cell description splits it into subcomplexes WA,WB with intersection C: use the target cells of KA and the top and prism cells of LA∖C for WA, and the corresponding B cells for WB. Their characteristic boundaries stay on their indicated side because FA,FB do. Each is the relative cylinder of that side's map. In particular (WA,j(LA)) and (WB,j(LB)) are CW pairs with finitely many relative cells: by [F6] those relative cells are exactly the target cells of KA∖C or KB∖C and the prism cells over LA∖C or LB∖C, respectively, and all four sets are finite by steps 2.2–3.1. The possibly infinite common C introduces no new relative cells.

5.1F4step 2.2step 4.1

Apply [F4] to qA:PA→A with source pair (WA,j(LA)). Its target map is vA:WA→rKA↪A and its prescribed lift on j(LA) is j(l)↦l∈PA. On that subcomplex vAj=FA, so the reversed homotopy EA is exactly the required homotopy from vA∣j(LA) to qA of the prescribed lift. Thus [F4] gives a continuous wA:WA→PA extending the inclusion of LA exactly. Apply the identical argument on the B side. Both maps equal the identity on C, so closed pasting gives a continuous w:W→P with wj=inclL. No global inverse of a weak equivalence has been invoked.

6.1F6F7step 2.1step 3.1step 5.1

The cylinder height homotopy in [F6] joins ju to kFu while fixing the cubical boundary at c, since c∈C has its whole cylinder track collapsed. Step 3.1 supplies a based nullhomotopy of Fu in K, hence of kFu in W. Concatenation proves that ju is based null in W. Composing with w from step 5.1 gives a based nullhomotopy of wju=u in P. Therefore the homomorphism q∗ at c has trivial kernel. Together with step 2.1 it is an isomorphism in every positive degree, including degree one without an abelian assumption.

7.1F1F7step 1.1step 6.1

For arbitrary p∈P, path-connectedness in step 1.1 supplies one path from c to p. The transport square for this path and its image under q commutes by the representative formula in [F7]. Since the map at c is an isomorphism by step 6.1, the map at p is an isomorphism as well. Combining with component bijectivity from step 1.1 proves weak equivalence [F1]. Only a path for the one point currently under consideration is used.

8.1F3F4F5step 1.1step 2.1step 3.1step 4.1step 5.1step 6.1step 7.1∎

Nonempty C is required to supply c and the single-component reduction; empty C is outside this statement. A side equal to C and empty relative cell sets cause no change in the constructions or finite lifting arguments. All degrees are positive in the group calculation, and components were treated separately. Constant cubes and repeated cell-boundary identifications retain their prescribed values because every construction fixes C and every lift extends its specified source subcomplex exactly. The nullhomotopy in step 6.1 fixes the basepoint even when c is not a vertex. The only witness families taken together in steps 2.1–5.1 are finite, or are given data on the common C; each cellular approximation and lifting has finitely many relative source cells. This proves the claim without AC.

Depends on

Dependency tree · 2 levels

Sources