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

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

Source header ยท Attribution source

namespace SomeLocalRingsopen Polynomialopen scoped BigOperatorsvariable {๐•œ : Type*} [Field ๐•œ]

Expand (sorry + sorry) ^ sorry : ?m.10(Unknown identifier `X`X + Unknown identifier `Q`Q)^Unknown identifier `n`n to first order in Unknown identifier `Q`Q, with a remainder divisible by Unknown identifier `Q`sorry ^ 2 : ?m.6Q^2.

lemma exists_R_pow_X_add (Q : Polynomial ๐•œ) (n : โ„•) : โˆƒ R : Polynomial ๐•œ, (X + Q) ^ n = X ^ n + (n : Polynomial ๐•œ) * X ^ (n - 1) * Q + R * Q ^ 2 := by classical cases n with | zero => refine โŸจ0, ?_โŸฉ simp | succ n => cases n with | zero => refine โŸจ0, ?_โŸฉ simp | succ n => -- The binomial expansion, with the `Q^0` and `Q^1` terms separated out. let f : โ„• โ†’ Polynomial ๐•œ := fun m => X ^ m * Q ^ (n + 2 - m) * ((n + 2).choose m : Polynomial ๐•œ) let R : Polynomial ๐•œ := โˆ‘ m โˆˆ Finset.range (n + 1), X ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ) refine โŸจR, ?_โŸฉ have hsplit : (โˆ‘ m โˆˆ Finset.range (n + 3), f m) = (โˆ‘ m โˆˆ Finset.range (n + 1), f m) + f (n + 1) + f (n + 2) := by calc (โˆ‘ m โˆˆ Finset.range (n + 3), f m) = (โˆ‘ m โˆˆ Finset.range (n + 2), f m) + f (n + 2) := by simpa [Nat.add_assoc] using (Finset.sum_range_succ f (n + 2)) _ = ((โˆ‘ m โˆˆ Finset.range (n + 1), f m) + f (n + 1)) + f (n + 2) := by simp [Finset.sum_range_succ] _ = (โˆ‘ m โˆˆ Finset.range (n + 1), f m) + f (n + 1) + f (n + 2) := by ac_rfl have htail : (โˆ‘ m โˆˆ Finset.range (n + 1), f m) = R * Q ^ 2 := by have hterm : โˆ€ m, m โˆˆ Finset.range (n + 1) โ†’ f m = (X ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ)) * Q ^ 2 := by intro m hm have hmle : m โ‰ค n := Nat.le_of_lt_succ (Finset.mem_range.mp hm) have hsub : n + 2 - m = n - m + 2 := Nat.sub_add_comm hmle -- Rewrite `Q^(n+2-m)` as `Q^(n-m) * Q^2`. simp [f, hsub, pow_add, mul_assoc, mul_left_comm, mul_comm] calc (โˆ‘ m โˆˆ Finset.range (n + 1), f m) = โˆ‘ m โˆˆ Finset.range (n + 1), (X ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ)) * Q ^ 2 := by refine Finset.sum_congr rfl ?_ intro m hm simpa using hterm m hm _ = (โˆ‘ m โˆˆ Finset.range (n + 1), X ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ)) * Q ^ 2 := by simpa [R] using (Finset.sum_mul (Finset.range (n + 1)) (fun m => X ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ)) (Q ^ 2)).symm -- Assemble the split binomial expansion. have hpow : (X + Q) ^ (n + 2) = โˆ‘ m โˆˆ Finset.range (n + 3), f m := by simp [f, Nat.add_left_comm, Nat.add_comm, add_pow] -- Simplify the `Q^0` and `Q^1` terms, and package the remainder into `R * Q^2`. -- (Note: here `Nat.succ (Nat.succ n) = n + 2` and `(n + 2) - 1 = n + 1`.) calc (X + Q) ^ (Nat.succ (Nat.succ n)) = (X + Q) ^ (n + 2) := by simp [Nat.add_assoc] _ = โˆ‘ m โˆˆ Finset.range (n + 3), f m := hpow _ = (โˆ‘ m โˆˆ Finset.range (n + 1), f m) + f (n + 1) + f (n + 2) := hsplit _ = X ^ (n + 2) + ((n + 2 : โ„•) : Polynomial ๐•œ) * X ^ (n + 1) * Q + R * Q ^ 2 := by -- rewrite the tail rw [htail] -- simplify the two explicit terms have hlast : f (n + 2) = X ^ (n + 2) := by simp [f, mul_left_comm, mul_comm] have hlin : f (n + 1) = ((n + 2 : โ„•) : Polynomial ๐•œ) * X ^ (n + 1) * Q := by have hsub : n + 2 - (n + 1) = 1 := by simp have hchoose : (n + 2).choose (n + 1) = n + 2 := by simp have hchoose' : ((n + 2).choose (n + 1) : Polynomial ๐•œ) = ((n + 2 : โ„•) : Polynomial ๐•œ) := by exact congrArg (fun t : โ„• => (t : Polynomial ๐•œ)) hchoose -- `choose (n+2) (n+1) = n+2` and `n+2-(n+1)=1`. dsimp [f] rw [hsub, hchoose'] -- `Q^1 = Q`; rearrange factors. simp [pow_one, mul_assoc] ac_rfl -- finish by rearranging simp [hlast, hlin, add_assoc, add_comm, add_left_comm, mul_comm] _ = X ^ (Nat.succ (Nat.succ n)) + (Nat.succ (Nat.succ n) : Polynomial ๐•œ) * X ^ (Nat.succ (Nat.succ n) - 1) * Q + R * Q ^ 2 := by simp [Nat.succ_eq_add_one, Nat.add_left_comm, Nat.add_comm]

Expand a monomial composed with Unknown identifier `X`sorry + sorry : ?m.5X + Unknown identifier `Q`Q to first order in Unknown identifier `Q`Q.

lemma exists_R_monomial_comp_X_add (Q : Polynomial ๐•œ) (a : ๐•œ) (n : โ„•) : โˆƒ R : Polynomial ๐•œ, (monomial n a).comp (X + Q) = monomial n a + (monomial n a).derivative * Q + R * Q ^ 2 := by classical rcases exists_R_pow_X_add (๐•œ := ๐•œ) Q n with โŸจR, hRโŸฉ refine โŸจC a * R, ?_โŸฉ -- Use `monomial_comp` to reduce to the power expansion, then simplify. have hcoeff : C a * (n : Polynomial ๐•œ) * X ^ (n - 1) = (monomial (n - 1) (a * (n : ๐•œ)) : Polynomial ๐•œ) := by have hnat : (n : Polynomial ๐•œ) = C (n : ๐•œ) := (Polynomial.C_eq_natCast (R := ๐•œ) n).symm calc C a * (n : Polynomial ๐•œ) * X ^ (n - 1) = (C a * C (n : ๐•œ)) * X ^ (n - 1) := by rw [hnat] _ = C (a * (n : ๐•œ)) * X ^ (n - 1) := by simp [mul_assoc] _ = monomial (n - 1) (a * (n : ๐•œ)) := by simpa using (Polynomial.C_mul_X_pow_eq_monomial (R := ๐•œ) (a := a * (n : ๐•œ)) (n := n - 1)) have hder : (monomial n a : Polynomial ๐•œ).derivative = C a * (n : Polynomial ๐•œ) * X ^ (n - 1) := by calc (monomial n a : Polynomial ๐•œ).derivative = monomial (n - 1) (a * (n : ๐•œ)) := by simp [Polynomial.derivative_monomial] _ = C a * (n : Polynomial ๐•œ) * X ^ (n - 1) := by simpa using hcoeff.symm calc (monomial n a : Polynomial ๐•œ).comp (X + Q) = C a * (X + Q) ^ n := by simp [Polynomial.monomial_comp] _ = C a * (X ^ n + (n : Polynomial ๐•œ) * X ^ (n - 1) * Q + R * Q ^ 2) := by simp [hR] _ = monomial n a + (monomial n a).derivative * Q + (C a * R) * Q ^ 2 := by -- Distribute `C a`, then rewrite the main and derivative terms. rw [hder] -- Note: `C a * X^n = monomial n a` is a simp lemma. -- Avoid using commutativity lemmas with `simp` (they may loop); finish by `ac_rfl`. simp [mul_add, mul_assoc, Polynomial.C_mul_X_pow_eq_monomial]

The first-order expansion property is preserved under addition (for fixed Unknown identifier `Q`Q).

lemma comp_X_add_taylor1_add {Q Pโ‚ Pโ‚‚ : Polynomial ๐•œ} (hโ‚ : โˆƒ R, Pโ‚.comp (X + Q) = Pโ‚ + Pโ‚.derivative * Q + R * Q ^ 2) (hโ‚‚ : โˆƒ R, Pโ‚‚.comp (X + Q) = Pโ‚‚ + Pโ‚‚.derivative * Q + R * Q ^ 2) : โˆƒ R, (Pโ‚ + Pโ‚‚).comp (X + Q) = (Pโ‚ + Pโ‚‚) + (Pโ‚ + Pโ‚‚).derivative * Q + R * Q ^ 2 := by classical rcases hโ‚ with โŸจRโ‚, hRโ‚โŸฉ rcases hโ‚‚ with โŸจRโ‚‚, hRโ‚‚โŸฉ refine โŸจRโ‚ + Rโ‚‚, ?_โŸฉ -- Expand both sides, then use commutativity/associativity of addition to rearrange terms. calc (Pโ‚ + Pโ‚‚).comp (X + Q) = Pโ‚.comp (X + Q) + Pโ‚‚.comp (X + Q) := by simp [Polynomial.add_comp] _ = (Pโ‚ + Pโ‚.derivative * Q + Rโ‚ * Q ^ 2) + (Pโ‚‚ + Pโ‚‚.derivative * Q + Rโ‚‚ * Q ^ 2) := by simp [hRโ‚, hRโ‚‚, add_assoc] _ = (Pโ‚ + Pโ‚‚) + (Pโ‚ + Pโ‚‚).derivative * Q + (Rโ‚ + Rโ‚‚) * Q ^ 2 := by -- Expand the derivative and remainder terms on the RHS, then close by `ac_rfl`. simp [Polynomial.derivative_add, add_mul, add_assoc, add_left_comm, add_comm]

Lemma 1.1. Let Unknown identifier `๐•œ`๐•œ be a field and Unknown identifier `P`P be an irreducible polynomial over Unknown identifier `๐•œ`๐•œ. For Unknown identifier `Q`sorry โˆˆ sorry[sorry] : PropQ โˆˆ 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], we have for some Unknown identifier `R`sorry โˆˆ sorry[sorry] : PropR โˆˆ 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].

lemma polynomial_comp_X_add_eq_add_derivative_mul_add_mul_sq (P : Polynomial ๐•œ) (Q : Polynomial ๐•œ) : โˆƒ R : Polynomial ๐•œ, P.comp (Polynomial.X + Q) = P + P.derivative * Q + R * Q ^ 2 := by classical -- Reduce to monomials via `Polynomial.induction_on'`, using additivity and the monomial case. refine Polynomial.induction_on' (motive := fun P : Polynomial ๐•œ => โˆƒ R : Polynomial ๐•œ, P.comp (X + Q) = P + P.derivative * Q + R * Q ^ 2) P ?_ ?_ ยท intro Pโ‚ Pโ‚‚ hโ‚ hโ‚‚ simpa [add_assoc] using comp_X_add_taylor1_add (Q := Q) hโ‚ hโ‚‚ ยท intro n a simpa using exists_R_monomial_comp_X_add (๐•œ := ๐•œ) (Q := Q) a n

Expand (sorry + sorry) ^ sorry : ?m.10(Unknown identifier `U`U + Unknown identifier `Q`Q)^Unknown identifier `n`n to first order in Unknown identifier `Q`Q, with a remainder divisible by Unknown identifier `Q`sorry ^ 2 : ?m.6Q^2.

lemma exists_R_pow_add (U Q : Polynomial ๐•œ) (n : โ„•) : โˆƒ R : Polynomial ๐•œ, (U + Q) ^ n = U ^ n + (n : Polynomial ๐•œ) * U ^ (n - 1) * Q + R * Q ^ 2 := by classical cases n with | zero => refine โŸจ0, ?_โŸฉ simp | succ n => cases n with | zero => refine โŸจ0, ?_โŸฉ simp | succ n => -- The binomial expansion, with the `Q^0` and `Q^1` terms separated out. let f : โ„• โ†’ Polynomial ๐•œ := fun m => U ^ m * Q ^ (n + 2 - m) * ((n + 2).choose m : Polynomial ๐•œ) let R : Polynomial ๐•œ := โˆ‘ m โˆˆ Finset.range (n + 1), U ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ) refine โŸจR, ?_โŸฉ have hsplit : (โˆ‘ m โˆˆ Finset.range (n + 3), f m) = (โˆ‘ m โˆˆ Finset.range (n + 1), f m) + f (n + 1) + f (n + 2) := by calc (โˆ‘ m โˆˆ Finset.range (n + 3), f m) = (โˆ‘ m โˆˆ Finset.range (n + 2), f m) + f (n + 2) := by simpa [Nat.add_assoc] using (Finset.sum_range_succ f (n + 2)) _ = ((โˆ‘ m โˆˆ Finset.range (n + 1), f m) + f (n + 1)) + f (n + 2) := by simp [Finset.sum_range_succ] _ = (โˆ‘ m โˆˆ Finset.range (n + 1), f m) + f (n + 1) + f (n + 2) := by ac_rfl have htail : (โˆ‘ m โˆˆ Finset.range (n + 1), f m) = R * Q ^ 2 := by have hterm : โˆ€ m, m โˆˆ Finset.range (n + 1) โ†’ f m = (U ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ)) * Q ^ 2 := by intro m hm have hmle : m โ‰ค n := Nat.le_of_lt_succ (Finset.mem_range.mp hm) have hsub : n + 2 - m = n - m + 2 := Nat.sub_add_comm hmle -- Rewrite `Q^(n+2-m)` as `Q^(n-m) * Q^2`. simp [f, hsub, pow_add, mul_assoc, mul_left_comm, mul_comm] calc (โˆ‘ m โˆˆ Finset.range (n + 1), f m) = โˆ‘ m โˆˆ Finset.range (n + 1), (U ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ)) * Q ^ 2 := by refine Finset.sum_congr rfl ?_ intro m hm simpa using hterm m hm _ = (โˆ‘ m โˆˆ Finset.range (n + 1), U ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ)) * Q ^ 2 := by simpa [R] using (Finset.sum_mul (Finset.range (n + 1)) (fun m => U ^ m * Q ^ (n - m) * ((n + 2).choose m : Polynomial ๐•œ)) (Q ^ 2)).symm -- Assemble the split binomial expansion. have hpow : (U + Q) ^ (n + 2) = โˆ‘ m โˆˆ Finset.range (n + 3), f m := by simp [f, Nat.add_left_comm, Nat.add_comm, add_pow] -- Simplify the `Q^0` and `Q^1` terms, and package the remainder into `R * Q^2`. calc (U + Q) ^ (Nat.succ (Nat.succ n)) = (U + Q) ^ (n + 2) := by simp [Nat.add_assoc] _ = โˆ‘ m โˆˆ Finset.range (n + 3), f m := hpow _ = (โˆ‘ m โˆˆ Finset.range (n + 1), f m) + f (n + 1) + f (n + 2) := hsplit _ = U ^ (n + 2) + ((n + 2 : โ„•) : Polynomial ๐•œ) * U ^ (n + 1) * Q + R * Q ^ 2 := by rw [htail] have hlast : f (n + 2) = U ^ (n + 2) := by simp [f] have hlin : f (n + 1) = ((n + 2 : โ„•) : Polynomial ๐•œ) * U ^ (n + 1) * Q := by have hsub : n + 2 - (n + 1) = 1 := by simp have hchoose : (n + 2).choose (n + 1) = n + 2 := by simp have hchoose' : ((n + 2).choose (n + 1) : Polynomial ๐•œ) = ((n + 2 : โ„•) : Polynomial ๐•œ) := by exact congrArg (fun t : โ„• => (t : Polynomial ๐•œ)) hchoose dsimp [f] rw [hsub, hchoose'] simp [pow_one, mul_assoc] ac_rfl simp [hlast, hlin, add_assoc, add_comm, mul_comm] _ = U ^ (Nat.succ (Nat.succ n)) + (Nat.succ (Nat.succ n) : Polynomial ๐•œ) * U ^ (Nat.succ (Nat.succ n) - 1) * Q + R * Q ^ 2 := by simp [Nat.succ_eq_add_one, Nat.add_left_comm, Nat.add_comm]

Expand a monomial composed with Unknown identifier `U`sorry + sorry : ?m.5U + Unknown identifier `Q`Q to first order in Unknown identifier `Q`Q.

lemma exists_R_monomial_comp_add (U Q : Polynomial ๐•œ) (a : ๐•œ) (n : โ„•) : โˆƒ R : Polynomial ๐•œ, (monomial n a).comp (U + Q) = (monomial n a).comp U + ((monomial n a).derivative.comp U) * Q + R * Q ^ 2 := by classical rcases exists_R_pow_add (๐•œ := ๐•œ) (U := U) (Q := Q) n with โŸจR, hRโŸฉ refine โŸจC a * R, ?_โŸฉ calc (monomial n a : Polynomial ๐•œ).comp (U + Q) = C a * (U + Q) ^ n := by simp [Polynomial.monomial_comp] _ = C a * (U ^ n + (n : Polynomial ๐•œ) * U ^ (n - 1) * Q + R * Q ^ 2) := by simp [hR] _ = C a * U ^ n + (C a * ((n : Polynomial ๐•œ) * U ^ (n - 1))) * Q + (C a * R) * Q ^ 2 := by -- Distribute `C a` and reassociate the `Q`-term. simp [add_assoc, add_mul, mul_assoc, mul_left_comm, mul_comm] _ = (monomial n a).comp U + ((monomial n a).derivative.comp U) * Q + (C a * R) * Q ^ 2 := by -- Simplify the main and derivative terms. simp [Polynomial.monomial_comp, Polynomial.derivative_monomial, mul_assoc, mul_left_comm, mul_comm, add_assoc]

The first-order expansion property is preserved under addition (for fixed Unknown identifier `U`U and Unknown identifier `Q`Q).

lemma comp_add_taylor1_add {U Q Pโ‚ Pโ‚‚ : Polynomial ๐•œ} (hโ‚ : โˆƒ R, Pโ‚.comp (U + Q) = Pโ‚.comp U + (Pโ‚.derivative.comp U) * Q + R * Q ^ 2) (hโ‚‚ : โˆƒ R, Pโ‚‚.comp (U + Q) = Pโ‚‚.comp U + (Pโ‚‚.derivative.comp U) * Q + R * Q ^ 2) : โˆƒ R, (Pโ‚ + Pโ‚‚).comp (U + Q) = (Pโ‚ + Pโ‚‚).comp U + ((Pโ‚ + Pโ‚‚).derivative.comp U) * Q + R * Q ^ 2 := by classical rcases hโ‚ with โŸจRโ‚, hRโ‚โŸฉ rcases hโ‚‚ with โŸจRโ‚‚, hRโ‚‚โŸฉ refine โŸจRโ‚ + Rโ‚‚, ?_โŸฉ calc (Pโ‚ + Pโ‚‚).comp (U + Q) = Pโ‚.comp (U + Q) + Pโ‚‚.comp (U + Q) := by simp [Polynomial.add_comp] _ = (Pโ‚.comp U + Pโ‚.derivative.comp U * Q + Rโ‚ * Q ^ 2) + (Pโ‚‚.comp U + Pโ‚‚.derivative.comp U * Q + Rโ‚‚ * Q ^ 2) := by simp [hRโ‚, hRโ‚‚, add_assoc] _ = (Pโ‚ + Pโ‚‚).comp U + ((Pโ‚ + Pโ‚‚).derivative.comp U) * Q + (Rโ‚ + Rโ‚‚) * Q ^ 2 := by -- Expand the derivative and remainder terms on the RHS, then close by `ac_rfl`. simp [Polynomial.derivative_add, Polynomial.add_comp, add_mul, add_assoc, add_left_comm, add_comm]

A first-order Taylor expansion of Unknown identifier `P.comp`P.comp around an arbitrary center Unknown identifier `U`U.

lemma polynomial_comp_add_eq_add_derivative_comp_mul_add_mul_sq (P U Q : Polynomial ๐•œ) : โˆƒ R : Polynomial ๐•œ, P.comp (U + Q) = P.comp U + (P.derivative.comp U) * Q + R * Q ^ 2 := by classical refine Polynomial.induction_on' (motive := fun P : Polynomial ๐•œ => โˆƒ R : Polynomial ๐•œ, P.comp (U + Q) = P.comp U + (P.derivative.comp U) * Q + R * Q ^ 2) P ?_ ?_ ยท intro Pโ‚ Pโ‚‚ hโ‚ hโ‚‚ simpa [add_assoc] using comp_add_taylor1_add (U := U) (Q := Q) hโ‚ hโ‚‚ ยท intro n a simpa using exists_R_monomial_comp_add (๐•œ := ๐•œ) (U := U) (Q := Q) a n

If Unknown identifier `P`P is irreducible and Unknown identifier `P'`sorry โ‰  0 : PropP' โ‰  0, then the class of Unknown identifier `P'`P' in 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 `๐•œ`sorry[sorry] / sorry : ?m.10๐•œ[Unknown identifier `X`X]/(Unknown identifier `P`P) is nonzero.

lemma mk_derivative_ne_zero_mod_irreducible (P : Polynomial ๐•œ) (hP : Irreducible P) (hP' : P.derivative โ‰  0) : AdjoinRoot.mk P P.derivative โ‰  (0 : AdjoinRoot P) := by intro h have hdiv : P โˆฃ P.derivative := (AdjoinRoot.mk_eq_zero).1 (by simpa using h) have hdegP : P.natDegree โ‰  0 := by intro hdeg rcases (Polynomial.natDegree_eq_zero.mp hdeg) with โŸจa, rflโŸฉ have ha : (a : ๐•œ) โ‰  0 := by simpa [Polynomial.C_ne_zero] using hP.ne_zero have : IsUnit (Polynomial.C a : Polynomial ๐•œ) := by simp [isUnit_iff_ne_zero, ha] exact hP.1 this have hle : P.natDegree โ‰ค P.derivative.natDegree := by exact Polynomial.natDegree_le_of_dvd hdiv hP' have hlt : P.derivative.natDegree < P.natDegree := Polynomial.natDegree_derivative_lt hdegP exact (not_lt_of_ge hle) hlt

If Unknown identifier `P`sorry โˆฃ sorry - sorry : PropP โˆฃ Unknown identifier `U`U - Unknown identifier `X`X, then composing a polynomial with Unknown identifier `U`U does not change its class in 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 `๐•œ`sorry[sorry] / sorry : ?m.10๐•œ[Unknown identifier `X`X]/(Unknown identifier `P`P).

lemma mk_comp_eq_mk_of_dvd_sub (P f U : Polynomial ๐•œ) (hUX : P โˆฃ (U - X)) : AdjoinRoot.mk P (f.comp U) = AdjoinRoot.mk P f := by have hmk : (AdjoinRoot.mk P) U = (AdjoinRoot.mk P) X := (AdjoinRoot.mk_eq_mk).2 (by simpa [sub_eq_add_neg, add_comm] using hUX) -- Work in `AdjoinRoot P`, where `mk` is `aeval` at the root. calc AdjoinRoot.mk P (f.comp U) = (Polynomial.aeval (AdjoinRoot.root P)) (f.comp U) := by simp [AdjoinRoot.aeval_eq] _ = (Polynomial.aeval ((Polynomial.aeval (AdjoinRoot.root P)) U)) f := by simpa using (Polynomial.aeval_comp (p := f) (q := U) (x := AdjoinRoot.root P)) _ = (Polynomial.aeval ((AdjoinRoot.mk P) U)) f := by simp [AdjoinRoot.aeval_eq] _ = (Polynomial.aeval ((AdjoinRoot.mk P) X)) f := by simp [hmk] _ = (Polynomial.aeval (AdjoinRoot.root P)) f := by simp [AdjoinRoot.mk_X] _ = AdjoinRoot.mk P f := by simp [AdjoinRoot.aeval_eq]

Given , choose Unknown identifier `S`S so that .

This uses that 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 `๐•œ`sorry[sorry] / sorry : ?m.10๐•œ[Unknown identifier `X`X]/(Unknown identifier `P`P) is a field (since Unknown identifier `P`P is irreducible) and that Unknown identifier `P'`P' is nonzero mod Unknown identifier `P`P.

lemma exists_S_kill_Rn_mod_P (P U Rn : Polynomial ๐•œ) (hP : Irreducible P) (hP' : P.derivative โ‰  0) (hUX : P โˆฃ (U - X)) : โˆƒ S : Polynomial ๐•œ, P โˆฃ (Rn + (P.derivative.comp U) * S) := by classical letI : Fact (Irreducible P) := โŸจhPโŸฉ let a : AdjoinRoot P := AdjoinRoot.mk P (P.derivative.comp U) let r : AdjoinRoot P := AdjoinRoot.mk P Rn have ha : a โ‰  0 := by have ha' : AdjoinRoot.mk P (P.derivative.comp U) = AdjoinRoot.mk P P.derivative := by simpa using mk_comp_eq_mk_of_dvd_sub (๐•œ := ๐•œ) (P := P) (f := P.derivative) (U := U) hUX -- Reduce to `mk P P' โ‰  0`. simpa [a, ha'] using mk_derivative_ne_zero_mod_irreducible (๐•œ := ๐•œ) P hP hP' let sbar : AdjoinRoot P := -(r / a) rcases (AdjoinRoot.mk_surjective (g := P) sbar) with โŸจS, hSโŸฉ refine โŸจS, ?_โŸฉ have hzero : AdjoinRoot.mk P (Rn + (P.derivative.comp U) * S) = (0 : AdjoinRoot P) := by -- Compute in the field `AdjoinRoot P`, using `a * (r / a) = r`. have hmul : a * (r / a) = r := by simpa [a, r] using (mul_div_cancelโ‚€ r ha) -- Rewrite `mk P S` as `sbar`. have : AdjoinRoot.mk P S = sbar := hS -- Now simplify. simp [a, r, sbar, this, hmul, mul_comm] exact (AdjoinRoot.mk_eq_zero).1 hzero

One Hensel-style lifting step: if Unknown identifier `P.comp`P.comp U is divisible by Unknown identifier `P`sorry ^ (sorry + 1) : ?m.11P^(Unknown identifier `n`n+1) and , then we can adjust Unknown identifier `U`U by Unknown identifier `S`sorry * sorry ^ (sorry + 1) : ?m.16S * Unknown identifier `P`P^(Unknown identifier `n`n+1) so that Unknown identifier `P.comp`P.comp becomes divisible by Unknown identifier `P`sorry ^ (sorry + 2) : ?m.11P^(Unknown identifier `n`n+2).

lemma hensel_step (P U Rn : Polynomial ๐•œ) (n : โ„•) (hP : Irreducible P) (hP' : P.derivative โ‰  0) (hUX : P โˆฃ (U - X)) (hcomp : P.comp U = Rn * P ^ (n + 1)) : โˆƒ (S Rn1 : Polynomial ๐•œ), P.comp (U + S * P ^ (n + 1)) = Rn1 * P ^ (n + 2) := by classical rcases exists_S_kill_Rn_mod_P (๐•œ := ๐•œ) (P := P) (U := U) (Rn := Rn) hP hP' hUX with โŸจS, hSโŸฉ rcases polynomial_comp_add_eq_add_derivative_comp_mul_add_mul_sq (๐•œ := ๐•œ) (P := P) (U := U) (Q := S * P ^ (n + 1)) with โŸจT, hTโŸฉ have hsq : (S * P ^ (n + 1)) ^ 2 = S ^ 2 * P ^ (2 * n + 2) := by -- `(S * P^(n+1))^2 = S^2 * (P^(n+1))^2 = S^2 * P^(2n+2)`. calc (S * P ^ (n + 1)) ^ 2 = S ^ 2 * (P ^ (n + 1)) ^ 2 := by simp [mul_pow] _ = S ^ 2 * P ^ ((n + 1) * 2) := by simp [pow_mul] _ = S ^ 2 * P ^ (2 * n + 2) := by have hmul : (n + 1) * 2 = 2 * n + 2 := by simp [Nat.add_mul, Nat.mul_comm] simp [hmul] have hrewrite : P.comp (U + S * P ^ (n + 1)) = (Rn + (P.derivative.comp U) * S) * P ^ (n + 1) + (T * S ^ 2) * P ^ (2 * n + 2) := by calc P.comp (U + S * P ^ (n + 1)) = P.comp U + (P.derivative.comp U) * (S * P ^ (n + 1)) + T * (S * P ^ (n + 1)) ^ 2 := hT _ = Rn * P ^ (n + 1) + (P.derivative.comp U) * (S * P ^ (n + 1)) + T * (S * P ^ (n + 1)) ^ 2 := by simp [hcomp, add_assoc] _ = (Rn + (P.derivative.comp U) * S) * P ^ (n + 1) + (T * S ^ 2) * P ^ (2 * n + 2) := by -- Factor out `P^(n+1)` and rewrite the remainder using `hsq`. simp [hsq, mul_add, mul_assoc, mul_left_comm, mul_comm, add_left_comm, add_comm] -- The first term is divisible by `P^(n+2)` by construction. have hdvd1 : P ^ (n + 2) โˆฃ (Rn + (P.derivative.comp U) * S) * P ^ (n + 1) := by rcases hS with โŸจA, hAโŸฉ refine โŸจA, ?_โŸฉ calc (Rn + (P.derivative.comp U) * S) * P ^ (n + 1) = (P * A) * P ^ (n + 1) := by simp [hA] _ = P ^ (n + 2) * A := by -- Commute and reassociate factors. simp [pow_succ, mul_assoc, mul_left_comm, mul_comm] -- The remainder is divisible by `P^(n+2)` since `n+2 โ‰ค 2n+2`. have hdvd2 : P ^ (n + 2) โˆฃ (T * S ^ 2) * P ^ (2 * n + 2) := by have hle : n + 2 โ‰ค 2 * n + 2 := by have hn : n โ‰ค n + n := Nat.le_add_right n n have hn' : n + 2 โ‰ค (n + n) + 2 := Nat.add_le_add_right hn 2 simp [two_mul, Nat.add_assoc] exact dvd_mul_of_dvd_right (pow_dvd_pow P hle) (T * S ^ 2) have hdvd : P ^ (n + 2) โˆฃ P.comp (U + S * P ^ (n + 1)) := by rw [hrewrite] exact dvd_add hdvd1 hdvd2 rcases hdvd with โŸจRn1, hRn1โŸฉ refine โŸจS, Rn1, ?_โŸฉ simpa [mul_assoc, mul_left_comm, mul_comm] using hRn1

State used to build the sequences in Lemma 1.2 by recursion on Unknown identifier `n`n.

structure LiftState (P : Polynomial ๐•œ) (n : โ„•) where U : Polynomial ๐•œ R : Polynomial ๐•œ q : Polynomial ๐•œ hcomp : P.comp U = R * P ^ (n + 1) hmod : P โˆฃ U - X

Lemma 1.2. Let Unknown identifier `๐•œ`๐•œ be a field and Unknown identifier `P`P be an irreducible polynomial over Unknown identifier `๐•œ`๐•œ. If Unknown identifier `P'`sorry โ‰  0 : PropP' โ‰  0, then there exists an infinite sequence of pairs of polynomials such that for all Unknown identifier `k`sorry โ‰ฅ 0 : Propk โ‰ฅ 0, .

lemma exists_polynomial_sequences_comp_X_add_sum_mul_pow_eq_mul_pow (P : Polynomial ๐•œ) (hP : Irreducible P) (hP' : P.derivative โ‰  0) : โˆƒ (Q R : โ„• โ†’ Polynomial ๐•œ), โˆ€ k : โ„•, P.comp (Polynomial.X + Finset.sum (Finset.range k) (fun i => Q (i + 1) * P ^ (i + 1))) = R k * P ^ (k + 1) := by classical -- Construct `Uโ‚™`, `Rโ‚™`, and `Qโ‚™` recursively, -- lifting the divisibility by one power of `P` at each step. let base : LiftState (๐•œ := ๐•œ) P 0 := { U := X R := 1 q := 0 hcomp := by simp hmod := by simp } let step : โˆ€ n : โ„•, LiftState (๐•œ := ๐•œ) P n โ†’ LiftState (๐•œ := ๐•œ) P (n + 1) := fun n st => let hSR := hensel_step (๐•œ := ๐•œ) (P := P) (U := st.U) (Rn := st.R) (n := n) hP hP' st.hmod st.hcomp let q : Polynomial ๐•œ := Classical.choose hSR let hR : โˆƒ Rn1 : Polynomial ๐•œ, P.comp (st.U + q * P ^ (n + 1)) = Rn1 * P ^ (n + 2) := Classical.choose_spec hSR let Rn1 : Polynomial ๐•œ := Classical.choose hR have hcomp' : P.comp (st.U + q * P ^ (n + 1)) = Rn1 * P ^ (n + 2) := Classical.choose_spec hR have h1 : P โˆฃ st.U - X := st.hmod have h2 : P โˆฃ q * P ^ (n + 1) := dvd_mul_of_dvd_right (dvd_pow_self P (Nat.succ_ne_zero n)) q have hsum : P โˆฃ (st.U - X) + q * P ^ (n + 1) := dvd_add h1 h2 have hmod' : P โˆฃ (st.U + q * P ^ (n + 1)) - X := by simpa [sub_eq_add_neg, add_assoc, add_left_comm, add_comm] using hsum { U := st.U + q * P ^ (n + 1) R := Rn1 q := q hcomp := hcomp' hmod := hmod' } let state : โˆ€ n : โ„•, LiftState (๐•œ := ๐•œ) P n := Nat.rec base (fun n st => step n st) have step_U (n : โ„•) (st : LiftState (๐•œ := ๐•œ) P n) : (step n st).U = st.U + (step n st).q * P ^ (n + 1) := by rfl refine โŸจ(fun n => (state n).q), (fun n => (state n).R), ?_โŸฉ intro k have hU : (state k).U = X + Finset.sum (Finset.range k) (fun i => (state (i + 1)).q * P ^ (i + 1)) := by induction k with | zero => simp [state, base] | succ k ih => have hstepU : (state (k + 1)).U = (state k).U + (state (k + 1)).q * P ^ (k + 1) := by -- Unfold one step of the recursion. simpa [state] using (step_U k (state k)) -- Use `sum_range_succ` to split off the last term. calc (state (k + 1)).U = (X + Finset.sum (Finset.range k) (fun i => (state (i + 1)).q * P ^ (i + 1))) + (state (k + 1)).q * P ^ (k + 1) := by simp [hstepU, ih, add_assoc] _ = X + Finset.sum (Finset.range (k + 1)) (fun i => (state (i + 1)).q * P ^ (i + 1)) := by rw [Finset.sum_range_succ (fun i => (state (i + 1)).q * P ^ (i + 1)) k] ac_rfl -- Rewrite the argument of `P.comp` using `hU`, then use the stored divisibility equality. calc P.comp (X + Finset.sum (Finset.range k) (fun i => (state (i + 1)).q * P ^ (i + 1))) = P.comp (state k).U := by simp [hU] _ = (state k).R * P ^ (k + 1) := (state k).hcomp

Evaluating a polynomial Unknown identifier `p`p at Unknown identifier `mk`mk f U in AdjoinRoot sorry : Type u_1AdjoinRoot Unknown identifier `f`f corresponds to taking Unknown identifier `p.comp`p.comp U modulo Unknown identifier `f`f.

lemma aeval_mk_eq_mk_comp (f U p : Polynomial ๐•œ) : (aeval (AdjoinRoot.mk f U)) p = AdjoinRoot.mk f (p.comp U) := by -- Rewrite `mk f U` as `aeval (root f) U`, then use `aeval_comp`. rw [show (AdjoinRoot.mk f U : AdjoinRoot f) = (aeval (AdjoinRoot.root f)) U from (AdjoinRoot.aeval_eq (f := f) U).symm] calc (aeval ((aeval (AdjoinRoot.root f)) U)) p = (aeval (AdjoinRoot.root f)) (p.comp U) := by simpa using (Polynomial.aeval_comp (p := p) (q := U) (x := AdjoinRoot.root f)).symm _ = AdjoinRoot.mk f (p.comp U) := by simp [AdjoinRoot.aeval_eq]

For , Lemma 1.2 gives Unknown identifier `P.comp`sorry = sorry * sorry ^ sorry : PropP.comp U = Unknown identifier `R`R (k-1) * Unknown identifier `P`P^Unknown identifier `k`k.

lemma prop1_3_comp_eq_mul_pow (P : Polynomial ๐•œ) (Q R : โ„• โ†’ Polynomial ๐•œ) (k : โ„•) (hk : 1 โ‰ค k) (hQR : โˆ€ n : โ„•, P.comp (X + โˆ‘ i โˆˆ Finset.range n, Q (i + 1) * P ^ (i + 1)) = R n * P ^ (n + 1)) : P.comp (X + โˆ‘ i โˆˆ Finset.range (k - 1), Q (i + 1) * P ^ (i + 1)) = R (k - 1) * P ^ k := by simpa [Nat.sub_add_cancel hk] using (hQR (k - 1))

The polynomial Unknown identifier `X`sorry + โˆ‘ i โˆˆ Finset.Iio sorry, sorry * sorry ^ (i + 1) : ?m.37X + โˆ‘ i < Unknown identifier `n`n, Unknown identifier `Q`Q (i+1) * Unknown identifier `P`P^(i+1) is congruent to Unknown identifier `X`X modulo Unknown identifier `P`P.

lemma prop1_3_dvd_sub_X (P : Polynomial ๐•œ) (Q : โ„• โ†’ Polynomial ๐•œ) (n : โ„•) : P โˆฃ (X + โˆ‘ i โˆˆ Finset.range n, Q (i + 1) * P ^ (i + 1)) - X := by have hterm : โˆ€ i โˆˆ Finset.range n, P โˆฃ Q (i + 1) * P ^ (i + 1) := by intro i hi exact dvd_mul_of_dvd_right (dvd_pow_self P (Nat.succ_ne_zero i)) (Q (i + 1)) have hsum : P โˆฃ โˆ‘ i โˆˆ Finset.range n, Q (i + 1) * P ^ (i + 1) := Finset.dvd_sum hterm simpa [add_sub_cancel_left] using hsum

In AdjoinRoot sorry : Type u_1AdjoinRoot Unknown identifier `P`P, the element Unknown identifier `root`root P is a root of Unknown identifier `P`sorry ^ sorry : ?m.5P^Unknown identifier `k`k for Unknown identifier `k`sorry โ‰  0 : Propk โ‰  0.

lemma prop1_3_aeval_root_pow_eq_zero (P : Polynomial ๐•œ) (k : โ„•) (hk : k โ‰  0) : (aeval (AdjoinRoot.root P)) (P ^ k) = (0 : AdjoinRoot P) := by have hP0 : (aeval (AdjoinRoot.root P)) P = (0 : AdjoinRoot P) := by simp [Polynomial.aeval_def, AdjoinRoot.algebraMap_eq] calc (aeval (AdjoinRoot.root P)) (P ^ k) = ((aeval (AdjoinRoot.root P)) P) ^ k := by simp [map_pow] _ = 0 := by simp [hP0, hk]

Proposition 1.3. Let Unknown identifier `๐•œ`๐•œ be a field and let Unknown identifier `P`P be an irreducible polynomial over Unknown identifier `๐•œ`๐•œ. If Unknown identifier `P'`sorry โ‰  0 : PropP' โ‰  0, then for every Unknown identifier `k`sorry โ‰ฅ 1 : Propk โ‰ฅ 1 there exists an injective Unknown identifier `๐•œ`๐•œ-algebra morphism from the field failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1739478) 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) into failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1745313) Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`sorry[sorry] โงธ sorry ^ sorry : Type (max u_1 u_2)๐•œ[Unknown identifier `X`X]โงธ(Unknown identifier `P`P^Unknown identifier `k`k).

theorem exists_injective_algHom_adjoinRoot_to_adjoinRoot_pow (P : Polynomial ๐•œ) (hP : Irreducible P) (hP' : P.derivative โ‰  0) : โˆ€ k : โ„•, 1 โ‰ค k โ†’ โˆƒ f : AdjoinRoot P โ†’โ‚[๐•œ] AdjoinRoot (P ^ k), Function.Injective f := by classical intro k hk rcases exists_polynomial_sequences_comp_X_add_sum_mul_pow_eq_mul_pow (๐•œ := ๐•œ) (P := P) hP hP' with โŸจQ, R, hQRโŸฉ have hk0 : k โ‰  0 := Nat.ne_of_gt (Nat.lt_of_lt_of_le Nat.zero_lt_one hk) let U : Polynomial ๐•œ := X + โˆ‘ i โˆˆ Finset.range (k - 1), Q (i + 1) * P ^ (i + 1) have hcompU : P.comp U = R (k - 1) * P ^ k := by simpa [U] using prop1_3_comp_eq_mul_pow (๐•œ := ๐•œ) (P := P) (Q := Q) (R := R) k hk hQR have hdvd : P ^ k โˆฃ P.comp U := by refine โŸจR (k - 1), ?_โŸฉ -- Commute the factors to match the definition of divisibility. simpa [mul_assoc, mul_left_comm, mul_comm] using hcompU let ฮฑ : AdjoinRoot (P ^ k) := AdjoinRoot.mk (P ^ k) U have haeval : (aeval ฮฑ) P = 0 := by have : (aeval ฮฑ) P = AdjoinRoot.mk (P ^ k) (P.comp U) := by simpa [ฮฑ, U] using aeval_mk_eq_mk_comp (๐•œ := ๐•œ) (f := P ^ k) (U := U) (p := P) -- Reduce to the divisibility statement `P^k โˆฃ P.comp U`. simpa [this] using (AdjoinRoot.mk_eq_zero (f := P ^ k) (g := P.comp U)).2 hdvd let f : AdjoinRoot P โ†’โ‚[๐•œ] AdjoinRoot (P ^ k) := AdjoinRoot.liftAlgHom P (Algebra.ofId ๐•œ (AdjoinRoot (P ^ k))) ฮฑ (by simpa [Polynomial.aeval_def] using haeval) let ฯ€k : AdjoinRoot (P ^ k) โ†’โ‚[๐•œ] AdjoinRoot P := AdjoinRoot.liftAlgHom (P ^ k) (Algebra.ofId ๐•œ (AdjoinRoot P)) (AdjoinRoot.root P) (by simpa [Polynomial.aeval_def] using (prop1_3_aeval_root_pow_eq_zero (๐•œ := ๐•œ) (P := P) k hk0)) have hฯ€kฮฑ : ฯ€k ฮฑ = AdjoinRoot.root P := by have hmk : (AdjoinRoot.mk (P ^ k) U : AdjoinRoot (P ^ k)) = (aeval (AdjoinRoot.root (P ^ k))) U := by simp calc ฯ€k ฮฑ = ฯ€k (AdjoinRoot.mk (P ^ k) U) := by simp [ฮฑ] _ = ฯ€k ((aeval (AdjoinRoot.root (P ^ k))) U) := by simp _ = (aeval (ฯ€k (AdjoinRoot.root (P ^ k)))) U := by simpa using (Polynomial.aeval_algHom_apply (f := ฯ€k) (x := AdjoinRoot.root (P ^ k)) (p := U)).symm _ = (aeval (AdjoinRoot.root P)) U := by simp [ฯ€k, AdjoinRoot.liftAlgHom_root] _ = AdjoinRoot.mk P U := by simp [AdjoinRoot.aeval_eq] _ = AdjoinRoot.mk P X := by refine (AdjoinRoot.mk_eq_mk).2 ?_ simpa [U] using prop1_3_dvd_sub_X (๐•œ := ๐•œ) (P := P) (Q := Q) (n := k - 1) _ = AdjoinRoot.root P := by simp [AdjoinRoot.mk_X] have hcomp : ฯ€k.comp f = AlgHom.id ๐•œ (AdjoinRoot P) := by apply AdjoinRoot.algHom_ext -- It suffices to check the image of `root P`. simp [AlgHom.comp_apply, f, ฯ€k, AdjoinRoot.liftAlgHom_root, hฯ€kฮฑ] have hleft : Function.LeftInverse ฯ€k f := by intro x -- Apply the equality `ฯ€k.comp f = id` to `x`. simpa [AlgHom.comp_apply] using congrArg (fun g => g x) hcomp exact โŸจf, hleft.injectiveโŸฉ

Corollary 1.4. Let Unknown identifier `๐•œ`๐•œ be a field and Unknown identifier `P`P be an irreducible polynomial over Unknown identifier `๐•œ`๐•œ. If Unknown identifier `P'`sorry โ‰  0 : PropP' โ‰  0, then for every Unknown identifier `k`sorry โ‰ฅ 1 : Propk โ‰ฅ 1, the quotient failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1752704) Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`sorry[sorry] โงธ sorry ^ sorry : Type (max u_1 u_2)๐•œ[Unknown identifier `X`X]โงธ(Unknown identifier `P`P ^ Unknown identifier `k`k) contains failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1759483) 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) as a Unknown identifier `๐•œ`๐•œ-subalgebra.

theorem exists_residueField_algEquiv_subalgebra_adjoinRoot_pow (P : Polynomial ๐•œ) (hP : Irreducible P) (hP' : P.derivative โ‰  0) : โˆ€ k : โ„•, 1 โ‰ค k โ†’ โˆƒ S : Subalgebra ๐•œ (AdjoinRoot (P ^ k)), Nonempty (AdjoinRoot P โ‰ƒโ‚[๐•œ] S) := by classical intro k hk rcases exists_injective_algHom_adjoinRoot_to_adjoinRoot_pow (๐•œ := ๐•œ) (P := P) hP hP' k hk with โŸจf, hfโŸฉ refine โŸจf.range, ?_โŸฉ exact โŸจAlgEquiv.ofInjective f hfโŸฉ

Corollary 1.5. Let Unknown identifier `๐•œ`๐•œ be a field and Unknown identifier `P`P be an irreducible polynomial over Unknown identifier `๐•œ`๐•œ. If Unknown identifier `P'`sorry โ‰  0 : PropP' โ‰  0, then for every Unknown identifier `k`sorry โ‰ฅ 1 : Propk โ‰ฅ 1 the local ring failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1765935) Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`sorry[sorry] โงธ sorry ^ sorry : Type (max u_1 u_2)๐•œ[Unknown identifier `X`X]โงธ(Unknown identifier `P`P ^ Unknown identifier `k`k) admits the structure of an algebra over failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1772714) 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).

theorem nonempty_algebra_adjoinRoot_pow_over_adjoinRoot (P : Polynomial ๐•œ) (hP : Irreducible P) (hP' : P.derivative โ‰  0) : โˆ€ k : โ„•, 1 โ‰ค k โ†’ Nonempty (Algebra (AdjoinRoot P) (AdjoinRoot (P ^ k))) := by intro k hk rcases exists_injective_algHom_adjoinRoot_to_adjoinRoot_pow (๐•œ := ๐•œ) (P := P) hP hP' k hk with โŸจf, _โŸฉ exact โŸจf.toRingHom.toAlgebraโŸฉ

In AdjoinRoot (sorry ^ sorry) : Type u_1AdjoinRoot (Unknown identifier `P`P^Unknown identifier `k`k), the class of Unknown identifier `P`sorry ^ sorry : ?m.5P^Unknown identifier `n`n is the Unknown identifier `n`n-th power of the class of Unknown identifier `P`P.

lemma mk_pow_eq_pow_mk (P : Polynomial ๐•œ) (k n : โ„•) : (AdjoinRoot.mk (P ^ k)) (P ^ n) = ((AdjoinRoot.mk (P ^ k)) P) ^ n := by simp

In AdjoinRoot (sorry ^ sorry) : Type u_1AdjoinRoot (Unknown identifier `P`P^Unknown identifier `k`k), the class of Unknown identifier `P`P is nilpotent of index Unknown identifier `k`k.

lemma beta_pow_k_eq_zero (P : Polynomial ๐•œ) (k : โ„•) : (((AdjoinRoot.mk (P ^ k)) P) ^ k : AdjoinRoot (P ^ k)) = 0 := by have hmk : (AdjoinRoot.mk (P ^ k)) (P ^ k) = (0 : AdjoinRoot (P ^ k)) := (AdjoinRoot.mk_eq_zero (f := P ^ k) (g := P ^ k)).2 dvd_rfl calc (((AdjoinRoot.mk (P ^ k)) P) ^ k : AdjoinRoot (P ^ k)) = (AdjoinRoot.mk (P ^ k)) (P ^ k) := by simpa using (mk_pow_eq_pow_mk (P := P) (k := k) (n := k)).symm _ = 0 := hmk

In AdjoinRoot (sorry ^ sorry) : Type u_1AdjoinRoot (Unknown identifier `P`P^Unknown identifier `k`k), the class of Unknown identifier `P`sorry ^ (sorry - 1) : ?m.11P^(Unknown identifier `k`k-1) is nonzero when Unknown identifier `P`P is irreducible and Unknown identifier `k`sorry โ‰ฅ 1 : Propk โ‰ฅ 1.

lemma beta_pow_pred_ne_zero (P : Polynomial ๐•œ) (hP : Irreducible P) (k : โ„•) (hk : 1 โ‰ค k) : (((AdjoinRoot.mk (P ^ k)) P) ^ (k - 1) : AdjoinRoot (P ^ k)) โ‰  0 := by intro hzero have hmk : (AdjoinRoot.mk (P ^ k)) (P ^ (k - 1)) = (0 : AdjoinRoot (P ^ k)) := by calc (AdjoinRoot.mk (P ^ k)) (P ^ (k - 1)) = (((AdjoinRoot.mk (P ^ k)) P) ^ (k - 1) : AdjoinRoot (P ^ k)) := by simp _ = 0 := hzero have hdiv : (P ^ k) โˆฃ (P ^ (k - 1)) := (AdjoinRoot.mk_eq_zero (f := P ^ k) (g := P ^ (k - 1))).1 hmk have hle : k โ‰ค k - 1 := by -- Reduce to an inequality of exponents using `pow_dvd_pow_iff`. simpa using (pow_dvd_pow_iff (a := P) (m := k - 1) (n := k) hP.ne_zero hP.not_isUnit).1 hdiv have hkpos : 0 < k := Nat.succ_le_iff.mp (by simpa using hk) have hklt : k - 1 < k := by -- `k - 1 = k.pred`, and `k.pred < k` for `k โ‰  0`. simpa [Nat.pred_eq_sub_one] using (Nat.pred_lt (Nat.ne_of_gt hkpos)) exact (lt_irrefl k) (lt_of_le_of_lt hle hklt)

Descending elimination for relations among in AdjoinRoot (sorry ^ sorry) : Type u_1AdjoinRoot (Unknown identifier `P`P^Unknown identifier `k`k).

lemma coeffs_eq_zero_of_sum_smul_pows_eq_zero (P : Polynomial ๐•œ) (hP : Irreducible P) (k : โ„•) (hk : 1 โ‰ค k) [Algebra (AdjoinRoot P) (AdjoinRoot (P ^ k))] : โˆ€ g : Fin k โ†’ AdjoinRoot P, (โˆ‘ i : Fin k, g i โ€ข (((AdjoinRoot.mk (P ^ k)) P) ^ (i : โ„•)) = (0 : AdjoinRoot (P ^ k))) โ†’ โˆ€ j : Fin k, g j = 0 := by classical letI : Fact (Irreducible P) := โŸจhPโŸฉ intro g hsum j let ฮฒ : AdjoinRoot (P ^ k) := (AdjoinRoot.mk (P ^ k)) P have hฮฒk : (ฮฒ ^ k : AdjoinRoot (P ^ k)) = 0 := by simpa [ฮฒ] using (beta_pow_k_eq_zero (P := P) (k := k)) have hฮฒpred : (ฮฒ ^ (k - 1) : AdjoinRoot (P ^ k)) โ‰  0 := by simpa [ฮฒ] using (beta_pow_pred_ne_zero (P := P) (hP := hP) (k := k) (hk := hk)) have hsumฮฒ : (โˆ‘ i : Fin k, g i โ€ข (ฮฒ ^ (i : โ„•))) = (0 : AdjoinRoot (P ^ k)) := by simpa [ฮฒ] using hsum -- Prove all coefficients vanish by strong induction on their index. have hgNat : โˆ€ n : โ„•, โˆ€ hn : n < k, g โŸจn, hnโŸฉ = 0 := by intro n hn refine Nat.strong_induction_on n (fun n ih hn => ?_) hn have hnle : n โ‰ค k - 1 := Nat.le_pred_of_lt hn let m : โ„• := k - 1 - n have hmulR : (โˆ‘ i : Fin k, g i โ€ข (ฮฒ ^ (i : โ„•))) * (ฮฒ ^ m) = (0 : AdjoinRoot (P ^ k)) := by -- Multiply the original relation on the right by `ฮฒ^m`. simpa using congrArg (fun x : AdjoinRoot (P ^ k) => x * (ฮฒ ^ m)) hsumฮฒ have hmul : (โˆ‘ i : Fin k, g i โ€ข (ฮฒ ^ ((i : โ„•) + m))) = (0 : AdjoinRoot (P ^ k)) := by -- Rewrite the multiplied relation as a sum of shifted exponents. have hmulR' : (โˆ‘ i : Fin k, (g i โ€ข (ฮฒ ^ (i : โ„•))) * (ฮฒ ^ m)) = (0 : AdjoinRoot (P ^ k)) := by simpa [Finset.sum_mul] using hmulR have hsumEq : (โˆ‘ i : Fin k, g i โ€ข (ฮฒ ^ ((i : โ„•) + m))) = โˆ‘ i : Fin k, (g i โ€ข (ฮฒ ^ (i : โ„•))) * (ฮฒ ^ m) := by refine Finset.sum_congr rfl ?_ intro i hi -- Move the scalar through multiplication and combine the powers. have hpow : (ฮฒ ^ (i : โ„•)) * (ฮฒ ^ m) = ฮฒ ^ ((i : โ„•) + m) := by simpa using (pow_add ฮฒ (i : โ„•) m).symm calc g i โ€ข (ฮฒ ^ ((i : โ„•) + m)) = g i โ€ข ((ฮฒ ^ (i : โ„•)) * (ฮฒ ^ m)) := by simp [hpow] _ = (g i โ€ข (ฮฒ ^ (i : โ„•))) * (ฮฒ ^ m) := by simp exact hsumEq.trans hmulR' -- Isolate the `n`-th coefficient after multiplying by `ฮฒ^(k-1-n)`. let i0 : Fin k := โŸจn, hnโŸฉ have hsum_single : (โˆ‘ i : Fin k, g i โ€ข (ฮฒ ^ ((i : โ„•) + m))) = g i0 โ€ข (ฮฒ ^ (n + m)) := by -- All other terms vanish: those with smaller indices by IH, -- those with larger indices since `ฮฒ^k = 0`. have hsum_single' : (โˆ‘ i โˆˆ (Finset.univ : Finset (Fin k)), g i โ€ข (ฮฒ ^ ((i : โ„•) + m))) = g i0 โ€ข (ฮฒ ^ (n + m)) := by refine Finset.sum_eq_single i0 ?_ ?_ ยท intro i hi hne by_cases hlt : (i : โ„•) < n ยท have hgi : g i = 0 := by have hi' : g โŸจ(i : โ„•), i.isLtโŸฉ = 0 := ih (i : โ„•) hlt i.isLt simpa [Fin.eta i i.isLt] using hi' simp [hgi] ยท have hneval : (i : โ„•) โ‰  n := by intro hEq apply hne apply Fin.ext simpa [i0] using hEq have hgt : n < (i : โ„•) := lt_of_le_of_ne (Nat.le_of_not_gt hlt) (Ne.symm hneval) have hn1le : n + 1 โ‰ค (i : โ„•) := Nat.succ_le_of_lt hgt have hm' : m = k - (n + 1) := by dsimp [m] simp [Nat.sub_sub, Nat.add_comm] have hk_le : k โ‰ค (i : โ„•) + m := by have hk0 : (n + 1) + m = k := by simpa [hm'] using (Nat.add_sub_of_le (Nat.succ_le_of_lt hn)) have := Nat.add_le_add_right hn1le m simpa [hk0] using this have hpow0 : (ฮฒ ^ ((i : โ„•) + m) : AdjoinRoot (P ^ k)) = 0 := pow_eq_zero_of_le hk_le hฮฒk simp [hpow0] ยท intro hi0 exact False.elim (by simp at hi0) simpa using hsum_single' have hgi0 : g i0 โ€ข (ฮฒ ^ (k - 1) : AdjoinRoot (P ^ k)) = 0 := by have hn_m : n + m = k - 1 := by simpa [m] using (Nat.add_sub_of_le hnle) -- Rewrite the sum as a single term and use `hmul = 0`. have : g i0 โ€ข (ฮฒ ^ (n + m) : AdjoinRoot (P ^ k)) = 0 := by have hmul' := hmul -- Replace the sum with its single surviving term. rw [hsum_single] at hmul' simpa using hmul' -- Rewrite `n + m` as `k - 1`. exact hn_m โ–ธ this -- Cancel the nonzero vector `ฮฒ^(k-1)` to get `g i0 = 0`. by_contra hne0 have hu : IsUnit (g i0) := (isUnit_iff_ne_zero).2 hne0 have : (ฮฒ ^ (k - 1) : AdjoinRoot (P ^ k)) = 0 := (IsUnit.smul_eq_zero hu).1 hgi0 exact hฮฒpred this -- Convert the `โ„•`-indexed statement back to `Fin k`. have hj' : g โŸจ(j : โ„•), j.isLtโŸฉ = 0 := hgNat (j : โ„•) j.isLt simpa [Fin.eta j j.isLt] using hj'

Lemma 1.6. Let Unknown identifier `๐•œ`๐•œ be a field and Unknown identifier `P`P be an irreducible polynomial over Unknown identifier `๐•œ`๐•œ. If Unknown identifier `P'`sorry โ‰  0 : PropP' โ‰  0, then for every Unknown identifier `k`sorry โ‰ฅ 1 : Propk โ‰ฅ 1, the family in failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1788950) Iff Hint: Type class instance resolution failures can be inspected with the `set_option trace.Meta.synthInstance true` command.Unknown identifier `๐•œ`sorry[sorry] โงธ sorry ^ sorry : Type (max u_1 u_2)๐•œ[Unknown identifier `X`X]โงธ(Unknown identifier `P`P^Unknown identifier `k`k) is linearly independent over failed to synthesize instance of type class GetElem Prop Prop (Type ?u.1795729) 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).

lemma linearIndependent_powers_mk_adjoinRoot_pow (P : Polynomial ๐•œ) (hP : Irreducible P) (hP' : P.derivative โ‰  0) (k : โ„•) (hk : 1 โ‰ค k) [Algebra (AdjoinRoot P) (AdjoinRoot (P ^ k))] : LinearIndependent (AdjoinRoot P) (fun i : Fin k => AdjoinRoot.mk (P ^ k) (P ^ (i : โ„•))) := by classical -- `hP'` is logically irrelevant here (we assume the `Algebra` structure already), -- but is part of the textbook statement. by_cases hder0 : P.derivative = 0 ยท exact False.elim (hP' hder0) -- Reduce to vanishing of coefficients in a finite linear combination. refine (Fintype.linearIndependent_iff).2 ?_ intro g hg j have hg' : (โˆ‘ i : Fin k, g i โ€ข (((AdjoinRoot.mk (P ^ k)) P) ^ (i : โ„•)) = (0 : AdjoinRoot (P ^ k))) := by simpa [mk_pow_eq_pow_mk (P := P) (k := k)] using hg exact coeffs_eq_zero_of_sum_smul_pows_eq_zero (P := P) (hP := hP) (k := k) (hk := hk) g hg' j

The algebra map Unknown identifier `ฯˆโ‚–`ฯˆโ‚– sending the class of Unknown identifier `X`X in AdjoinRoot (sorry ^ sorry) : Type u_1AdjoinRoot (Unknown identifier `X`X^Unknown identifier `k`k) to the class of Unknown identifier `P`P.

noncomputable def psiK (P : Polynomial ๐•œ) (k : โ„•) [Algebra (AdjoinRoot P) (AdjoinRoot (P ^ k))] : AdjoinRoot ((Polynomial.X : Polynomial (AdjoinRoot P)) ^ k) โ†’โ‚[AdjoinRoot P] AdjoinRoot (P ^ k) := by classical let ฮฒ : AdjoinRoot (P ^ k) := AdjoinRoot.mk (P ^ k) P refine AdjoinRoot.liftAlgHom ((Polynomial.X : Polynomial (AdjoinRoot P)) ^ k) (Algebra.ofId (AdjoinRoot P) (AdjoinRoot (P ^ k))) ฮฒ ?_ have hฮฒk : (ฮฒ ^ k : AdjoinRoot (P ^ k)) = 0 := by simpa [ฮฒ] using (beta_pow_k_eq_zero (P := P) (k := k)) -- `X` maps to `ฮฒ`, hence `X^k` maps to `ฮฒ^k = 0`. simp [ฮฒ, Polynomial.evalโ‚‚_pow, hฮฒk]
lemma psiK_def_and_root (P : Polynomial ๐•œ) (k : โ„•) [Algebra (AdjoinRoot P) (AdjoinRoot (P ^ k))] : psiK (P := P) (k := k) (AdjoinRoot.root ((Polynomial.X : Polynomial (AdjoinRoot P)) ^ k)) = AdjoinRoot.mk (P ^ k) P := by classical simp [psiK, AdjoinRoot.liftAlgHom_root]

Injectivity of Unknown identifier `ฯˆโ‚–`ฯˆโ‚–, deduced from the linear independence of (Lemma 1.6).

lemma psiK_injective (P : Polynomial ๐•œ) (hP : Irreducible P) (hP' : P.derivative โ‰  0) (k : โ„•) (hk : 1 โ‰ค k) [Algebra (AdjoinRoot P) (AdjoinRoot (P ^ k))] : Function.Injective (psiK (P := P) (k := k)) := by classical haveI : Fact (Irreducible P) := โŸจhPโŸฉ let ฮฒ : AdjoinRoot (P ^ k) := AdjoinRoot.mk (P ^ k) P let f : Polynomial (AdjoinRoot P) := (Polynomial.X : Polynomial (AdjoinRoot P)) ^ k have hf : f โ‰  0 := by simp [f] let pb : PowerBasis (AdjoinRoot P) (AdjoinRoot f) := AdjoinRoot.powerBasis (K := AdjoinRoot P) hf have hdim : pb.dim = k := by simp [pb, f] have hpb_gen : pb.gen = AdjoinRoot.root f := by simp [pb] have hฮฒ_li : LinearIndependent (AdjoinRoot P) (fun i : Fin pb.dim => ฮฒ ^ (i : โ„•)) := by have hฮฒ_li' : LinearIndependent (AdjoinRoot P) (fun i : Fin k => ฮฒ ^ (i : โ„•)) := by -- This is exactly Lemma 1.6, rewritten from `mk (P^k) (P^i)` to `ฮฒ^i`. simpa [ฮฒ, mk_pow_eq_pow_mk (P := P) (k := k)] using (linearIndependent_powers_mk_adjoinRoot_pow (P := P) (hP := hP) (hP' := hP') (k := k) (hk := hk)) -- Transport along the index equivalence `Fin pb.dim โ‰ƒ Fin k`. have hฮฒ_li'' : LinearIndependent (AdjoinRoot P) (fun i : Fin pb.dim => ฮฒ ^ ((finCongr hdim i) : โ„•)) := by simpa using (linearIndependent_equiv (finCongr hdim) (f := fun i : Fin k => ฮฒ ^ (i : โ„•))).2 hฮฒ_li' simpa [finCongr_apply_coe] using hฮฒ_li'' -- First show that the kernel of `ฯˆโ‚–` is trivial, using the power basis of `AdjoinRoot (X^k)`. have hker : โˆ€ x : AdjoinRoot f, psiK (P := P) (k := k) x = 0 โ†’ x = 0 := by intro x hx let ฯˆ : AdjoinRoot f โ†’โ‚[AdjoinRoot P] AdjoinRoot (P ^ k) := psiK (P := P) (k := k) let ฯ† : AdjoinRoot f โ†’โ‚—[AdjoinRoot P] AdjoinRoot (P ^ k) := ฯˆ.toLinearMap have hx' : ฯ† x = 0 := by simpa [ฯ†] using hx have hฯˆ_root : ฯˆ (AdjoinRoot.root f) = ฮฒ := by simpa [ฯˆ, f, ฮฒ] using (psiK_def_and_root (P := P) (k := k)) have hฯ†_gen_pow : โˆ€ i : Fin pb.dim, ฯ† (pb.gen ^ (i : โ„•) : AdjoinRoot f) = (ฮฒ ^ (i : โ„•) : AdjoinRoot (P ^ k)) := by intro i calc ฯ† (pb.gen ^ (i : โ„•) : AdjoinRoot f) = ฯˆ (pb.gen ^ (i : โ„•) : AdjoinRoot f) := by rfl _ = (ฯˆ pb.gen) ^ (i : โ„•) := by simp [map_pow] _ = (ฯˆ (AdjoinRoot.root f)) ^ (i : โ„•) := by simp [hpb_gen] _ = (ฮฒ : AdjoinRoot (P ^ k)) ^ (i : โ„•) := by simp [hฯˆ_root] -- Expand `x` in the power basis, apply `ฯ†`, and get a linear relation among the `ฮฒ^i`. have hsum0 : (โˆ‘ i : Fin pb.dim, (pb.basis.repr x i) โ€ข (ฮฒ ^ (i : โ„•) : AdjoinRoot (P ^ k))) = 0 := by have hrepr : (โˆ‘ i : Fin pb.dim, (pb.basis.repr x i) โ€ข (pb.basis i : AdjoinRoot f)) = x := by simpa using (pb.basis.sum_repr x) have hmap0 : ฯ† (โˆ‘ i : Fin pb.dim, (pb.basis.repr x i) โ€ข (pb.basis i : AdjoinRoot f)) = 0 := by simpa [hx'] using congrArg ฯ† hrepr have hsum0' : (โˆ‘ i : Fin pb.dim, (pb.basis.repr x i) โ€ข ฯ† (pb.basis i : AdjoinRoot f)) = 0 := by simpa [map_sum, LinearMap.map_smul] using hmap0 simpa [PowerBasis.coe_basis, hฯ†_gen_pow] using hsum0' -- Linear independence forces all coefficients to vanish. have hcoeff : โˆ€ j : Fin pb.dim, (pb.basis.repr x j) = 0 := by have hiff := (Fintype.linearIndependent_iff).1 hฮฒ_li exact hiff (fun i => pb.basis.repr x i) hsum0 have hrepro : pb.basis.repr x = 0 := by ext j exact hcoeff j exact (pb.basis.repr.map_eq_zero_iff).1 hrepro -- Conclude injectivity. intro x y hxy -- Work in the domain `AdjoinRoot f`, rewriting via `hdim`. have hsub : psiK (P := P) (k := k) (x - y) = 0 := by simp [map_sub, hxy] have : (x - y : AdjoinRoot f) = 0 := hker (x - y) hsub exact sub_eq_zero.mp this

The AdjoinRoot sorry : Type u_1AdjoinRoot Unknown identifier `P`P-dimension of AdjoinRoot (sorry ^ sorry) : Type u_1AdjoinRoot (Unknown identifier `X`X^Unknown identifier `k`k) is Unknown identifier `k`k.

lemma finrank_domain_over_adjoinRoot_eq_k (P : Polynomial ๐•œ) (hP : Irreducible P) (k : โ„•) : Module.finrank (AdjoinRoot P) (AdjoinRoot ((Polynomial.X : Polynomial (AdjoinRoot P)) ^ k)) = k := by classical haveI : Fact (Irreducible P) := โŸจhPโŸฉ set f : Polynomial (AdjoinRoot P) := (Polynomial.X : Polynomial (AdjoinRoot P)) ^ k have hf : f โ‰  0 := by simp [f] -- Use the standard power basis for `AdjoinRoot f` over a field. simpa [f, AdjoinRoot.powerBasis_dim (K := AdjoinRoot P) (f := f) hf, Polynomial.natDegree_X_pow] using (PowerBasis.finrank (AdjoinRoot.powerBasis (K := AdjoinRoot P) hf))
end SomeLocalRings