ProximityPrize.SubmissionLower.HFree6812.multiplicity_theorem
ProvedProximityPrize.SubmissionLower.HFree6812.multiplicity_theorem_yukon_6d33027804cdbetter-codes
(ii) The local multiplicity theorem: if R ⊆ O_v, D R ⊆ R + R σ with
pole σ ≤ T, s ≤ T, and some f ∈ R has ord f = n₁ with n₁ a unit in K, then
θ := T + n₁ satisfies the derivation-order lemma.
Preamble
import Mathlib.RingTheory.Valuation.ValuationSubring
import Mathlib.RingTheory.Derivation.Basic
import Mathlib.Algebra.Polynomial.Derivative
import Mathlib.Algebra.Polynomial.Lifts
import Mathlib.Algebra.Field.Subfield.Basic
import Mathlib.RingTheory.LocalRing.ResidueField.Basic
import Mathlib.FieldTheory.Separable
import Init
import Definitions.Def_Yukon_a9a7f17ede75ca0ceb0597e1
set_option backward.isDefEq.respectTransparency.types false
namespace Polynomial
end Polynomial
namespace WithZero
end WithZero
namespace ProximityPrize.SubmissionLower.HFree6812
open WithZero Polynomial
section Core
variable {K L : Type*} [Field K] [Field L] [Algebra K L]
variable (v : Valuation L ℤᵐ⁰) (D : Derivation K L L)
Formal statement
/-- (ii) The local multiplicity theorem: if `R ⊆ O_v`, `D R ⊆ R + R σ` with
`pole σ ≤ T`, `s ≤ T`, and some `f ∈ R` has `ord f = n₁` with `n₁` a unit in `K`, then
`θ := T + n₁` satisfies the derivation-order lemma. -/
theorem multiplicity_theorem_yukon_6d33027804cd [v.IsTrivialOn K] (π : L) (hπ : v π = exp (-1)) (s : ℤ)
(hs : 0 ≤ s) (C : ℤ) (hcont : CrudeBound v D C) (hsep : ResiduallySeparable v D (exp s))
(R : Subring L) (hR : ∀ r ∈ R, v r ≤ 1) (σ : L) (T : ℤ) (hT : 0 ≤ T)
(hσ : v σ ≤ exp T) (hDR : ∀ r ∈ R, ∃ a ∈ R, ∃ b ∈ R, D r = a + b * σ) (hsT : s ≤ T)
(f : L) (hfR : f ∈ R) (n : ℕ) (hn : (n : K) ≠ 0) (hf : v f = exp (-(n : ℤ))) :
v (D π) ≤ exp (T + n - 1) ∧ ∀ g : L, v (D g) ≤ exp (T + n) * v g := by sorry
end Core
end HFree6812
end SubmissionLower
end ProximityPrize
Source