A Chebyshev bound at one alternating peak
ProvedErdosProblems.Erdos1041.SharpCollinearChebyshev.exists_peak_le_comparisonBoundchebysheverdos-1041-collinearsign-alternation
Let be monic of degree , vanish at and , and have alternating signs at strictly ordered points inside . Then at least one of those points has , where . This specializes the abstract comparison principle to the scaled Chebyshev comparator.
Preamble
import Definitions.Def_ErdosProblems_Erdos1041_SharpCollinearChebyshev import Mathlib.Algebra.Polynomial.Degree.IsMonicOfDegree import Mathlib.Algebra.Polynomial.Roots import Mathlib.Analysis.SpecialFunctions.Trigonometric.Chebyshev.RootsExtrema import Mathlib.Data.Real.Basic import Mathlib.RingTheory.Polynomial.ScaleRoots import Mathlib.Tactic.Choose import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Ring import Mathlib.Topology.Algebra.Polynomial import Mathlib.Topology.Order.IntermediateValue /-! # The sharp Chebyshev comparator for collinear Erdos #1041 For degree `n`, put `r = cos (pi / (2n))`. The polynomial `T_n(r X) / (2^(n-1) r^n)` is monic, vanishes at `-1` and `1`, and has absolute value at most `1 / (2^(n-1) r^n)` on `[-1,1]`. Combining these facts with the constrained alternation theorem gives the sharp upper bound for one of the alternating interior peaks of any monic comparison polynomial with the same endpoint zeros. -/ open Set open Polynomial open ErdosProblems.Erdos1041.SharpCollinearAlternation open ErdosProblems.Erdos1041.SharpCollinearChebyshev
Formal statement
theorem ErdosProblems.Erdos1041.SharpCollinearChebyshev.exists_peak_le_comparisonBound
{m : ℕ} {p : ℝ[X]} {c : Fin (m + 1) → ℝ}
(hp : p.IsMonicOfDegree (m + 2))
(hc : StrictMono c) (ha : -1 < c 0) (hb : c (Fin.last m) < 1)
(hpa : p.eval (-1) = 0) (hpb : p.eval 1 = 0)
(hpalt : ∀ i : Fin m,
p.eval (c i.castSucc) * p.eval (c i.succ) < 0)
(hc_mem : ∀ i : Fin (m + 1), |c i| ≤ 1) :
∃ i : Fin (m + 1), |p.eval (c i)| ≤ comparisonBound (m + 2) := by sorry
Source
Lean source: https://github.com/wcook04/plectis-erdos-lean/blob/c93c2e4dd86a2e317e0cb650ea244fee1afd59c2/ErdosProblems/Erdos1041/SharpCollinearChebyshev.lean#L130-L149