Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Whitehead torsion of a finite CW homotopy equivalence

Definition

Let f:X→Y be a homotopy equivalence of finite CW complexes. Choose a vertex x∈X and, after taking a cellular representative still denoted f, put y=f(x), a vertex of Y; set π=π1(Y,y). Then the based induced map f∗:π1(X,x)→π is an isomorphism (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type). Other basepoints are compared by supplied paths in the independence theorem. Choose

Coefficient transport. Transport the right Z[π1(X,x)]-module structure on C∗(X~) along the ring isomorphism Z[f∗]:Z[π1(X,x)]→Z[π], so that c⋅λ:=c⋅f∗−1(λ) for λ∈Z[π]. By Universal-cover boundaries, maps and homotopies respect the right group-ring action the transported boundary and the chain map C∗(f~) are right Z[π]-linear, and by A lifted finite CW equivalence has a contractible group-ring mapping cone C∗(f~) is a chain homotopy equivalence of bounded complexes of finite based free right Z[π]-modules.

The class. Form the algebraic mapping cone with the differential recorded in The mapping cone of a chain map, Cone⁡(C∗(f~))n=Cn(Y~)⊕Cn−1(X~),d(y,x)=(dY~y+Cn−1(f~)x, −dX~x), carrying in each degree the displayed basis of Cn(Y~) followed by that of Cn−1(X~), so that the target summands come first. This complex is bounded, finite based free and contractible, and Z[π] has invariant basis number, so the contraction torsion of Finite based free complexes and contraction torsion is defined for it, is independent of the chosen contraction by Contraction torsion does not depend on the contraction, and lands in K~1(Z[π]). Define τ(f):=image of τ(Cone⁡(C∗(f~))) in Wh(π)=K1(Z[π])/⟨[±γ]:γ∈π⟩, using the quotient map of K₁ of a ring and the Whitehead group of a discrete group. Equivalently, τ(f) is the image of the reduced class [ (d+s)odd ]∈K~1(Z[π]) for any contraction s of the cone.

Disconnected complexes. If Y has components D, write π1D for the fundamental group of a component at a chosen basepoint; every component of a finite CW complex has the homotopy type of a connected finite CW complex and contains a vertex, so this is defined. Since f is a homotopy equivalence it maps components of X bijectively onto components of Y, and the data above are chosen componentwise; the class τ(f)∈⨁D∈π0(Y)Wh(π1D) has as its D-component the torsion of the restriction to the component of Y corresponding to D, computed with a basepoint in that component and its chosen lift. For connected Y this is the single class defined above.

Status. This is a definition by chosen data: the contraction, the cellular representative, the basepoint paths, the lifts, the orientations and the order of the cells are all auxiliary. The next theorem proves that the resulting class in Wh does not depend on them; until then τ(f) denotes the class attached to the displayed choices. No further quotient and no further choice principle is used, the cellular representative exists choice-free for finite complexes, and all choices made here are finite except the (finite) choice of cell lifts.

Depends on

Used by

Dependency tree · two levels

81 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