Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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 matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace

Statement

Let k be a field.

  1. Let R be a commutative ring, M a free R-module of finite rank n with basis (e0,…,en−1), and let v0,…,vn−1∈M span M. Then the coordinate matrix A of (v0,…,vn−1) in the basis (ei) has a right inverse, det⁡(A) is a unit of R, and (v0,…,vn−1) is a basis of M. The determinant is formed for n≥1; for n=0 the module is the zero module and the empty family is its basis, with no determinant clause.
  2. If F⊆E is a field extension and A∈Mm×n(F), then the rank of A over F equals its rank over E.
  3. Let B be a finite-dimensional k-algebra and N a finite-dimensional left B-module. A proper submodule has strictly smaller k-dimension, a maximal proper submodule of a nonzero finite-dimensional module exists by maximal dimension (no arbitrary Choice), and iterating produces a finite composition series of N (Composition series and length of a module); in particular N has finite length.
  4. If S1,…,Sm are simple B-modules and N⊆S1⊕⋯⊕Sm is a submodule, then N is isomorphic to a direct sum of a subfamily of the Si, and N has a complement in S1⊕⋯⊕Sm.
  5. If T:N→N is k-linear with Tr=0 for some r≥1, then tr⁡(T)=0 (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

Facts & Assumptions

Given: A field k; a commutative ring R; a free R-module M of finite rank n with basis (e0,…,en−1) and vectors v0,…,vn−1 spanning M; a field extension F⊆E and a matrix A∈Mm×n(F); a finite-dimensional k-algebra B and a finite-dimensional left B-module N; simple B-modules S1,…,Sm and a submodule N⊆S1⊕⋯⊕Sm; a k-linear T:N→N with Tr=0 for some r≥1.

[F1]

A free module on a set has a standard basis with unique finite expansions, and a family (bx) is a basis of a module when every element is uniquely a finite R-linear combination of the bx (The free module on a set and its standard basis).

[F2]

Matrix product and identity over a commutative ring: (AB)ik=∑j<naijbjk, and In has entry 1 on the diagonal and 0 elsewhere (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose).

[F3]

Invertibility over a commutative ring means the existence of C with AC=In=CA, and the inverse is unique (Invertible square matrices and similarity over a commutative ring).

[F4]

The Leibniz determinant is det⁡(A)=∑σ∈Snsgn⁡(σ)∏i<naσ(i),i and is multiplicative, det⁡(AB)=det⁡(A)det⁡(B) (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[F5]

A matrix A∈Mn(R) over a commutative ring is invertible if and only if det⁡(A) is a unit of R (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit).

[F6]

Every family of nonempty sets indexed by a natural number n has a choice function (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[F7]

The row space Row⁡(A)⊆Fn is the span of the rows, and rank⁡(A)=dim⁡FRow⁡(A), defined because a finite list spans it (Row space, column space, nullspace, row rank, column rank and matrix rank).

[F8]

An R-algebra has a central structure map, and a left module over a k-algebra is a k-vector space through that map (Algebras over a commutative ring, central structure maps, and algebra homomorphisms, Unital left and right modules over a ring; unqualified module means left module).

[F9]

A subspace of a finite-dimensional space is finite-dimensional with no larger dimension; dim⁡FU=dim⁡FV holds for U⊆V exactly when U=V; every independent subset of a finite-dimensional space is contained in a basis (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[F11]

The trace of a square matrix is the sum of its diagonal entries, and the trace of an endomorphism of a finite-dimensional space is the trace of any matrix of it (The trace tr⁡(A) as the sum of the diagonal entries, The basis-independent trace of an endomorphism of a finite-dimensional vector space).

[F14]

The direct sum ⨁i=1mSi is the submodule of the product of tuples with finite support, with coordinate inclusions (The direct sum of an indexed family of modules).

Proof

technique · direct
1.1givenF1F6algebrachoose

Write the unique coordinate expansion vj=∑i<naijei of each vj in the basis (ei); this is the coordinate matrix A=(aij), and identifying M with Rn through coordinate expansions of [F1] carries vj to the j-th column aj of A and is an R-module isomorphism. Since the vj span M, the columns aj span Rn, so for every i<n the set {b∈Rn:Ab=ei} is nonempty; by [F6] applied to the function i↦{b∈Rn:Ab=ei} on n there are b0,…,bn−1∈Rn with Abi=ei, and B∈Mn(R) denotes the matrix with i-th column bi.

1.2givenF7F12algebra

Let U⊆Fn be the F-row space of A and (u0,…,ur−1) an F-basis of it, so that r=rank⁡F(A) by [F7]; by [F12] the field extension makes En an F-vector space containing Fn, and viewing rows and the ui in En, every row of A is an F-combination of the ui and hence an E-combination, so every E-combination of the rows is an E-combination of the ui: each ui is itself an F-combination of the rows and therefore lies in UE, so the list (u0,…,ur−1) E-spans the E-row space UE of the matrix A read over E.

1.3givenF8F9algebra

A submodule of N is closed under k-scalars through the structure map of the k-algebra B of [F8], hence is a k-linear subspace of N; consequently, if L⊊L′⊆N are submodules then dim⁡kL<dim⁡kL′ by [F9].

1.4givenF13F14algebra

Claim 4 is proved by induction on m. For m=0 the direct sum is 0, so N=0 is the empty direct sum with complement 0; for m=1 the only submodules of the simple module S1 are 0 and S1, the direct sums over the empty and the full subfamily, with complements S1 and 0; for m≥2, write S:=S1 and M:=S2⊕⋯⊕Sm, a direct sum of m−1 simple modules, so that S1⊕⋯⊕Sm=S⊕M with the coordinate projections as in [F14], and let N⊆S⊕M be a submodule.

1.5givenF9F10algebra

If T:N→N is k-linear with Tr=0, put Kj:=ker⁡(Tj) for j≥0, so that K0=0 and 0=K0⊆K1⊆⋯⊆Kr=N is a chain of k-subspaces of the finite-dimensional space N, with Kj finite-dimensional for every j by [F9]; extend a basis of Kj successively to a basis of Kj+1 using the extension clause of [F9] and concatenate the successive blocks to an ordered basis (w1,…,wd) of N in the sense of [F10].

2.1step 1.1F2F4algebra

By [F2] the i-th column of AB is Abi=ei, so AB=In; by [F4] det⁡(A)det⁡(B)=det⁡(AB)=det⁡(In), and the Leibniz expansion of det⁡(In) has vanishing products ∏i<n(In)σ(i),i unless σ=id⁡, so det⁡(In)=1 for n≥1 and det⁡(A)det⁡(B)=1: the determinant det⁡(A) is a unit of R with inverse det⁡(B).

2.2step 1.2F7F12algebra

Suppose ∑i<rλiui=0 in En with all λi∈E. The coefficients span an F-subspace L⊆E that is spanned by the finitely many λi; discarding from that finite spanning list each vector lying in the span of those retained leaves an F-basis (μ1,…,μt) of L, and λi=∑tcitμt with cit∈F. For each coordinate k<n the equality gives 0=∑i<rλiui(k)=∑tμt(∑i<rcitui(k)) in E; the μt are F-independent in E and the coefficients ∑i<rcitui(k) lie in F, so they all vanish, that is ∑i<rcitui=0 in Fn for every t; the ui are F-independent, so every cit=0 and hence every λi=0: the list (u0,…,ur−1) is E-independent.

2.3step 1.3F9choosealgebra

Let N≠0. The k-dimensions dim⁡kL of the proper submodules L⊊N form a nonempty set of natural numbers, since the zero submodule is proper and has dimension 0, bounded above by dim⁡kN−1 by [F9]; let d be its largest element and let L be a proper submodule with dim⁡kL=d (one selection from a nonempty set of submodules). Then L is maximal proper: if L⊊L′⊆N, step 1.3 gives dim⁡kL′>dim⁡kL=d, so L′ is not a proper submodule with dimension at most d, whence L′=N.

2.4step 1.4F13F14algebra

Case N∩S≠0 of claim 4. Since S is simple and N∩S is a nonzero submodule of it, N∩S=S, and for n=s+u∈N with s∈S, u∈M one has u=n−s∈N∩M; hence N=S⊕(N∩M) with the sum direct because S∩M=0. By the induction hypothesis applied to N∩M⊆M there are a subfamily (Si)i∈J, J⊆{2,…,m}, with N∩M≅⨁i∈JSi and a submodule K′⊆M with (N∩M)∩K′=0 and (N∩M)+K′=M; then N≅S⊕⨁i∈JSi, and K′ is a complement of N in S⊕M, because N+K′=S+(N∩M)+K′=S⊕M and an element of N∩K′ lies in M, hence has zero S-component and lies in (N∩M)∩K′=0.

3.1step 2.1F1F3F5algebra

By [F5] the unit determinant of step 2.1 makes A invertible, so [F3] gives C with CA=AC=In; if ∑j<nλjaj=0 in Rn, then 0=C(0)=CAλ=λ, so the columns aj of A are linearly independent and, being spanning, they form a basis of Rn; applying the coordinate isomorphism to the preimages shows (v0,…,vn−1) is a basis of M, which proves claim 1 for n≥1; for n=0 the module is 0 with empty basis by [F1] and there is no determinant clause.

3.2step 1.2step 2.2F7algebra

The list (u0,…,ur−1) is E-independent by step 2.2 and E-spans UE by step 1.2, so it is an E-basis of UE; therefore rank⁡E(A)=dim⁡EUE=r=dim⁡FU=rank⁡F(A) by [F7], which is claim 2.

3.3step 2.3F9F13algebra

Iteration for claim 3: starting from N and repeatedly replacing a nonzero module by a maximal proper submodule, which exists by step 2.3, produces a strictly decreasing chain N=N0⊋N1⊋⋯⊋Nt=0 of finite-dimensional submodules, because each Ni is finite-dimensional by [F9] and each step strictly lowers the k-dimension, so the process terminates after at most dim⁡kN steps. Reading the chain upwards gives 0=Nt⊊⋯⊊N0=N, and each factor Ni−1/Ni is simple: if it had a nonzero proper submodule Q, the preimage {x∈Ni−1:x+Ni∈Q} would be a submodule strictly between Ni and Ni−1, contradicting maximality of Ni in Ni−1; this is a finite composition series of N in the sense of [F13], so N has finite length.

3.4step 2.4F13F14algebra

Case N∩S=0 of claim 4. The projection π:N→M is then injective, and π(N)⊆M is a submodule to which the induction hypothesis applies: there are a subfamily (Si)i∈J, J⊆{2,…,m}, with π(N)≅⨁i∈JSi and a submodule K⊆M with π(N)∩K=0 and π(N)+K=M. For u∈π(N) let f(u)∈S be the S-component of the unique n∈N with π(n)=u, so that this n is f(u)+u and N={f(u)+u:u∈π(N)}; the projection and the S-component map are B-module homomorphisms; the inverse of the restricted projection respects addition and B-scalars, so f is a B-module homomorphism. Every x=s+u∈S⊕M with u=u1+u2, u1∈π(N), u2∈K, equals (f(u1)+u1)+((s−f(u1))+u2)∈N+(S⊕K), and if n=f(u)+u∈N∩(S⊕K) with n=s′+k, k∈K, then projecting to M gives u=k, so u∈π(N)∩K=0, u=0 and n=f(0)=0 by linearity of f, whence N∩(S⊕K)=0; therefore S⊕K is a complement of N in S⊕M, and N≅π(N)≅⨁i∈JSi through the injective projection.

4.1step 1.4step 2.4step 3.4algebra

Cases 2.4 and 3.4 cover every submodule N⊆S⊕M according to whether N∩S is zero, and in both cases N is isomorphic to a direct sum of a subfamily of S1,…,Sm and has a complement in S1⊕⋯⊕Sm; with the case m≤1 of step 1.4 this proves claim 4 by induction on m.

5.1step 1.5step 3.1step 3.2step 3.3step 4.1F10F11algebra∎

In the ordered basis of step 1.5, a basis vector w∈Kj coming from the j-th block satisfies T(w)∈Kj−1, which is the span of the blocks preceding w; the matrix [T] of T in this ordered basis of [F10] therefore has zeros on its diagonal, and tr⁡(T) is the trace of that matrix by [F11] and thus the sum of its diagonal entries, which is 0. This proves claim 5, and with steps 3.1, 3.2, 3.3, 4.1 all five claims are proved.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

100 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