Theorems · Definition · field theory
AlgebraicClosure.finEquivRoots
{k : Type u} →
[inst : Field k] →
{K : Type u_1} →
[inst_1 : Field K] →
[inst_2 : DecidableEq K] →
{i : k →+* K} →
{f : AlgebraicClosure.Monics k} →
(Polynomial.map i ↑f).Splits → Fin (↑f).natDegree ≃ ↥(Polynomial.map i ↑f).roots.toEnumFinsetIf a monic polynomial f : k[X] splits in K,
then it has as many roots (counting multiplicity) as its degree.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 141 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FieldFieldDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- RingHomstatement and proof · cited by 10,189
- Equivstatement · cited by 8,337
- Fieldstatement and proof · cited by 7,404
- Polynomialstatement · cited by 5,681
- Equiv.symmproof · cited by 3,681
- Polynomial.natDegreestatement · cited by 1,105
- Polynomial.mapstatement and proof · cited by 806
- Polynomial.Monicstatement · cited by 461
- Polynomial.Splitsstatement and proof · cited by 290
- Polynomial.rootsstatement · cited by 264
- Multiset.toEnumFinsetstatement · cited by 24
Cited by3
Results whose statement or proof uses this declaration.
- AlgebraicClosure.toSplittingFieldproof · cited by 2
- AlgebraicClosure.toSplittingField_coeffproof · cited by 1
- AlgebraicClosure.finEquivRoots.congr_simpstatement and proof · cited by 0