ProximityPrize.SubmissionLower.HFree6812.pi_bound_of_element
ProvedProximityPrize.SubmissionLower.HFree6812.pi_bound_of_element_yukon_082a13d8a402better-codes
(ii) One element f with ord f = n, pole (D f) ≤ T, n a unit in K, and
s ≤ T force 1 - ord (Dπ) ≤ T + n.
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) One element `f` with `ord f = n`, `pole (D f) ≤ T`, `n` a unit in `K`, and
`s ≤ T` force `1 - ord (Dπ) ≤ T + n`. -/
theorem pi_bound_of_element_yukon_082a13d8a402 [v.IsTrivialOn K] (π : L) (hπ : v π = exp (-1)) (s T : ℤ)
(hsT : s ≤ T) (hint : ∀ u : L, v u ≤ 1 → v (D u) ≤ max (exp s) (v (D π)))
(f : L) (n : ℕ) (hn : (n : K) ≠ 0) (hf : v f = exp (-(n : ℤ)))
(hDf : v (D f) ≤ exp T) :
v (D π) ≤ exp (T + n - 1) := by sorry
end Core
end HFree6812
end SubmissionLower
end ProximityPrize
Source