Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1.3 — slow growth of the derivative orders in the frequency schedule

Open
TorusEuler.paperLemma13_slowOrders

by LG · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

eulerfinite-time-blowupfluid-dynamicspde

Lemma 1.3 of the frozen manuscript (cc:uf:tower:lem:slow-orders). Fix an integer b≥1b\ge1b≥1, a threshold function B:N→RB:\mathbb{N}\to\mathbb{R}B:N→R, a frequency sequence λ:N→R\lambda:\mathbb{N}\to\mathbb{R}λ:N→R (written freq, with λi\lambda_iλi​ = freq i), and an order sequence q:N→Nq:\mathbb{N}\to\mathbb{N}q:N→N, and write K(s)=320b(s+1)K(s)=320b(s+1)K(s)=320b(s+1) (frequencyExponent). Assume:

  1. q1=1q_1=1q1​=1 and B(1)≤λ0B(1)\le\lambda_0B(1)≤λ0​;
  2. λi+1=λiK(qi+1)\lambda_{i+1}=\lambda_i^{K(q_{i+1})}λi+1​=λiK(qi+1​)​ for every iii;
  3. for every iii, qi+2q_{i+2}qi+2​ is the greatest element of {s:1≤s≤qi+1+1, B(s)≤λi}\{s: 1\le s\le q_{i+1}+1,\ B(s)\le\lambda_i\}{s:1≤s≤qi+1​+1, B(s)≤λi​} (the schedule's max-selection, with the paper's index j=i+1j=i+1j=i+1);
  4. B(s)>0B(s)>0B(s)>0 and log⁡B(s)≥4K(s+1)3\log B(s)\ge 4K(s+1)^3logB(s)≥4K(s+1)3 for every s≥1s\ge1s≥1.

Then the orders grow by at most one and tend to infinity,

qj≤qj+1≤qj+1(j≥1),qj→∞,q_j\le q_{j+1}\le q_j+1\quad(j\ge1),\qquad q_j\to\infty,qj​≤qj+1​≤qj​+1(j≥1),qj​→∞,

and the logarithmic gains Lj=4log⁡λj+1L_j=4\log\lambda_{j+1}Lj​=4logλj+1​ obey the uniform bound

Lj+1≤(log⁡λj−1)2(j≥1),L_{j+1}\le(\log\lambda_{j-1})^2\quad(j\ge1),Lj+1​≤(logλj−1​)2(j≥1),

which in the statement's zero-based frequency index reads 4log⁡λi+3≤(log⁡λi)24\log\lambda_{i+3}\le(\log\lambda_i)^24logλi+3​≤(logλi​)2 for all iii.

This is the schedule lemma that keeps the fixed-order constant losses of the construction below small powers of the frequencies, however fast BBB grows; it is proved in Appendix C of the manuscript.

Formalization Note The paper chooses BBB 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 (q1=1q_1=1q1​=1) while frequencies are zero-based (λ0=N\lambda_0=Nλ0​=N), exactly as in the schedule (1.14); the docstring records the shift i=j−1i=j-1i=j−1.

Preamble
import Mathlib
import Definitions.Def_TorusEuler_Schedule

open Filter Set
open scoped ContDiff InnerProductSpace
Formal statement
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 TorusEuler
Source
Alpöge–Buckmaster–Coiculescu, *Finite-Time Singularity Formation for the Three-Dimensional Euler Equations*, frozen manuscript of 18 November 2026 (torus-paper-freeze-2026-11-18). Lean: https://github.com/mcoiculescu/EulerBlowupPublic/blob/36d3961161f8e7bba9cc8f671e5d0c4a27281239/formalization/lean/TorusEuler/PaperParameterAndLaunchStatements.lean#L14; TeX: https://github.com/mcoiculescu/EulerBlowupPublic/blob/36d3961161f8e7bba9cc8f671e5d0c4a27281239/frozen-manuscript/sections/01b_parameters.tex#L54 (cc:uf:tower:lem:slow-orders), schedule (cc:uf:tower:eq:schedule).
Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me