ProximityPrize.SubmissionLower.HFree6812.derivation_order_iterate_pole
ProvedProximityPrize.SubmissionLower.HFree6812.derivation_order_iterate_pole_yukon_9a1a3b6a87f3better-codes
Iterated pole form: pole (Dᵏ f) ≤ pole f + k θ.
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
/-- Iterated pole form: `pole (Dᵏ f) ≤ pole f + k θ`. -/
theorem derivation_order_iterate_pole_yukon_9a1a3b6a87f3 (π : L) (hπ : v π = exp (-1)) (s θ : ℤ) (hs : 0 ≤ s)
(hsθ : s ≤ θ) (hπθ : v (D π) ≤ exp (θ - 1)) (C : ℤ)
(hcont : CrudeBound v D C) (hsep : ResiduallySeparable v D (exp s)) (k : ℕ) (f : L) :
max 0 (v ((⇑D)^[k] f)).log ≤ max 0 (v f).log + k * θ := by sorry
end Core
end HFree6812
end SubmissionLower
end ProximityPrize
Source