Theorems · Theorem · field theory
IntermediateField.LinearDisjoint.finrank_left_eq_finrank
∀ {F : Type u} {E : Type v} [inst : Field F] [inst_1 : Field E] [inst_2 : Algebra F E] {A B : IntermediateField F E}
[Module.Finite F ↥A], A.LinearDisjoint ↥B → A ⊔ B = ⊤ → Module.finrank (↥A) E = Module.finrank F ↥BIf A and B are linearly disjoint over F and A ⊔ B = E, then the Module.finrank of
E over A is equal to the Module.finrank of B over F.
- Defined in
- Mathlib.FieldTheory.LinearDisjoint
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 146 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Algebrastatement and proof · cited by 11,388
- Top.topstatement and proof · cited by 9,680
- Fieldstatement and proof · cited by 7,404
- Module.finrankstatement and proof · cited by 1,770
- LT.lt.ne'proof · cited by 1,417
- Module.Finitestatement and proof · cited by 1,032
- IntermediateFieldstatement and proof · cited by 988
- IntermediateField.LinearDisjointstatement and proof · cited by 82
- Module.finrank_posproof · cited by 62
- mul_right_inj'proof · cited by 56
- Module.finrank_mul_finrankproof · cited by 26
- IntermediateField.finrank_top'proof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- IntermediateField.LinearDisjoint.finrank_right_eq_finrankproof · cited by 1
- NumberField.natAbs_discr_eq_natAbs_discr_pow_mul_natAbs_discr_powproof · cited by 1