The rank of a matrix does not increase under an entrywise field homomorphism
ProvedMatrix.rank_map_leLet be fields, more precisely let be a ring homomorphism of fields (necessarily injective), and let be a matrix with entries in , with finitely many columns. Applying to every entry gives the matrix with entries in . The statement asserts
Indeed the column space of over is spanned by of its columns, and every column of is the image of an -linear combination of these, hence an -linear combination of their images; so the column space of over has dimension at most . (Equality holds, but only the inequality is stated.)
Use. This transfers a rank bound obtained over a larger field back to the base field. In the reduction of Leopoldt.exists_linearIndependent_log_conj_of_brumer, the group matrix of -adic logarithms has entries in a completion that need not contain the roots of unity needed for Dedekind's group determinant; the determinant argument (Matrix.card_sub_one_le_rank_of_charSum_ne_zero) is run after embedding into a completion of , and this lemma brings the bound back to .
Formalization Note. Matrix.rank is the dimension of the range of the linear map given by the matrix, over the field of its entries; it needs only Fintype on the column index, and the row index may be any type. A.map ι applies ι entrywise.
import Mathlib
theorem Matrix.rank_map_le {m n : Type*} [Fintype n] {F F' : Type*} [Field F] [Field F']
(ι : F →+* F') (A : Matrix m n F) : (A.map ι).rank ≤ A.rank := by sorry