Theorems · Theorem · linear algebra
rank_matrix_module
∀ (R : Type u) (M : Type v) [inst : Semiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M] [StrongRankCondition R]
[Module.Free R M] (m : Type w) (n : Type w') [Finite m] [Finite n],
Module.rank R (Matrix m n M) =
Cardinal.lift.{max v w', w} (Cardinal.mk m) * Cardinal.lift.{max v w, w'} (Cardinal.mk n) *
Cardinal.lift.{max w w', v} (Module.rank R M)If m and n are finite, the rank of m × n matrices over a module M is
(#m).lift * (#n).lift * rank R M.
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 111 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Modulestatement and proof · cited by 20,661
- Semiringstatement and proof · cited by 13,802
- AddCommMonoidstatement and proof · cited by 12,281
- Fintypeproof · cited by 7,736
- Matrixstatement · cited by 4,303
- Finitestatement and proof · cited by 3,029
- Cardinalstatement and proof · cited by 2,598
- Module.Basisproof · cited by 1,477
- Cardinal.mkstatement and proof · cited by 942
- Module.Freestatement and proof · cited by 597
- Cardinal.liftstatement and proof · cited by 583
- Module.rankstatement and proof · cited by 496
Cited by3
Results whose statement or proof uses this declaration.
- rank_matrixproof · cited by 1
- rank_matrix_module'proof · cited by 1
- Module.finrank_matrixproof · cited by 0