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 be a field.
- Let be a commutative ring, a free -module of finite rank with basis , and let span . Then the coordinate matrix of in the basis has a right inverse, is a unit of , and is a basis of . The determinant is formed for ; for the module is the zero module and the empty family is its basis, with no determinant clause.
- If is a field extension and , then the rank of over equals its rank over .
- Let be a finite-dimensional -algebra and a finite-dimensional left -module. A proper submodule has strictly smaller -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 (Composition series and length of a module); in particular has finite length.
- If are simple -modules and is a submodule, then is isomorphic to a direct sum of a subfamily of the , and has a complement in .
- If is -linear with for some , then (The basis-independent trace of an endomorphism of a finite-dimensional vector space).
Facts & Assumptions
Given: A field ; a commutative ring ; a free -module of finite rank with basis and vectors spanning ; a field extension and a matrix ; a finite-dimensional -algebra and a finite-dimensional left -module ; simple -modules and a submodule ; a -linear with for some .
A free module on a set has a standard basis with unique finite expansions, and a family is a basis of a module when every element is uniquely a finite -linear combination of the (The free module on a set and its standard basis).
Matrix product and identity over a commutative ring: , and has entry on the diagonal and elsewhere (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose).
Invertibility over a commutative ring means the existence of with , and the inverse is unique (Invertible square matrices and similarity over a commutative ring).
The Leibniz determinant is and is multiplicative, (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix, For same-sized finite square matrices over a commutative ring, ).
A matrix over a commutative ring is invertible if and only if is a unit of (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit).
Every family of nonempty sets indexed by a natural number has a choice function (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).
The row space is the span of the rows, and , defined because a finite list spans it (Row space, column space, nullspace, row rank, column rank and matrix rank).
An -algebra has a central structure map, and a left module over a -algebra is a -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).
A subspace of a finite-dimensional space is finite-dimensional with no larger dimension; holds for exactly when ; every independent subset of a finite-dimensional space is contained in a basis (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
Ordered bases give unique coordinates, and the matrix of a linear map has as its -th column the coordinate column of (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis, Coordinate columns and matrices of linear maps relative to ordered bases).
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 as the sum of the diagonal entries, The basis-independent trace of an endomorphism of a finite-dimensional vector space).
For a subfield of , every -vector space is an -vector space by restricting scalars, and , are the function spaces with pointwise operations (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations, A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars, The vector space of all functions with pointwise operations, and as the case ).
Submodules, quotient modules, simple modules, composition series and length (Submodule of a module, Quotient module with scalar multiplication on additive cosets, Simple module: a nonzero module with no proper nonzero submodule, Composition series and length of a module).
The direct sum is the submodule of the product of tuples with finite support, with coordinate inclusions (The direct sum of an indexed family of modules).
Proof
Write the unique coordinate expansion of each in the basis ; this is the coordinate matrix , and identifying with through coordinate expansions of [F1] carries to the -th column of and is an -module isomorphism. Since the span , the columns span , so for every the set is nonempty; by [F6] applied to the function on there are with , and denotes the matrix with -th column .
Let be the -row space of and an -basis of it, so that by [F7]; by [F12] the field extension makes an -vector space containing , and viewing rows and the in , every row of is an -combination of the and hence an -combination, so every -combination of the rows is an -combination of the : each is itself an -combination of the rows and therefore lies in , so the list -spans the -row space of the matrix read over .
A submodule of is closed under -scalars through the structure map of the -algebra of [F8], hence is a -linear subspace of ; consequently, if are submodules then by [F9].
Claim 4 is proved by induction on . For the direct sum is , so is the empty direct sum with complement ; for the only submodules of the simple module are and , the direct sums over the empty and the full subfamily, with complements and ; for , write and , a direct sum of simple modules, so that with the coordinate projections as in [F14], and let be a submodule.
If is -linear with , put for , so that and is a chain of -subspaces of the finite-dimensional space , with finite-dimensional for every by [F9]; extend a basis of successively to a basis of using the extension clause of [F9] and concatenate the successive blocks to an ordered basis of in the sense of [F10].
By [F2] the -th column of is , so ; by [F4] , and the Leibniz expansion of has vanishing products unless , so for and : the determinant is a unit of with inverse .
Suppose in with all . The coefficients span an -subspace that is spanned by the finitely many ; discarding from that finite spanning list each vector lying in the span of those retained leaves an -basis of , and with . For each coordinate the equality gives in ; the are -independent in and the coefficients lie in , so they all vanish, that is in for every ; the are -independent, so every and hence every : the list is -independent.
Let . The -dimensions of the proper submodules form a nonempty set of natural numbers, since the zero submodule is proper and has dimension , bounded above by by [F9]; let be its largest element and let be a proper submodule with (one selection from a nonempty set of submodules). Then is maximal proper: if , step 1.3 gives , so is not a proper submodule with dimension at most , whence .
Case of claim 4. Since is simple and is a nonzero submodule of it, , and for with , one has ; hence with the sum direct because . By the induction hypothesis applied to there are a subfamily , , with and a submodule with and ; then , and is a complement of in , because and an element of lies in , hence has zero -component and lies in .
By [F5] the unit determinant of step 2.1 makes invertible, so [F3] gives with ; if in , then , so the columns of are linearly independent and, being spanning, they form a basis of ; applying the coordinate isomorphism to the preimages shows is a basis of , which proves claim 1 for ; for the module is with empty basis by [F1] and there is no determinant clause.
The list is -independent by step 2.2 and -spans by step 1.2, so it is an -basis of ; therefore by [F7], which is claim 2.
Iteration for claim 3: starting from and repeatedly replacing a nonzero module by a maximal proper submodule, which exists by step 2.3, produces a strictly decreasing chain of finite-dimensional submodules, because each is finite-dimensional by [F9] and each step strictly lowers the -dimension, so the process terminates after at most steps. Reading the chain upwards gives , and each factor is simple: if it had a nonzero proper submodule , the preimage would be a submodule strictly between and , contradicting maximality of in ; this is a finite composition series of in the sense of [F13], so has finite length.
Case of claim 4. The projection is then injective, and is a submodule to which the induction hypothesis applies: there are a subfamily , , with and a submodule with and . For let be the -component of the unique with , so that this is and ; the projection and the -component map are -module homomorphisms; the inverse of the restricted projection respects addition and -scalars, so is a -module homomorphism. Every with , , , equals , and if with , , then projecting to gives , so , and by linearity of , whence ; therefore is a complement of in , and through the injective projection.
Cases 2.4 and 3.4 cover every submodule according to whether is zero, and in both cases is isomorphic to a direct sum of a subfamily of and has a complement in ; with the case of step 1.4 this proves claim 4 by induction on .
In the ordered basis of step 1.5, a basis vector coming from the -th block satisfies , which is the span of the blocks preceding ; the matrix of in this ordered basis of [F10] therefore has zeros on its diagonal, and is the trace of that matrix by [F11] and thus the sum of its diagonal entries, which is . This proves claim 5, and with steps 3.1, 3.2, 3.3, 4.1 all five claims are proved.
Depends on
- Unital left and right modules over a ring; unqualified module means left module
- Submodule of a module
- Quotient module $M/N$ with scalar multiplication on additive cosets
- Simple module: a nonzero module with no proper nonzero submodule
- Semisimple modules as direct sums of simple modules
- Composition series and length of a module
- The direct sum of an indexed family of modules
- The endomorphism ring $\operatorname{End}_R(M)$ under addition and composition
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- A finite list $v : n \to V$ is an ordered basis if and only if every $x \in V$ equals $\sum_{i<n} \lambda_i v_i$ for exactly one $\lambda : n \to F$; those scalars are the coordinates of $x$ in that ordered basis
- Linear map between vector spaces over the same field
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Row space, column space, nullspace, row rank, column rank and matrix rank
- The rank of a matrix equals the rank of the linear map $x\mapsto Ax$
- The vector space $M_{m \times n}(F) := F^{\,m \times n}$ of $m$ by $n$ matrices over a field, with entrywise operations
- Finite rectangular matrices over a commutative ring, their entries, rows and columns
- For $n\ge1$, 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)$
- For every positive-sized square matrix over a commutative ring, $A\operatorname{adj}(A)=\operatorname{adj}(A)A=\det(A)I$
- A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- The free module on a set and its standard basis
- Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose
- Invertible square matrices and similarity over a commutative ring
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
- Algebras over a commutative ring, central structure maps, and algebra homomorphisms
- Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations
- A field is a vector space over itself, and over any subfield $K \subseteq F$ every $F$-vector space is a $K$-vector space by restricting the scalars
- The vector space $F^{X}$ of all functions $X \to F$ with pointwise operations, and $F^{n}$ as the case $X = n = \{0, 1, \dots, n-1\}$
- Coordinate columns $[v]_{\mathcal B}$ and matrices $[T]_{\mathcal B}^{\mathcal C}$ of linear maps relative to ordered bases
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
- Keith Conrad, Tensor products (University of Connecticut expository notes, 60 pp.) (standard reference, not scraped)
- The CRing Project, open-source commutative algebra text (2016 PDF; Chapter 13) (standard reference, not scraped)