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.
K₁ of a ring and the Whitehead group of a discrete group
Definition
Let be an associative unital ring and let be its stable groups (Stable general linear and elementary groups for right modules). By Stable elementary matrices equal the commutator subgroup, is normal in and equals the commutator subgroup, so the quotient is an abelian group. This group is written additively: for the symbol denotes the class of the stabilized matrix in , and the group law is the one induced by matrix multiplication, so for compatible ; the class is unchanged by stabilization and equals the class of for every . The reduced group is the quotient of by the subgroup generated by the class of the matrix (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups); in one has for every invertible .
Now let be a discrete group, with integral group ring , a unital ring with basis the classes of the group elements (The group ring of finitely supported formal -linear combinations of group elements, The group ring is a unital -algebra with basis , and each is a unit of ). The Whitehead group of is the quotient by the subgroup generated by the classes of the unit matrices . Reading the generators in the order , then , exhibits the same subgroup as , so there is a natural identification
Functoriality and well-definedness. A unital ring homomorphism carries invertible matrices to invertible matrices and elementary matrices to elementary matrices, hence induces and ; a group homomorphism induces the unital ring homomorphism , , which sends to and therefore descends to a homomorphism . These assignments are compatible with composition and preserve identities. If is an inner automorphism of , given by , then the induced ring automorphism of is conjugation by the unit , so on it acts as with the scalar matrix ; conjugation by a fixed invertible matrix is the identity on the quotient , because . Hence inner automorphisms of induce the identity on .
Depends on
- Stable elementary matrices equal the commutator subgroup
- The group ring $R[G]$ of finitely supported formal $R$-linear combinations of group elements
- The group ring $R[G]$ is a unital $R$-algebra with basis $G$, and each $g\in G$ is a unit of $R[G]$
- Normal subgroup: invariance under conjugation
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- Stable general linear and elementary groups for right modules
Used by
- Ordinary acyclicity forgets nonzero group-ring torsion Counterexample
- Finite based free complexes and contraction torsion Definition
- Whitehead torsion of a finite CW homotopy equivalence Definition
- A free-face interval expansion has zero torsion Example
- The Whitehead group of the trivial group is zero Example
- Torsion of a two-term based contractible complex Example
- A chain contraction makes the odd-to-even parity map invertible Lemma
- An elementary CW expansion has zero Whitehead torsion Lemma
- Basis-change, direct-sum and based exact-sequence formulas Lemma
- Cellular basis ambiguities vanish in the Whitehead group Lemma
- Contraction torsion does not depend on the contraction Lemma
- Every Whitehead class is realized by a finite CW homotopy equivalence Lemma
- Zero relative torsion gives a finite relative elementary deformation Lemma
- Composition and based-pair sum formulas for Whitehead torsion Theorem
- Simple homotopy equivalences have zero torsion Theorem
Dependency tree · two levels
16 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
- Lück, §2.1, pp.24–26 (standard reference, not scraped)
- Cohen, §19, pp.62–65 (standard reference, not scraped)