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.

Finite based free complexes and contraction torsion

Definition

Let R be an associative unital ring. A finite based free right R-chain complex is a chain complex C of right R-modules (Chain complex in an abelian category, Unital left and right modules over a ring; unqualified module means left module) which is bounded, so that Cn=0 for all but finitely many n, together with a preferred finite basis Bn of the free right R-module Cn for every n; the union B=⨆nBn is the displayed basis and the elements of Bn are the displayed basis vectors of degree n. The degree-ordered bases are Bodd=(b∈Bn:n odd, n increasing),Beven=(b∈Bn:n even, n increasing), each written as a finite list by increasing degree and, within a degree, in the order fixed by Bn. A chain contraction s of C is a right-linear family with ds+sd=id (A chain contraction makes the odd-to-even parity map invertible).

Assume now that #Bodd=#Beven. By the parity lemma (A chain contraction makes the odd-to-even parity map invertible) the odd-to-even component Φs:=(d+s)odd:Codd→Ceven is an isomorphism of right R-modules, so its matrix As in the displayed bases Bodd, Beven is an invertible square matrix over R, and the contraction torsion of (C,s) is the class τs(C):=[As]∈K~1(R) of K₁ of a ring and the Whitehead group of a discrete group. The displayed bases fix the sign convention: the odd-to-even parity is used, not the even-to-odd one.

Automatic equality of basis sizes. If R has invariant basis number, then #Bodd=#Beven always holds, because Φs is an isomorphism of free right R-modules Codd→Ceven; in particular this applies to every group ring R=Z[π] by Integral group rings have invariant basis number. Over a ring without invariant basis number the matrix formula is asserted only when the two displayed finite basis sizes agree, as above; the parity lemma itself needs no such hypothesis.

The two-term case. Let q≥1, let u∈R be a unit, and let C be the complex 0→Cq=R→uCq−1=R→0 with the displayed single basis vector in each of the degrees q and q−1 and zero elsewhere. The contraction identity forces u to be a unit and sq−1=u−1, sq=0, so the complex is contractible with that contraction. If q is odd the map (d+s)odd contains the component Cq→Cq−1 with matrix (u) and no other nonzero component, so τ(C)=[u]; if q is even the same component belongs to the even-to-odd map, (d+s)odd=u−1 on the remaining degree, and τ(C)=[u−1]=−[u]. Thus τ(C)=(−1)q+1[u]∈K~1(R), which is the parity sign used throughout this page.

Depends on

Used by

Dependency tree · two levels

24 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