Theorems · Theorem · nonassociative algebras
RootPairing.ncard_eq_finrank_of_linearIndepOn_of
∀ {ι : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [Finite ι] [inst : AddCommGroup M]
[inst_1 : AddCommGroup N] [inst_2 : CommRing R] [inst_3 : Module R M] [inst_4 : Module R N] (P : RootPairing ι R M N)
[P.IsRootSystem] [Nontrivial R] {s : Set ι},
LinearIndepOn R (⇑P.root) s →
(∀ (i : ι), P.root i ∈ AddSubmonoid.closure (⇑P.root '' s) ∨ -P.root i ∈ AddSubmonoid.closure (⇑P.root '' s)) →
s.ncard = Module.finrank R M- Cited by
- 1 results in Mathlib
- Foundations
- Depth 120 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites40
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Modulestatement and proof · cited by 20,661
- CommRingstatement and proof · cited by 17,173
- AddCommGroupstatement and proof · cited by 12,871
- SetLike.coeproof · cited by 8,199
- Fintypeproof · cited by 7,736
- Submoduleproof · cited by 7,192
- Set.Elemproof · cited by 7,166
- Set.imagestatement and proof · cited by 5,609
- Set.rangeproof · cited by 4,705
- Finitestatement and proof · cited by 3,029
Cited by1
Results whose statement or proof uses this declaration.
- RootPairing.eq_baseOf_of_linearIndepOn_of_mem_or_neg_mem_closureproof · cited by 2