Theorems · Theorem · linear algebra
rank_pi
∀ {R : Type u} {η : Type u₁'} {φ : η → Type u_1} [inst : Semiring R] [StrongRankCondition R]
[inst_2 : (i : η) → AddCommMonoid (φ i)] [inst_3 : (i : η) → Module R (φ i)] [∀ (i : η), Module.Free R (φ i)]
[Finite η], Module.rank R ((i : η) → φ i) = Cardinal.sum fun i => Module.rank R (φ i)The rank of a finite product of free modules is the sum of the ranks.
- Cited by
- 6 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.
Cites17
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
- Finitestatement and proof · cited by 3,029
- Cardinalstatement · cited by 2,598
- Module.Basisproof · cited by 1,477
- Module.Freestatement and proof · cited by 597
- Module.rankstatement and proof · cited by 496
- StrongRankConditionstatement and proof · cited by 286
- nonempty_fintypeproof · cited by 261
- Module.Free.ChooseBasisIndexproof · cited by 133
Cited by6
Results whose statement or proof uses this declaration.
- Module.finrank_pi_fintypeproof · cited by 6
- Module.finrank_piproof · cited by 5
- rank_fun_eq_lift_mulproof · cited by 2
- Submodule.IsLattice.rank_of_piproof · cited by 1
- rank_fin_funproof · cited by 0
- rank_funproof · cited by 0