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

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]

If Unknown identifier `p.comp`sorry = sorry * sorry : Propp.comp q = Unknown identifier `r`r * Unknown identifier `s`s, then every root of Unknown identifier `s`s maps to a root of Unknown identifier `p`p by evaluation of Unknown identifier `q`q.

This is the basic β€œroot mapping” step used in Proposition 2.6.

lemma isRoot_aeval_of_comp_eq_mul {K : Type*} [Field K] [Algebra π•œ K] {p q r s : Polynomial π•œ} (h : p.comp q = r * s) {Ξ± : K} (hs : (s.map (algebraMap π•œ K)).IsRoot Ξ±) : ((p.map (algebraMap π•œ K)).IsRoot ((Polynomial.aeval Ξ±) q)) := by have hs0 : (Polynomial.aeval Ξ±) s = 0 := by simpa [Polynomial.IsRoot, Polynomial.eval_map, Polynomial.aeval_def] using hs have h' : (Polynomial.aeval ((Polynomial.aeval Ξ±) q)) p = (Polynomial.aeval Ξ±) r * (Polynomial.aeval Ξ±) s := by simpa [Polynomial.aeval_comp, map_mul] using congrArg (fun t : Polynomial π•œ => (Polynomial.aeval Ξ±) t) h have hp0 : (Polynomial.aeval ((Polynomial.aeval Ξ±) q)) p = 0 := by simpa [hs0] using h'.trans rfl have hp0' : Polynomial.evalβ‚‚ (algebraMap π•œ K) ((Polynomial.aeval Ξ±) q) p = 0 := by simpa [Polynomial.aeval_def] using hp0 have hp0'' : Polynomial.eval ((Polynomial.aeval Ξ±) q) (p.map (algebraMap π•œ K)) = 0 := by simpa [Polynomial.eval_map] using hp0' simpa [Polynomial.IsRoot] using hp0''

failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1087693) 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) is finite-dimensional over Unknown identifier `π•œ`π•œ, using the monic associate of Unknown identifier `P`P.

This is a local helper for Proposition 2.6.

lemma finiteDimensional_quotient_span_of_ne_zero (P : Polynomial π•œ) (hP0 : P β‰  0) : FiniteDimensional π•œ (Polynomial π•œ β§Έ Ideal.span ({P} : Set (Polynomial π•œ))) := by classical let Pm : Polynomial π•œ := P * Polynomial.C (P.leadingCoeff)⁻¹ have hPm_monic : Pm.Monic := by simpa [Pm] using (Polynomial.monic_mul_leadingCoeff_inv (p := P) hP0) have hPm_isUnit : IsUnit (Polynomial.C (P.leadingCoeff)⁻¹) := by have hne : (P.leadingCoeff)⁻¹ β‰  0 := by exact inv_ne_zero (Polynomial.leadingCoeff_ne_zero.2 hP0) exact (Polynomial.isUnit_C).2 ((isUnit_iff_ne_zero).2 hne) have hI : (Ideal.span ({P} : Set (Polynomial π•œ)) : Ideal (Polynomial π•œ)) = Ideal.span ({Pm} : Set (Polynomial π•œ)) := by have hassoc : Associated P Pm := by refine ⟨hPm_isUnit.unit, ?_⟩ simp [Pm] exact (Ideal.span_singleton_eq_span_singleton).2 hassoc haveI : FiniteDimensional π•œ (Polynomial π•œ β§Έ Ideal.span ({Pm} : Set (Polynomial π•œ))) := (Polynomial.Monic.finite_quotient (R := π•œ) (g := Pm) hPm_monic) let e : (Polynomial π•œ β§Έ Ideal.span ({Pm} : Set (Polynomial π•œ))) ≃ₐ[π•œ] (Polynomial π•œ β§Έ Ideal.span ({P} : Set (Polynomial π•œ))) := Ideal.quotientEquivAlgOfEq (R₁ := π•œ) (A := Polynomial π•œ) (I := Ideal.span ({Pm} : Set (Polynomial π•œ))) (J := Ideal.span ({P} : Set (Polynomial π•œ))) hI.symm exact Module.Finite.equiv (R := π•œ) (M := Polynomial π•œ β§Έ Ideal.span ({Pm} : Set (Polynomial π•œ))) (N := Polynomial π•œ β§Έ Ideal.span ({P} : Set (Polynomial π•œ))) e.toLinearEquiv

Conversely, if is an isomorphism and Unknown identifier `n`sorry > 1 : Propn > 1, then Unknown identifier `S_f`S_f is coprime to Unknown identifier `Pβ‚‚`Pβ‚‚.

lemma prop2_5_coprime_of_exists_ringEquiv (P₁ Pβ‚‚ : Polynomial π•œ) (hP₁ : Irreducible P₁) (hPβ‚‚ : Irreducible Pβ‚‚) (fX : Polynomial π•œ β†’+* Polynomial π•œ) (Sf : Polynomial π•œ) (hSf : fX P₁ = Sf * Pβ‚‚) (n : β„•) (hn : 1 < n) (hIJn : (Ideal.span ({P₁ ^ n} : Set (Polynomial π•œ)) : Ideal (Polynomial π•œ)) ≀ Ideal.comap fX (Ideal.span ({Pβ‚‚ ^ n} : Set (Polynomial π•œ)))) : (βˆƒ 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) β†’ IsCoprime Sf Pβ‚‚ := by intro hexists classical rcases hexists with ⟨e, he⟩ 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 hinj : Function.Injective fXn := by have hxe : fXn = e.toRingHom := by simpa [fXn] using he.symm intro x y hxy apply e.injective have : e.toRingHom x = e.toRingHom y := by simpa [hxe] using hxy simpa using this by_contra hcop have hPβ‚‚_dvd : Pβ‚‚ ∣ Sf := by have hnot : Β¬ IsCoprime Pβ‚‚ Sf := by intro h' exact hcop ((isCoprime_comm).1 h') exact (hPβ‚‚.dvd_iff_not_isCoprime).2 hnot rcases hPβ‚‚_dvd with ⟨S0, rfl⟩ -- Construct a nonzero element in the kernel using the extra `Pβ‚‚`-divisibility of `fX(P₁)`. have hPβ‚‚sq : Pβ‚‚ ^ 2 ∣ fX P₁ := by refine ⟨S0, ?_⟩ simp [hSf, pow_two, mul_left_comm, mul_comm] have hle : n ≀ 2 * (n - 1) := by omega have hPβ‚‚n : Pβ‚‚ ^ n ∣ fX (P₁ ^ (n - 1)) := by have hpow : Pβ‚‚ ^ (2 * (n - 1)) ∣ fX (P₁ ^ (n - 1)) := by have hpow' : (Pβ‚‚ ^ 2) ^ (n - 1) ∣ (fX P₁) ^ (n - 1) := pow_dvd_pow_of_dvd hPβ‚‚sq (n - 1) simpa [pow_mul, map_pow] using hpow' exact dvd_trans (pow_dvd_pow Pβ‚‚ hle) hpow have hker : fXn (Ideal.Quotient.mk (Ideal.span ({P₁ ^ n} : Set (Polynomial π•œ))) (P₁ ^ (n - 1))) = 0 := by have hmem : fX (P₁ ^ (n - 1)) ∈ (Ideal.span ({Pβ‚‚ ^ n} : Set (Polynomial π•œ)) : Ideal (Polynomial π•œ)) := (Ideal.mem_span_singleton).2 hPβ‚‚n -- Reduce to ideal membership. have : Ideal.Quotient.mk (Ideal.span ({Pβ‚‚ ^ n} : Set (Polynomial π•œ))) (fX (P₁ ^ (n - 1))) = 0 := (Ideal.Quotient.eq_zero_iff_mem).2 hmem have hf : fXn (Ideal.Quotient.mk (Ideal.span ({P₁ ^ n} : Set (Polynomial π•œ))) (P₁ ^ (n - 1))) = Ideal.Quotient.mk (Ideal.span ({Pβ‚‚ ^ n} : Set (Polynomial π•œ))) (fX (P₁ ^ (n - 1))) := by simp [fXn] exact hf.trans this have hnonzero : Ideal.Quotient.mk (Ideal.span ({P₁ ^ n} : Set (Polynomial π•œ))) (P₁ ^ (n - 1)) β‰  0 := by intro hz have hmem : P₁ ^ (n - 1) ∈ (Ideal.span ({P₁ ^ n} : Set (Polynomial π•œ)) : Ideal (Polynomial π•œ)) := (Ideal.Quotient.eq_zero_iff_mem).1 hz have hdvd : P₁ ^ n ∣ P₁ ^ (n - 1) := (Ideal.mem_span_singleton).1 hmem have hne : Β¬ n ≀ n - 1 := by omega have : n ≀ n - 1 := (pow_dvd_pow_iff hP₁.ne_zero hP₁.not_isUnit).1 hdvd exact hne this have : Ideal.Quotient.mk (Ideal.span ({P₁ ^ n} : Set (Polynomial π•œ))) (P₁ ^ (n - 1)) = 0 := by have hx : fXn (Ideal.Quotient.mk (Ideal.span ({P₁ ^ n} : Set (Polynomial π•œ))) (P₁ ^ (n - 1))) = fXn 0 := by calc fXn (Ideal.Quotient.mk (Ideal.span ({P₁ ^ n} : Set (Polynomial π•œ))) (P₁ ^ (n - 1))) = 0 := hker _ = fXn 0 := by simp exact hinj hx exact hnonzero this

Proposition 2.5. 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 `π•œ`π•œ, and let Unknown identifier `S_f`S_f and be as in Proposition 2.4. For Unknown identifier `n`sorry > 1 : Propn > 1, Unknown identifier `S_f`S_f is prime to Unknown identifier `Pβ‚‚`Pβ‚‚ if and only if is an isomorphism.

theorem proposition_2_5 (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) (ΟƒX : Polynomial π•œ ≃+* Polynomial π•œ) (hΟƒX : ΟƒX Polynomial.X = Polynomial.X ∧ RingHom.StabilizesBaseFieldWith (π•œ := π•œ) (A := Polynomial π•œ) (B := Polynomial π•œ) ΟƒX.toRingHom Οƒ_f) (Qf : Polynomial π•œ) (hQf : Qf.natDegree < P₁.natDegree ∧ 1 ≀ Qf.natDegree) (fX : Polynomial π•œ β†’+* Polynomial π•œ) (hfX_X : fX Polynomial.X = Qf) (hfX : RingHom.StabilizesBaseFieldWith (π•œ := π•œ) (A := Polynomial π•œ) (B := Polynomial π•œ) fX Οƒ_f) (hfX_def : βˆ€ P : Polynomial π•œ, fX P = (ΟƒX P).comp Qf) (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 : (ΟƒX P₁).comp Qf = Sf * Pβ‚‚) (n : β„•) (hn : 1 < 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 have _ := hΟƒX have _ := hQf have _ := hfX_X constructor Β· intro hcop have hfXP₁ : fX P₁ = Sf * Pβ‚‚ := by calc fX P₁ = (ΟƒX P₁).comp Qf := hfX_def P₁ _ = Sf * Pβ‚‚ := by simpa [mul_comm] using hSf exact prop2_5_exists_ringEquiv_of_isCoprime (π•œ := π•œ) P₁ Pβ‚‚ hP₁ hPβ‚‚ f Οƒ_f hf fX hfX hIJ hf_ind Sf hfXP₁ n hIJn hcop Β· intro hexists have hfXP₁ : fX P₁ = Sf * Pβ‚‚ := by calc fX P₁ = (ΟƒX P₁).comp Qf := hfX_def P₁ _ = Sf * Pβ‚‚ := by simpa [mul_comm] using hSf exact prop2_5_coprime_of_exists_ringEquiv (π•œ := π•œ) P₁ Pβ‚‚ hP₁ hPβ‚‚ fX Sf hfXP₁ n hn hIJn hexists

Proposition 2.6. 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 `π•œ`π•œ, and let Unknown identifier `Οƒ_f`sorry ^ sorry : ?m.5Οƒ_f^Unknown identifier `X`X and Unknown identifier `Q_f`Q_f be as in Proposition 2.4.

  1. If Unknown identifier `Ξ±`Ξ± is a root of Unknown identifier `Pβ‚‚`Pβ‚‚, then is a root of .

  2. The map gives a bijection between the roots of Unknown identifier `Pβ‚‚`Pβ‚‚ and the roots of .

theorem proposition_2_6 (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) (ΟƒX : Polynomial π•œ ≃+* Polynomial π•œ) (hΟƒX : ΟƒX Polynomial.X = Polynomial.X ∧ RingHom.StabilizesBaseFieldWith (π•œ := π•œ) (A := Polynomial π•œ) (B := Polynomial π•œ) ΟƒX.toRingHom Οƒ_f) (Qf Sf : Polynomial π•œ) (hSf : (ΟƒX P₁).comp Qf = Sf * Pβ‚‚) : (βˆ€ {K : Type*} [Field K] [Algebra π•œ K] {Ξ± : K}, (Pβ‚‚.map (algebraMap π•œ K)).IsRoot Ξ± β†’ ((ΟƒX P₁).map (algebraMap π•œ K)).IsRoot ((Polynomial.aeval Ξ±) Qf)) ∧ βˆƒ e : {Ξ± : AlgebraicClosure π•œ // (Pβ‚‚.map (algebraMap π•œ (AlgebraicClosure π•œ))).IsRoot Ξ±} ≃ {Ξ² : AlgebraicClosure π•œ // ((ΟƒX P₁).map (algebraMap π•œ (AlgebraicClosure π•œ))).IsRoot Ξ²}, βˆ€ a, (e a).1 = ((Polynomial.aeval a.1) Qf) := by classical refine ⟨?_, ?_⟩ Β· intro K _ _ Ξ± hΞ± exact isRoot_aeval_of_comp_eq_mul (π•œ := π•œ) (p := ΟƒX P₁) (q := Qf) (r := Sf) (s := Pβ‚‚) hSf hΞ± Β· classical -- Work with the quotient rings `π•œ[X]/(ΟƒX P₁)` -- and `π•œ[X]/(Pβ‚‚)` and the substitution map `X ↦ Qf`. let I1 : Ideal (Polynomial π•œ) := Ideal.span ({ΟƒX P₁} : Set (Polynomial π•œ)) let I2 : Ideal (Polynomial π•œ) := Ideal.span ({Pβ‚‚} : Set (Polynomial π•œ)) let compQ : Polynomial π•œ β†’+* Polynomial π•œ := Polynomial.compRingHom Qf have hIJ : (I1 : Ideal (Polynomial π•œ)) ≀ Ideal.comap compQ I2 := by refine (Ideal.span_singleton_le_iff_mem (I := Ideal.comap compQ I2) (x := ΟƒX P₁)).2 ?_ refine (Ideal.mem_span_singleton).2 ?_ refine ⟨Sf, ?_⟩ simpa [I1, I2, compQ, mul_comm] using hSf have hP₁σ : Irreducible (ΟƒX P₁) := hP₁.map ΟƒX haveI : I1.IsMaximal := by letI : Fact (Irreducible (ΟƒX P₁)) := ⟨hPβ‚ΟƒβŸ© simpa [I1] using (AdjoinRoot.span_maximal_of_irreducible (K := π•œ) (f := ΟƒX P₁)) haveI : I2.IsMaximal := by letI : Fact (Irreducible Pβ‚‚) := ⟨hPβ‚‚βŸ© simpa [I2] using (AdjoinRoot.span_maximal_of_irreducible (K := π•œ) (f := Pβ‚‚)) -- Use the induced field structures on the quotient rings. letI : Field (Polynomial π•œ β§Έ I1) := Ideal.Quotient.field (I := I1) letI : Field (Polynomial π•œ β§Έ I2) := Ideal.Quotient.field (I := I2) let mk₁ : Polynomial π•œ β†’+* (Polynomial π•œ β§Έ I1) := Ideal.Quotient.mk I1 let mkβ‚‚ : Polynomial π•œ β†’+* (Polynomial π•œ β§Έ I2) := Ideal.Quotient.mk I2 let ψ : (Polynomial π•œ β§Έ I1) β†’+* (Polynomial π•œ β§Έ I2) := Ideal.quotientMap (I := I1) I2 compQ hIJ have hψ : RingHom.StabilizesBaseFieldWith (π•œ := π•œ) (A := Polynomial π•œ β§Έ I1) (B := Polynomial π•œ β§Έ I2) ψ (RingEquiv.refl π•œ) := by intro a -- `ψ` fixes constants since `compQ` does. have hmk₁ : mk₁ (Polynomial.C a) = algebraMap π•œ (Polynomial π•œ β§Έ I1) a := by simpa [mk₁, Polynomial.algebraMap_eq] using (Ideal.Quotient.mk_algebraMap (R₁ := π•œ) (A := Polynomial π•œ) (I := I1) a) have hmkβ‚‚ : mkβ‚‚ (Polynomial.C a) = algebraMap π•œ (Polynomial π•œ β§Έ I2) a := by simpa [mkβ‚‚, Polynomial.algebraMap_eq] using (Ideal.Quotient.mk_algebraMap (R₁ := π•œ) (A := Polynomial π•œ) (I := I2) a) have hcalc : ψ (mk₁ (Polynomial.C a)) = mkβ‚‚ (Polynomial.C a) := by have : ψ (mk₁ (Polynomial.C a)) = mkβ‚‚ (compQ (Polynomial.C a)) := by simp [ψ, mk₁, mkβ‚‚] simpa [compQ] using this -- Translate back to the `algebraMap` form. simpa [RingHom.StabilizesBaseFieldWith, hmk₁, hmkβ‚‚] using hcalc have hinj : Function.Injective ψ := by exact RingHom.injective ψ haveI : FiniteDimensional π•œ (Polynomial π•œ β§Έ I1) := by simpa [I1] using (finiteDimensional_quotient_span_of_ne_zero (π•œ := π•œ) (P := ΟƒX P₁) hP₁σ.ne_zero) haveI : FiniteDimensional π•œ (Polynomial π•œ β§Έ I2) := by simpa [I2] using (finiteDimensional_quotient_span_of_ne_zero (π•œ := π•œ) (P := Pβ‚‚) hPβ‚‚.ne_zero) have hΟƒX_eq : ΟƒX = Polynomial.mapEquiv Οƒ_f := polynomialRingEquiv_eq_mapEquiv_of_fix_X_of_stabilizesBaseFieldWith (π•œ := π•œ) Οƒ_f ΟƒX hΟƒX.1 hΟƒX.2 have hdeg₁₂ : P₁.natDegree = Pβ‚‚.natDegree := prop2_4_natDegree_eq (π•œ := π•œ) P₁ Pβ‚‚ hP₁ hPβ‚‚ f Οƒ_f hf have hdegΟƒ : (ΟƒX P₁).natDegree = P₁.natDegree := by simp [hΟƒX_eq, Polynomial.mapEquiv_apply] have hfinrank : Module.finrank π•œ (Polynomial π•œ β§Έ I1) = Module.finrank π•œ (Polynomial π•œ β§Έ I2) := by have hdeg : (ΟƒX P₁).natDegree = Pβ‚‚.natDegree := hdegΟƒ.trans hdeg₁₂ simp [I1, I2, finrank_quotient_span_eq_natDegree, hdeg] rcases exists_ringEquiv_of_injective_of_finrank_eq (π•œ := π•œ) (A := Polynomial π•œ β§Έ I1) (B := Polynomial π•œ β§Έ I2) ψ (RingEquiv.refl π•œ) hψ hinj hfinrank with ⟨eQ, heQ⟩ -- Choose a polynomial representative for the inverse image of `X`. rcases Ideal.Quotient.mk_surjective (I := I1) (eQ.symm (mkβ‚‚ Polynomial.X)) with ⟨R, hR⟩ have heQ_mk (P : Polynomial π•œ) : eQ (mk₁ P) = mkβ‚‚ (P.comp Qf) := by have : eQ.toRingHom (mk₁ P) = ψ (mk₁ P) := by simpa using congrArg (fun g => g (mk₁ P)) heQ simpa [ψ, mk₁, mkβ‚‚, compQ] using this have hsymm_mk (P : Polynomial π•œ) : eQ.symm (mkβ‚‚ P) = mk₁ (P.comp R) := by have hconst : βˆ€ a : π•œ, eQ.symm (mkβ‚‚ (Polynomial.C a)) = mk₁ (Polynomial.C a) := by intro a have hx : eQ (mk₁ (Polynomial.C a)) = mkβ‚‚ (Polynomial.C a) := by simpa using heQ_mk (P := Polynomial.C a) have hx' := congrArg (fun x => eQ.symm x) hx simpa using hx'.symm have hX : eQ.symm (mkβ‚‚ Polynomial.X) = mk₁ R := by simpa [mk₁, mkβ‚‚] using hR.symm have hRingHom : eQ.symm.toRingHom.comp mkβ‚‚ = (mk₁.comp (Polynomial.compRingHom R)) := by apply Polynomial.ringHom_ext Β· intro a simpa [RingHom.comp_apply] using hconst a Β· simpa [RingHom.comp_apply] using hX have := congrArg (fun g : Polynomial π•œ β†’+* (Polynomial π•œ β§Έ I1) => g P) hRingHom simpa [RingHom.comp_apply, mk₁, mkβ‚‚, Polynomial.compRingHom] using this -- Polynomial congruences expressing that `Qf` and `R` are inverses modulo `(Pβ‚‚)` and `(ΟƒX P₁)`. have hRcomp_mk : mkβ‚‚ (R.comp Qf) = mkβ‚‚ Polynomial.X := by have : eQ (mk₁ R) = mkβ‚‚ Polynomial.X := by simpa using congrArg (fun x => eQ x) hR simpa [heQ_mk (P := R)] using this rcases (Ideal.mem_span_singleton).1 ((Ideal.Quotient.eq).1 hRcomp_mk) with ⟨Sβ‚‚, hSβ‚‚βŸ© have hRcomp : R.comp Qf = Polynomial.X + Pβ‚‚ * Sβ‚‚ := eq_add_of_sub_eq' hSβ‚‚ have hQfcomp_mk : mk₁ (Qf.comp R) = mk₁ Polynomial.X := by have hmkX : eQ (mk₁ Polynomial.X) = mkβ‚‚ Qf := by simpa [hΟƒX.1] using heQ_mk (P := Polynomial.X) have hmkX' := congrArg (fun x => eQ.symm x) hmkX have htmp : mk₁ Polynomial.X = mk₁ (Qf.comp R) := by simpa [hsymm_mk (P := Qf)] using hmkX' exact htmp.symm rcases (Ideal.mem_span_singleton).1 ((Ideal.Quotient.eq).1 hQfcomp_mk) with ⟨S₁, hSβ‚βŸ© have hQfcomp : Qf.comp R = Polynomial.X + (ΟƒX P₁) * S₁ := eq_add_of_sub_eq' hS₁ have hPβ‚‚comp : βˆƒ T : Polynomial π•œ, Pβ‚‚.comp R = T * (ΟƒX P₁) := by have hmk0 : mk₁ (Pβ‚‚.comp R) = 0 := by have hmkβ‚‚0 : mkβ‚‚ Pβ‚‚ = 0 := by apply (Ideal.Quotient.eq_zero_iff_mem).2 try 'simp' instead of 'simpa' Note: This linter can be disabled with `set_option linter.unnecessarySimpa false`simpa [I2] using (Ideal.subset_span (by 'simp' tactic does nothing Note: This linter can be disabled with `set_option linter.unusedTactic false`this tactic is never executed Note: This linter can be disabled with `set_option linter.unreachableTactic false`simp : Pβ‚‚ ∈ ({Pβ‚‚} : Set (Polynomial π•œ)))) have : eQ.symm (mkβ‚‚ Pβ‚‚) = mk₁ (Pβ‚‚.comp R) := by simpa using hsymm_mk (P := Pβ‚‚) simpa [hmkβ‚‚0] using this.symm have hmem : Pβ‚‚.comp R ∈ (I1 : Ideal (Polynomial π•œ)) := (Ideal.Quotient.eq_zero_iff_mem).1 hmk0 rcases (Ideal.mem_span_singleton).1 hmem with ⟨T, hT⟩ refine ⟨T, ?_⟩ simpa [I1, mul_comm, mul_left_comm, mul_assoc] using hT let g : {Ξ± : AlgebraicClosure π•œ // (Pβ‚‚.map (algebraMap π•œ (AlgebraicClosure π•œ))).IsRoot Ξ±} β†’ {Ξ² : AlgebraicClosure π•œ // ((ΟƒX P₁).map (algebraMap π•œ (AlgebraicClosure π•œ))).IsRoot Ξ²} := fun a => ⟨(Polynomial.aeval a.1) Qf, isRoot_aeval_of_comp_eq_mul (π•œ := π•œ) (p := ΟƒX P₁) (q := Qf) (r := Sf) (s := Pβ‚‚) hSf (K := AlgebraicClosure π•œ) (Ξ± := a.1) a.2⟩ let h : {Ξ² : AlgebraicClosure π•œ // ((ΟƒX P₁).map (algebraMap π•œ (AlgebraicClosure π•œ))).IsRoot Ξ²} β†’ {Ξ± : AlgebraicClosure π•œ // (Pβ‚‚.map (algebraMap π•œ (AlgebraicClosure π•œ))).IsRoot Ξ±} := fun b => ⟨(Polynomial.aeval b.1) R, by rcases hPβ‚‚comp with ⟨T, hT⟩ simpa [mul_assoc] using (isRoot_aeval_of_comp_eq_mul (π•œ := π•œ) (p := Pβ‚‚) (q := R) (r := T) (s := ΟƒX P₁) hT (K := AlgebraicClosure π•œ) (Ξ± := b.1) b.2)⟩ have h_left : Function.LeftInverse h g := by intro a ext have hPβ‚‚a : (Polynomial.aeval a.1) Pβ‚‚ = 0 := by simpa [Polynomial.IsRoot, Polynomial.eval_map, Polynomial.aeval_def] using a.2 have hEval : (Polynomial.aeval a.1) (R.comp Qf) = a.1 := by simp [hRcomp, hPβ‚‚a, map_add, map_mul] have : (Polynomial.aeval ((Polynomial.aeval a.1) Qf)) R = a.1 := by simpa [Polynomial.aeval_comp] using hEval simpa [g, h] using this have h_right : Function.RightInverse h g := by intro b ext have hΟƒa : (Polynomial.aeval b.1) (ΟƒX P₁) = 0 := by simpa [Polynomial.IsRoot, Polynomial.eval_map, Polynomial.aeval_def] using b.2 have hEval : (Polynomial.aeval b.1) (Qf.comp R) = b.1 := by simp [hQfcomp, hΟƒa, map_add, map_mul] have : (Polynomial.aeval ((Polynomial.aeval b.1) R)) Qf = b.1 := by simpa [Polynomial.aeval_comp] using hEval simpa [g, h] using this refine ⟨Equiv.mk g h h_left h_right, ?_⟩ intro a rfl

Root multiplicity for a composition over an algebraically closed field.

If Unknown identifier `b`sorry = sorry : Propb = Unknown identifier `q.eval`q.eval a, then the multiplicity of Unknown identifier `a`a as a root of Unknown identifier `p.comp`p.comp q is the multiplicity of Unknown identifier `b`b as a root of Unknown identifier `p`p, times the multiplicity of Unknown identifier `a`a as a root of Unknown identifier `q`sorry - sorry : ?m.5q - Unknown identifier `C`C b.

lemma rootMultiplicity_comp_eq_mul {K : Type*} [Field K] [IsAlgClosed K] (p q : Polynomial K) (a : K) (hp : p β‰  0) : Polynomial.rootMultiplicity a (p.comp q) = Polynomial.rootMultiplicity (Polynomial.eval a q) p * Polynomial.rootMultiplicity a (q - Polynomial.C (Polynomial.eval a q)) := by classical by_cases hq0 : q = Polynomial.C (Polynomial.eval a q) Β· -- Here `q` is constant, so `p.comp q` is constant and the inner factor is zero. rw [hq0] simp [Polynomial.comp_C] Β· set b : K := Polynomial.eval a q have hq : q β‰  Polynomial.C b := by simpa [b] using hq0 have hq_sub_ne_zero : βˆ€ c : K, q - Polynomial.C c β‰  0 := by intro c hc have hqc : q = Polynomial.C c := sub_eq_zero.mp hc have hb : b = c := by -- Evaluate at `a` to compare constants. simp [b, hqc] exact hq (by simp [hqc, hb] : q = Polynomial.C b) have h0not : (0 : Polynomial K) βˆ‰ p.roots.map (fun c : K => q - Polynomial.C c) := by intro hmem rcases (Multiset.mem_map.1 hmem) with ⟨c, hc, hc0⟩ exact hq_sub_ne_zero c (by simpa using hc0) have hprod_ne_zero : (p.roots.map (fun c : K => q - Polynomial.C c)).prod β‰  0 := Multiset.prod_ne_zero h0not have hleading : p.leadingCoeff β‰  0 := Polynomial.leadingCoeff_ne_zero.2 hp have hC_ne : (Polynomial.C p.leadingCoeff : Polynomial K) β‰  0 := by simpa [Polynomial.C_eq_zero] using hleading have hroots : p.roots.card = p.natDegree := IsAlgClosed.card_roots_eq_natDegree (p := p) have hp_fac : Polynomial.C p.leadingCoeff * (p.roots.map fun c : K => Polynomial.X - Polynomial.C c).prod = p := Polynomial.C_leadingCoeff_mul_prod_multiset_X_sub_C (p := p) hroots have hcomp : p.comp q = Polynomial.C p.leadingCoeff * (p.roots.map fun c : K => q - Polynomial.C c).prod := by -- Compose the factorization of `p` with `q`. calc p.comp q = q.compRingHom p := rfl _ = q.compRingHom (Polynomial.C p.leadingCoeff * (p.roots.map fun c : K => Polynomial.X - Polynomial.C c).prod) := by simp [hp_fac] _ = Polynomial.C p.leadingCoeff * (p.roots.map fun c : K => q - Polynomial.C c).prod := by simp [map_mul, map_multiset_prod, Polynomial.compRingHom] have hmul_ne : (Polynomial.C p.leadingCoeff * (p.roots.map fun c : K => q - Polynomial.C c).prod) β‰  0 := mul_ne_zero hC_ne hprod_ne_zero have hrootC : Polynomial.rootMultiplicity a (Polynomial.C p.leadingCoeff : Polynomial K) = 0 := by refine Polynomial.rootMultiplicity_eq_zero ?_ intro hroot have : Polynomial.eval a (Polynomial.C p.leadingCoeff : Polynomial K) = 0 := by simpa [Polynomial.IsRoot] using hroot rw [Polynomial.eval_C] at this exact hleading this have hRM_prod : Polynomial.rootMultiplicity a (p.roots.map fun c : K => q - Polynomial.C c).prod = Multiset.count b p.roots * Polynomial.rootMultiplicity a (q - Polynomial.C b) := by -- Induct on the multiset `p.roots`. induction p.roots using Multiset.induction_on with | empty => simp [b] | cons c s ih => have h0not_s : (0 : Polynomial K) βˆ‰ s.map (fun c : K => q - Polynomial.C c) := by intro hmem rcases (Multiset.mem_map.1 hmem) with ⟨c', hc', hc0⟩ exact hq_sub_ne_zero c' (by simpa using hc0) have hprod_s : (s.map (fun c : K => q - Polynomial.C c)).prod β‰  0 := Multiset.prod_ne_zero h0not_s have hmul : (q - Polynomial.C c) * (s.map (fun c : K => q - Polynomial.C c)).prod β‰  0 := mul_ne_zero (hq_sub_ne_zero c) hprod_s by_cases hcb : c = b Β· subst hcb have hRM_mul := (Polynomial.rootMultiplicity_mul (x := a) (p := q - Polynomial.C b) (q := (s.map (fun c : K => q - Polynomial.C c)).prod) (hpq := hmul)) -- Only the head factor contributes at `b`. have hcount : Multiset.count b (b ::β‚˜ s) = Multiset.count b s + 1 := by simp -- Rearrange. calc Polynomial.rootMultiplicity a ((b ::β‚˜ s).map (fun c : K => q - Polynomial.C c)).prod = Polynomial.rootMultiplicity a ((q - Polynomial.C b) * (s.map (fun c : K => q - Polynomial.C c)).prod) := by simp _ = Polynomial.rootMultiplicity a (q - Polynomial.C b) + Polynomial.rootMultiplicity a (s.map (fun c : K => q - Polynomial.C c)).prod := by simpa using hRM_mul _ = (Multiset.count b s + 1) * Polynomial.rootMultiplicity a (q - Polynomial.C b) := by -- Use the induction hypothesis and arithmetic. -- `m + n*m = (n+1)*m`. simp [ih, Nat.add_mul, Nat.add_comm] _ = Multiset.count b (b ::β‚˜ s) * Polynomial.rootMultiplicity a (q - Polynomial.C b) := by simp [hcount] Β· have hbcn : b β‰  c := by simpa [ne_comm] using hcb have hnotroot : Β¬ (q - Polynomial.C c).IsRoot a := by intro hroot have : Polynomial.eval a (q - Polynomial.C c) = 0 := by simpa [Polynomial.IsRoot] using hroot have : b - c = 0 := by simpa [b, Polynomial.eval_sub, Polynomial.eval_C] using this exact hcb (sub_eq_zero.mp this).symm have hRM_head : Polynomial.rootMultiplicity a (q - Polynomial.C c) = 0 := Polynomial.rootMultiplicity_eq_zero hnotroot have hRM_mul := (Polynomial.rootMultiplicity_mul (x := a) (p := q - Polynomial.C c) (q := (s.map (fun c : K => q - Polynomial.C c)).prod) (hpq := hmul)) calc Polynomial.rootMultiplicity a ((c ::β‚˜ s).map (fun c : K => q - Polynomial.C c)).prod = Polynomial.rootMultiplicity a ((q - Polynomial.C c) * (s.map (fun c : K => q - Polynomial.C c)).prod) := by simp _ = Polynomial.rootMultiplicity a (q - Polynomial.C c) + Polynomial.rootMultiplicity a (s.map (fun c : K => q - Polynomial.C c)).prod := by simpa using hRM_mul _ = Multiset.count b (c ::β‚˜ s) * Polynomial.rootMultiplicity a (q - Polynomial.C b) := by simp [hRM_head, ih, hbcn] have hcount : Multiset.count b p.roots = Polynomial.rootMultiplicity b p := by simp calc Polynomial.rootMultiplicity a (p.comp q) = Polynomial.rootMultiplicity a (Polynomial.C p.leadingCoeff * (p.roots.map fun c : K => q - Polynomial.C c).prod) := by simp [hcomp] _ = Polynomial.rootMultiplicity a (Polynomial.C p.leadingCoeff : Polynomial K) + Polynomial.rootMultiplicity a (p.roots.map fun c : K => q - Polynomial.C c).prod := by simpa using (Polynomial.rootMultiplicity_mul (x := a) hmul_ne) _ = Multiset.count b p.roots * Polynomial.rootMultiplicity a (q - Polynomial.C b) := by simp [hrootC, hRM_prod] _ = Polynomial.rootMultiplicity b p * Polynomial.rootMultiplicity a (q - Polynomial.C b) := by simp [hcount]

For , the multiplicity of Unknown identifier `a`a as a root of Unknown identifier `q`sorry - sorry : ?m.5q - Unknown identifier `C`C (q.eval a) is 1 : β„•1 iff the derivative does not vanish at Unknown identifier `a`a.

lemma rootMultiplicity_sub_C_eval_eq_one_iff {K : Type*} [Field K] (q : Polynomial K) (a : K) : Polynomial.rootMultiplicity a (q - Polynomial.C (Polynomial.eval a q)) = 1 ↔ Β¬ (q.derivative.IsRoot a) := by classical set r : Polynomial K := q - Polynomial.C (Polynomial.eval a q) by_cases hr0 : r = 0 Β· have hqconst : q = Polynomial.C (Polynomial.eval a q) := by have : q - Polynomial.C (Polynomial.eval a q) = 0 := by simpa [r] using hr0 exact sub_eq_zero.mp this have hqder : q.derivative = 0 := by rw [hqconst] simp constructor Β· intro h _ have hrm : Polynomial.rootMultiplicity a r = 0 := by simp [r, hr0] rw [hrm] at h exact Nat.zero_ne_one h Β· intro h have : q.derivative.IsRoot a := by simp [hqder, Polynomial.IsRoot] exact False.elim (h this) Β· have hr_root : r.IsRoot a := by simp [r, Polynomial.IsRoot] have hpos : 0 < Polynomial.rootMultiplicity a r := (Polynomial.rootMultiplicity_pos hr0).2 hr_root have hge : 1 ≀ Polynomial.rootMultiplicity a r := Nat.succ_le_iff.2 hpos have hlt : (1 < Polynomial.rootMultiplicity a r) ↔ r.derivative.IsRoot a := by constructor Β· intro h exact (Polynomial.one_lt_rootMultiplicity_iff_isRoot (p := r) (t := a) hr0).1 h |>.2 Β· intro h exact (Polynomial.one_lt_rootMultiplicity_iff_isRoot (p := r) (t := a) hr0).2 ⟨hr_root, h⟩ have hEq : Polynomial.rootMultiplicity a r = 1 ↔ Β¬ r.derivative.IsRoot a := by constructor Β· intro h hdr have : Β¬ 1 < Polynomial.rootMultiplicity a r := by simp [h] exact this (hlt.2 hdr) Β· intro hdr rcases Nat.lt_or_eq_of_le hge with hlt' | heq Β· exact (hdr (hlt.1 hlt')).elim Β· simpa using heq.symm have hderiv : r.derivative = q.derivative := by simp [r] simpa [r, hderiv] using hEq
end SomeLocalRings