Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 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.

Stable general linear and elementary groups for right modules

Definition

Throughout, R is an associative unital ring, not assumed commutative (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides). For n≥0 let Rn be the set of column vectors v=(v1,…,vn) with vi∈R, made into a right R-module by entrywise addition and the right action (v⋅r)i:=vir(r∈R) (Unital left and right modules over a ring; unqualified module means left module); for n=0 this is the zero module, whose unique element is the empty column. A map f:Rn→Rm is right R-linear when f(v+v′)=f(v)+f(v′) and f(v⋅r)=f(v)⋅r.

Matrices. Every right-linear f:Rn→Rm has a unique matrix A∈Mm×n(R), written A=(Aij), such that (Av)i=∑j=1nAijvj, the sum being the finite sum in the additive group of R; uniqueness uses that the standard basis vectors e1,…,en of Rn generate it and that columns of A are the coordinate vectors of f(ej). If g:Rm→Rp has matrix B, then g∘f:Rn→Rp has matrix BA, with (BA)ik=∑jBijAjk; this is the displayed order and it uses only associativity and distributivity.

General linear group. Let GLn(R) be the group of n×n matrices over R possessing a two-sided inverse, with multiplication of matrices as the group operation and In as the identity; by the previous paragraph GLn(R) is exactly the group of right-linear automorphisms of Rn. The stabilization A↦diag⁡(A,1) identifies GLn(R) with a subgroup of GLn+1(R), and GL(R):=⋃n≥0GLn(R) is the stable general linear group, in which every element is represented by some n×n matrix. A matrix A belongs to GLn(R) when there is a matrix B satisfying both AB=In and BA=In; either equation alone need not imply the other over an arbitrary unital ring. No determinant, commutativity, or rank function is used anywhere in this definition.

For a concrete one-sided inverse, take R=End⁡k(V) where V has basis e0,e1,…. Let S(ei)=ei+1 and let L(e0)=0, L(ei+1)=ei. Then LS=1V, while SL(e0)=0≠e0, so the 1×1 matrices A=L and B=S satisfy AB=I1 but not BA=I1.

Elementary matrices. For n≥1, 1≤i,j≤n with i≠j and r∈R, let Eij be the matrix with entry 1 in position (i,j) and 0 elsewhere, and let eij(r):=In+rEij be the corresponding elementary matrix. It is invertible with two-sided inverse eij(−r), because Eij2=0 and hence eij(r)eij(−r)=In. Let En(R) be the subgroup of GLn(R) generated by all elementary matrices in GLn(R) for n≥1, and set E0(R)={I0}. Let E(R):=⋃n≥0En(R) be the stable elementary subgroup, the subgroup of GL(R) generated by the images of all elementary matrices. Elementary matrices are stable in the same way: eij(r) in GLn(R) is the image of the elementary matrix with the same indices in GLn+1(R).

Depends on

Used by

Dependency tree · two levels

9 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