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.
A chain contraction makes the odd-to-even parity map invertible
Statement
Let be an associative unital ring and let be a bounded free right -chain complex, so that for all but finitely many and each is a free right -module. A chain contraction of is a family of right-linear maps with for every , that is, the identity of is null-homotopic and is contractible; equivalently as maps of graded modules. Write and , and let and be the odd-to-even and even-to-odd components of the degree-one perturbation of the differential.
Then:
For the matrix assertions in clause 2, choose a finite ordered basis of each and suppose that the concatenated bases and have equal size. Use these same bases for every parity map and every contraction below. A bracket on a parity map means the class of its square matrix in these source and target bases. The triangular assertions use decreasing degree order; the equality of classes holds in any fixed ordering of these bases.
- and are isomorphisms of right -modules, mutually inverse up to the unipotent correction : one has on and on , where raises degrees by two and is nilpotent. This holds over an arbitrary unital and uses no rank, freeness, commutativity or invariant-basis-number hypothesis.
- If is a second chain contraction, , and , then , and the composites are the identity plus maps that strictly raise degrees by even positive amounts. In particular, when the two displayed bases are finite and of the same size and ordered by decreasing degree, all four matrices are unipotent upper triangular and hence have class in , and
Facts & Assumptions
Given: A bounded free right -chain complex over a unital ring , a chain contraction , and a second chain contraction .
A complex is contractible exactly when its identity is null-homotopic, and a null-homotopy of the identity is a degree-one family with (A contractible complex, A chain homotopy).
Odd and even parts of a graded module are the direct sums of the modules of the corresponding degrees, and maps add by components (The direct sum of an indexed family of modules).
For a right -module and right-linear maps, the composite is computed by composing the components; and raises degree by one (Chain complex in an abelian category).
In the class is additive over products, , and every matrix that is unipotent and upper triangular in a finite ordered basis lies in , hence has class (K₁ of a ring and the Whitehead group of a discrete group, Stable elementary matrices equal the commutator subgroup).
A matrix is unipotent upper triangular in the degree-ordered basis when it is the identity plus a map raising degrees, and a product of matrices with a degree-raising factor has matrix computed by the block decomposition of [F2] (Stable general linear and elementary groups for right modules).
Proof
As a map of the graded module , by [F1] and ; restricting to and gives and .
The map raises degrees by two, and on the bounded complex it is nilpotent: for large. Hence is invertible on each of and with inverse , a finite sum. If the homogeneous bases are finite, its matrix in decreasing degree order is upper unitriangular and has class in by [F4]; no class is asserted for infinite bases.
For a homogeneous of even degree one computes and then ; applying and collecting the part of degree gives , and using , and this equals , while every remaining term lies in degree or . Hence with strictly raising degree by an even positive amount and .
From step 1.1, is invertible, so is injective; its composite in the other order is invertible, so it is surjective. Hence is an isomorphism, and by symmetry so is ; this used no finiteness or rank hypothesis beyond boundedness.
The same computation with and interchanged and replaced by gives with strictly raising degree by an even positive amount and . The maps and themselves raise degree by two, so their identity-plus maps are unipotent on the bounded complex; no square-zero assertion about is needed.
Assume now that the displayed bases are finite and of the same size, so that the matrices of , and the four corrections are defined; by steps 1.3 and 2.2 the four correction matrices are unipotent upper triangular in the degree-ordered bases, hence have class in by [F4], and additivity of the class gives .
Therefore in ; taking gives in addition , and the module-isomorphism assertions hold over an arbitrary associative unital ring without a rank or invariant-basis-number assumption. The equalities in this step retain the finite, equal-size basis hypothesis of step 3.1.
Depends on
- A contractible complex
- Unital left and right modules over a ring; unqualified module means left module
- A chain homotopy
- The direct sum of an indexed family of modules
- K₁ of a ring and the Whitehead group of a discrete group
- Chain complex in an abelian category
- Stable elementary matrices equal the commutator subgroup
- Stable general linear and elementary groups for right modules
Used by
Dependency tree · two levels
21 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.2, equation (2.7), pp.27–28 (standard reference, not scraped)