Lemma 1.3 — slow growth of the derivative orders in the frequency schedule
OpenTorusEuler.paperLemma13_slowOrdersLemma 1.3 of the frozen manuscript (cc:uf:tower:lem:slow-orders). Fix an integer , a threshold function , a frequency sequence (written freq, with = freq i), and an order sequence , and write (frequencyExponent). Assume:
- and ;
- for every ;
- for every , is the greatest element of (the schedule's max-selection, with the paper's index );
- and for every .
Then the orders grow by at most one and tend to infinity,
and the logarithmic gains obey the uniform bound
which in the statement's zero-based frequency index reads for all .
This is the schedule lemma that keeps the fixed-order constant losses of the construction below small powers of the frequencies, however fast grows; it is proved in Appendix C of the manuscript.
Formalization Note The paper chooses nondecreasing; the formal statement (the authors' own) does not need monotonicity and assumes only positivity and the floor bound. The order sequence is one-based () while frequencies are zero-based (), exactly as in the schedule (1.14); the docstring records the shift .
import Mathlib import Definitions.Def_TorusEuler_Schedule open Filter Set open scoped ContDiff InnerProductSpace
namespace TorusEuler
/-- `cc:uf:tower:lem:slow-orders`, with `i = j - 1`. The gain `L_(j+1)` is
`4 * log (freq (i+3))` under the schedule in (1.14). -/
theorem paperLemma13_slowOrders (b : ℕ) (B freq : ℕ → ℝ) (q : ℕ → ℕ)
(hb : 1 ≤ b) (hq : q 1 = 1) (hInitial : B 1 ≤ freq 0)
(hFrequency : ∀ i, freq (i + 1) = freq i ^ frequencyExponent b (q (i + 1)))
(hMaximum : ∀ i,
IsGreatest {s | 1 ≤ s ∧ s ≤ q (i + 1) + 1 ∧ B s ≤ freq i} (q (i + 2)))
(hPositive : ∀ s, 1 ≤ s → 0 < B s)
(hFloor : ∀ s, 1 ≤ s → 4 * (frequencyExponent b (s + 1) : ℝ) ^ 3 ≤ Real.log (B s)) :
(∀ i, q (i + 1) ≤ q (i + 2) ∧ q (i + 2) ≤ q (i + 1) + 1) ∧
Tendsto q atTop atTop ∧ ∀ i, 4 * Real.log (freq (i + 3)) ≤ (Real.log (freq i)) ^ 2 := by sorry
end TorusEulerConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.