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.

Every Whitehead class is realized by a finite CW homotopy equivalence

Statement

For a connected finite CW complex X, π=π1X and η∈Wh⁡(π), there is a finite CW complex Y⊃X such that i:X↪Y is a homotopy equivalence and i∗−1τ(i)=η. Only relative cells in two consecutive degrees n,n+1, with even n≥max⁡(4,dim⁡X+1), are needed. For a disconnected finite X, a prescribed class on each of its finitely many components is realized componentwise.

Facts & Assumptions

Given: A connected finite X and a Whitehead class η.

[F1]

Each Whitehead class has a representative A∈GLm(Z[π]), with finite m; a zero class may be represented by an identity matrix (K₁ of a ring and the Whitehead group of a discrete group).

[F2]

The relative boundary of a two-high-layer pair is the matrix of the triple homotopy boundary in oriented lifted-cell bases (Two high relative cell layers have free homotopy bases and their cellular boundary matrix).

[F3]

For a simply connected (k−1)-connected CW pair with nonempty simply connected base, the relative Hurewicz map πk→Hk is an isomorphism without any choice principle (Relative Hurewicz comparison through a choice-free weak model).

[F4]

The cellular complex of a CW pair computes its relative singular homology (Cellular homology computes singular homology).

[F5]

A weak homotopy equivalence between finite CW complexes is a homotopy equivalence without any choice principle (Whitehead theorem).

[F6]

Attaching cells of dimension at least three preserves components and fundamental groups (High relative cells do not change lower homotopy); based maps from simply connected spheres lift to universal covers (Lifting criterion for maps from path-connected locally path-connected spaces).

[F7]

Inclusion torsion is the torsion of its based relative universal-cover complex, with two-term sign (−1)q+1 when the upper cells have degree q (Whitehead torsion of a finite CW homotopy equivalence, Composition and based-pair sum formulas for Whitehead torsion).

Proof

technique · direct
1.1F1F6given

Choose A=(aij)∈GLm(R) with R=Z[π] representing η, allowing m=1 and A=I for η=0. Choose an even integer n≥max⁡(4,dim⁡X+1). Attach m n-cells by constant maps at the chosen base vertex to form Xn=X∨⋁j=1mSjn. By [F6], π1Xn=π and no lower relative homotopy is introduced.

2.1F1F2step 1.1

Each aij is a finite integral sum of elements of π. The jth wedge sphere, preceded by a based whisker representing a group element and repeated by signed pinch maps, realizes its coefficient in πn(Xn). Since n≥2, this is an abelian group and finite sums of these maps are represented by based maps Sn→Xn. For each column j choose one such map fj whose relative coordinates are (a1j,…,amj)T; only finitely many explicit choices are needed. Attach m (n+1)-cells along the fj to form finite Y. The right-module column convention and [F2] make the relative cellular differential exactly A.

3.1F4F6step 2.1

By [F6] the map i:X↪Y induces a component bijection and an isomorphism on π1. The inverse image X~ of X in the universal cover Y~ is the connected universal cover of X: the π1-isomorphism makes the restricted cover connected, and a loop in it maps to a null loop in Y and hence is null in X. Both X~ and Y~ are simply connected. Their relative cellular chain complex is 0→Rm→ARm→0 in degrees n+1,n, so it has zero homology in every degree because A is invertible. By [F4], Hk(Y~,X~;Z)=0 for every k.

4.1F3F6step 3.1

Suppose some πk(Y~,X~) were nonzero and take the least such k. Since the pair has no relative cells below n≥4, it is at least 3-connected and k≥n≥4; its base X~ is simply connected. The choice-free comparison [F3] gives πk(Y~,X~)≅Hk(Y~,X~;Z)=0, a contradiction. Hence all relative homotopy groups vanish. Coverings induce isomorphisms on higher homotopy groups by lifting spheres and homotopies; together with the π1-isomorphism of step 3.1, i is a weak homotopy equivalence.

5.1F5F7step 2.1step 4.1

Both X and Y are finite, so the finite choice-free clause [F5] makes i a homotopy equivalence. Its relative complex has upper degree q=n+1, and n is even, so (−1)q+1=(−1)n+2=+1. Therefore [F7] gives i∗−1τ(i)=[A]=η. For finitely many connected components, repeat the construction separately on each component and take their finite disjoint union; no component transport or infinite choice is involved. ∎

Depends on

Used by

Dependency tree · two levels

74 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