Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

Cell slides and stabilizations realize elementary group-ring matrices

Statement

Let L⊂K be a homotopy-equivalence inclusion of connected finite CW complexes, with only relative cells in degrees n,n+1, n≥3. Put R=Z[π1L], choose oriented lifts, and let A be the invertible relative boundary matrix in the right-module column convention. A finite formal deformation fixing L realizes A↦PAQ for elementary matrices P,Q over R and A↦diag⁡(A,Im). Reordering, reversing orientations, and changing lifts implement permutations and diagonal factors ±g. Every resulting pair has the same relative simple type over L.

Facts & Assumptions

Given: The finite connected homotopy-equivalence pair and chosen bases in the statement.

[F1]

In two high relative cell degrees, the relative homotopy groups have free right R-bases on the lifted cells, their triple boundary is the cellular boundary, and for a homotopy equivalence this boundary is an isomorphism (Two high relative cell layers have free homotopy bases and their cellular boundary matrix).

[F2]

An elementary expansion adds a free-face cell pair and its collapse removes it; both operations may fix a retained subcomplex (Elementary expansions and collapses of finite CW complexes).

[F3]

The inclusion of a CW subcomplex is a cofibration, so homotopies of its attaching maps extend over finite cell attachments (Relative CW inclusions are cofibrations).

[F4]

Reordering, orientation reversal and a new deck lift change a group-ring cellular basis by a permutation or a diagonal factor ±g; elementary changes and these trivial units do not change its Whitehead class (Cellular basis ambiguities vanish in the Whitehead group).

[F5]

The stable elementary subgroup E(R) is normal in GL(R) (Stable elementary matrices equal the commutator subgroup).

[F6]

For the pair (V,L) the kernel of πn(V)→πn(V,L) is the image of πn(L). For V=L∨⋁Sjn, the standard sphere classes map to the relative cell basis, so any class in πn(V) is a sum of those sphere classes with group-ring coefficients and a class from πn(L) (Long exact sequence of relative homotopy groups, [F1]).

Proof

technique · direct
1.1

Each attaching sphere of a relative n-cell maps into L. Its class in πn−1(L) maps to zero in πn−1(K) because the cell fills it. The inclusion is a homotopy equivalence, so that homomorphism is injective; each attaching sphere is therefore null-homotopic in L. This also holds for n=3, where the relevant group is π2.

given
2.1

A chosen null-homotopy changes that attaching map to a constant map through the standard collar: attach a copy of the n-cell and an (n+1)-cell whose two cap faces are the old and new characteristic disks and whose side is the homotopy, then collapse the old cap. This is precisely the two-expansion/collapse comparison of homotopic attaching maps in Cohen’s attaching-map comparison (printed p.23), carried out relative to L using [F2] and [F3]. Repeat finitely for the lower cells and push the attaching maps of the upper cells across each collapse by the same collar construction. Thus the pair is formally deformed relative to L to simplified form, where every lower n-cell is trivially attached at the chosen base vertex of L. The deformation does not change its relative simple type.

F2F3step 1.1
3.1

In simplified form put Kn=L∨⋁j=1aSjn, and write φj:Sn→Kn for the attaching map of the jth upper (n+1)-cell and uj for its relative class. Given distinct upper indices i,j and r=∑gagg∈R, represent the based sphere class [φj]+[φi]r∈πn(Kn) by a finite pinch-and-whisker map θ:Sn→Kn: one sphere summand gives φj, and the finitely many other signed summands give the g-translates of φi. Since n≥3, πn(Kn) is abelian; the right group-ring action and triple boundary are those of [F1], so the relative image of θ is ∂uj+(∂ui)r. This constructs an attaching map for a new upper cell, not a replacement characteristic disk for an existing lower cell.

F1step 2.1
3.2

Attach at the basepoint of L a trivially attached n-cell and an (n+1)-cell whose attaching sphere wraps once around that new n-sphere and misses the old relative cells. The new lower cell is a free face after choosing the evident characteristic maps, so this is an elementary expansion relative to L; its relative boundary adds a 1 diagonal block and zero off-diagonal blocks. Repeating gives A↦diag⁡(A,Im).

F2step 2.1
4.1

Let C be the CW subcomplex containing Kn and all upper cells except ejn+1; since i≠j, it contains ein+1. The attaching sphere φi extends over the characteristic disk of ein+1 in C, so every whiskered multiple [φi]r is null-homotopic in C. Thus φj and the map θ of step 3.1 are homotopic as maps into C. Apply the finite collar expansion/collapse comparison of homotopic attaching maps, as in step 2.1, to replace the jth upper cell attached by φj with a new upper cell attached by θ; all other cells and L stay fixed. In the unchanged lower basis and the upper basis in which only uj is replaced by its new characteristic class, the jth boundary column changes from Aj to Aj+Air by step 3.1, while every other column stays fixed. Hence the new matrix is A(I+Eijr) in the right-module column convention. The reverse collar realizes its inverse I−Eijr. This is Cohen’s cell-slide construction, printed pp.31–32, translated from his upper-indexed row notation.

F1F2F3step 2.1step 3.1
5.1

For an elementary left factor P and an a×a matrix A, normality [F5] gives A−1PA∈E(R) in the stable group. Thus for some finite m, the matrix diag⁡(A−1PA,Im) is a product of elementary matrices of size a+m. First perform the m stabilizations of step 3.2. The upper-cell slides of step 4.1 for that product then change diag⁡(A,Im) to diag⁡(PA,Im). This establishes the desired operation with extra identity pairs; the next step removes those pairs geometrically. No unstabilized normality is assumed.

F1F5step 3.2step 4.1
6.1

The lower skeleton is still V=L∨⋁j=1a+mSjn: the slides changed only upper attaching maps. For an added lower index j>a, the corresponding upper attaching map has relative class bj, and every other upper map has zero jth coordinate. By [F6], the first is homotopic in V to σj+αj, where σj traverses the jth lower sphere once and αj lies in L; represent this sum with the traversal on one disk and the L-map on its complementary disk. Every other upper map is homotopic to a finite sum of sphere terms using only the other lower indices and a term in L, so it can avoid the interior of this lower cell. Make these replacements using the collar construction of step 2.1. Now the jth lower cell is a genuine free face of its matched upper cell, and no other upper cell meets its interior. Collapse this pair. The other relative coordinates are unchanged because the homotopies took place in V and the remaining maps avoid that pair. Repeating for the m added indices leaves exactly the matrix PA. Thus stabilization has not weakened the claimed original-size operation.

F1F2F6step 2.1step 5.1
7.1

A simultaneous left and right elementary operation PAQ is a finite composite of steps 5.1–6.1 and 4.1; stabilization may be inserted first. Basis permutations, orientations and lifts have exactly the effects asserted in [F4]. All constructions used finitely many cells and finitely many summands of a group-ring coefficient, and each map fixes L, proving the statement. ∎

F4step 4.1step 3.2step 5.1step 6.1

Depends on

Used by

Dependency tree · two levels

57 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