Equivalences between polynomial rings

This file establishes a number of equivalences between polynomial rings, based on equivalences between the underlying types.

Notation

As in other polynomial files, we typically use the notation:

• σ : Type* (indexing the variables)

• R : Type* [CommSemiring R] (the coefficients)

• s : σ →₀ ℕ, a function from σ to ℕ which is zero away from a finite set. This will give rise to a monomial in MvPolynomial σ R which mathematicians might call X^s

• a : R

• i : σ, with corresponding monomial X i, often denoted X_i by mathematicians

• p : MvPolynomial σ R

Tags

equivalence, isomorphism, morphism, ring hom, hom

@[simp]

theorem MvPolynomial.pUnitAlgEquiv_symm_apply (R : Type u) [CommSemiring R] (p : Polynomial R) : (MvPolynomial.pUnitAlgEquiv R).symm p = Polynomial.eval₂ MvPolynomial.C (MvPolynomial.X PUnit.unit) p

@[simp]

theorem MvPolynomial.pUnitAlgEquiv_apply (R : Type u) [CommSemiring R] (p : MvPolynomial PUnit.{u_2 + 1} R) : (MvPolynomial.pUnitAlgEquiv R) p = MvPolynomial.eval₂ Polynomial.C (fun (x : PUnit.{u_2 + 1} ) => Polynomial.X) p

def MvPolynomial.pUnitAlgEquiv (R : Type u) [CommSemiring R] : MvPolynomial PUnit.{u_2 + 1} R ≃ₐ[R] Polynomial R

The ring isomorphism between multivariable polynomials in a single variable and polynomials over the ground ring.

Equations

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

@[simp]

theorem MvPolynomial.mapEquiv_apply {S₁ : Type v} {S₂ : Type w} (σ : Type u_1) [CommSemiring S₁] [CommSemiring S₂] (e : S₁ ≃+* S₂) (a : MvPolynomial σ S₁) : (MvPolynomial.mapEquiv σ e) a = (MvPolynomial.map ↑e) a

def MvPolynomial.mapEquiv {S₁ : Type v} {S₂ : Type w} (σ : Type u_1) [CommSemiring S₁] [CommSemiring S₂] (e : S₁ ≃+* S₂) : MvPolynomial σ S₁ ≃+* MvPolynomial σ S₂

If e : A ≃+* B is an isomorphism of rings, then so is map e.

Equations

• MvPolynomial.mapEquiv σ e = { toFun := ⇑(MvPolynomial.map ↑e), invFun := ⇑(MvPolynomial.map ↑e.symm), left_inv := ⋯, right_inv := ⋯, map_mul' := ⋯, map_add' := ⋯ }

@[simp]

theorem MvPolynomial.mapEquiv_refl {R : Type u} (σ : Type u_1) [CommSemiring R] : MvPolynomial.mapEquiv σ (RingEquiv.refl R) = RingEquiv.refl (MvPolynomial σ R)

@[simp]

theorem MvPolynomial.mapEquiv_symm {S₁ : Type v} {S₂ : Type w} (σ : Type u_1) [CommSemiring S₁] [CommSemiring S₂] (e : S₁ ≃+* S₂) : (MvPolynomial.mapEquiv σ e).symm = MvPolynomial.mapEquiv σ e.symm

@[simp]

theorem MvPolynomial.mapEquiv_trans {S₁ : Type v} {S₂ : Type w} {S₃ : Type x} (σ : Type u_1) [CommSemiring S₁] [CommSemiring S₂] [CommSemiring S₃] (e : S₁ ≃+* S₂) (f : S₂ ≃+* S₃) : (MvPolynomial.mapEquiv σ e).trans (MvPolynomial.mapEquiv σ f) = MvPolynomial.mapEquiv σ (e.trans f)

@[simp]

theorem MvPolynomial.mapAlgEquiv_apply {R : Type u} (σ : Type u_1) [CommSemiring R] {A₁ : Type u_2} {A₂ : Type u_3} [CommSemiring A₁] [CommSemiring A₂] [Algebra R A₁] [Algebra R A₂] (e : A₁ ≃ₐ[R] A₂) (a : MvPolynomial σ A₁) : (MvPolynomial.mapAlgEquiv σ e) a = (MvPolynomial.map ↑e) a

def MvPolynomial.mapAlgEquiv {R : Type u} (σ : Type u_1) [CommSemiring R] {A₁ : Type u_2} {A₂ : Type u_3} [CommSemiring A₁] [CommSemiring A₂] [Algebra R A₁] [Algebra R A₂] (e : A₁ ≃ₐ[R] A₂) : MvPolynomial σ A₁ ≃ₐ[R] MvPolynomial σ A₂

If e : A ≃ₐ[R] B is an isomorphism of R-algebras, then so is map e.

Equations

• MvPolynomial.mapAlgEquiv σ e = { toFun := ⇑(MvPolynomial.map ↑e), invFun := (MvPolynomial.mapEquiv σ ↑e).invFun, left_inv := ⋯, right_inv := ⋯, map_mul' := ⋯, map_add' := ⋯, commutes' := ⋯ }

@[simp]

theorem MvPolynomial.mapAlgEquiv_refl {R : Type u} (σ : Type u_1) [CommSemiring R] {A₁ : Type u_2} [CommSemiring A₁] [Algebra R A₁] : MvPolynomial.mapAlgEquiv σ AlgEquiv.refl = AlgEquiv.refl

@[simp]

theorem MvPolynomial.mapAlgEquiv_symm {R : Type u} (σ : Type u_1) [CommSemiring R] {A₁ : Type u_2} {A₂ : Type u_3} [CommSemiring A₁] [CommSemiring A₂] [Algebra R A₁] [Algebra R A₂] (e : A₁ ≃ₐ[R] A₂) : (MvPolynomial.mapAlgEquiv σ e).symm = MvPolynomial.mapAlgEquiv σ e.symm

@[simp]

theorem MvPolynomial.mapAlgEquiv_trans {R : Type u} (σ : Type u_1) [CommSemiring R] {A₁ : Type u_2} {A₂ : Type u_3} {A₃ : Type u_4} [CommSemiring A₁] [CommSemiring A₂] [CommSemiring A₃] [Algebra R A₁] [Algebra R A₂] [Algebra R A₃] (e : A₁ ≃ₐ[R] A₂) (f : A₂ ≃ₐ[R] A₃) : (MvPolynomial.mapAlgEquiv σ e).trans (MvPolynomial.mapAlgEquiv σ f) = MvPolynomial.mapAlgEquiv σ (e.trans f)

def MvPolynomial.sumToIter (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] : MvPolynomial (S₁ ⊕ S₂) R →+* MvPolynomial S₁ (MvPolynomial S₂ R)

The function from multivariable polynomials in a sum of two types, to multivariable polynomials in one of the types, with coefficients in multivariable polynomials in the other type.

See sumRingEquiv for the ring isomorphism.

Equations

• MvPolynomial.sumToIter R S₁ S₂ = MvPolynomial.eval₂Hom (MvPolynomial.C.comp MvPolynomial.C) fun (bc : S₁ ⊕ S₂) => Sum.recOn bc MvPolynomial.X (⇑MvPolynomial.C ∘ MvPolynomial.X)

@[simp]

theorem MvPolynomial.sumToIter_C (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (a : R) : (MvPolynomial.sumToIter R S₁ S₂) (MvPolynomial.C a) = MvPolynomial.C (MvPolynomial.C a)

@[simp]

theorem MvPolynomial.sumToIter_Xl (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (b : S₁) : (MvPolynomial.sumToIter R S₁ S₂) (MvPolynomial.X (Sum.inl b)) = MvPolynomial.X b

@[simp]

theorem MvPolynomial.sumToIter_Xr (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (c : S₂) : (MvPolynomial.sumToIter R S₁ S₂) (MvPolynomial.X (Sum.inr c)) = MvPolynomial.C (MvPolynomial.X c)

def MvPolynomial.iterToSum (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] : MvPolynomial S₁ (MvPolynomial S₂ R) →+* MvPolynomial (S₁ ⊕ S₂) R

The function from multivariable polynomials in one type, with coefficients in multivariable polynomials in another type, to multivariable polynomials in the sum of the two types.

See sumRingEquiv for the ring isomorphism.

Equations

• MvPolynomial.iterToSum R S₁ S₂ = MvPolynomial.eval₂Hom (MvPolynomial.eval₂Hom MvPolynomial.C (MvPolynomial.X ∘ Sum.inr)) (MvPolynomial.X ∘ Sum.inl)

@[simp]

theorem MvPolynomial.iterToSum_C_C (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (a : R) : (MvPolynomial.iterToSum R S₁ S₂) (MvPolynomial.C (MvPolynomial.C a)) = MvPolynomial.C a

@[simp]

theorem MvPolynomial.iterToSum_X (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (b : S₁) : (MvPolynomial.iterToSum R S₁ S₂) (MvPolynomial.X b) = MvPolynomial.X (Sum.inl b)

@[simp]

theorem MvPolynomial.iterToSum_C_X (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (c : S₂) : (MvPolynomial.iterToSum R S₁ S₂) (MvPolynomial.C (MvPolynomial.X c)) = MvPolynomial.X (Sum.inr c)

@[simp]

theorem MvPolynomial.isEmptyAlgEquiv_apply (R : Type u) (σ : Type u_1) [CommSemiring R] [he : IsEmpty σ] (a : MvPolynomial σ R) : (MvPolynomial.isEmptyAlgEquiv R σ) a = (MvPolynomial.aeval fun (a : σ) => he.elim a) a

@[simp]

theorem MvPolynomial.isEmptyAlgEquiv_symm_apply_support (R : Type u) (σ : Type u_1) [CommSemiring R] [he : IsEmpty σ] (a : R) : ((MvPolynomial.isEmptyAlgEquiv R σ).symm a).support = if a = 0 then ∅ else {0}

@[simp]

theorem MvPolynomial.isEmptyAlgEquiv_symm_apply_toFun (R : Type u) (σ : Type u_1) [CommSemiring R] [he : IsEmpty σ] (a : R) (j : σ →₀ ℕ) : ((MvPolynomial.isEmptyAlgEquiv R σ).symm a) j = Pi.single 0 a j

def MvPolynomial.isEmptyAlgEquiv (R : Type u) (σ : Type u_1) [CommSemiring R] [he : IsEmpty σ] : MvPolynomial σ R ≃ₐ[R] R

The algebra isomorphism between multivariable polynomials in no variables and the ground ring.

Equations

• MvPolynomial.isEmptyAlgEquiv R σ = AlgEquiv.ofAlgHom (MvPolynomial.aeval fun (a : σ) => he.elim a) (Algebra.ofId R (MvPolynomial σ R)) ⋯ ⋯

@[simp]

theorem MvPolynomial.aeval_injective_iff_of_isEmpty {R : Type u} {S₁ : Type v} {σ : Type u_1} [CommSemiring R] [IsEmpty σ] [CommSemiring S₁] [Algebra R S₁] {f : σ → S₁} : Function.Injective ⇑(MvPolynomial.aeval f) ↔ Function.Injective ⇑(algebraMap R S₁)

@[simp]

theorem MvPolynomial.isEmptyRingEquiv_symm_apply_support (R : Type u) (σ : Type u_1) [CommSemiring R] [IsEmpty σ] (a : R) : ((MvPolynomial.isEmptyRingEquiv R σ).symm a).support = if a = 0 then ∅ else {0}

@[simp]

theorem MvPolynomial.isEmptyRingEquiv_apply (R : Type u) (σ : Type u_1) [CommSemiring R] [IsEmpty σ] (a : MvPolynomial σ R) : (MvPolynomial.isEmptyRingEquiv R σ) a = (MvPolynomial.aeval fun (a : σ) => inst✝.elim a) a

@[simp]

theorem MvPolynomial.isEmptyRingEquiv_symm_apply_toFun (R : Type u) (σ : Type u_1) [CommSemiring R] [IsEmpty σ] (a : R) (j : σ →₀ ℕ) : ((MvPolynomial.isEmptyRingEquiv R σ).symm a) j = Pi.single 0 a j

def MvPolynomial.isEmptyRingEquiv (R : Type u) (σ : Type u_1) [CommSemiring R] [IsEmpty σ] : MvPolynomial σ R ≃+* R

The ring isomorphism between multivariable polynomials in no variables and the ground ring.

Equations

• MvPolynomial.isEmptyRingEquiv R σ = (MvPolynomial.isEmptyAlgEquiv R σ).toRingEquiv

@[simp]

theorem MvPolynomial.mvPolynomialEquivMvPolynomial_symm_apply (R : Type u) (S₁ : Type v) (S₂ : Type w) (S₃ : Type x) [CommSemiring R] [CommSemiring S₃] (f : MvPolynomial S₁ R →+* MvPolynomial S₂ S₃) (g : MvPolynomial S₂ S₃ →+* MvPolynomial S₁ R) (hfgC : (f.comp g).comp MvPolynomial.C = MvPolynomial.C) (hfgX : ∀ (n : S₂), f (g (MvPolynomial.X n)) = MvPolynomial.X n) (hgfC : (g.comp f).comp MvPolynomial.C = MvPolynomial.C) (hgfX : ∀ (n : S₁), g (f (MvPolynomial.X n)) = MvPolynomial.X n) (a : MvPolynomial S₂ S₃) : (MvPolynomial.mvPolynomialEquivMvPolynomial R S₁ S₂ S₃ f g hfgC hfgX hgfC hgfX).symm a = g a

@[simp]

theorem MvPolynomial.mvPolynomialEquivMvPolynomial_apply (R : Type u) (S₁ : Type v) (S₂ : Type w) (S₃ : Type x) [CommSemiring R] [CommSemiring S₃] (f : MvPolynomial S₁ R →+* MvPolynomial S₂ S₃) (g : MvPolynomial S₂ S₃ →+* MvPolynomial S₁ R) (hfgC : (f.comp g).comp MvPolynomial.C = MvPolynomial.C) (hfgX : ∀ (n : S₂), f (g (MvPolynomial.X n)) = MvPolynomial.X n) (hgfC : (g.comp f).comp MvPolynomial.C = MvPolynomial.C) (hgfX : ∀ (n : S₁), g (f (MvPolynomial.X n)) = MvPolynomial.X n) (a : MvPolynomial S₁ R) : (MvPolynomial.mvPolynomialEquivMvPolynomial R S₁ S₂ S₃ f g hfgC hfgX hgfC hgfX) a = f a

def MvPolynomial.mvPolynomialEquivMvPolynomial (R : Type u) (S₁ : Type v) (S₂ : Type w) (S₃ : Type x) [CommSemiring R] [CommSemiring S₃] (f : MvPolynomial S₁ R →+* MvPolynomial S₂ S₃) (g : MvPolynomial S₂ S₃ →+* MvPolynomial S₁ R) (hfgC : (f.comp g).comp MvPolynomial.C = MvPolynomial.C) (hfgX : ∀ (n : S₂), f (g (MvPolynomial.X n)) = MvPolynomial.X n) (hgfC : (g.comp f).comp MvPolynomial.C = MvPolynomial.C) (hgfX : ∀ (n : S₁), g (f (MvPolynomial.X n)) = MvPolynomial.X n) : MvPolynomial S₁ R ≃+* MvPolynomial S₂ S₃

A helper function for sumRingEquiv.

Equations

• MvPolynomial.mvPolynomialEquivMvPolynomial R S₁ S₂ S₃ f g hfgC hfgX hgfC hgfX = { toFun := ⇑f, invFun := ⇑g, left_inv := ⋯, right_inv := ⋯, map_mul' := ⋯, map_add' := ⋯ }

def MvPolynomial.sumRingEquiv (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] : MvPolynomial (S₁ ⊕ S₂) R ≃+* MvPolynomial S₁ (MvPolynomial S₂ R)

The ring isomorphism between multivariable polynomials in a sum of two types, and multivariable polynomials in one of the types, with coefficients in multivariable polynomials in the other type.

Equations

• MvPolynomial.sumRingEquiv R S₁ S₂ = MvPolynomial.mvPolynomialEquivMvPolynomial R (S₁ ⊕ S₂) S₁ (MvPolynomial S₂ R) (MvPolynomial.sumToIter R S₁ S₂) (MvPolynomial.iterToSum R S₁ S₂) ⋯ ⋯ ⋯ ⋯

@[simp]

theorem MvPolynomial.sumAlgEquiv_apply (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (a : MvPolynomial (S₁ ⊕ S₂) R) : (MvPolynomial.sumAlgEquiv R S₁ S₂) a = (MvPolynomial.sumToIter R S₁ S₂) a

@[simp]

theorem MvPolynomial.sumAlgEquiv_symm_apply (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] (a : MvPolynomial S₁ (MvPolynomial S₂ R)) : (MvPolynomial.sumAlgEquiv R S₁ S₂).symm a = (MvPolynomial.iterToSum R S₁ S₂) a

def MvPolynomial.sumAlgEquiv (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] : MvPolynomial (S₁ ⊕ S₂) R ≃ₐ[R] MvPolynomial S₁ (MvPolynomial S₂ R)

The algebra isomorphism between multivariable polynomials in a sum of two types, and multivariable polynomials in one of the types, with coefficients in multivariable polynomials in the other type.

Equations

• MvPolynomial.sumAlgEquiv R S₁ S₂ = { toEquiv := (MvPolynomial.sumRingEquiv R S₁ S₂).toEquiv, map_mul' := ⋯, map_add' := ⋯, commutes' := ⋯ }

theorem MvPolynomial.sumAlgEquiv_comp_rename_inr (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] : (↑(MvPolynomial.sumAlgEquiv R S₁ S₂)).comp (MvPolynomial.rename Sum.inr) = IsScalarTower.toAlgHom R (MvPolynomial S₂ R) (MvPolynomial S₁ (MvPolynomial S₂ R))

theorem MvPolynomial.sumAlgEquiv_comp_rename_inl (R : Type u) (S₁ : Type v) (S₂ : Type w) [CommSemiring R] : (↑(MvPolynomial.sumAlgEquiv R S₁ S₂)).comp (MvPolynomial.rename Sum.inl) = MvPolynomial.mapAlgHom (Algebra.ofId R (MvPolynomial S₂ R))

@[simp]

theorem MvPolynomial.optionEquivLeft_symm_apply (R : Type u) (S₁ : Type v) [CommSemiring R] (a : Polynomial (MvPolynomial S₁ R)) : (MvPolynomial.optionEquivLeft R S₁).symm a = (Polynomial.aevalTower (MvPolynomial.rename some) (MvPolynomial.X none)) a

@[simp]

theorem MvPolynomial.optionEquivLeft_apply (R : Type u) (S₁ : Type v) [CommSemiring R] (a : MvPolynomial (Option S₁) R) : (MvPolynomial.optionEquivLeft R S₁) a = (MvPolynomial.aeval fun (o : Option S₁) => o.elim Polynomial.X fun (s : S₁) => Polynomial.C (MvPolynomial.X s)) a

def MvPolynomial.optionEquivLeft (R : Type u) (S₁ : Type v) [CommSemiring R] : MvPolynomial (Option S₁) R ≃ₐ[R] Polynomial (MvPolynomial S₁ R)

The algebra isomorphism between multivariable polynomials in Option S₁ and polynomials with coefficients in MvPolynomial S₁ R.

Equations

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

theorem MvPolynomial.optionEquivLeft_X_some (R : Type u) (S₁ : Type v) [CommSemiring R] (x : S₁) : (MvPolynomial.optionEquivLeft R S₁) (MvPolynomial.X (some x)) = Polynomial.C (MvPolynomial.X x)

theorem MvPolynomial.optionEquivLeft_X_none (R : Type u) (S₁ : Type v) [CommSemiring R] : (MvPolynomial.optionEquivLeft R S₁) (MvPolynomial.X none) = Polynomial.X

theorem MvPolynomial.optionEquivLeft_C (R : Type u) (S₁ : Type v) [CommSemiring R] (r : R) : (MvPolynomial.optionEquivLeft R S₁) (MvPolynomial.C r) = Polynomial.C (MvPolynomial.C r)

@[simp]

theorem MvPolynomial.optionEquivRight_symm_apply (R : Type u) (S₁ : Type v) [CommSemiring R] (a : MvPolynomial S₁ (Polynomial R)) : (MvPolynomial.optionEquivRight R S₁).symm a = (MvPolynomial.aevalTower (Polynomial.aeval (MvPolynomial.X none)) fun (i : S₁) => MvPolynomial.X (some i)) a

@[simp]

theorem MvPolynomial.optionEquivRight_apply (R : Type u) (S₁ : Type v) [CommSemiring R] (a : MvPolynomial (Option S₁) R) : (MvPolynomial.optionEquivRight R S₁) a = (MvPolynomial.aeval fun (o : Option S₁) => o.elim (MvPolynomial.C Polynomial.X) MvPolynomial.X) a

def MvPolynomial.optionEquivRight (R : Type u) (S₁ : Type v) [CommSemiring R] : MvPolynomial (Option S₁) R ≃ₐ[R] MvPolynomial S₁ (Polynomial R)

The algebra isomorphism between multivariable polynomials in Option S₁ and multivariable polynomials with coefficients in polynomials.

Equations

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

theorem MvPolynomial.optionEquivRight_X_some (R : Type u) (S₁ : Type v) [CommSemiring R] (x : S₁) : (MvPolynomial.optionEquivRight R S₁) (MvPolynomial.X (some x)) = MvPolynomial.X x

theorem MvPolynomial.optionEquivRight_X_none (R : Type u) (S₁ : Type v) [CommSemiring R] : (MvPolynomial.optionEquivRight R S₁) (MvPolynomial.X none) = MvPolynomial.C Polynomial.X

theorem MvPolynomial.optionEquivRight_C (R : Type u) (S₁ : Type v) [CommSemiring R] (r : R) : (MvPolynomial.optionEquivRight R S₁) (MvPolynomial.C r) = MvPolynomial.C (Polynomial.C r)

def MvPolynomial.finSuccEquiv (R : Type u) [CommSemiring R] (n : ℕ) : MvPolynomial (Fin (n + 1)) R ≃ₐ[R] Polynomial (MvPolynomial (Fin n) R)

The algebra isomorphism between multivariable polynomials in Fin (n + 1) and polynomials over multivariable polynomials in Fin n.

Equations

• MvPolynomial.finSuccEquiv R n = (MvPolynomial.renameEquiv R (finSuccEquiv n)).trans (MvPolynomial.optionEquivLeft R (Fin n))

theorem MvPolynomial.finSuccEquiv_eq (R : Type u) [CommSemiring R] (n : ℕ) : ↑(MvPolynomial.finSuccEquiv R n) = MvPolynomial.eval₂Hom (Polynomial.C.comp MvPolynomial.C) fun (i : Fin (n + 1)) => Fin.cases Polynomial.X (fun (k : Fin n) => Polynomial.C (MvPolynomial.X k)) i

@[simp]

theorem MvPolynomial.finSuccEquiv_apply (R : Type u) [CommSemiring R] (n : ℕ) (p : MvPolynomial (Fin (n + 1)) R) : (MvPolynomial.finSuccEquiv R n) p = (MvPolynomial.eval₂Hom (Polynomial.C.comp MvPolynomial.C) fun (i : Fin (n + 1)) => Fin.cases Polynomial.X (fun (k : Fin n) => Polynomial.C (MvPolynomial.X k)) i) p

theorem MvPolynomial.finSuccEquiv_comp_C_eq_C {R : Type u} [CommSemiring R] (n : ℕ) : (↑(MvPolynomial.finSuccEquiv R n).symm).comp (Polynomial.C.comp MvPolynomial.C) = MvPolynomial.C

theorem MvPolynomial.finSuccEquiv_X_zero {R : Type u} [CommSemiring R] {n : ℕ} : (MvPolynomial.finSuccEquiv R n) (MvPolynomial.X 0) = Polynomial.X

theorem MvPolynomial.finSuccEquiv_X_succ {R : Type u} [CommSemiring R] {n : ℕ} {j : Fin n} : (MvPolynomial.finSuccEquiv R n) (MvPolynomial.X j.succ) = Polynomial.C (MvPolynomial.X j)

theorem MvPolynomial.finSuccEquiv_coeff_coeff {R : Type u} [CommSemiring R] {n : ℕ} (m : Fin n →₀ ℕ) (f : MvPolynomial (Fin (n + 1)) R) (i : ℕ) : MvPolynomial.coeff m (((MvPolynomial.finSuccEquiv R n) f).coeff i) = MvPolynomial.coeff (Finsupp.cons i m) f

The coefficient of m in the i-th coefficient of finSuccEquiv R n f equals the coefficient of Finsupp.cons i m in f.

theorem MvPolynomial.eval_eq_eval_mv_eval' {R : Type u} [CommSemiring R] {n : ℕ} (s : Fin n → R) (y : R) (f : MvPolynomial (Fin (n + 1)) R) : (MvPolynomial.eval (Fin.cons y s)) f = Polynomial.eval y (Polynomial.map (MvPolynomial.eval s) ((MvPolynomial.finSuccEquiv R n) f))

theorem MvPolynomial.coeff_eval_eq_eval_coeff {R : Type u} [CommSemiring R] {n : ℕ} (s' : Fin n → R) (f : Polynomial (MvPolynomial (Fin n) R)) (i : ℕ) : (Polynomial.map (MvPolynomial.eval s') f).coeff i = (MvPolynomial.eval s') (f.coeff i)

theorem MvPolynomial.support_coeff_finSuccEquiv {R : Type u} [CommSemiring R] {n : ℕ} {f : MvPolynomial (Fin (n + 1)) R} {i : ℕ} {m : Fin n →₀ ℕ} : m ∈ (((MvPolynomial.finSuccEquiv R n) f).coeff i).support ↔ Finsupp.cons i m ∈ f.support

theorem MvPolynomial.totalDegree_coeff_finSuccEquiv_add_le {R : Type u} [CommSemiring R] {n : ℕ} (f : MvPolynomial (Fin (n + 1)) R) (i : ℕ) (hi : ((MvPolynomial.finSuccEquiv R n) f).coeff i ≠ 0) : (((MvPolynomial.finSuccEquiv R n) f).coeff i).totalDegree + i ≤ f.totalDegree

The totalDegree of a multivariable polynomial p is at least i more than the totalDegree of the ith coefficient of finSuccEquiv applied to p, if this is nonzero.

theorem MvPolynomial.finSuccEquiv_support {R : Type u} [CommSemiring R] {n : ℕ} (f : MvPolynomial (Fin (n + 1)) R) : ((MvPolynomial.finSuccEquiv R n) f).support = Finset.image (fun (m : Fin (n + 1) →₀ ℕ) => m 0) f.support

theorem MvPolynomial.finSuccEquiv_support' {R : Type u} [CommSemiring R] {n : ℕ} {f : MvPolynomial (Fin (n + 1)) R} {i : ℕ} : Finset.image (Finsupp.cons i) (((MvPolynomial.finSuccEquiv R n) f).coeff i).support = Finset.filter (fun (m : Fin (n + 1) →₀ ℕ) => m 0 = i) f.support

theorem MvPolynomial.support_finSuccEquiv_nonempty {R : Type u} [CommSemiring R] {n : ℕ} {f : MvPolynomial (Fin (n + 1)) R} (h : f ≠ 0) : ((MvPolynomial.finSuccEquiv R n) f).support.Nonempty

theorem MvPolynomial.degree_finSuccEquiv {R : Type u} [CommSemiring R] {n : ℕ} {f : MvPolynomial (Fin (n + 1)) R} (h : f ≠ 0) : ((MvPolynomial.finSuccEquiv R n) f).degree = ↑(MvPolynomial.degreeOf 0 f)

theorem MvPolynomial.natDegree_finSuccEquiv {R : Type u} [CommSemiring R] {n : ℕ} (f : MvPolynomial (Fin (n + 1)) R) : ((MvPolynomial.finSuccEquiv R n) f).natDegree = MvPolynomial.degreeOf 0 f

theorem MvPolynomial.degreeOf_coeff_finSuccEquiv {R : Type u} [CommSemiring R] {n : ℕ} (p : MvPolynomial (Fin (n + 1)) R) (j : Fin n) (i : ℕ) : MvPolynomial.degreeOf j (((MvPolynomial.finSuccEquiv R n) p).coeff i) ≤ MvPolynomial.degreeOf j.succ p

theorem MvPolynomial.finSuccEquiv_rename_finSuccEquiv {R : Type u} {σ : Type u_1} [CommSemiring R] {n : ℕ} (e : σ ≃ Fin n) (φ : MvPolynomial (Option σ) R) : (MvPolynomial.finSuccEquiv R n) ((MvPolynomial.rename ⇑(e.optionCongr.trans (finSuccEquiv n).symm)) φ) = Polynomial.map (MvPolynomial.rename ⇑e).toRingHom ((MvPolynomial.optionEquivLeft R σ) φ)

Consider a multivariate polynomial φ whose variables are indexed by Option σ, and suppose that σ ≃ Fin n. Then one may view φ as a polynomial over MvPolynomial (Fin n) R, by

1. renaming the variables via Option σ ≃ Fin (n+1), and then singling out the 0-th variable via MvPolynomial.finSuccEquiv;
2. first viewing it as polynomial over MvPolynomial σ R via MvPolynomial.optionEquivLeft, and then renaming the variables.

This lemma shows that both constructions are the same.