On Some Local Rings (Maassarani, 2025) -- Section 02 -- Part 1

Lean contributors (project-level attribution): Liang Xiao, Haochen Ju, Zichen Wang.

Source header ยท Attribution source

namespace SomeLocalRingsvariable {๐•œ : Type*} [Field ๐•œ]variable {A B : Type*} [Ring A] [Ring B] [Algebra ๐•œ A] [Algebra ๐•œ B]

Definition 2.1. For Unknown identifier `A`A and Unknown identifier `B`B two Unknown identifier `๐•œ`๐•œ-algebras, we say that a ring morphism stabilizes Unknown identifier `๐•œ`๐•œ if there exists a field automorphism such that for all , Unknown identifier `f`sorry = (algebraMap sorry sorry) sorry : Propf (algebraMap ๐•œ A a) = algebraMap Unknown identifier `๐•œ`๐•œ Unknown identifier `B`B (Unknown identifier `ฯƒ_f`ฯƒ_f a).

def RingHom.StabilizesBaseField (f : A โ†’+* B) : Prop := โˆƒ ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ, โˆ€ a : ๐•œ, f (algebraMap ๐•œ A a) = algebraMap ๐•œ B (ฯƒ_f a)

A ring morphism stabilizes Unknown identifier `๐•œ`๐•œ with respect to a given automorphism Unknown identifier `ฯƒ_f`ฯƒ_f.

def RingHom.StabilizesBaseFieldWith (f : A โ†’+* B) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) : Prop := โˆ€ a : ๐•œ, f (algebraMap ๐•œ A a) = algebraMap ๐•œ B (ฯƒ_f a)

Given stabilizing Unknown identifier `๐•œ`๐•œ with respect to Unknown identifier `ฯƒ_f`ฯƒ_f, the range of Unknown identifier `f`f is a Unknown identifier `๐•œ`๐•œ-submodule of Unknown identifier `B`B.

This corresponds to the statement that is a Unknown identifier `๐•œ`๐•œ-vector subspace of Unknown identifier `B`B.

noncomputable def RingHom.rangeSubmodule (f : A โ†’+* B) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f) : Submodule ๐•œ B := by classical refine { carrier := Set.range f add_mem' := ?_ zero_mem' := ?_ smul_mem' := ?_ } ยท intro x y hx hy rcases hx with โŸจx', rflโŸฉ rcases hy with โŸจy', rflโŸฉ refine โŸจx' + y', by simpโŸฉ ยท exact โŸจ0, by simpโŸฉ ยท intro a y hy rcases hy with โŸจx, rflโŸฉ refine โŸจ(algebraMap ๐•œ A (ฯƒ_f.symm a)) * x, ?_โŸฉ -- `f` is `ฯƒ_f`-semilinear on `๐•œ`-scalars. calc f ((algebraMap ๐•œ A (ฯƒ_f.symm a)) * x) = f (algebraMap ๐•œ A (ฯƒ_f.symm a)) * f x := by simp [map_mul] _ = (algebraMap ๐•œ B a) * f x := by have : f (algebraMap ๐•œ A (ฯƒ_f.symm a)) = algebraMap ๐•œ B a := by simpa using (hf (ฯƒ_f.symm a)) simp [this] _ = a โ€ข f x := by simp [Algebra.smul_def]

Proposition 2.2. Let Unknown identifier `๐•œ`๐•œ be a field. Let Unknown identifier `A`A and Unknown identifier `B`B be finite dimensional algebras over Unknown identifier `๐•œ`๐•œ and let be a ring morphism stabilizing Unknown identifier `๐•œ`๐•œ with respect to .

  1. is a Unknown identifier `๐•œ`๐•œ-vector subspace of Unknown identifier `B`B.

  2. If Unknown identifier `f`f is injective then .

  3. If Unknown identifier `f`f is injective and then Unknown identifier `f`f is an isomorphism.

  4. If Unknown identifier `f`f is an isomorphism then Unknown identifier `f`sorryโปยน : ?m.1fโปยน stabilizes Unknown identifier `๐•œ`๐•œ and .

  5. If Unknown identifier `f`f is an isomorphism then .

  6. Let Unknown identifier `I`I be a proper ideal of Unknown identifier `B`B, and let be the projection. Then Unknown identifier `ฯ€`sorry โˆ˜ sorry : ?m.1 โ†’ ?m.3ฯ€ โˆ˜ Unknown identifier `f`f stabilizes Unknown identifier `๐•œ`๐•œ and .

  7. Let Unknown identifier `J`J be an ideal of Unknown identifier `A`A lying in the kernel of Unknown identifier `f`f. Then the induced morphism factorising Unknown identifier `f`f stabilizes Unknown identifier `๐•œ`๐•œ and .

theorem exists_submodule_range_eq_of_stabilizesBaseFieldWith (f : A โ†’+* B) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f) : โˆƒ V : Submodule ๐•œ B, (V : Set B) = Set.range f := by classical refine โŸจRingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f hf, ?_โŸฉ rfl

Twisting scalar multiplication by a field automorphism preserves Module.finrank.{u_1, u_2} (R : Type u_1) (M : Type u_2) [Semiring R] [AddCommMonoid M] [Module R M] : โ„•Module.finrank.

theorem finrank_compHom_symm [FiniteDimensional ๐•œ A] (ฯƒ : ๐•œ โ‰ƒ+* ๐•œ) : @Module.finrank ๐•œ A _ _ (Module.compHom A (ฯƒ.symm.toRingHom)) = Module.finrank ๐•œ A := by classical let inst0 : Module ๐•œ A := inferInstance let inst1 : Module ๐•œ A := by letI : Module ๐•œ A := inst0 exact Module.compHom A (ฯƒ.symm.toRingHom) have hrank : @Module.rank ๐•œ A _ _ inst1 = @Module.rank ๐•œ A _ _ inst0 := by -- Compare ranks using the identity additive equivalence and the scalar automorphism `ฯƒ`. have hrank' : @Module.rank ๐•œ A _ _ inst0 = @Module.rank ๐•œ A _ _ inst1 := by simpa using (@rank_eq_of_equiv_equiv (R := ๐•œ) (R' := ๐•œ) (M := A) (Mโ‚ := A) _ _ inst0 _ _ inst1 (i := ฯƒ) (j := AddEquiv.refl A) ฯƒ.bijective (by intro r m -- Unfold the scalar action for `inst1` (a `Module.compHom`). change @SMul.smul ๐•œ A inst0.toSMul r m = @SMul.smul ๐•œ A inst1.toSMul (ฯƒ r) m change @SMul.smul ๐•œ A inst0.toSMul r m = @SMul.smul ๐•œ A inst0.toSMul (ฯƒ.symm (ฯƒ r)) m simp)) simpa using hrank'.symm -- Convert rank equality into `finrank` equality. simpa [Module.finrank, inst1, inst0] using congrArg Cardinal.toNat hrank
theorem finrank_rangeSubmodule_eq_finrank_of_injective [FiniteDimensional ๐•œ A] [FiniteDimensional ๐•œ B] (f : A โ†’+* B) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f) (hinj : Function.Injective f) : Module.finrank ๐•œ (RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f hf) = Module.finrank ๐•œ A := by classical -- Use the twisted `๐•œ`-module structure on `A` (via `ฯƒ_f.symm`) so that `f` becomes `๐•œ`-linear. let inst0 : Module ๐•œ A := inferInstance let instAฯƒ : Module ๐•œ A := Module.compHom A (ฯƒ_f.symm.toRingHom) have hfin_twist : @Module.finrank ๐•œ A _ _ instAฯƒ = @Module.finrank ๐•œ A _ _ inst0 := by -- `inst0` is definitionally the ambient `๐•œ`-module structure on `A`. simpa [instAฯƒ, inst0] using (finrank_compHom_symm (๐•œ := ๐•œ) (A := A) ฯƒ_f) have hfin : Module.finrank ๐•œ (RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f hf) = @Module.finrank ๐•œ A _ _ instAฯƒ := by letI : Module ๐•œ A := instAฯƒ let fL : A โ†’โ‚—[๐•œ] B := { toFun := f map_add' := by intro x y simp map_smul' := by intro a x -- Unfold the scalar action for `instAฯƒ` (a `Module.compHom`). change f ((letI : Module ๐•œ A := inst0; (ฯƒ_f.symm a) โ€ข x)) = a โ€ข f x -- Use the defining relation `hf` and multiplicativity of `f`. simp [Algebra.smul_def, map_mul, hf (ฯƒ_f.symm a)] } have hrange : RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f hf = LinearMap.range fL := by ext y rfl have hfinrange : Module.finrank ๐•œ (LinearMap.range fL) = Module.finrank ๐•œ A := by simpa using (LinearMap.finrank_range_of_inj (f := fL) (by simpa using hinj)) calc Module.finrank ๐•œ (RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f hf) = Module.finrank ๐•œ (LinearMap.range fL) := by simpa using congrArg (fun (S : Submodule ๐•œ B) => Module.finrank ๐•œ S) hrange _ = Module.finrank ๐•œ A := hfinrange _ = @Module.finrank ๐•œ A _ _ instAฯƒ := by rfl -- Convert from the twisted module structure back to the original one. exact hfin.trans hfin_twisttheorem exists_ringEquiv_of_injective_of_finrank_eq [FiniteDimensional ๐•œ A] [FiniteDimensional ๐•œ B] (f : A โ†’+* B) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f) (hinj : Function.Injective f) (hfinrank : Module.finrank ๐•œ A = Module.finrank ๐•œ B) : โˆƒ e : A โ‰ƒ+* B, e.toRingHom = f := by classical let V := RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f hf have hV : Module.finrank ๐•œ V = Module.finrank ๐•œ B := by calc Module.finrank ๐•œ V = Module.finrank ๐•œ A := by simpa [V] using (finrank_rangeSubmodule_eq_finrank_of_injective (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f hf hinj) _ = Module.finrank ๐•œ B := hfinrank have hVtop : (V : Submodule ๐•œ B) = โŠค := by -- A submodule of the same `finrank` as the ambient space is `โŠค`. exact Submodule.eq_top_of_finrank_eq (S := V) (by simpa using hV) have hsurj : Function.Surjective f := by intro y have : y โˆˆ (V : Submodule ๐•œ B) := by simp [hVtop] rcases this with โŸจx, rflโŸฉ exact โŸจx, rflโŸฉ refine โŸจRingEquiv.ofBijective f โŸจhinj, hsurjโŸฉ, ?_โŸฉ rfltheorem stabilizesBaseFieldWith_inv_of_ringEquiv (e : A โ‰ƒ+* B) (ฯƒ_e : ๐•œ โ‰ƒ+* ๐•œ) (he : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B) e.toRingHom ฯƒ_e) : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := B) (B := A) e.symm.toRingHom ฯƒ_e.symm := by intro a have h := he (ฯƒ_e.symm a) -- Apply `e.symm` to the defining relation for `e`. have h' := congrArg (fun b => e.symm b) h -- Simplify. simpa using h'.symmtheorem finrank_eq_of_ringEquiv [FiniteDimensional ๐•œ A] [FiniteDimensional ๐•œ B] (e : A โ‰ƒ+* B) (ฯƒ_e : ๐•œ โ‰ƒ+* ๐•œ) (he : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B) e.toRingHom ฯƒ_e) : Module.finrank ๐•œ A = Module.finrank ๐•œ B := by classical -- Apply Prop. 2.2.(2) to `e.toRingHom`, and use that its range is `โŠค`. have hinj : Function.Injective e.toRingHom := e.injective have h1 : Module.finrank ๐•œ (RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) e.toRingHom ฯƒ_e he) = Module.finrank ๐•œ A := by simpa using (finrank_rangeSubmodule_eq_finrank_of_injective (๐•œ := ๐•œ) (A := A) (B := B) e.toRingHom ฯƒ_e he hinj) have hrange : (RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) e.toRingHom ฯƒ_e he : Submodule ๐•œ B) = โŠค := by ext y constructor ยท intro _; simp ยท intro _ rcases e.surjective y with โŸจx, rflโŸฉ exact โŸจx, rflโŸฉ have htop : Module.finrank ๐•œ (RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) e.toRingHom ฯƒ_e he) = Module.finrank ๐•œ B := by -- Use that `rangeSubmodule = โŠค`, hence it is linearly equivalent to `B`. let S : Submodule ๐•œ B := RingHom.rangeSubmodule (๐•œ := ๐•œ) (A := A) (B := B) e.toRingHom ฯƒ_e he have eSTop : (โ†ฅS) โ‰ƒโ‚—[๐•œ] (โ†ฅ(โŠค : Submodule ๐•œ B)) := LinearEquiv.ofEq S โŠค (by simpa [S] using hrange) have eSB : (โ†ฅS) โ‰ƒโ‚—[๐•œ] B := eSTop.trans Submodule.topEquiv simpa [S] using eSB.finrank_eq -- Combine the two equalities. exact (h1.symm.trans htop)theorem stabilizesBaseFieldWith_comp_quotient_mk (f : A โ†’+* B) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f) (I : Ideal B) [I.IsTwoSided] (hI : I โ‰  โŠค) : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B โงธ I) ((Ideal.Quotient.mk I).comp f) ฯƒ_f := by have _ : I โ‰  โŠค := hI intro a -- Push the relation through the quotient map. simpa [RingHom.StabilizesBaseFieldWith] using congrArg (Ideal.Quotient.mk I) (hf a)theorem stabilizesBaseFieldWith_quotientLift (f : A โ†’+* B) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A) (B := B) f ฯƒ_f) (J : Ideal A) [J.IsTwoSided] (hJ : โˆ€ a โˆˆ J, f a = 0) : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := A โงธ J) (B := B) (Ideal.Quotient.lift J f hJ) ฯƒ_f := by intro a -- Use the quotient algebra map and the defining property of `Ideal.Quotient.lift`. simpa [RingHom.StabilizesBaseFieldWith] using (by -- `algebraMap` into a quotient is `Ideal.Quotient.mk` on `algebraMap` into the ring. simpa using (by -- Reduce to the statement for `f` using `Ideal.Quotient.lift_mk`. simpa [Ideal.Quotient.mk_algebraMap (Rโ‚ := ๐•œ) (A := A) J a] using (by -- `lift` agrees with `f` on representatives. simpa [Ideal.Quotient.lift_mk] using hf a)))

Polynomial.mapEquiv.{u, v} {R : Type u} {S : Type v} [Semiring R] [Semiring S] (e : R โ‰ƒ+* S) : Polynomial R โ‰ƒ+* Polynomial SPolynomial.mapEquiv fixes the variable Unknown identifier `X`X.

lemma polynomial_mapEquiv_fix_X (ฯƒ : ๐•œ โ‰ƒ+* ๐•œ) : (Polynomial.mapEquiv ฯƒ) Polynomial.X = Polynomial.X := by simp [Polynomial.mapEquiv_apply]

Polynomial.mapEquiv.{u, v} {R : Type u} {S : Type v} [Semiring R] [Semiring S] (e : R โ‰ƒ+* S) : Polynomial R โ‰ƒ+* Polynomial SPolynomial.mapEquiv stabilizes the base field with the given automorphism.

lemma polynomial_mapEquiv_stabilizesBaseFieldWith (ฯƒ : ๐•œ โ‰ƒ+* ๐•œ) : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ) (B := Polynomial ๐•œ) (Polynomial.mapEquiv ฯƒ).toRingHom ฯƒ := by intro a simp [Polynomial.mapEquiv_apply, Polynomial.algebraMap_eq]

If a ring automorphism of failed to synthesize instance of type class GetElem Prop Prop ?m.3 Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`sorry[sorry] : ?m.3๐•œ[Unknown identifier `X`X] fixes Unknown identifier `X`X and acts on the base field Unknown identifier `๐•œ`๐•œ by Unknown identifier `ฯƒ`ฯƒ, then it is Polynomial.mapEquiv sorry : Polynomial ?m.1 โ‰ƒ+* Polynomial ?m.2Polynomial.mapEquiv Unknown identifier `ฯƒ`ฯƒ.

lemma polynomialRingEquiv_eq_mapEquiv_of_fix_X_of_stabilizesBaseFieldWith (ฯƒ : ๐•œ โ‰ƒ+* ๐•œ) (e : Polynomial ๐•œ โ‰ƒ+* Polynomial ๐•œ) (hX : e Polynomial.X = Polynomial.X) (he : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ) (B := Polynomial ๐•œ) e.toRingHom ฯƒ) : e = Polynomial.mapEquiv ฯƒ := by -- First prove equality of the underlying ring homomorphisms. have hRingHom : e.toRingHom = (Polynomial.mapEquiv ฯƒ).toRingHom := by apply Polynomial.ringHom_ext ยท intro a have hCe : e.toRingHom (Polynomial.C a) = Polynomial.C (ฯƒ a) := by simpa [Polynomial.algebraMap_eq] using he a have hCmap : (Polynomial.mapEquiv ฯƒ).toRingHom (Polynomial.C a) = Polynomial.C (ฯƒ a) := by simp [Polynomial.mapEquiv_apply] exact hCe.trans hCmap.symm ยท have hXe : e.toRingHom Polynomial.X = Polynomial.X := by simpa using hX have hXmap : (Polynomial.mapEquiv ฯƒ).toRingHom Polynomial.X = Polynomial.X := by simp [RingEquiv.toRingHom_eq_coe, polynomial_mapEquiv_fix_X (๐•œ := ๐•œ) ฯƒ] exact hXe.trans hXmap.symm -- Lift to an equality of ring equivalences. apply RingEquiv.ext intro p simpa using congrArg (fun f : Polynomial ๐•œ โ†’+* Polynomial ๐•œ => f p) hRingHom

Proposition 2.3. Let Unknown identifier `๐•œ`๐•œ be a field and let be a field automorphism. Then there is a unique ring automorphism stabilizing Unknown identifier `๐•œ`๐•œ with respect to Unknown identifier `ฯƒ`ฯƒ such that .

theorem existsUnique_polynomialRingEquiv_stabilizesBaseFieldWith_fixing_X (ฯƒ : ๐•œ โ‰ƒ+* ๐•œ) : โˆƒ! ฯƒX : Polynomial ๐•œ โ‰ƒ+* Polynomial ๐•œ, ฯƒX Polynomial.X = Polynomial.X โˆง RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ) (B := Polynomial ๐•œ) ฯƒX.toRingHom ฯƒ := by refine โŸจPolynomial.mapEquiv ฯƒ, ?_, ?_โŸฉ ยท refine โŸจpolynomial_mapEquiv_fix_X (๐•œ := ๐•œ) ฯƒ, ?_โŸฉ exact polynomial_mapEquiv_stabilizesBaseFieldWith (๐•œ := ๐•œ) ฯƒ ยท intro e he rcases he with โŸจhX, hstabโŸฉ exact polynomialRingEquiv_eq_mapEquiv_of_fix_X_of_stabilizesBaseFieldWith (๐•œ := ๐•œ) ฯƒ e hX hstab

A ring isomorphism failed to synthesize instance of type class GetElem Prop Prop ?m.8 Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`๐•œ[Unknown identifier `X`X]/(Unknown identifier `Pโ‚`Pโ‚) โ‰ƒ+* failed to synthesize instance of type class GetElem Prop Prop ?m.19 Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`๐•œ[Unknown identifier `X`X]/(Unknown identifier `Pโ‚‚`Pโ‚‚) stabilizing Unknown identifier `๐•œ`๐•œ forces equal Unknown identifier `natDegree`natDegree.

lemma prop2_4_natDegree_eq (Pโ‚ Pโ‚‚ : Polynomial ๐•œ) (hPโ‚ : Irreducible Pโ‚) (hPโ‚‚ : Irreducible Pโ‚‚) (f : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) โ‰ƒ+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (B := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) f.toRingHom ฯƒ_f) : Pโ‚.natDegree = Pโ‚‚.natDegree := by classical -- Equip the quotients with `FiniteDimensional` instances, using a monic associate. have hPโ‚0 : Pโ‚ โ‰  0 := hPโ‚.ne_zero have hPโ‚‚0 : Pโ‚‚ โ‰  0 := hPโ‚‚.ne_zero let Pโ‚m : Polynomial ๐•œ := Pโ‚ * Polynomial.C (Pโ‚.leadingCoeff)โปยน let Pโ‚‚m : Polynomial ๐•œ := Pโ‚‚ * Polynomial.C (Pโ‚‚.leadingCoeff)โปยน have hPโ‚m_monic : Pโ‚m.Monic := by simpa [Pโ‚m] using (Polynomial.monic_mul_leadingCoeff_inv (p := Pโ‚) hPโ‚0) have hPโ‚‚m_monic : Pโ‚‚m.Monic := by simpa [Pโ‚‚m] using (Polynomial.monic_mul_leadingCoeff_inv (p := Pโ‚‚) hPโ‚‚0) have hPโ‚m_isUnit : IsUnit (Polynomial.C (Pโ‚.leadingCoeff)โปยน) := by have hne : (Pโ‚.leadingCoeff)โปยน โ‰  0 := by exact inv_ne_zero (Polynomial.leadingCoeff_ne_zero.2 hPโ‚0) exact (Polynomial.isUnit_C).2 ((isUnit_iff_ne_zero).2 hne) have hPโ‚‚m_isUnit : IsUnit (Polynomial.C (Pโ‚‚.leadingCoeff)โปยน) := by have hne : (Pโ‚‚.leadingCoeff)โปยน โ‰  0 := by exact inv_ne_zero (Polynomial.leadingCoeff_ne_zero.2 hPโ‚‚0) exact (Polynomial.isUnit_C).2 ((isUnit_iff_ne_zero).2 hne) have hIโ‚ : (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) = Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ)) := by -- The generators are associated via multiplication by a unit constant. have hassoc : Associated Pโ‚ Pโ‚m := by refine โŸจhPโ‚m_isUnit.unit, ?_โŸฉ simp [Pโ‚m] exact (Ideal.span_singleton_eq_span_singleton).2 hassoc have hIโ‚‚ : (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) = Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ)) := by have hassoc : Associated Pโ‚‚ Pโ‚‚m := by refine โŸจhPโ‚‚m_isUnit.unit, ?_โŸฉ simp [Pโ‚‚m] exact (Ideal.span_singleton_eq_span_singleton).2 hassoc haveI : FiniteDimensional ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ))) := (Polynomial.Monic.finite_quotient (R := ๐•œ) (g := Pโ‚m) hPโ‚m_monic) haveI : FiniteDimensional ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ))) := (Polynomial.Monic.finite_quotient (R := ๐•œ) (g := Pโ‚‚m) hPโ‚‚m_monic) haveI : FiniteDimensional ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) := by let e : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ))) โ‰ƒโ‚[๐•œ] (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) := Ideal.quotientEquivAlgOfEq (Rโ‚ := ๐•œ) (A := Polynomial ๐•œ) (I := Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ))) (J := Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) hIโ‚.symm exact Module.Finite.equiv (R := ๐•œ) (M := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ))) (N := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) e.toLinearEquiv haveI : FiniteDimensional ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) := by let e : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ))) โ‰ƒโ‚[๐•œ] (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) := Ideal.quotientEquivAlgOfEq (Rโ‚ := ๐•œ) (A := Polynomial ๐•œ) (I := Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ))) (J := Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) hIโ‚‚.symm exact Module.Finite.equiv (R := ๐•œ) (M := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ))) (N := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) e.toLinearEquiv have hfin : Module.finrank ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) = Module.finrank ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) := finrank_eq_of_ringEquiv (๐•œ := ๐•œ) (A := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (B := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) f ฯƒ_f hf simpa [finrank_quotient_span_eq_natDegree] using hfin

In the quotient by the principal ideal (Unknown identifier `P`P), a polynomial and its remainder modulo Unknown identifier `P`P agree.

lemma quotient_mk_mod_eq_mk (P p : Polynomial ๐•œ) : Ideal.Quotient.mk (Ideal.span ({P} : Set (Polynomial ๐•œ))) (p % P) = Ideal.Quotient.mk (Ideal.span ({P} : Set (Polynomial ๐•œ))) p := by classical apply (Ideal.Quotient.eq).2 -- `p % P - p` is a multiple of `P`. refine (Ideal.mem_span_singleton).2 ?_ refine โŸจ-(p / P), ?_โŸฉ have hrem : p % P = p - P * (p / P) := by exact eq_sub_of_add_eq (EuclideanDomain.mod_add_div p P) calc p % P - p = (p - P * (p / P)) - p := by simp [hrem] _ = -(P * (p / P)) := by simp [sub_eq_add_neg, add_left_comm, add_comm] _ = P * (-(p / P)) := by simp [mul_neg]

Every element of failed to synthesize instance of type class GetElem Prop Prop (Type ?u.515767) Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`sorry[sorry] โงธ sorry : Type (max u_1 u_2)๐•œ[Unknown identifier `X`X]โงธ(Unknown identifier `P`P) has a representative of .

lemma prop2_4_exists_reduced_poly_rep (P : Polynomial ๐•œ) (hP : P.natDegree โ‰  0) (z : Polynomial ๐•œ โงธ Ideal.span ({P} : Set (Polynomial ๐•œ))) : โˆƒ Q : Polynomial ๐•œ, Q.natDegree < P.natDegree โˆง Ideal.Quotient.mk _ Q = z := by classical rcases (Ideal.Quotient.mk_surjective (I := Ideal.span ({P} : Set (Polynomial ๐•œ))) z) with โŸจR, rflโŸฉ refine โŸจR % P, ?_, ?_โŸฉ ยท simpa using Polynomial.natDegree_mod_lt R hP ยท simpa using (quotient_mk_mod_eq_mk (๐•œ := ๐•œ) P R)

If two polynomials of represent the same element in failed to synthesize instance of type class GetElem Prop Prop (Type ?u.521602) Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`sorry[sorry] โงธ sorry : Type (max u_1 u_2)๐•œ[Unknown identifier `X`X]โงธ(Unknown identifier `P`P), then they are equal.

lemma prop2_4_unique_reduced_poly_rep {P : Polynomial ๐•œ} {Q Q' : Polynomial ๐•œ} (hQ : Q.natDegree < P.natDegree) (hQ' : Q'.natDegree < P.natDegree) (h : Ideal.Quotient.mk (Ideal.span ({P} : Set (Polynomial ๐•œ))) Q = Ideal.Quotient.mk (Ideal.span ({P} : Set (Polynomial ๐•œ))) Q') : Q = Q' := by classical have hmem : Q - Q' โˆˆ Ideal.span ({P} : Set (Polynomial ๐•œ)) := (Ideal.Quotient.eq).1 h have hdvd : P โˆฃ Q - Q' := (Ideal.mem_span_singleton).1 hmem by_contra hne have hneq0 : Q - Q' โ‰  0 := sub_ne_zero.2 hne have hdeg : (Q - Q').natDegree < P.natDegree := by have hle : (Q - Q').natDegree โ‰ค max Q.natDegree Q'.natDegree := Polynomial.natDegree_sub_le Q Q' have hmax : max Q.natDegree Q'.natDegree < P.natDegree := max_lt_iff.2 โŸจhQ, hQ'โŸฉ exact lt_of_le_of_lt hle hmax exact (Polynomial.not_dvd_of_natDegree_lt (p := P) hneq0 hdeg) hdvd

Proposition 2.4. Assume Unknown identifier `๐•œ`๐•œ is a field and are irreducible polynomials in failed to synthesize instance of type class GetElem Prop Prop ?m.3 Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`sorry[sorry] : ?m.3๐•œ[Unknown identifier `X`X]. Let be a ring isomorphism stabilizing Unknown identifier `๐•œ`๐•œ with respect to Unknown identifier `ฯƒ_f`ฯƒ_f.

  1. .

  2. There exists a unique polynomial Unknown identifier `Q_f`sorry โˆˆ sorry[sorry] : PropQ_f โˆˆ failed to synthesize instance of type class GetElem Prop Prop ?m.2 Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`๐•œ[Unknown identifier `X`X] with such that Unknown identifier `f`f is induced by a ring morphism stabilizing Unknown identifier `๐•œ`๐•œ with respect to Unknown identifier `ฯƒ_f`ฯƒ_f and given by , where Unknown identifier `ฯƒ_f`sorry ^ sorry : ?m.5ฯƒ_f^Unknown identifier `X`X is as in Proposition 2.3.

  3. for some polynomial Unknown identifier `S_f`S_f.

  4. If then Unknown identifier `P`sorry = sorry * sorry : PropP = Unknown identifier `R`R * Unknown identifier `Pโ‚`Pโ‚.

  5. The morphism Unknown identifier `f_X`f_X maps sorry ^ sorry : ?m.5(Unknown identifier `Pโ‚`Pโ‚^Unknown identifier `n`n) into sorry ^ sorry : ?m.5(Unknown identifier `Pโ‚‚`Pโ‚‚^Unknown identifier `n`n) and hence induces stabilizing Unknown identifier `๐•œ`๐•œ.

theorem proposition_2_4 (Pโ‚ Pโ‚‚ : Polynomial ๐•œ) (hPโ‚ : Irreducible Pโ‚) (hPโ‚‚ : Irreducible Pโ‚‚) (f : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) โ‰ƒ+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (B := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) f.toRingHom ฯƒ_f) : Pโ‚.natDegree = Pโ‚‚.natDegree โˆง (let ฯƒX := Classical.choose (ExistsUnique.exists (existsUnique_polynomialRingEquiv_stabilizesBaseFieldWith_fixing_X (๐•œ := ๐•œ) ฯƒ_f)) โˆƒ! Qf : Polynomial ๐•œ, Qf.natDegree < Pโ‚.natDegree โˆง โˆƒ fX : Polynomial ๐•œ โ†’+* Polynomial ๐•œ, fX Polynomial.X = Qf โˆง RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ) (B := Polynomial ๐•œ) fX ฯƒ_f โˆง (โˆ€ P : Polynomial ๐•œ, fX P = (ฯƒX P).comp Qf) โˆง (โˆƒ hIJ : (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))), Ideal.quotientMap (I := Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) fX hIJ = f.toRingHom) โˆง (โˆƒ Sf : Polynomial ๐•œ, (ฯƒX Pโ‚).comp Qf = Sf * Pโ‚‚) โˆง (โˆ€ P : Polynomial ๐•œ, (โˆƒ S : Polynomial ๐•œ, (ฯƒX P).comp Qf = S * Pโ‚‚) โ†’ โˆƒ R : Polynomial ๐•œ, P = R * Pโ‚) โˆง โˆ€ n : โ„•, โˆƒ hIJn : (Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))), RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (B := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) (Ideal.quotientMap (I := Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) fX hIJn) ฯƒ_f) := by classical have hdeg : Pโ‚.natDegree = Pโ‚‚.natDegree := prop2_4_natDegree_eq (๐•œ := ๐•œ) Pโ‚ Pโ‚‚ hPโ‚ hPโ‚‚ f ฯƒ_f hf refine โŸจhdeg, ?_โŸฉ -- Unfold the chosen lift `ฯƒ_f^X`. simp (config := { zeta := false }) only let ฯƒX := Classical.choose (ExistsUnique.exists (existsUnique_polynomialRingEquiv_stabilizesBaseFieldWith_fixing_X (๐•œ := ๐•œ) ฯƒ_f)) have hฯƒX : ฯƒX Polynomial.X = Polynomial.X โˆง RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ) (B := Polynomial ๐•œ) ฯƒX.toRingHom ฯƒ_f := Classical.choose_spec (ExistsUnique.exists (existsUnique_polynomialRingEquiv_stabilizesBaseFieldWith_fixing_X (๐•œ := ๐•œ) ฯƒ_f)) let mkโ‚ : Polynomial ๐•œ โ†’+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) := Ideal.Quotient.mk _ let mkโ‚‚ : Polynomial ๐•œ โ†’+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) := Ideal.Quotient.mk _ -- Choose `Qf` as the reduced representative of `f(Xโ‚)`. let z : Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)) := f (mkโ‚ Polynomial.X) have hPโ‚‚deg0 : Pโ‚‚.natDegree โ‰  0 := ne_of_gt (hPโ‚‚.natDegree_pos) rcases prop2_4_exists_reduced_poly_rep (๐•œ := ๐•œ) Pโ‚‚ hPโ‚‚deg0 z with โŸจQf, hQf_degโ‚‚, hQf_mkโŸฉ have hQf_degโ‚ : Qf.natDegree < Pโ‚.natDegree := by simpa [hdeg] using hQf_degโ‚‚ -- Define `fX(P) = (ฯƒX P).comp Qf`. let fX : Polynomial ๐•œ โ†’+* Polynomial ๐•œ := (Polynomial.compRingHom Qf).comp ฯƒX.toRingHom have hfX_def : โˆ€ P : Polynomial ๐•œ, fX P = (ฯƒX P).comp Qf := by intro P rfl have hfX_X : fX Polynomial.X = Qf := by -- `ฯƒX` fixes `X`, and `X.comp Qf = Qf`. simp [fX, hฯƒX.1] have hfX : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ) (B := Polynomial ๐•œ) fX ฯƒ_f := by intro a -- Constants are handled by the stabilization property of `ฯƒX`. have hCฯƒ : ฯƒX (Polynomial.C a) = Polynomial.C (ฯƒ_f a) := by simpa [Polynomial.algebraMap_eq] using (hฯƒX.2 a) simp [fX, hCฯƒ] -- Core identity: `f` agrees with the induced map from `fX` on polynomial representatives. have hmk : โˆ€ P : Polynomial ๐•œ, f (mkโ‚ P) = mkโ‚‚ (fX P) := by have hRingHom : f.toRingHom.comp mkโ‚ = mkโ‚‚.comp fX := by apply Polynomial.ringHom_ext ยท intro a -- Compare on constants using the stabilization of `f` and `ฯƒX`. have hfC : f (mkโ‚ (Polynomial.C a)) = algebraMap ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) (ฯƒ_f a) := by simpa [mkโ‚, Polynomial.algebraMap_eq, Ideal.Quotient.mk_algebraMap] using (hf a) have hCฯƒ : ฯƒX (Polynomial.C a) = Polynomial.C (ฯƒ_f a) := by simpa [Polynomial.algebraMap_eq] using (hฯƒX.2 a) have hfXC : fX (Polynomial.C a) = Polynomial.C (ฯƒ_f a) := by simp [hfX_def, hCฯƒ] have halg : algebraMap ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) (ฯƒ_f a) = mkโ‚‚ (Polynomial.C (ฯƒ_f a)) := by simpa [mkโ‚‚, Polynomial.algebraMap_eq] using (Ideal.Quotient.mk_algebraMap (Rโ‚ := ๐•œ) (A := Polynomial ๐•œ) (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) (ฯƒ_f a)).symm -- Finish by rewriting both sides through `algebraMap`. simp [RingHom.comp_apply, hfC, hfXC, halg] ยท -- Compare on `X` by definition of `Qf`. have : mkโ‚‚ Qf = f (mkโ‚ Polynomial.X) := by simpa [z] using hQf_mk simpa [RingHom.comp_apply, hfX_X] using this.symm intro P simpa [mkโ‚, mkโ‚‚] using congrArg (fun g : Polynomial ๐•œ โ†’+* _ => g P) hRingHom -- Show the ideal compatibility needed to form `quotientMap`. have hmkโ‚_Pโ‚ : mkโ‚ Pโ‚ = 0 := by refine (Ideal.Quotient.eq_zero_iff_mem).2 ?_ exact Ideal.subset_span (by simp) have hmkโ‚‚_fXPโ‚ : mkโ‚‚ (fX Pโ‚) = 0 := by calc mkโ‚‚ (fX Pโ‚) = f (mkโ‚ Pโ‚) := (hmk Pโ‚).symm _ = f 0 := by simp [hmkโ‚_Pโ‚] _ = 0 := by simp have hmemโ‚‚ : fX Pโ‚ โˆˆ (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) := (Ideal.Quotient.eq_zero_iff_mem).1 hmkโ‚‚_fXPโ‚ have hIJ : (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) := by -- Principal ideal: it suffices to check the generator. refine (Ideal.span_singleton_le_iff_mem (I := Ideal.comap fX (Ideal.span ({Pโ‚‚} : Set _))) (x := Pโ‚)).2 ?_ exact hmemโ‚‚ have hf_ind : Ideal.quotientMap (I := Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) fX hIJ = f.toRingHom := by apply RingHom.ext intro x refine Quotient.inductionOn x ?_ intro P -- Reduce to the defining equation on representatives. simpa [Ideal.quotientMap_mk, mkโ‚, mkโ‚‚] using (hmk P).symm -- Point (3): divisibility by `Pโ‚‚`. have hSf : โˆƒ Sf : Polynomial ๐•œ, (ฯƒX Pโ‚).comp Qf = Sf * Pโ‚‚ := by rcases (Ideal.mem_span_singleton).1 hmemโ‚‚ with โŸจSf, hSfโŸฉ refine โŸจSf, ?_โŸฉ have : (ฯƒX Pโ‚).comp Qf = Pโ‚‚ * Sf := by simpa [hfX_def Pโ‚, fX] using hSf simpa [mul_comm] using this -- Point (4): kernel characterization via injectivity of `f`. have hker : โˆ€ P : Polynomial ๐•œ, (โˆƒ S : Polynomial ๐•œ, (ฯƒX P).comp Qf = S * Pโ‚‚) โ†’ โˆƒ R : Polynomial ๐•œ, P = R * Pโ‚ := by intro P hdiv rcases hdiv with โŸจS, hSโŸฉ have hmkโ‚‚_zero : mkโ‚‚ (fX P) = 0 := by -- In the quotient by `(Pโ‚‚)`, multiples of `Pโ‚‚` are zero. apply (Ideal.Quotient.eq_zero_iff_mem).2 refine (Ideal.mem_span_singleton).2 ?_ refine โŸจS, ?_โŸฉ -- Convert `S * Pโ‚‚` into `Pโ‚‚ * S` for divisibility. simpa [hfX_def P, mul_comm, mul_left_comm, mul_assoc] using hS have hmkโ‚_zero : mkโ‚ P = 0 := by apply f.injective have hfP : f (mkโ‚ P) = 0 := by simpa [hmk P] using hmkโ‚‚_zero calc f (mkโ‚ P) = 0 := hfP _ = f 0 := by simp have hmemโ‚ : P โˆˆ (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) := (Ideal.Quotient.eq_zero_iff_mem).1 hmkโ‚_zero rcases (Ideal.mem_span_singleton).1 hmemโ‚ with โŸจR, hRโŸฉ refine โŸจR, ?_โŸฉ -- Convert the divisibility statement into the desired multiplicative form. simpa [mul_comm] using hR -- Point (5): ideal power compatibility. have hpow : โˆ€ n : โ„•, โˆƒ hIJn : (Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))), RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (B := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) (Ideal.quotientMap (I := Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) fX hIJn) ฯƒ_f := by intro n rcases hSf with โŸจSf, hSfโŸฉ have hmem_pow : fX (Pโ‚ ^ n) โˆˆ (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) := by -- `fX(Pโ‚^n) = (Sf*Pโ‚‚)^n = Sf^n * Pโ‚‚^n`. refine (Ideal.mem_span_singleton).2 ?_ refine โŸจSf ^ n, ?_โŸฉ calc fX (Pโ‚ ^ n) = (fX Pโ‚) ^ n := by simp [map_pow] _ = ((ฯƒX Pโ‚).comp Qf) ^ n := by simp [hfX_def Pโ‚] _ = (Sf * Pโ‚‚) ^ n := by simp [hSf] _ = (Sf ^ n) * (Pโ‚‚ ^ n) := by simp [mul_pow] _ = (Pโ‚‚ ^ n) * (Sf ^ n) := by simp [mul_comm] have hIJn : (Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) := by refine (Ideal.span_singleton_le_iff_mem (I := Ideal.comap fX (Ideal.span ({Pโ‚‚ ^ n} : Set _))) (x := Pโ‚ ^ n)).2 ?_ exact hmem_pow refine โŸจhIJn, ?_โŸฉ intro a -- Stabilization is inherited from `fX`. simpa [RingHom.StabilizesBaseFieldWith, Ideal.quotientMap_mk, Ideal.Quotient.mk_algebraMap] using congrArg (Ideal.Quotient.mk (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ)))) (hfX a) -- Assemble existence. refine โŸจQf, โŸจhQf_degโ‚, ?_โŸฉ, ?_โŸฉ ยท refine โŸจfX, โŸจhfX_X, hfX, hfX_def, ?_, hSf, hker, ?_โŸฉโŸฉ ยท refine โŸจhIJ, ?_โŸฉ exact hf_ind ยท intro n simpa using (hpow n) -- Uniqueness of `Qf`: any solution must represent `f(Xโ‚)` and satisfy the degree bound. intro Qg hQg rcases hQg with โŸจhQg_degโ‚, fXg, hfXg_X, hfXg, hfXg_def, hrestโŸฉ rcases hrest with โŸจhIJg, hrestโŸฉ rcases hIJg with โŸจhIJg, hf_indgโŸฉ -- Evaluate the induced equality on `X`. have hmkQg : mkโ‚‚ Qg = f (mkโ‚ Polynomial.X) := by have hq : Ideal.quotientMap (I := Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) fXg hIJg (mkโ‚ Polynomial.X) = f.toRingHom (mkโ‚ Polynomial.X) := by simpa using congrArg (fun g => g (mkโ‚ Polynomial.X)) hf_indg simpa [Ideal.quotientMap_mk, mkโ‚, mkโ‚‚, hfXg_X] using hq have hmkQf : mkโ‚‚ Qf = f (mkโ‚ Polynomial.X) := by simpa [z] using hQf_mk have hmk_eq : mkโ‚‚ Qf = mkโ‚‚ Qg := by simp [hmkQf, hmkQg] have hQg_degโ‚‚ : Qg.natDegree < Pโ‚‚.natDegree := by simpa [hdeg] using hQg_degโ‚ -- Apply uniqueness of reduced representatives modulo `Pโ‚‚`. have : Qf = Qg := prop2_4_unique_reduced_poly_rep (๐•œ := ๐•œ) (P := Pโ‚‚) hQf_degโ‚‚ hQg_degโ‚‚ (by simpa [mkโ‚‚] using hmk_eq) simp [this]

If Unknown identifier `Pโ‚‚`sorry โˆฃ sorry : PropPโ‚‚ โˆฃ Unknown identifier `fX`fX P, then Unknown identifier `Pโ‚`sorry โˆฃ sorry : PropPโ‚ โˆฃ Unknown identifier `P`P (using injectivity of the induced map on (Unknown identifier `Pโ‚`Pโ‚)-quotients).

lemma prop2_5_dvd_P1_of_dvd_P2_fX (Pโ‚ Pโ‚‚ : Polynomial ๐•œ) (f : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) โ‰ƒ+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (fX : Polynomial ๐•œ โ†’+* Polynomial ๐•œ) (hIJ : (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (hf_ind : Ideal.quotientMap (I := Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) fX hIJ = f.toRingHom) : โˆ€ P : Polynomial ๐•œ, Pโ‚‚ โˆฃ fX P โ†’ Pโ‚ โˆฃ P := by intro P hP classical let mkโ‚ : Polynomial ๐•œ โ†’+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) := Ideal.Quotient.mk _ let mkโ‚‚ : Polynomial ๐•œ โ†’+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) := Ideal.Quotient.mk _ have hmkโ‚‚ : mkโ‚‚ (fX P) = 0 := by refine (Ideal.Quotient.eq_zero_iff_mem).2 ?_ exact (Ideal.mem_span_singleton).2 hP have hEq : mkโ‚‚ (fX P) = f (mkโ‚ P) := by simpa [Ideal.quotientMap_mk, mkโ‚, mkโ‚‚] using congrArg (fun g => g (mkโ‚ P)) hf_ind have hmkโ‚ : mkโ‚ P = 0 := by apply f.injective have : f (mkโ‚ P) = f 0 := by simpa [hEq] using hmkโ‚‚ simpa using this have hmem : P โˆˆ (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) := by exact (Ideal.Quotient.eq_zero_iff_mem).1 hmkโ‚ exact (Ideal.mem_span_singleton).1 hmem

If Unknown identifier `S_f`S_f is coprime to Unknown identifier `Pโ‚‚`Pโ‚‚, then divisibility of by Unknown identifier `Pโ‚‚`sorry ^ sorry : ?m.5Pโ‚‚^Unknown identifier `k`k forces divisibility of Unknown identifier `P`P by Unknown identifier `Pโ‚`sorry ^ sorry : ?m.5Pโ‚^Unknown identifier `k`k.

lemma prop2_5_pow_dvd_P1_of_pow_dvd_P2_fX (Pโ‚ Pโ‚‚ : Polynomial ๐•œ) (hPโ‚‚ : Irreducible Pโ‚‚) (f : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) โ‰ƒ+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (fX : Polynomial ๐•œ โ†’+* Polynomial ๐•œ) (hIJ : (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (hf_ind : Ideal.quotientMap (I := Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) fX hIJ = f.toRingHom) (Sf : Polynomial ๐•œ) (hSf : fX Pโ‚ = Sf * Pโ‚‚) : IsCoprime Sf Pโ‚‚ โ†’ โˆ€ k : โ„•, โˆ€ P : Polynomial ๐•œ, (Pโ‚‚ ^ k โˆฃ fX P) โ†’ (Pโ‚ ^ k โˆฃ P) := by intro hcop refine Nat.rec ?_ ?_ ยท intro P _; simp ยท intro k IH P hdiv have hPโ‚‚0 : Pโ‚‚ โ‰  0 := hPโ‚‚.ne_zero have hPโ‚‚_dvd : Pโ‚‚ โˆฃ fX P := by exact dvd_trans (dvd_pow_self Pโ‚‚ (Nat.succ_ne_zero k)) hdiv have hPโ‚_dvd : Pโ‚ โˆฃ P := prop2_5_dvd_P1_of_dvd_P2_fX (๐•œ := ๐•œ) Pโ‚ Pโ‚‚ f fX hIJ hf_ind P hPโ‚‚_dvd rcases hPโ‚_dvd with โŸจP', rflโŸฉ have hdiv' : Pโ‚‚ ^ (k + 1) โˆฃ fX Pโ‚ * fX P' := by simpa [map_mul] using hdiv have hdiv'' : Pโ‚‚ ^ k * Pโ‚‚ โˆฃ (Sf * fX P') * Pโ‚‚ := by simpa [pow_succ, hSf, mul_assoc, mul_left_comm, mul_comm] using hdiv' have hdivSf : Pโ‚‚ ^ k โˆฃ Sf * fX P' := by exact (mul_dvd_mul_iff_right hPโ‚‚0).1 hdiv'' have hcop' : IsCoprime (Pโ‚‚ ^ k) Sf := by exact (isCoprime_comm).1 (hcop.pow_right (n := k)) have hdivP' : Pโ‚‚ ^ k โˆฃ fX P' := by exact IsCoprime.dvd_of_dvd_mul_left hcop' hdivSf have hIH : Pโ‚ ^ k โˆฃ P' := IH P' hdivP' simpa [pow_succ, mul_assoc, mul_left_comm, mul_comm] using (mul_dvd_mul_left Pโ‚ hIH)

Injectivity of the induced map under the coprimality hypothesis.

lemma prop2_5_injective_quotientMap_pow (Pโ‚ Pโ‚‚ : Polynomial ๐•œ) (hPโ‚‚ : Irreducible Pโ‚‚) (f : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) โ‰ƒ+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (fX : Polynomial ๐•œ โ†’+* Polynomial ๐•œ) (hIJ : (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (hf_ind : Ideal.quotientMap (I := Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) fX hIJ = f.toRingHom) (Sf : Polynomial ๐•œ) (hSf : fX Pโ‚ = Sf * Pโ‚‚) (n : โ„•) (hIJn : (Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ)))) : IsCoprime Sf Pโ‚‚ โ†’ Function.Injective (Ideal.quotientMap (I := Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) fX hIJn) := by intro hcop classical intro x y hxy refine Quotient.inductionOnโ‚‚ x y ?_ hxy intro p q hxy apply (Ideal.Quotient.eq).2 have hEq : Ideal.Quotient.mk (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) (fX p) = Ideal.Quotient.mk (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) (fX q) := by simpa [Ideal.quotientMap_mk] using hxy have hmemโ‚‚ : fX p - fX q โˆˆ (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) := (Ideal.Quotient.eq).1 hEq have hdivโ‚‚ : Pโ‚‚ ^ n โˆฃ fX (p - q) := by simpa [map_sub] using (Ideal.mem_span_singleton).1 hmemโ‚‚ have hdivโ‚ : Pโ‚ ^ n โˆฃ p - q := prop2_5_pow_dvd_P1_of_pow_dvd_P2_fX (๐•œ := ๐•œ) Pโ‚ Pโ‚‚ hPโ‚‚ f fX hIJ hf_ind Sf hSf hcop n (p - q) hdivโ‚‚ exact (Ideal.mem_span_singleton).2 hdivโ‚

If Unknown identifier `S_f`S_f is coprime to Unknown identifier `Pโ‚‚`Pโ‚‚, then the induced map is an isomorphism.

lemma prop2_5_exists_ringEquiv_of_isCoprime (Pโ‚ Pโ‚‚ : Polynomial ๐•œ) (hPโ‚ : Irreducible Pโ‚) (hPโ‚‚ : Irreducible Pโ‚‚) (f : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) โ‰ƒ+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (ฯƒ_f : ๐•œ โ‰ƒ+* ๐•œ) (hf : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (B := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) f.toRingHom ฯƒ_f) (fX : Polynomial ๐•œ โ†’+* Polynomial ๐•œ) (hfX : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ) (B := Polynomial ๐•œ) fX ฯƒ_f) (hIJ : (Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ)))) (hf_ind : Ideal.quotientMap (I := Ideal.span ({Pโ‚} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚} : Set (Polynomial ๐•œ))) fX hIJ = f.toRingHom) (Sf : Polynomial ๐•œ) (hSf : fX Pโ‚ = Sf * Pโ‚‚) (n : โ„•) (hIJn : (Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) โ‰ค Ideal.comap fX (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ)))) : IsCoprime Sf Pโ‚‚ โ†’ โˆƒ e : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) โ‰ƒ+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))), e.toRingHom = Ideal.quotientMap (I := Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) fX hIJn := by intro hcop classical -- Finite-dimensionality of the quotients, by reducing to a monic associate. have hPโ‚0 : Pโ‚ โ‰  0 := hPโ‚.ne_zero have hPโ‚‚0 : Pโ‚‚ โ‰  0 := hPโ‚‚.ne_zero have hPโ‚n0 : Pโ‚ ^ n โ‰  0 := pow_ne_zero n hPโ‚0 have hPโ‚‚n0 : Pโ‚‚ ^ n โ‰  0 := pow_ne_zero n hPโ‚‚0 let Pโ‚m : Polynomial ๐•œ := (Pโ‚ ^ n) * Polynomial.C ((Pโ‚ ^ n).leadingCoeff)โปยน let Pโ‚‚m : Polynomial ๐•œ := (Pโ‚‚ ^ n) * Polynomial.C ((Pโ‚‚ ^ n).leadingCoeff)โปยน have hPโ‚m_monic : Pโ‚m.Monic := by simpa [Pโ‚m] using (Polynomial.monic_mul_leadingCoeff_inv (p := Pโ‚ ^ n) hPโ‚n0) have hPโ‚‚m_monic : Pโ‚‚m.Monic := by simpa [Pโ‚‚m] using (Polynomial.monic_mul_leadingCoeff_inv (p := Pโ‚‚ ^ n) hPโ‚‚n0) have hPโ‚m_isUnit : IsUnit (Polynomial.C ((Pโ‚ ^ n).leadingCoeff)โปยน) := by have hne : ((Pโ‚ ^ n).leadingCoeff)โปยน โ‰  0 := by exact inv_ne_zero (Polynomial.leadingCoeff_ne_zero.2 hPโ‚n0) exact (Polynomial.isUnit_C).2 ((isUnit_iff_ne_zero).2 hne) have hPโ‚‚m_isUnit : IsUnit (Polynomial.C ((Pโ‚‚ ^ n).leadingCoeff)โปยน) := by have hne : ((Pโ‚‚ ^ n).leadingCoeff)โปยน โ‰  0 := by exact inv_ne_zero (Polynomial.leadingCoeff_ne_zero.2 hPโ‚‚n0) exact (Polynomial.isUnit_C).2 ((isUnit_iff_ne_zero).2 hne) have hIโ‚ : (Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) = Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ)) := by have hassoc : Associated (Pโ‚ ^ n) Pโ‚m := by refine โŸจhPโ‚m_isUnit.unit, ?_โŸฉ simp [Pโ‚m] exact (Ideal.span_singleton_eq_span_singleton).2 hassoc have hIโ‚‚ : (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ)) : Ideal (Polynomial ๐•œ)) = Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ)) := by have hassoc : Associated (Pโ‚‚ ^ n) Pโ‚‚m := by refine โŸจhPโ‚‚m_isUnit.unit, ?_โŸฉ simp [Pโ‚‚m] exact (Ideal.span_singleton_eq_span_singleton).2 hassoc haveI : FiniteDimensional ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ))) := (Polynomial.Monic.finite_quotient (R := ๐•œ) (g := Pโ‚m) hPโ‚m_monic) haveI : FiniteDimensional ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ))) := (Polynomial.Monic.finite_quotient (R := ๐•œ) (g := Pโ‚‚m) hPโ‚‚m_monic) haveI : FiniteDimensional ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) := by let e : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ))) โ‰ƒโ‚[๐•œ] (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) := Ideal.quotientEquivAlgOfEq (Rโ‚ := ๐•œ) (A := Polynomial ๐•œ) (I := Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ))) (J := Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) hIโ‚.symm exact Module.Finite.equiv (R := ๐•œ) (M := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚m} : Set (Polynomial ๐•œ))) (N := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) e.toLinearEquiv haveI : FiniteDimensional ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) := by let e : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ))) โ‰ƒโ‚[๐•œ] (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) := Ideal.quotientEquivAlgOfEq (Rโ‚ := ๐•œ) (A := Polynomial ๐•œ) (I := Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ))) (J := Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) hIโ‚‚.symm exact Module.Finite.equiv (R := ๐•œ) (M := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚m} : Set (Polynomial ๐•œ))) (N := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) e.toLinearEquiv let fXn : (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) โ†’+* (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) := Ideal.quotientMap (I := Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) fX hIJn have hfXn : RingHom.StabilizesBaseFieldWith (๐•œ := ๐•œ) (A := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (B := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) fXn ฯƒ_f := by intro a simpa [RingHom.StabilizesBaseFieldWith, fXn, Ideal.quotientMap_mk, Ideal.Quotient.mk_algebraMap] using congrArg (Ideal.Quotient.mk (Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ)))) (hfX a) have hinj : Function.Injective fXn := by simpa [fXn] using prop2_5_injective_quotientMap_pow (๐•œ := ๐•œ) Pโ‚ Pโ‚‚ hPโ‚‚ f fX hIJ hf_ind Sf hSf n hIJn hcop have hdeg : Pโ‚.natDegree = Pโ‚‚.natDegree := prop2_4_natDegree_eq (๐•œ := ๐•œ) Pโ‚ Pโ‚‚ hPโ‚ hPโ‚‚ f ฯƒ_f hf have hfinrank : Module.finrank ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) = Module.finrank ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) := by calc Module.finrank ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) = (Pโ‚ ^ n).natDegree := by simp [finrank_quotient_span_eq_natDegree] _ = n * Pโ‚.natDegree := by simp [Polynomial.natDegree_pow] _ = n * Pโ‚‚.natDegree := by simp [hdeg] _ = (Pโ‚‚ ^ n).natDegree := by simp [Polynomial.natDegree_pow] _ = Module.finrank ๐•œ (Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) := by simp [finrank_quotient_span_eq_natDegree] rcases exists_ringEquiv_of_injective_of_finrank_eq (๐•œ := ๐•œ) (A := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚ ^ n} : Set (Polynomial ๐•œ))) (B := Polynomial ๐•œ โงธ Ideal.span ({Pโ‚‚ ^ n} : Set (Polynomial ๐•œ))) fXn ฯƒ_f hfXn hinj hfinrank with โŸจe, heโŸฉ refine โŸจe, ?_โŸฉ simpa [fXn] using he
end SomeLocalRings