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.

A chain contraction makes the odd-to-even parity map invertible

Statement

Let R be an associative unital ring and let C be a bounded free right R-chain complex, so that Cn=0 for all but finitely many n and each Cn is a free right R-module. A chain contraction of C is a family of right-linear maps sn:Cn→Cn+1 with dn+1sn+sn−1dn=idCn for every n, that is, the identity of C is null-homotopic and C is contractible; equivalently ds+sd=id as maps of graded modules. Write Codd=⨁nC2n+1 and Ceven=⨁nC2n, and let (d+s)odd:Codd→Ceven and (d+s)even:Ceven→Codd be the odd-to-even and even-to-odd components of the degree-one perturbation d+s of the differential.

Then:

For the matrix assertions in clause 2, choose a finite ordered basis Bn of each Cn and suppose that the concatenated bases Bodd and Beven have equal size. Use these same bases for every parity map and every contraction below. A bracket on a parity map means the K1(R) 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.

  1. (d+s)odd and (d+s)even are isomorphisms of right R-modules, mutually inverse up to the unipotent correction id+s2: one has (d+s)even(d+s)odd=id+s2 on Codd and (d+s)odd(d+s)even=id+s2 on Ceven, where s2 raises degrees by two and is nilpotent. This holds over an arbitrary unital R and uses no rank, freeness, commutativity or invariant-basis-number hypothesis.
  2. If t is a second chain contraction, u=s−t, μn=(sn+1−tn+1)tn and νn=(tn+1−sn+1)sn, then (id+μ)odd, (id+ν)even and the composites (d+s)odd (id+μ)odd (d+t)even,(d+t)even (id+ν)even (d+s)odd 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 0 in K1(R), and [(d+s)odd]=−[(d+t)even]∈K1(R).

Facts & Assumptions

Given: A bounded free right R-chain complex C over a unital ring R, a chain contraction s, and a second chain contraction t.

[F1]

A complex is contractible exactly when its identity is null-homotopic, and a null-homotopy of the identity is a degree-one family s with ds+sd=1 (A contractible complex, A chain homotopy).

[F2]

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).

[F3]

For a right R-module Cn and right-linear maps, the composite (d+s)2 is computed by composing the components; d2=0 and s raises degree by one (Chain complex in an abelian category).

[F4]

In K1(R)=GL(R)/E(R) the class is additive over products, [AB]=[A]+[B], and every matrix that is unipotent and upper triangular in a finite ordered basis lies in E(R), hence has class 0 (K₁ of a ring and the Whitehead group of a discrete group, Stable elementary matrices equal the commutator subgroup).

[F5]

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

technique · direct
1.1

As a map of the graded module C, (d+s)2=d2+ds+sd+s2=id+s2 by [F1] and d2=0; restricting to Codd and Ceven gives (d+s)even(d+s)odd=id+s2 and (d+s)odd(d+s)even=id+s2.

givenF1F2F3algebra
1.2

The map s2 raises degrees by two, and on the bounded complex C it is nilpotent: (s2)kCn⊆Cn+2k=0 for k large. Hence id+s2 is invertible on each of Codd and Ceven with inverse ∑k≥0(−s2)k, a finite sum. If the homogeneous bases are finite, its matrix in decreasing degree order is upper unitriangular and has class 0 in K1(R) by [F4]; no K1 class is asserted for infinite bases.

givenF1F4F5
1.3

For a homogeneous x of even degree one computes (d+t)x=dx+tx and then (id+ut)(d+t)x=dx+tx+utdx+ut2x; applying d+s and collecting the part of degree deg⁡x gives sdx+dtx+dutdx, and using du=−ud, dtd=d and ds+sd=id this equals (x−dsx)+(x−tdx)−udx=x, while every remaining term lies in degree deg⁡x+2 or deg⁡x+4. Hence (d+s)(id+μ)(d+t)=id+N with N strictly raising degree by an even positive amount and μ=ut.

givenF1algebra
2.1

From step 1.1, (d+s)even∘(d+s)odd is invertible, so (d+s)odd is injective; its composite in the other order is invertible, so it is surjective. Hence (d+s)odd is an isomorphism, and by symmetry so is (d+s)even; this used no finiteness or rank hypothesis beyond boundedness.

givenstep 1.1step 1.2
2.2

The same computation with s and t interchanged and u replaced by −u gives (d+t)(id+ν)(d+s)=id+N′ with N′ strictly raising degree by an even positive amount and ν=−us. The maps μ=ut and ν=−us themselves raise degree by two, so their identity-plus maps are unipotent on the bounded complex; no square-zero assertion about u=s−t is needed.

givenstep 1.3algebra
3.1

Assume now that the displayed bases are finite and of the same size, so that the matrices of (d+s)odd, (d+t)even 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 0 in K1(R) by [F4], and additivity of the class gives [(d+s)odd]+[(d+t)even]=0.

F4F5step 1.3step 2.2
4.1

Therefore [(d+s)odd]=−[(d+t)even] in K1(R); taking t=s gives in addition [(d+s)odd]=−[(d+s)even], and the module-isomorphism assertions hold over an arbitrary associative unital ring without a rank or invariant-basis-number assumption. The K1 equalities in this step retain the finite, equal-size basis hypothesis of step 3.1.

step 2.1step 3.1∎

Depends on

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