Theorems · Theorem · field theory
IsSepClosed.exists_root_C_mul_X_pow_add_C_mul_X_add_C
∀ {k : Type u} [inst : Field k] [IsSepClosed k] {n : ℕ} (a b c : k),
↑n = 0 → 2 ≤ n → b ≠ 0 → ∃ x, a * x ^ n + b * x + c = 0If n ≥ 2 equals zero in a separably closed field k, b ≠ 0,
then there exists x in k such that a * x ^ n + b * x + c = 0.
- Defined in
- Mathlib.FieldTheory.IsSepClosed
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 115 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FieldIsSepClosed
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Fieldstatement and proof · cited by 7,404
- Polynomialproof · cited by 5,681
- Polynomial.Xproof · cited by 1,639
- Polynomial.Cproof · cited by 1,598
- Polynomial.degreeproof · cited by 643
- Polynomial.eval_Xproof · cited by 172
- Polynomial.IsRootproof · cited by 152
- Polynomial.eval_Cproof · cited by 145
- Polynomial.eval_mulproof · cited by 127
- Polynomial.Separableproof · cited by 117
- Ne.isUnitproof · cited by 99
Cited by1
Results whose statement or proof uses this declaration.
- IsSepClosed.exists_root_C_mul_X_pow_add_C_mul_X_add_C'proof · cited by 0