Theorems · Theorem · linear algebra
Module.le_rank_iff_exists_finset
∀ {R : Type u} {M : Type v} [inst : Semiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M] [Nontrivial R] {n : ℕ},
↑n ≤ Module.rank R M ↔ ∃ s, s.card = n ∧ LinearIndepOn R id ↑sNote: if the rank of a module is infinite, it may not contain a linear independent subset with cardinality equal to the rank, see https://mathoverflow.net/questions/263020/maximum-cardinal-of-a-set-of-linearly-independent-vectors-in-a-module.
- Defined in
- Mathlib.LinearAlgebra.Dimension.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 88 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites32
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Modulestatement and proof · cited by 20,661
- Semiringstatement and proof · cited by 13,802
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- SetLike.coestatement and proof · cited by 8,199
- Set.Elemproof · cited by 7,166
- Cardinalstatement and proof · cited by 2,598
- Nontrivialstatement and proof · cited by 2,416
- iSupproof · cited by 2,415
- Finset.cardstatement and proof · cited by 2,327
- Cardinal.mkproof · cited by 942
Cited by1
Results whose statement or proof uses this declaration.
- Module.le_rank_iffproof · cited by 1