ProximityPrize.SubmissionLower.HFree6812.derivation_order_iterate
ProvedProximityPrize.SubmissionLower.HFree6812.derivation_order_iterate_yukon_37deb23af724better-codes
(i) Iterated: ord (Dᵏ f) ≥ ord 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
/-- (i) Iterated: `ord (Dᵏ f) ≥ ord f - k θ`. -/
theorem derivation_order_iterate_yukon_37deb23af724 (π : 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) :
v ((⇑D)^[k] f) ≤ exp (k * θ) * v f := by sorry
end Core
end HFree6812
end SubmissionLower
end ProximityPrize
Source