On Some Local Rings (Maassarani, 2025) -- Section 02 -- Part 2
Lean contributors (project-level attribution): Liang Xiao, Haochen Ju, Zichen Wang.
namespace SomeLocalRingsvariable {π : Type*} [Field π]variable {A B : Type*} [Ring A] [Ring B] [Algebra π A] [Algebra π B]
If p.comp q = r * s, then every root of s maps to a root of p by evaluation of 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''
π[X]β§Έ(P) is finite-dimensional over π, using the monic associate of 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 n > 1, then S_f is coprime to 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 π is a field and are irreducible polynomials in π[X]. Let
be a ring isomorphism stabilizing π, and let S_f and
be as in Proposition 2.4. For n > 1, S_f is prime to 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 π is a field and are irreducible polynomials in π[X]. Let
be a ring isomorphism stabilizing π, and let Ο_f^X and Q_f
be as in Proposition 2.4.
-
If
Ξ±is a root ofPβ, thenis a root of. -
The map
gives a bijection between the roots ofPβ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
simpa [I2] using (Ideal.subset_span (by 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
rflRoot multiplicity for a composition over an algebraically closed field.
If b = q.eval a, then the multiplicity of a as a root of p.comp q is the multiplicity of b
as a root of p, times the multiplicity of a as a root of q - 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 a as a root of q - C (q.eval a) is 1 iff the derivative
does not vanish at 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 hEqend SomeLocalRings