Polynomials and adjoining roots

Main results

• Polynomial.instCommSemiringAdjoinSingleton, instCommRingAdjoinSingleton: adjoining an element to a commutative (semi)ring gives a commutative (semi)ring

@[simp]

theorem Polynomial.adjoin_X {R : Type u} [CommSemiring R] : Algebra.adjoin R {X} = ⊤

theorem Algebra.adjoin_singleton_eq_range_aeval (R : Type u) {A : Type z} [CommSemiring R] [Semiring A] [Algebra R A] (x : A) : adjoin R {x} = (Polynomial.aeval x).range

@[simp]

theorem Polynomial.aeval_mem_adjoin_singleton (R : Type u) {A : Type z} [CommSemiring R] [Semiring A] [Algebra R A] {p : Polynomial R} (x : A) : (aeval x) p ∈ Algebra.adjoin R {x}

theorem Algebra.adjoin_mem_exists_aeval (R : Type u) {A : Type z} [CommSemiring R] [Semiring A] [Algebra R A] (x : A) {a : A} (h : a ∈ adjoin R {x}) : ∃ (p : Polynomial R), (Polynomial.aeval x) p = a

theorem Algebra.adjoin_eq_exists_aeval (R : Type u) {A : Type z} [CommSemiring R] [Semiring A] [Algebra R A] (x : A) (a : ↥(adjoin R {x})) : ∃ (p : Polynomial R), (Polynomial.aeval x) p = ↑a

theorem Algebra.adjoin_singleton_induction (R : Type u) {A : Type z} [CommSemiring R] [Semiring A] [Algebra R A] (x : A) {M : ↥(adjoin R {x}) → Prop} (a : ↥(adjoin R {x})) (f : ∀ (p : Polynomial R), M ⟨(Polynomial.aeval x) p, ⋯⟩) : M a

instance Polynomial.instCommSemiringAdjoinSingleton (R : Type u) {A : Type z} [CommSemiring R] [Semiring A] [Algebra R A] (x : A) : CommSemiring ↥(Algebra.adjoin R {x})

Equations

• Polynomial.instCommSemiringAdjoinSingleton R x = { toSemiring := (Algebra.adjoin R {x}).toSemiring, mul_comm := ⋯ }

instance Polynomial.instCommRingAdjoinSingleton {R : Type u_3} {A : Type u_4} [CommRing R] [Ring A] [Algebra R A] (x : A) : CommRing ↥(Algebra.adjoin R {x})

Equations

• Polynomial.instCommRingAdjoinSingleton x = { toRing := (Algebra.adjoin R {x}).toRing, mul_comm := ⋯ }