Fixed-start chains and their frames survive coefficient limits
ProvedDerivativeChainPrivate.framed_power_chain_collision_limitderivative-chainshigher-power-supportsharp-cubic-radius
For a finite complex list write . Fix , a tail index , reference index , and start . Let degree-at-most- polynomials converge coefficientwise to such a polynomial . Suppose uniformly bounded lists lie in the roots of , start at , and are constant from to the chosen reference entry. Assume each list admits unit orthogonal coefficients with nondecreasing projections, and . There is a corresponding root list for with the same start and tail, unit orthogonal frames, monotone projections, and length at most . Degree equality with is not assumed.
Preamble
import Mathlib import Definitions.Def_DerivativeChainPrivate_foundations open DerivativeChainPrivate Polynomial MeasureTheory Filter Set Topology Metric Function ComplexConjugate open scoped BigOperators ComplexOrder Topology set_option autoImplicit false set_option backward.isDefEq.respectTransparency false set_option maxHeartbeats 0 set_option maxRecDepth 100000
Formal statement
theorem DerivativeChainPrivate.framed_power_chain_collision_limit (n k : ℕ) [NeZero n] (last : Fin n) (p : ℕ → Polynomial ℂ) (q : Polynomial ℂ)
(hp : ∀ j, (p j).natDegree ≤ n) (hq : q.natDegree ≤ n)
(hc : ∀ k, Tendsto (fun j => (p j).coeff k) atTop (𝓝 (q.coeff k)))
(z : ℕ → Fin n → ℂ) (a b : ℕ → ℂ) (M : ℝ) (hM : 0 ≤ M)
(hbound : ∀ j i, ‖z j i‖ ≤ M)
(hroot : ∀ j i, (Polynomial.derivative^[n-(i.val+1)] (p j)).eval (z j i) = 0)
(η : ℂ) (hstart : ∀ j, z j 0 = η)
(htail : ∀ j i, k ≤ i.val → z j i = z j last)
(ha : ∀ j, ‖a j‖ = 1) (hb : ∀ j, ‖b j‖ = 1)
(hab : ∀ j, (a j*starRingEnd ℂ (b j)).re = 0)
(hmonoA : ∀ j, Monotone (fun i => (a j*z j i).re))
(hmonoB : ∀ j, Monotone (fun i => (b j*z j i).re))
(c : ℕ → ℝ) (C : ℝ) (hcLim : Tendsto c atTop (𝓝 C))
(hcost : ∀ j, chainCost (z j) ≤ c j) :
∃ (w : Fin n → ℂ) (A B : ℂ),
(∀ i, (Polynomial.derivative^[n-(i.val+1)] q).eval (w i) = 0) ∧
w 0 = η ∧ (∀ i : Fin n, k ≤ i.val → w i = w last) ∧
‖A‖ = 1 ∧ ‖B‖ = 1 ∧ (A*starRingEnd ℂ B).re = 0 ∧
Monotone (fun i => (A*w i).re) ∧ Monotone (fun i => (B*w i).re) ∧ chainCost w ≤ C := by sorrySource