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 rank bounds under regular specialization
Statement
Let , with fraction field and residue field . If a finite matrix has entries in , then . Consequently the kernel dimension of a regularized linear system can only decrease after passing from to . In particular, this applies to finite commutator systems for centralizers. If a finite-dimensional algebra image at is generated by specializations of finitely many regular matrices, finitely many lifted words remain linearly independent over whenever their specializations form a basis.
Facts & Assumptions
Given: A finite matrix over the local ring and, when using the last clause, a finite-dimensional matrix algebra generated by a finite family of regular matrices.
Rank–nullity holds for finite matrices over each of the fields and , and determinants are polynomial in their entries (Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace).
Vectorizing a finite square matrix identifies its entries with coordinates in a finite-dimensional vector space, so commutators with a finite set of matrices form a finite matrix of linear equations.
Proof
Given: The data in [F1]–[F2].
If is zero, the desired rank inequality is immediate. If , choose independent columns of the specialized matrix. Gaussian elimination on that submatrix shows its row space also has dimension , so choose independent rows; the resulting square submatrix is invertible and has nonzero determinant by A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit. Conversely a nonzero minor gives independent columns. Thus some minor of has determinant nonzero in the residue field. Its determinant in specializes to that nonzero value, so it is a nonzero element of and remains nonzero in its fraction field . Hence . Since both matrices have the same number of columns, rank–nullity gives .
For regular endomorphisms of a fixed finite free tensor space, vectorize and form the finite matrix of . Its kernel is exactly the simultaneous commutant of the , which equals the commutant of the algebra they generate. Applying step 1.1 bounds the generic commutant dimension above by the specialized commutant dimension. This argument uses only the selected regular matrices; it does not specialize arbitrary rational functions.
Let be the specialized image, generated by the specialized finite family, in an endomorphism space of finite dimension. The set of all words in those generators spans ; from this spanning set choose a finite subset that is a basis, by adding a word only when it increases the dimension, which can happen at most times. If , the image lower bound is immediate; otherwise the same words in the regular lifts form a matrix over whose specialization has full column rank. Step 1.1, applied to a nonzero square minor of that column matrix, shows the lifted words are -linearly independent. Hence the generic image dimension is at least . The argument is identical for any other finite regular generating family.
Depends on
Used by
Dependency tree · two levels
35 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
- Alexei Davydov and Alexander Molev, A categorical approach to classical and quantum Schur–Weyl duality (standard reference, not scraped)