Every gap attains the scaled Chebyshev height
ProvedErdosProblems.Erdos1041.PaperCompleteR21.chebyshev_configuration_attainschebysheverdos-1041-collinearsharp-inequality
Let , let with , and let . Form the monic polynomial whose roots are , where are the scaled Chebyshev nodes. Their diameter is , and on every segment joining successive nodes there is a point where , with . This is an attaining family, not a classification of all equality cases.
Preamble
import Definitions.Def_ErdosProblems_Erdos1041_SharpCollinearChebyshev import Definitions.Def_ErdosProblems_Erdos1041_PaperCompleteR21_CollinearDiameterWhole import Mathlib 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 /-! # Erdős 1041: the sharp Chebyshev bound for collinear roots, with sharpness Paper-form restatement of * `res:sharp-collinear-root-diameter` (`paper/1041/erdos-1041-lemniscate-newton-flow.tex`, line 1155), * `thm:sharp-collinear-diameter` (`paper/reasoning-parts/erdos1041/core.tex`, line 1715), * `cor:collinear-erdos-1041` (`paper/reasoning-parts/erdos1041/core.tex`, line 1769). A monic complex polynomial of degree `n` whose zero occurrences are collinear is written here in its factored form `∏ k, (X - C (base + dir * y k))` with `‖dir‖ = 1` and `y : Fin n → ℝ`: that is exactly "monic of degree `n` with all zero occurrences on one line", the line being `base + dir * ℝ`. The diameter `D` of the zero occurrences is carried as the hypothesis that `D` is the greatest pairwise distance between zero occurrences. The existing tree modules `SharpCollinearAlternation` and `SharpCollinearChebyshev` supply the alternation/Chebyshev kernel: for a monic real `p` of degree `m + 2` vanishing at `±1` and alternating in sign at `m + 1` ordered interior points, one of those points has `|p| ≤ comparisonBound (m+2)`. This file supplies everything the paper's proof needs around that kernel: * the rigid normalisation (translation, rotation, scaling by `R = D/2`) and the transport identity `‖f (base + dir * s)‖ = R ^ n * |q ((s - mid)/R)|`; * the existence of a maximiser of `|q|` in each root gap, and the fact that it is interior; * the sign alternation of those gap maxima, proved directly from the product form of `q`; * the upgrade from the kernel's pointwise conclusion to a bound on the WHOLE selected segment, which is where "`c i` is the gap maximum" is used; * the repeated-zero (constant path) case; * the sharpness clauses: the scaled Chebyshev configuration, its extreme zeros at distance `D`, a point of every adjacent gap at which the bound is attained with equality, and hence that no smaller constant works in any degree. -/ set_option autoImplicit false set_option maxHeartbeats 1600000 noncomputable section open Polynomial Finset Set open ErdosProblems.Erdos1041.SharpCollinearChebyshev /-! ### The constant `C_n = 1 / (2^(n-1) cos^n (π/(2n)))` -/ /-! ### A monic product of linear factors -/ /-! ### Sign alternation between consecutive root gaps -/ /-! ### Gap maxima -/ /-! ### The normalised core: a whole gap below `C_n` -/ /-! ### Transport between the root line and `ℝ` -/ /-! ### The sharp collinear root-diameter theorem -/ /-! ### The Erdős case: a short curve inside the unit lemniscate -/ /-! ### Sharpness: the scaled Chebyshev root configuration -/ open ErdosProblems.Erdos1041.PaperCompleteR21
Formal statement
theorem ErdosProblems.Erdos1041.PaperCompleteR21.chebyshev_configuration_attains {m : ℕ} (base dir : ℂ) (hdir : ‖dir‖ = 1)
{R : ℝ} (hR : 0 < R) (f : ℂ[X])
(hf : f = ∏ k : Fin (m + 2), (X - C (base + dir * ((R * chebNode m k : ℝ) : ℂ)))) :
IsGreatest {d : ℝ | ∃ j k : Fin (m + 2),
d = dist (base + dir * ((R * chebNode m j : ℝ) : ℂ))
(base + dir * ((R * chebNode m k : ℝ) : ℂ))} (2 * R) ∧
∀ i : Fin (m + 1),
∃ z ∈ segment ℝ (base + dir * ((R * chebNode m i.castSucc : ℝ) : ℂ))
(base + dir * ((R * chebNode m i.succ : ℝ) : ℂ)),
‖f.eval z‖ = comparisonBound (m + 2) * R ^ (m + 2) := by sorry
Source
Lean source: https://github.com/wcook04/plectis-erdos-lean/blob/c93c2e4dd86a2e317e0cb650ea244fee1afd59c2/ErdosProblems/Erdos1041/PaperCompleteR21/CollinearDiameterWhole.lean#L765-L830