A predicate on adjoining roots of polynomial

This file defines a predicate IsAdjoinRoot S f, which states that the ring S can be constructed by adjoining a specified root of the polynomial f : R[X] to R. This predicate is useful when the same ring can be generated by adjoining the root of different polynomials, and you want to vary which polynomial you're considering.

The results in this file are intended to mirror those in RingTheory.AdjoinRoot, in order to provide an easier way to translate results from one to the other.

Motivation

AdjoinRoot presents one construction of a ring R[α]. However, it is possible to obtain rings of this form in many ways, such as NumberField.ringOfIntegers ℚ(√-5), or Algebra.adjoin R {α, α^2}, or IntermediateField.adjoin R {α, 2 - α}, or even if we want to view ℂ as adjoining a root of X^2 + 1 to ℝ.

Main definitions

The two main predicates in this file are:

• IsAdjoinRoot S f: S is generated by adjoining a specified root of f : R[X] to R
• IsAdjoinRootMonic S f: S is generated by adjoining a root of the monic polynomial f : R[X] to R

Using IsAdjoinRoot to map into S:

• IsAdjoinRoot.map: inclusion from R[X] to S
• IsAdjoinRoot.root: the specific root adjoined to R to give S

Using IsAdjoinRoot to map out of S:

• IsAdjoinRoot.repr: choose a non-unique representative in R[X]
• IsAdjoinRoot.lift, IsAdjoinRoot.liftHom: lift a morphism R →+* T to S →+* T
• IsAdjoinRootMonic.modByMonicHom: a unique representative in R[X] if f is monic

Main results

• AdjoinRoot.isAdjoinRoot and AdjoinRoot.isAdjoinRootMonic: AdjoinRoot satisfies the conditions on IsAdjoinRoot(_monic)
• IsAdjoinRootMonic.powerBasis: the root generates a power basis on S over R
• IsAdjoinRoot.aequiv: algebra isomorphism showing adjoining a root gives a unique ring up to isomorphism
• IsAdjoinRoot.ofEquiv: transfer IsAdjoinRoot across an algebra isomorphism
• IsAdjoinRootMonic.minpoly_eq: the minimal polynomial of the adjoined root of f is equal to f, if f is irreducible and monic, and R is a GCD domain

structure IsAdjoinRoot {R : Type u} (S : Type v) [CommSemiring R] [Semiring S] [Algebra R S] (f : Polynomial R) : Type (max u v)

IsAdjoinRoot S f states that the ring S can be constructed by adjoining a specified root of the polynomial f : R[X] to R.

Compare PowerBasis R S, which does not explicitly specify which polynomial we adjoin a root of (in particular f does not need to be the minimal polynomial of the root we adjoin), and AdjoinRoot which constructs a new type.

This is not a typeclass because the choice of root given S and f is not unique.

• map : Polynomial R →+* S
• map_surjective : Function.Surjective ⇑self.map
• ker_map : RingHom.ker self.map = Ideal.span {f}
• algebraMap_eq : algebraMap R S = RingHom.comp self.map Polynomial.C

structure IsAdjoinRootMonic {R : Type u} (S : Type v) [CommSemiring R] [Semiring S] [Algebra R S] (f : Polynomial R) extends IsAdjoinRoot : Type (max u v)

IsAdjoinRootMonic S f states that the ring S can be constructed by adjoining a specified root of the monic polynomial f : R[X] to R.

As long as f is monic, there is a well-defined representation of elements of S as polynomials in R[X] of degree lower than deg f (see modByMonicHom and coeff). In particular, we have IsAdjoinRootMonic.powerBasis.

Bundling Monic into this structure is very useful when working with explicit fs such as X^2 - C a * X - C b since it saves you carrying around the proofs of monicity.

• map : Polynomial R →+* S
• map_surjective : Function.Surjective ⇑self.map
• ker_map : RingHom.ker self.map = Ideal.span {f}
• algebraMap_eq : algebraMap R S = RingHom.comp self.map Polynomial.C
• Monic : Polynomial.Monic f

def IsAdjoinRoot.root {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) : S

(h : IsAdjoinRoot S f).root is the root of f that can be adjoined to generate S.

Equations

• IsAdjoinRoot.root h = h.map Polynomial.X

theorem IsAdjoinRoot.subsingleton {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) [Subsingleton R] : Subsingleton S

theorem IsAdjoinRoot.algebraMap_apply {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) (x : R) : (algebraMap R S) x = h.map (Polynomial.C x)

@[simp]

theorem IsAdjoinRoot.mem_ker_map {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) {p : Polynomial R} : p ∈ RingHom.ker h.map ↔ f ∣ p

theorem IsAdjoinRoot.map_eq_zero_iff {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) {p : Polynomial R} : h.map p = 0 ↔ f ∣ p

@[simp]

theorem IsAdjoinRoot.map_X {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) : h.map Polynomial.X = IsAdjoinRoot.root h

@[simp]

theorem IsAdjoinRoot.map_self {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) : h.map f = 0

@[simp]

theorem IsAdjoinRoot.aeval_eq {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) (p : Polynomial R) : (Polynomial.aeval (IsAdjoinRoot.root h)) p = h.map p

theorem IsAdjoinRoot.aeval_root {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) : (Polynomial.aeval (IsAdjoinRoot.root h)) f = 0

def IsAdjoinRoot.repr {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) (x : S) : Polynomial R

Choose an arbitrary representative so that h.map (h.repr x) = x.

If f is monic, use IsAdjoinRootMonic.modByMonicHom for a unique choice of representative.

Equations

• IsAdjoinRoot.repr h x = Exists.choose ⋯

theorem IsAdjoinRoot.map_repr {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) (x : S) : h.map (IsAdjoinRoot.repr h x) = x

theorem IsAdjoinRoot.repr_zero_mem_span {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) : IsAdjoinRoot.repr h 0 ∈ Ideal.span {f}

repr preserves zero, up to multiples of f

theorem IsAdjoinRoot.repr_add_sub_repr_add_repr_mem_span {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) (x : S) (y : S) : IsAdjoinRoot.repr h (x + y) - (IsAdjoinRoot.repr h x + IsAdjoinRoot.repr h y) ∈ Ideal.span {f}

repr preserves addition, up to multiples of f

theorem IsAdjoinRoot.ext_map {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot S f) (eq : ∀ (x : Polynomial R), h.map x = h'.map x) : h = h'

Extensionality of the IsAdjoinRoot structure itself. See IsAdjoinRootMonic.ext_elem for extensionality of the ring elements.

theorem IsAdjoinRoot.ext {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot S f) (eq : IsAdjoinRoot.root h = IsAdjoinRoot.root h') : h = h'

Extensionality of the IsAdjoinRoot structure itself. See IsAdjoinRootMonic.ext_elem for extensionality of the ring elements.

theorem IsAdjoinRoot.eval₂_repr_eq_eval₂_of_map_eq {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {i : R →+* T} {x : T} (hx : Polynomial.eval₂ i x f = 0) (h : IsAdjoinRoot S f) (z : S) (w : Polynomial R) (hzw : h.map w = z) : Polynomial.eval₂ i x (IsAdjoinRoot.repr h z) = Polynomial.eval₂ i x w

Auxiliary lemma for IsAdjoinRoot.lift

def IsAdjoinRoot.lift {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] (i : R →+* T) (x : T) (hx : Polynomial.eval₂ i x f = 0) (h : IsAdjoinRoot S f) : S →+* T

Lift a ring homomorphism R →+* T to S →+* T by specifying a root x of f in T, where S is given by adjoining a root of f to R.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem IsAdjoinRoot.lift_map {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {i : R →+* T} {x : T} (hx : Polynomial.eval₂ i x f = 0) (h : IsAdjoinRoot S f) (z : Polynomial R) : (IsAdjoinRoot.lift i x hx h) (h.map z) = Polynomial.eval₂ i x z

@[simp]

theorem IsAdjoinRoot.lift_root {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {i : R →+* T} {x : T} (hx : Polynomial.eval₂ i x f = 0) (h : IsAdjoinRoot S f) : (IsAdjoinRoot.lift i x hx h) (IsAdjoinRoot.root h) = x

@[simp]

theorem IsAdjoinRoot.lift_algebraMap {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {i : R →+* T} {x : T} (hx : Polynomial.eval₂ i x f = 0) (h : IsAdjoinRoot S f) (a : R) : (IsAdjoinRoot.lift i x hx h) ((algebraMap R S) a) = i a

theorem IsAdjoinRoot.apply_eq_lift {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {i : R →+* T} {x : T} (hx : Polynomial.eval₂ i x f = 0) (h : IsAdjoinRoot S f) (g : S →+* T) (hmap : ∀ (a : R), g ((algebraMap R S) a) = i a) (hroot : g (IsAdjoinRoot.root h) = x) (a : S) : g a = (IsAdjoinRoot.lift i x hx h) a

Auxiliary lemma for apply_eq_lift

theorem IsAdjoinRoot.eq_lift {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {i : R →+* T} {x : T} (hx : Polynomial.eval₂ i x f = 0) (h : IsAdjoinRoot S f) (g : S →+* T) (hmap : ∀ (a : R), g ((algebraMap R S) a) = i a) (hroot : g (IsAdjoinRoot.root h) = x) : g = IsAdjoinRoot.lift i x hx h

Unicity of lift: a map that agrees on R and h.root agrees with lift everywhere.

def IsAdjoinRoot.liftHom {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] (x : T) [Algebra R T] (hx' : (Polynomial.aeval x) f = 0) (h : IsAdjoinRoot S f) : S →ₐ[R] T

Lift the algebra map R → T to S →ₐ[R] T by specifying a root x of f in T, where S is given by adjoining a root of f to R.

Equations

• IsAdjoinRoot.liftHom x hx' h = let __src := IsAdjoinRoot.lift (algebraMap R T) x hx' h; { toRingHom := __src, commutes' := ⋯ }

@[simp]

theorem IsAdjoinRoot.coe_liftHom {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {x : T} [Algebra R T] (hx' : (Polynomial.aeval x) f = 0) (h : IsAdjoinRoot S f) : ↑(IsAdjoinRoot.liftHom x hx' h) = IsAdjoinRoot.lift (algebraMap R T) x hx' h

theorem IsAdjoinRoot.lift_algebraMap_apply {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {x : T} [Algebra R T] (hx' : (Polynomial.aeval x) f = 0) (h : IsAdjoinRoot S f) (z : S) : (IsAdjoinRoot.lift (algebraMap R T) x hx' h) z = (IsAdjoinRoot.liftHom x hx' h) z

@[simp]

theorem IsAdjoinRoot.liftHom_map {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {x : T} [Algebra R T] (hx' : (Polynomial.aeval x) f = 0) (h : IsAdjoinRoot S f) (z : Polynomial R) : (IsAdjoinRoot.liftHom x hx' h) (h.map z) = (Polynomial.aeval x) z

@[simp]

theorem IsAdjoinRoot.liftHom_root {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {x : T} [Algebra R T] (hx' : (Polynomial.aeval x) f = 0) (h : IsAdjoinRoot S f) : (IsAdjoinRoot.liftHom x hx' h) (IsAdjoinRoot.root h) = x

theorem IsAdjoinRoot.eq_liftHom {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [CommRing T] {x : T} [Algebra R T] (hx' : (Polynomial.aeval x) f = 0) (h : IsAdjoinRoot S f) (g : S →ₐ[R] T) (hroot : g (IsAdjoinRoot.root h) = x) : g = IsAdjoinRoot.liftHom x hx' h

Unicity of liftHom: a map that agrees on h.root agrees with liftHom everywhere.

def AdjoinRoot.isAdjoinRoot {R : Type u} [CommRing R] (f : Polynomial R) : IsAdjoinRoot (AdjoinRoot f) f

AdjoinRoot f is indeed given by adjoining a root of f.

Equations

• AdjoinRoot.isAdjoinRoot f = { map := AdjoinRoot.mk f, map_surjective := ⋯, ker_map := ⋯, algebraMap_eq := ⋯ }

def AdjoinRoot.isAdjoinRootMonic {R : Type u} [CommRing R] (f : Polynomial R) (hf : Polynomial.Monic f) : IsAdjoinRootMonic (AdjoinRoot f) f

AdjoinRoot f is indeed given by adjoining a root of f. If f is monic this is more powerful than AdjoinRoot.isAdjoinRoot.

Equations

• AdjoinRoot.isAdjoinRootMonic f hf = let __src := AdjoinRoot.isAdjoinRoot f; { toIsAdjoinRoot := __src, Monic := hf }

@[simp]

theorem AdjoinRoot.isAdjoinRoot_map_eq_mk {R : Type u} [CommRing R] (f : Polynomial R) : (AdjoinRoot.isAdjoinRoot f).map = AdjoinRoot.mk f

@[simp]

theorem AdjoinRoot.isAdjoinRootMonic_map_eq_mk {R : Type u} [CommRing R] (f : Polynomial R) (hf : Polynomial.Monic f) : (AdjoinRoot.isAdjoinRootMonic f hf).map = AdjoinRoot.mk f

@[simp]

theorem AdjoinRoot.isAdjoinRoot_root_eq_root {R : Type u} [CommRing R] (f : Polynomial R) : IsAdjoinRoot.root (AdjoinRoot.isAdjoinRoot f) = AdjoinRoot.root f

@[simp]

theorem AdjoinRoot.isAdjoinRootMonic_root_eq_root {R : Type u} [CommRing R] (f : Polynomial R) (hf : Polynomial.Monic f) : IsAdjoinRoot.root (AdjoinRoot.isAdjoinRootMonic f hf).toIsAdjoinRoot = AdjoinRoot.root f

theorem IsAdjoinRootMonic.map_modByMonic {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (g : Polynomial R) : h.map (g %ₘ f) = h.map g

theorem IsAdjoinRootMonic.modByMonic_repr_map {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (g : Polynomial R) : IsAdjoinRoot.repr h.toIsAdjoinRoot (h.map g) %ₘ f = g %ₘ f

def IsAdjoinRootMonic.modByMonicHom {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : S →ₗ[R] Polynomial R

IsAdjoinRoot.modByMonicHom sends the equivalence class of f mod g to f %ₘ g.

Equations

• IsAdjoinRootMonic.modByMonicHom h = { toAddHom := { toFun := fun (x : S) => IsAdjoinRoot.repr h.toIsAdjoinRoot x %ₘ f, map_add' := ⋯ }, map_smul' := ⋯ }

@[simp]

theorem IsAdjoinRootMonic.modByMonicHom_map {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (g : Polynomial R) : (IsAdjoinRootMonic.modByMonicHom h) (h.map g) = g %ₘ f

@[simp]

theorem IsAdjoinRootMonic.map_modByMonicHom {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (x : S) : h.map ((IsAdjoinRootMonic.modByMonicHom h) x) = x

@[simp]

theorem IsAdjoinRootMonic.modByMonicHom_root_pow {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) {n : ℕ} (hdeg : n < Polynomial.natDegree f) : (IsAdjoinRootMonic.modByMonicHom h) (IsAdjoinRoot.root h.toIsAdjoinRoot ^ n) = Polynomial.X ^ n

@[simp]

theorem IsAdjoinRootMonic.modByMonicHom_root {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (hdeg : 1 < Polynomial.natDegree f) : (IsAdjoinRootMonic.modByMonicHom h) (IsAdjoinRoot.root h.toIsAdjoinRoot) = Polynomial.X

def IsAdjoinRootMonic.basis {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : Basis (Fin (Polynomial.natDegree f)) R S

The basis on S generated by powers of h.root.

Auxiliary definition for IsAdjoinRootMonic.powerBasis.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem IsAdjoinRootMonic.basis_apply {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (i : Fin (Polynomial.natDegree f)) : (IsAdjoinRootMonic.basis h) i = IsAdjoinRoot.root h.toIsAdjoinRoot ^ ↑i

theorem IsAdjoinRootMonic.deg_pos {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] [Nontrivial S] (h : IsAdjoinRootMonic S f) : 0 < Polynomial.natDegree f

theorem IsAdjoinRootMonic.deg_ne_zero {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] [Nontrivial S] (h : IsAdjoinRootMonic S f) : Polynomial.natDegree f ≠ 0

@[simp]

theorem IsAdjoinRootMonic.powerBasis_dim {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : (IsAdjoinRootMonic.powerBasis h).dim = Polynomial.natDegree f

@[simp]

theorem IsAdjoinRootMonic.powerBasis_gen {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : (IsAdjoinRootMonic.powerBasis h).gen = IsAdjoinRoot.root h.toIsAdjoinRoot

@[simp]

theorem IsAdjoinRootMonic.powerBasis_basis {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : (IsAdjoinRootMonic.powerBasis h).basis = IsAdjoinRootMonic.basis h

def IsAdjoinRootMonic.powerBasis {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : PowerBasis R S

If f is monic, the powers of h.root form a basis.

Equations

• IsAdjoinRootMonic.powerBasis h = { gen := IsAdjoinRoot.root h.toIsAdjoinRoot, dim := Polynomial.natDegree f, basis := IsAdjoinRootMonic.basis h, basis_eq_pow := ⋯ }

@[simp]

theorem IsAdjoinRootMonic.basis_repr {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (x : S) (i : Fin (Polynomial.natDegree f)) : ((IsAdjoinRootMonic.basis h).repr x) i = Polynomial.coeff ((IsAdjoinRootMonic.modByMonicHom h) x) ↑i

theorem IsAdjoinRootMonic.basis_one {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (hdeg : 1 < Polynomial.natDegree f) : (IsAdjoinRootMonic.basis h) { val := 1, isLt := hdeg } = IsAdjoinRoot.root h.toIsAdjoinRoot

@[simp]

theorem IsAdjoinRootMonic.liftPolyₗ_apply {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [AddCommGroup T] [Module R T] (h : IsAdjoinRootMonic S f) (g : Polynomial R →ₗ[R] T) : ∀ (a : S), (IsAdjoinRootMonic.liftPolyₗ h g) a = g ((IsAdjoinRootMonic.modByMonicHom h) a)

def IsAdjoinRootMonic.liftPolyₗ {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] {T : Type u_1} [AddCommGroup T] [Module R T] (h : IsAdjoinRootMonic S f) (g : Polynomial R →ₗ[R] T) : S →ₗ[R] T

IsAdjoinRootMonic.liftPolyₗ lifts a linear map on polynomials to a linear map on S.

Equations

• IsAdjoinRootMonic.liftPolyₗ h g = g ∘ₗ IsAdjoinRootMonic.modByMonicHom h

def IsAdjoinRootMonic.coeff {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : S →ₗ[R] ℕ → R

IsAdjoinRootMonic.coeff h x i is the ith coefficient of the representative of x : S.

Equations

• IsAdjoinRootMonic.coeff h = IsAdjoinRootMonic.liftPolyₗ h { toAddHom := { toFun := Polynomial.coeff, map_add' := ⋯ }, map_smul' := ⋯ }

theorem IsAdjoinRootMonic.coeff_apply_lt {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (z : S) (i : ℕ) (hi : i < Polynomial.natDegree f) : (IsAdjoinRootMonic.coeff h) z i = ((IsAdjoinRootMonic.basis h).repr z) { val := i, isLt := hi }

theorem IsAdjoinRootMonic.coeff_apply_coe {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (z : S) (i : Fin (Polynomial.natDegree f)) : (IsAdjoinRootMonic.coeff h) z ↑i = ((IsAdjoinRootMonic.basis h).repr z) i

theorem IsAdjoinRootMonic.coeff_apply_le {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (z : S) (i : ℕ) (hi : Polynomial.natDegree f ≤ i) : (IsAdjoinRootMonic.coeff h) z i = 0

theorem IsAdjoinRootMonic.coeff_apply {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (z : S) (i : ℕ) : (IsAdjoinRootMonic.coeff h) z i = if hi : i < Polynomial.natDegree f then ((IsAdjoinRootMonic.basis h).repr z) { val := i, isLt := hi } else 0

theorem IsAdjoinRootMonic.coeff_root_pow {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) {n : ℕ} (hn : n < Polynomial.natDegree f) : (IsAdjoinRootMonic.coeff h) (IsAdjoinRoot.root h.toIsAdjoinRoot ^ n) = Pi.single n 1

theorem IsAdjoinRootMonic.coeff_one {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] [Nontrivial S] (h : IsAdjoinRootMonic S f) : (IsAdjoinRootMonic.coeff h) 1 = Pi.single 0 1

theorem IsAdjoinRootMonic.coeff_root {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) (hdeg : 1 < Polynomial.natDegree f) : (IsAdjoinRootMonic.coeff h) (IsAdjoinRoot.root h.toIsAdjoinRoot) = Pi.single 1 1

theorem IsAdjoinRootMonic.coeff_algebraMap {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] [Nontrivial S] (h : IsAdjoinRootMonic S f) (x : R) : (IsAdjoinRootMonic.coeff h) ((algebraMap R S) x) = Pi.single 0 x

theorem IsAdjoinRootMonic.ext_elem {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) ⦃x : S⦄ ⦃y : S⦄ (hxy : ∀ i < Polynomial.natDegree f, (IsAdjoinRootMonic.coeff h) x i = (IsAdjoinRootMonic.coeff h) y i) : x = y

theorem IsAdjoinRootMonic.ext_elem_iff {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) {x : S} {y : S} : x = y ↔ ∀ i < Polynomial.natDegree f, (IsAdjoinRootMonic.coeff h) x i = (IsAdjoinRootMonic.coeff h) y i

theorem IsAdjoinRootMonic.coeff_injective {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : Function.Injective ⇑(IsAdjoinRootMonic.coeff h)

theorem IsAdjoinRootMonic.isIntegral_root {R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : IsIntegral R (IsAdjoinRoot.root h.toIsAdjoinRoot)

@[simp]

theorem IsAdjoinRoot.lift_self_apply {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} (h : IsAdjoinRoot S f) (x : S) : (IsAdjoinRoot.lift (algebraMap R S) (IsAdjoinRoot.root h) ⋯ h) x = x

theorem IsAdjoinRoot.lift_self {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} (h : IsAdjoinRoot S f) : IsAdjoinRoot.lift (algebraMap R S) (IsAdjoinRoot.root h) ⋯ h = RingHom.id S

def IsAdjoinRoot.aequiv {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) : S ≃ₐ[R] T

Adjoining a root gives a unique ring up to algebra isomorphism.

This is the converse of IsAdjoinRoot.ofEquiv: this turns an IsAdjoinRoot into an AlgEquiv, and IsAdjoinRoot.ofEquiv turns an AlgEquiv into an IsAdjoinRoot.

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem IsAdjoinRoot.aequiv_map {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) (z : Polynomial R) : (IsAdjoinRoot.aequiv h h') (h.map z) = h'.map z

@[simp]

theorem IsAdjoinRoot.aequiv_root {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) : (IsAdjoinRoot.aequiv h h') (IsAdjoinRoot.root h) = IsAdjoinRoot.root h'

@[simp]

theorem IsAdjoinRoot.aequiv_self {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} (h : IsAdjoinRoot S f) : IsAdjoinRoot.aequiv h h = AlgEquiv.refl

@[simp]

theorem IsAdjoinRoot.aequiv_symm {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) : AlgEquiv.symm (IsAdjoinRoot.aequiv h h') = IsAdjoinRoot.aequiv h' h

@[simp]

theorem IsAdjoinRoot.lift_aequiv {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] {U : Type u_2} [CommRing U] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) (i : R →+* U) (x : U) (hx : Polynomial.eval₂ i x f = 0) (z : S) : (IsAdjoinRoot.lift i x hx h') ((IsAdjoinRoot.aequiv h h') z) = (IsAdjoinRoot.lift i x hx h) z

@[simp]

theorem IsAdjoinRoot.liftHom_aequiv {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] {U : Type u_2} [CommRing U] [Algebra R U] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) (x : U) (hx : (Polynomial.aeval x) f = 0) (z : S) : (IsAdjoinRoot.liftHom x hx h') ((IsAdjoinRoot.aequiv h h') z) = (IsAdjoinRoot.liftHom x hx h) z

@[simp]

theorem IsAdjoinRoot.aequiv_aequiv {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] {U : Type u_2} [CommRing U] [Algebra R U] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) (h'' : IsAdjoinRoot U f) (x : S) : (IsAdjoinRoot.aequiv h' h'') ((IsAdjoinRoot.aequiv h h') x) = (IsAdjoinRoot.aequiv h h'') x

@[simp]

theorem IsAdjoinRoot.aequiv_trans {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] {U : Type u_2} [CommRing U] [Algebra R U] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) (h'' : IsAdjoinRoot U f) : AlgEquiv.trans (IsAdjoinRoot.aequiv h h') (IsAdjoinRoot.aequiv h' h'') = IsAdjoinRoot.aequiv h h''

@[simp]

theorem IsAdjoinRoot.ofEquiv_map_apply {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] (h : IsAdjoinRoot S f) (e : S ≃ₐ[R] T) : ∀ (a : Polynomial R), (IsAdjoinRoot.ofEquiv h e).map a = e (h.map a)

def IsAdjoinRoot.ofEquiv {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] (h : IsAdjoinRoot S f) (e : S ≃ₐ[R] T) : IsAdjoinRoot T f

Transfer IsAdjoinRoot across an algebra isomorphism.

This is the converse of IsAdjoinRoot.aequiv: this turns an AlgEquiv into an IsAdjoinRoot, and IsAdjoinRoot.aequiv turns an IsAdjoinRoot into an AlgEquiv.

Equations

• IsAdjoinRoot.ofEquiv h e = { map := RingHom.comp (↑↑e) h.map, map_surjective := ⋯, ker_map := ⋯, algebraMap_eq := ⋯ }

@[simp]

theorem IsAdjoinRoot.ofEquiv_root {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] (h : IsAdjoinRoot S f) (e : S ≃ₐ[R] T) : IsAdjoinRoot.root (IsAdjoinRoot.ofEquiv h e) = e (IsAdjoinRoot.root h)

@[simp]

theorem IsAdjoinRoot.aequiv_ofEquiv {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] {U : Type u_2} [CommRing U] [Algebra R U] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot T f) (e : T ≃ₐ[R] U) : IsAdjoinRoot.aequiv h (IsAdjoinRoot.ofEquiv h' e) = AlgEquiv.trans (IsAdjoinRoot.aequiv h h') e

@[simp]

theorem IsAdjoinRoot.ofEquiv_aequiv {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} {T : Type u_1} [CommRing T] [Algebra R T] {U : Type u_2} [CommRing U] [Algebra R U] (h : IsAdjoinRoot S f) (h' : IsAdjoinRoot U f) (e : S ≃ₐ[R] T) : IsAdjoinRoot.aequiv (IsAdjoinRoot.ofEquiv h e) h' = AlgEquiv.trans (AlgEquiv.symm e) (IsAdjoinRoot.aequiv h h')

theorem IsAdjoinRootMonic.minpoly_eq {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] {f : Polynomial R} [IsDomain R] [IsDomain S] [NoZeroSMulDivisors R S] [IsIntegrallyClosed R] (h : IsAdjoinRootMonic S f) (hirr : Irreducible f) : minpoly R (IsAdjoinRoot.root h.toIsAdjoinRoot) = f

theorem Algebra.adjoin.powerBasis'_minpoly_gen {R : Type u} {S : Type v} [CommRing R] [CommRing S] [Algebra R S] [IsDomain R] [IsDomain S] [NoZeroSMulDivisors R S] [IsIntegrallyClosed R] {x : S} (hx' : IsIntegral R x) : minpoly R x = minpoly R (Algebra.adjoin.powerBasis' hx').gen