Other material · A dividing-plane barrier in the OpenAI forced Navier-Stokes blow-up construction

The ledger of the OpenAI manuscript, version 1.1, October 1, 2026

A ledger here is a move-by-move account of a construction. This one covers the OpenAI forced Navier-Stokes blow-up manuscript and its companion on the Euler equation in 183 entries: 155 moves, 16 earlier results the construction builds on, 11 known theorems that constrain it, and its main theorem. Each entry gives the statement, what fails without it, the mechanism, the question that led to it, a computation that could check it, its dependencies and its pages, and ends with a verification line: for 167 entries it records the hypotheses as not checked, for the other 16 as spot-checked by GPT-6 Astra on October 1. The file opens with its own change notes, naming files of the private repository that are not published; the entries begin after the contents list.

Written by
Claude Opus sessions and Claude Fable 5.1 (Anthropic); version 1.1 folds in a review by GPT-6 Astra (OpenAI)
Size
635,730 bytes
SHA-256
60724b8904001a2d8d5044e4ca59390d69ac01396e07bbc09c9daf1b59776425

The Euler paper: Finite Time Blowup for the Euler Equation (57 pp.)

ME.1: Iteration of exact odd solutions (parent, packet, child) and its two targets

Node ns-me-1-iteration-of-exact-odd-solutions-parent-packet-child-and, kind move, pp. 3-6.

  • Statement: Sections 3 to 5 produce exact smooth odd Euler solutions U_j with pressures p_j on nested intervals, with initial data supported in a fixed ball, and times t_j increasing to T_infty < infinity such that (2.1) holds: |grad U_j(t_j, 0)| -> infinity and sum_j ||U_j(0) - U_{j-1}(0)||_{H^m} < infinity for every fixed m. Throughout, grad^2 p_j <= K_+ I with one constant for all stages (p. 3). Every flow is odd, u(t,-x) = -u(t,x), so X(t,0) = 0 (p. 4).
  • Obligation: It turns "gradient growth" into a sequence of honest smooth solutions whose data converge. Blowup then needs only stability (Section 6), with no need to follow one solution up to the singular time. Oddness removes drift of the amplification point: without a fixed central trajectory there is no point at which to compare the parent shear, the packet phase and the target gradient across infinitely many stages.
  • Mechanism: Each stage is a map (parent, older flow) -> child. The child's leading new gradient at the origin is a rank-one shear h_j q2 p2^T that dominates everything older (h_j >> h_{j-1}^2, (5.14)). Relative to that shear the child satisfies the same structural hypotheses (4.3)-(4.7) that the parent satisfied, so the stage can be repeated. Proposition 4.1 supplies the growing wave and the new frame. Proposition 3.1 makes the wave exact. Section 5.7 checks the hypotheses again. Section 6 passes to the limit (Figure 1, p. 6). Oddness makes the origin a stagnation point of every U_j, so the central trajectory, and the label where the packet peaks, never move.
  • Antecedent: Cordoba and Martinez-Zoroa [10, Section 1.2], forced Euler: "a vorticity layer to amplify a more localized layer" (p. 4). Cordoba and Martinez-Zoroa [11], IPM: successive amplification of oscillatory layers with approximations of increasing order (p. 2). Local existence: Kato [24]. The stability comparison of Section 6 is proved in the paper itself.
  • Cost: Each child must again be exact, smooth and odd, and satisfy: the low bounds (5.4); the one-sided bounds (5.5) (H <= K_B + 1 and the initial symmetric-gradient lower bounds); the Gevrey particle-map bound (3.16); the shear form (4.3) with |E| <= k_{j-1}^{-1/4}; the activation conditions (4.7); and t_{j-1}^{-1} <= K_h^c (Section 5.4). The initial increments must be summable in every H^m and supported in a fixed ball.
  • Backward question: If a single smooth solution cannot be followed to its singular time, can blowup be certified by exact smooth solutions whose data converge smoothly while their gradients at one fixed point and at times t_j -> T_infty < infinity diverge? And which symmetry pins that point?
  • Checkable: None directly: this is the architecture. The stage map is checkable only through its components (ME.3, ME.13 to ME.17). The parity bookkeeping (odd A_1 = alpha chi_1 v f_delta when chi_1 and v are even and f_delta is odd) can be checked symbolically.
  • Depends on: ME.11 (Each child U_j is an exact smooth odd Euler solution because Lemma 3.3 removes the residual with zero initial correction, and that correction is odd (p. 29).); ME.3 (The first target |grad U_j(t_j,0)| -> infinity is the packet's frequency-independent leading gradient at the fixed center, exact to O(k^{-1/4}) by (3.13).); ME.17 (The child's leading gradient is a shear h_child q2 p2^T in a new frame with a2 ~ a and beta2 x_tar^2 ~ 1 ((4.10), (4.14)), so the same stage map applies again.); ME.19 (The scale hierarchy gives t_j increasing to T_infty < infinity, summable increments, and the one constant K_+ = K_B + 1 through the pressure budget of Section 5.7.); L.1 (The Euler paper cites Córdoba-Martínez-Zoroa [10] (forced Euler) for 'a vorticity layer to amplify a more localized layer', the pattern of its parent, packet, child iteration.); L.3 (The Euler paper cites Córdoba-Martínez-Zoroa [11] (IPM), successive amplification of oscillatory layers with approximations of increasing order, as an antecedent of its iteration.)
  • Refs: pp. 3-6, (2.1), Figure 1; p. 4 (oddness); p. 21 (parity of coefficients); p. 29 (parity of the correction); p. 48 (Section 5.4); p. 53.
  • Verification: statement digest-only; hypotheses not-checked; computation checked False

ME.2: Lagrangian deformation identities F_t = MF, F_tt = -HF, det F = 1

Node ns-me-2-lagrangian-deformation-identities-f-t-mf-f-tt-hf-det-f-1, kind move, pp. 3.

  • Statement: Along parent trajectories, with F = grad_a X, M = grad u(t, X), H = grad^2 p(t, X) (2.2): det F = 1, F_t = MF, F_tt = -HF (2.3). The same holds in the normalized label (3.5)-(3.6), with Xi(t,y) = l^{-1} X(t, l y), F(0) = I. The commuting derivatives d_i = sum_j (F^{-1})_{ji} d/dy_j satisfy d.W = div_y(F^{-1} W) (p. 11). At the fixed origin the same kinematics give Bdot = -B^2 - H for the gradient (p. 51, p. 52).
  • Obligation: It converts Euler's nonlinear pressure coupling into two linear facts along particle paths. First, m = F^{-T} m0 solves m_t = -M^T m exactly (the ray equation in (2.4)). Second, a displacement eta = F z has velocity eta_t - M eta = F z_t, and eta's acceleration is governed only by the pressure Hessian. Without F_tt = -HF the history and mean problems would have no action whose coercivity depends only on an UPPER bound for H.
  • Mechanism: Differentiate X_t = u(t,X) in the label to get F_t = MF. Differentiate X_tt = -grad p(t,X) in the label to get F_tt = -HF. So the pressure Hessian is the "acceleration of deformation" (p. 3). This is used three ways. (a) The ray and transverse equations (2.4), (3.9), (4.1) come from pushing forward fixed Lagrangian data. (b) In the mean inverse, the terms containing z cancel in the strong equation (3.24) "because F_tt = -HF" (p. 15). (c) The transverse history equation (3.28) follows from the action (3.27) by integration by parts with F_tt = -HF (p. 16).
  • Antecedent: None cited for the identities (classical Lagrangian kinematics). The use of an upper bound on the pressure Hessian to control a quadratic action is credited to Brenier [3, Section 2] (p. 16).
  • Cost: None of its own. It makes the pressure Hessian, a nonlocal quantity, the object that must be controlled at every stage (the invariant H <= K_+ I; see ME.4, ME.5, ME.19).
  • Backward question: Along a particle path, what controls the second time derivative of the deformation? Could a displacement boundary value problem posed along paths be coercive in terms of that quantity alone, even when the velocity gradient M is enormous?
  • Checkable: Yes. For an exact linear Euler flow u = L(t) x (tr L = 0, and L_t + L^2 = -H(t) with H symmetric, so p = x^T H x / 2 gives grad^2 p = H), integrate F_t = LF and check numerically that F_tt = -HF, det F = 1, and that m = F^{-T} m0 satisfies m_t = -L^T m.
  • Refs: p. 3, (2.2)-(2.3); p. 11, (3.5)-(3.6); p. 15, (3.24); p. 16, (3.28); pp. 51-52.
  • Verification: statement digest-only; hypotheses not-checked; computation checked False

ME.3: The ray and transverse-velocity system and the frequency-independent packet gradient

Node ns-me-3-the-ray-and-transverse-velocity-system-and-the-frequency, kind move, pp. 3-4.

  • Statement: Paper's packet ansatz (pp. 3-4): with phase k m0.y, m = F^{-T} m0, and v solving (2.4), m_t = -M^T m, v_t = -M v + 2 m (m.Mv)/|m|^2, m.v = 0, the leading increment is w_lead(t, X(t, l y)) = (l alpha / k) chi_1(y) v(t,y) f_delta(k m0.y) (2.5). Its velocity is O(alpha/k), but its leading gradient alpha chi_1 v (x) m f'_delta does not depend on k (p. 4). Claim 1 of Proposition 3.1 makes this exact: grad u_new - grad u = alpha chi_1 v (x) m f'_delta(theta) + O(k^{-1/4}) at x = X(t, l y), theta = k m0.y (3.13).
  • Obligation: It identifies which oscillations have gradients that grow along trajectories. It also decouples the size of the packet (velocity ~ alpha/k, and its initial H^m size) from the size of the gradient it will produce. This decoupling is what later allows exponentially small, summable initial increments.
  • Mechanism: For a rapidly varying phase, the linearized Euler equation at leading order transports the phase covector (m_t = -M^T m) and evolves the amplitude by -Mv. The pressure projects that amplitude back onto m-perpendicular, which is the term 2 m (m.Mv)/|m|^2. Differentiating the phase produces the factor (k/l) m, which cancels the prefactor l/k in (2.5). So the gradient is O(alpha delta^{-1}) at the peak of f'_delta, for every k. At the center it equals alpha delta^{-1} v (x) m (Section 2.3, p. 5).
  • Antecedent: Lifschitz and Hameiri [28] and Friedlander and Vishik [21]: the leading equations for the phase gradient and the velocity amplitude perpendicular to it (pp. 2-3). Cheverry [8]: nonlinear oscillatory approximate solutions and their phase corrections (p. 3). Craik and Criminale [14]: exact waves on affine flows. Fabijonas and Holm [20] proposed iterated superpositions; Le Dizes and Leblanc [25] showed these generally satisfy the equations only along one trajectory, "preventing its use as the background for the next iteration" (p. 2).
  • Cost: Transversality m.v = 0 and lower bounds D_m = |m|^2 >= P^{-c0}, K, G, K_R >= P^{-c0} (Section 3.2 (i)). Every O(1/k) and higher term must be corrected (ME.9 to ME.11). The leading gradient is large only where f'_delta is large, that is, at theta near 0, including the center.
  • Backward question: Along a particle path of a smooth flow, which high-frequency perturbations have growing gradients? Can the gradient be made independent of the frequency, so that the perturbation's size (and its initial Sobolev cost) becomes a free parameter?
  • Checkable: Yes: the linear system (2.4) along a shear. Take M(t) = B + h q p^T with B = L_B from (5.1) (so a = 1, beta = x0^{-2}), m(0) along n, v(0) = q. Integrate (2.4), check d/dt (m.v) = 0 to machine precision, and record the growth of |m||v|; compare with (4.22) and (4.12). Also check (4.14) algebraically: (h_child / (|m||v|)) v (x) m = h_child q2 p2^T.
  • Depends on: ME.2 (Uses m = F^{-T} m0, which solves m_t = -M^T m exactly because F_t = MF, in the normalized label (3.5)-(3.6) where the phase k m0.y stays fixed.); L.9 (The Euler paper's ray and transverse-velocity system lists Craik-Criminale [14], exact waves on affine flows, among its antecedents.); L.10 (The Euler paper's system m' = -M^T m, v' = -Mv + 2m(m·Mv)/|m|^2 is the leading short-wave system it credits to Lifschitz-Hameiri [28] and Friedlander-Vishik [21].)
  • Refs: pp. 3-4, (2.4)-(2.5); p. 5; p. 11, (3.7); p. 12, (3.9); p. 13, (3.13); p. 30 (Section 3.7); p. 34, (4.1); p. 36, (4.14).
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.4: The peaked asymmetric profile f_delta and the one-sided pressure-Hessian increment

Node ns-me-4-the-peaked-asymmetric-profile-f-delta-and-the-one-sided, kind move, pp. 4.

  • Statement: Profile and pressure increment (p. 11, pp. 4, 13): f_delta is smooth, odd, periodic, mean zero, f'_delta(0) = delta^{-1}, -C <= f'_delta <= delta^{-1}, with Gevrey-2 bounds (3.4); it is the odd primitive of h_delta = (delta^{-1} g(theta/delta) - c_g)/(1 - c_g delta), g an even Gevrey bump, g(0) = 1. The packet gives grad^2 p_new - grad^2 p = -2 alpha chi_1 (m.Mv) (m (x) m)/D_m f'_delta(theta) + O(k^{-1/4}) (3.14), leading term (2.7). As m (x) m/|m|^2 >= 0, where m.Mv > 0 and f'_delta >= 0 the leading increment is negative semidefinite; where f'_delta < 0, f'_delta >= -C uniformly in delta.
  • Obligation: It keeps a uniform upper bound H <= K_+ I (needed for coercivity, ME.5 and ME.6) even though each packet's pressure Hessian has size up to C_M h_j h_{j-1}, far beyond any fixed K_+ (Section 5.7, p. 52).
  • Mechanism: m (x) m / |m|^2 is positive semidefinite. Proposition 4.1 gives m.Mv > 0 on the packet support once tau >= 1 (4.9). So wherever f'_delta >= 0, the leading increment is NEGATIVE semidefinite and only lowers lambda_max(H). The profile is asymmetric: large positive derivative delta^{-1} at the center (which produces the shear), but negative part bounded by -C uniformly in delta. So where f'_delta < 0 the largest eigenvalue of the leading increment is at most 2C alpha (m.Mv) <= 2C alpha |m||v| ||M_{j-1}|| <= C C_M delta_j h_j h_{j-1} (the projector m (x) m/|m|^2 has norm 1). This uses alpha |m||v| <= C delta_j h_j for tau >= 1 (Claim 3 of Proposition 4.1 with (5.18)), so the factor delta_j comes in through the normalization alpha = delta h_child / A_tar (4.13). This is the bound lambda_max(H_j) <= lambda_max(H_{j-1}) + C C_M delta_j h_j h_{j-1} + k_j^{-1/4} (p. 53). This is summable: delta_j h_j h_{j-1} <= exp(-x_{j-1}/(2 j^3)) (5.16); seed cost delta_{J-1} h_{J-1} = x0^{-10} (p. 51). Before tau = 1 the sign is not available; there the exponential smallness (4.12) makes the total increment summable (5.15).
  • Antecedent: None cited.
  • Cost: It needs the sign m.Mv > 0 for tau >= 1 on every label |y| <= 1/2 (Proposition 4.1 Claim 1), plus summable positive parts and remainders over all stages (Section 5.5). The Gevrey bounds carry delta^{-c} factors, so delta^{-1} <= P^{c0} enters the packet size P (Section 3.2 (i), (5.10)).
  • Backward question: The packet's pressure Hessian is huge. How can an upper bound on the pressure Hessian survive infinitely many stages? Can the profile be shaped so that the huge part has a definite (negative) sign and only an O(delta) part has the wrong sign?
  • Checkable: Yes. Build f_delta numerically from a bump g (for example the exp(-1/z) construction) for delta = 10^{-1}..10^{-4}. Check oddness, mean zero, f'_delta(0) = delta^{-1}, and that min f'_delta stays bounded below uniformly in delta. For random symmetric M and transverse v with m.Mv > 0, check that -2 (m.Mv) m (x) m f' has no positive eigenvalue when f' >= 0, and that its positive eigenvalue is <= 2 C |m.Mv| when f' >= -C.
  • Depends on: ME.16 (Needs the sign m.Mv > 0 for tau >= 1 on every label |y| <= 1/2 (4.9), which makes the leading increment negative semidefinite where f'_delta >= 0.); ME.3 (The increment (2.7) is the Hessian of the pressure that keeps m.v = 0 in (2.4), built from the ray normal m, the amplitude v and M.); ME.17 (Its early unsigned part and its positive part are summable via the size ratio (4.12), exp(-b x_prev) before tau = 1, and the factor delta in alpha = delta h_child/A_tar (4.13).); ME.8 (f_delta is built from an even Gevrey bump so that its derivatives obey the order-2 bound (3.4) that the shift calculus consumes.)
  • Refs: p. 4, (2.7); p. 5; p. 11, (3.4); p. 13, (3.14); p. 30; p. 36; p. 50, (5.15)-(5.16); p. 51
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.5: The stationary-action history problem, coercive from H <= K_+ I alone

Node ns-me-5-the-stationary-action-history-problem-coercive-from-h-k-i, kind move, pp. 4.

  • Statement: History problem (p. 12): for activation time t0 > 0 and each label y, the primary coefficient on [0, t0] is xi with xi(0,y) = 0, xi(t0,y) = xi_T, |xi_T| <= P^{c0}, stationary for integral_0^{t0} (|eta_t|^2 - H eta.eta) dt, eta = F R_perp xi; then v = F R_perp xi_t = eta_t - M eta, continued forward by (3.9). If H <= K_+ I, the action is >= (1 - K_+ t0^2/2) integral |eta_t|^2 >= (1/2) integral |eta_t|^2 (p. 16), so it is coercive; the forced version (3.27)-(3.28) has zero endpoints. The history velocity obeys sup_[0,t0] |v| <= K_h^c, Lipschitz in the label (p. 38).
  • Obligation: The equation is UNFORCED, so a packet that must be in its growing mode at a positive activation time t0 has to be present in the initial datum and evolve passively through [0, t0]. On [0, t0], ||M|| can be as large as C_M h* with t0^{-1} <= h* (4.6). Inference, not stated in the paper: a forward Gronwall bound would lose exp(C h* t0), and h* t0 is huge because t0 = t_{j-1} >= S_base/12 is fixed while h* = h_{j-1} grows. The paper states only the design: the endpoint selects the growing solution "while the history estimates control the initial velocity increment" (p. 4). The two-point problem prescribes the state at t0 and controls the initial increment with bounds polynomial in K_h (p. 38), not exponential in the parent gradient.
  • Mechanism: Written in the displacement eta, the linearized transverse dynamics are the Euler-Lagrange equations of the action integral (|eta_t|^2 - eta^T H eta). This uses F_tt = -HF (ME.2) and involves M only through lower-order terms. The action is coercive once K_+ t0^2 / 2 < 1 by the Poincare inequality integral |eta|^2 <= (t0^2/2) integral |eta_t|^2 for eta(0) = 0. Large NEGATIVE eigenvalues of H only increase the form (p. 4). The equation contains no y or theta derivatives, so it acts label by label. It commutes with multiplication by the time-independent factor alpha chi_1 f_delta, so the localized displacement solves the same equation (p. 20, p. 38).
  • Antecedent: Brenier [3, Section 2], short-time action minimization for Euler flows with an upper bound on the pressure Hessian (p. 16).
  • Cost: Uniform H <= K_+ I on [0, t0] for all labels, and short intervals: K_+ S^2/2 + B_e S + C_2 B_c r^3 S <= 1/2 (3.11), realized as (5.17) with K_+ = K_B + 1. Hence the pressure budget of ME.4 and ME.19. Also t0^{-1} <= P^{c0} and t0^{-1} <= K_h^c (Section 5.4 (iv)).
  • Backward question: With no force available, how can I dictate the packet's state at a late activation time without paying the exponential of the huge parent gradient over the history interval? Is there a formulation whose well-posedness depends only on a one-sided bound for the pressure Hessian and a short time?
  • Checkable: Yes. For a model parent with large M but H <= K_+ I (for example the linear flow of ME.2 with a strong shear), solve the two-point problem (3.28) with f = 0, xi(0) = 0, xi(t0) = xi_T by finite differences. Check E(eta) >= (1/2) integral |eta_t|^2, symmetry of the endpoint map (ME.13), and that sup |v| grows polynomially, not like exp(integral ||M||).
  • Depends on: ME.2 (Writes the transverse dynamics in the displacement eta = F R_perp xi as Euler-Lagrange equations of the action integral (|eta_t|^2 - H eta.eta), using F_tt = -HF.); ME.4 (Its coercivity needs the uniform bound H <= K_+ I on [0, t0], which the one-sided profile keeps from stage to stage.); ME.3 (The history fixes the principal coefficient v = F R_perp xi_t of the transverse system (2.4), which (3.9) then continues forward from t0.)
  • Refs: p. 4 (Section 2.2); p. 12, (3.9), (3.11); p. 16, (3.27)-(3.28); p. 17; p. 20; p. 38.
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.6: The mean inverse with compactly supported initial velocity

Node ns-me-6-the-mean-inverse-with-compactly-supported-initial-velocity, kind move, pp. 4.

  • Statement: Mean inverse (pp. 13-16): for an angle-independent force f, solve B_t + M B + d qbar = f, d.B = 0, supp B(0) in {|l y| <= 2} (3.19); later B and qbar may be nonlocal. Write B = F z_t, div_y z = 0, z(S) = 0, and impose z_t(0) = L A z(0), A = curl_y chi N chi curl_y (3.20). Under (3.11), using (3.22)-(3.23), the form a of (3.21) on V = {z in H^1((0,S); L^2_sigma) : z(S) = 0} satisfies a(z,z) >= E/2 (p. 15); Lax-Milgram gives a unique z, and (3.24)-(3.26) give B(0) = L A z(0), supported in {|l y| <= 2}. Lemma 3.2 (a) gives the shift bounds.
  • Obligation: Products of zero-mean oscillations have nonzero phase average (p. 4). That mean must be cancelled by an angle-independent correction whose pressure is nonlocal. Since the problem is unforced, the correction lives in the initial datum, which must stay compactly supported in a fixed ball for u0 to be in C^infty_c. The boundary operator forces exactly that and nothing more.
  • Mechanism: Posing the mean problem backward (z(S) = 0) with a Robin-type condition at t = 0 turns it into a coercive symmetric-plus-lower-order form. The outer curl in A makes A z(0) divergence free, and the outer cutoff puts its support in {|l y| <= 2}. The natural boundary condition of the variational problem then says the initial mean velocity equals L A z(0), which is automatically localized. The possibly negative initial boundary term <M(0) z(0), z(0)> is absorbed by L <A z(0), z(0)> = L Z^2 on the small ball {|l y| < r}, where the initial gradient may be very negative (the seed shear lives there), and by B_e S outside. The harmonic estimate (3.23) converts Z into L^2 mass on that ball with the small factor r^3.
  • Antecedent: None cited for the construction (Lax-Milgram, Newton potential). The action-type coercivity parallels Brenier [3].
  • Cost: The initial symmetric gradient must satisfy sym M(0) >= -B_c I on |l y| < r and >= -B_e I outside, with L >= C_1 B_c and 0 <= L <= P^{c0} (3.11). The iteration maintains this with B_c = C_M h_{J-1} + 2, L = C_1 B_c + 1 (5.5)-(5.6), which requires the summed initial gradient changes to fit inside the margins (Section 5.7, p. 53). The mean initial increment obeys ||u_mean,0||_{H^m} <= l^{-m} k^{-2} P^{cm}, supported in |a| <= 2 (3.17). It vanishes if t0 = 0 and L = 0.
  • Backward question: The mean part of the packet's self-interaction has to be cancelled, but the flow is unforced, so the cancellation must be written into compactly supported initial data. How can a mean correction have compactly supported initial velocity when the mean equations are nonlocal through the pressure?
  • Checkable: Partial. Discretize A = curl chi N chi curl spectrally on a large periodic box and check <A v, v> >= 0, div A v = 0 and supp A v subset {|l y| <= 2}; check (3.23) numerically for harmonic-plus-small fields. The coercivity and Lax-Milgram step are a pure estimate.
  • Depends on: ME.2 (Writes the mean field as B = eta_t - M eta = F z_t with eta = F z, and uses F_tt = -HF to cancel the z terms in the strong form (3.24).); ME.4 (Its coercivity term (1 - K_+ S^2/2) needs the uniform bound H <= K_+ I that the one-sided profile keeps from stage to stage.); ME.8 (Lemma 3.2 (a) and the table (3.32) state its derivative bounds as shift gains in the calculus (3.1)-(3.3).)
  • Refs: p. 4; pp. 13-16, (3.19)-(3.26); p. 17, Lemma 3.2 (a); p. 19, (3.32); p. 13, (3.17).
  • Verification: statement completeness audit 2026-10-01: TRUNCATED; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.7: The transverse inverse, label by label, with an exact-incompressibility curl correction

Node ns-me-7-the-transverse-inverse-label-by-label-with-an-exact, kind move, pp. 16-19.

  • Statement: Transverse inverse (pp. 16-20): for a force f(t,y,theta) with zero angle mean, solve A_t + M A + m d_theta pi = f, m.A = 0, by the history problem (3.27)-(3.28) on [0, t0] and K_R a_t + 2 R_perp^T F^T F_t R_perp a = R_perp^T F^T f, A = F R_perp a (3.30), on [t0, S], with pi from (3.29). With Q_A = -d_theta^{-1}(m x A)/D_m and C_A = d x Q_A, A + k^{-1} C_A is exactly divergence free (3.33). Lemma 3.2 (b): input of shift d - 10 with profile h gives A, pi, Q_A, C_A and derivatives of shift d with profile h; transversality, zero mean and support are preserved.
  • Obligation: It cancels the oscillatory part of each order's forcing while keeping every oscillatory coefficient supported in |y| <= 1/2 with zero phase mean. It never loses more than the growth of the primary wave itself, via the profile g from Proposition 4.1 Claim 4.
  • Mechanism: The principal transverse operator has no y or theta derivatives: it is an ODE in time at each (y, theta). So a force supported in a set yields a solution supported in the same set. Its coefficients do not depend on theta, so averaging in theta shows zero-mean forces give zero-mean solutions (p. 16). The m-component of the equation is not an unknown: it defines the pressure (3.29) (differentiating m.A = 0 with m_t = -M^T m gives m.A_t = m.MA). The derivative bounds use the ASSUMED propagator bound P^{c0} g(t)/g(s') (Section 3.2 (iii)) in Duhamel form. The text notes "we never use a Gronwall factor exponential in the undifferentiated matrix norm" (p. 19).
  • Antecedent: None cited beyond the ray-optics setting of ME.3 (Lifschitz and Hameiri [28], Friedlander and Vishik [21]).
  • Cost: The propagator hypothesis Section 3.2 (iii) with a profile g, g(t0) = 1, and alpha, sup alpha g <= P^{c0}. Proposition 4.1 Claim 4 must supply these. Each inverse costs a fixed number of shifts (table (3.32)).
  • Backward question: How do I solve for the higher-order oscillatory corrections so that they grow no faster than the primary growing mode, stay localized, keep zero phase mean, and are exactly divergence free at every order?
  • Checkable: Yes. For a model parent, (3.30) is a 2x2 linear ODE per label. Compute its propagator numerically and compare with g(t)/g(s) for g = V_lambda (Section 4.6). Check symbolically that pi from (3.29) makes (F R_perp)^T (f - A_t - M A) = 0 and that m x d_theta Q = A.
  • Depends on: ME.5 (On [0, t0] it solves the forced history problem (3.27)-(3.28) with zero endpoints, and starts (3.30) from a(t0) = xi_t(t0).); ME.16 (Its derivative bounds use the growth-weighted propagator bound P^c g(t)/g(s) of Proposition 4.1 Claim 4 (Section 3.2 (iii)) in Duhamel form.); ME.3 (The pressure (3.29) comes from differentiating m.A = 0 with m_t = -M^T m (m.A_t = m.MA), the transversality of the ray system.); ME.8 (Lemma 3.2 (b) states its output bounds as a gain from shift d - 10 to shift d in the shift calculus.)
  • Refs: pp. 16-19, (3.27)-(3.30), Lemma 3.2 (b), (3.32); p. 20, (3.33).
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.8: Gevrey order-2 shift calculus with a common growth constant

Node ns-me-8-gevrey-order-2-shift-calculus-with-a-common-growth, kind move, pp. 6.

  • Statement: Gevrey order-2 shift calculus (pp. 6-11): with |f|_n as in (2.8), s = 6, f has shift d with profile h if sum_{|I|=n} sup_t h^{-1} ||d^I f||_{H^s} <= R^{n+d} ((n+d)!)^2 (3.1). Shifts add under products, since the Leibniz sum is bounded via (3.2) with sum_l (n choose l)^{-1} <= 3. Triangular rule (3.3): if Z_n <= P^c (F_n + sum_{l>=1} (n choose l) R_c^l (l!)^2 Z_{n-l}) with F_n <= R^{n+d-1}((n+d-1)!)^2, then Z_n <= R^{n+d}((n+d)!)^2, with R independent of the expansion length. Lemma 3.2 turns input shift d - 10 into output shift d (table (3.32)).
  • Obligation: The expansion solves about k^theta successive linear problems, each losing a fixed number of derivatives. Without one growth constant R valid for all orders, the constants would compound with the number of steps and no residual bound uniform in N_k would exist. Order 2 (rather than analytic) is needed so the packet can be compactly supported (chi_1, chi_o) while keeping factorial control.
  • Mechanism: Record losses in an integer shift d rather than in R. A derivative raises d by 1. A product adds shifts: the binomial identity (3.2) makes the Leibniz sum converge with constant 3. A linear inverse raises d by 10 (Lemma 3.2). Coefficient multiplication costs one more shift once R is a large fixed power of P. At the end, (3.40) separates derivative order from shift (expansion order), so the factorial in the shift becomes (C N_k)^{O(p)} rather than (n!)-type growth in the derivative index.
  • Antecedent: None cited for the Gevrey framework. Related in spirit: Cordoba and Martinez-Zoroa [11], "approximations of increasing order to keep every spatial derivative of the source uniformly bounded" (p. 2).
  • Cost: Every coefficient F, F^{-1}, F_t, F_tt, M, H needs Gevrey-2 bounds P^{c0} (P^{c0})^n (n!)^2 (Section 3.2 (i)). So the child must output Gevrey-2 particle-map bounds (3.16) for the next stage (ME.12), and the base flow must be Gevrey (Section 5.1).
  • Backward question: Which derivative-counting scheme lets me stack O(k^theta) linear solves, each losing derivatives, with constants that do not grow with the number of solves, while still allowing compactly supported cutoffs?
  • Checkable: Yes, combinatorially. Verify numerically for n, d1, d2 up to several hundred: the ratio identity and bound in (3.2), sum_l (n choose l)^{-1} <= 3, (3.40) (n+d)! <= 2^{n+d} n! d!, and the composition ratio (3.56). Check the induction (3.3) by iterating the recursion with R_c/R small.
  • Depends on: ME.2 (Its coefficient norms |a|_{n,infty} measure the particle-path coefficients F, F^{-1}, F_t, F_tt, M, H of (2.2), which must carry order-2 bounds.); ME.3 (Order 2 rather than analytic lets the packet (2.5) carry the compactly supported cutoff chi_1 while keeping factorial derivative bounds.)
  • Refs: p. 6, (2.8); p. 7; pp. 10-11, (3.1)-(3.3); p. 17, Lemma 3.2; p. 19, (3.32); p. 22, (3.40).
  • Echo: the statement states its own reason (B is an echo for pairs where this is the dependent).
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.9: Two-scale lift and order-by-order cancellation, mean before oscillation

Node ns-me-9-two-scale-lift-and-order-by-order-cancellation-mean, kind move, pp. 4.

  • Statement: Two-scale expansion (pp. 11-22): lifting the phase to theta in T, l W and l^2 q added on theta = k m0.y solve Euler if W_t + M W + W.dtilde W + dtilde q = 0, dtilde.W = 0 (3.8). Expand W^a, q^a as in (3.34), A_1 = alpha chi_1 v f_delta, B_1 = 0. At order p the only unknown term in the forcing (3.35) is -(B_p.m) d_theta A_1, of zero angle mean (3.36), so the mean problem (3.37) is solved first, then the transverse one (3.38). All oscillatory coefficients are supported in |y| <= 1/2, and by induction (3.39) they have shifts 100p - 80 (A, pi, Q, C) and 100p - 140 (B, qbar).
  • Obligation: It produces an approximate solution to all orders in 1/k whose leading term is the growing packet. It cancels both the phase-averaged (mean) and oscillatory parts of the quadratic self-interaction and keeps exact incompressibility, localization and parity at every order. Exact Craik-Criminale waves need affine backgrounds, and their iterated superpositions generally satisfy the equations only along a single trajectory (Le Dizes and Leblanc [25], p. 2). This expansion replaces them.
  • Mechanism: Lifting theta makes "fast" derivatives explicit (k m d_theta), so powers of kappa organize the equation. The triangular structure is the key: the order-p forcing depends on lower orders, except for one term, -(B_p.m) d_theta A_1, which is linear in the unknown mean B_p and has zero mean. Solving the mean first removes the circularity. The oscillatory problem then sees B_p as known data. The shifts a_p, b_p grow linearly in p with slack: every forcing product sits at shift d_target - 1 or lower, and d_target >= 25p absorbs the O(p) products into R = P^c (p. 22).
  • Antecedent: Cheverry [8] (oscillatory approximate solutions and additional phase corrections, p. 3). Craik and Criminale [14] (cancellation of the wave's quadratic self-interaction on affine flows, p. 2). Cordoba and Martinez-Zoroa [11] (approximations of increasing order).
  • Cost: It needs both linear inverses (ME.6, ME.7) with support and zero-mean preservation and the Gevrey shift calculus (ME.8). The profile growth H_0^{2p-2} must be beaten by kappa^p. This is where alpha, sup alpha g <= P^{c0} enters.
  • Backward question: When the wave's quadratic self-interaction does not vanish identically (localized amplitude, non-affine background), can the error be cancelled order by order? In what order must the mean and oscillatory parts be solved so that each step is a solvable linear problem?
  • Checkable: Yes, symbolically. Expand W.dtilde W with the V_p ansatz in powers of kappa and verify the coefficient extraction (3.35)-(3.36): at order p the only undetermined term is -(B_p.m) d_theta A_1, and the order-one phase term vanishes because m.A_1 = 0. Verify dtilde.W^a = 0 identically from m x d_theta Q_p = A_p.
  • Depends on: ME.6 (Solves the mean problem (3.37) for B_p and qbar_p with the mean inverse, first at each order.); ME.7 (Solves the transverse problem (3.38) for A_p and pi_p, and uses the curl correction C_p = d x Q_p for exact incompressibility (3.33).); ME.3 (The leading term A_1 = alpha chi_1 v f_delta is the packet (2.5); m.A_1 = 0 kills the (1,p) phase term, which makes the order-p system triangular.); ME.8 (The induction bounds (3.39), with shifts a_p and b_p, use the product and triangular rules of the shift calculus.); L.3 (The order-by-order two-scale expansion cites the approximations of increasing order of [11], which keep every spatial derivative of the source bounded.); L.9 (The two-scale expansion replaces exact Craik-Criminale waves, which need affine backgrounds, while cancelling the wave's quadratic self-interaction order by order.)
  • Refs: p. 4, (2.6); pp. 11-12, (3.7)-(3.8); pp. 20-22, (3.33)-(3.39) and the table on p. 22.
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.10: Truncation at N_k = floor(k^theta) and a super-exponentially small residual

Node ns-me-10-truncation-at-n-k-floor-k-theta-and-a-super-exponentially, kind move, pp. 20.

  • Statement: Truncation (pp. 20-23): truncate at N_k = floor(k^theta), theta = 10^{-6}. Using (3.40), each residual coefficient (orders N_k + 1 to 2N_k + 2) obeys |.|_n <= (P^c)^n (n!)^2 [P^c (C N_k)^{300}]^{p+1}, and (3.12) gives P^c (C N_k)^{300} <= k^{0.01} (3.41). In the lifted variables (3.42), with the rho-norm (3.43), ||z^a||_rho + ||z^a_t||_rho + ||grad z^a||_rho <= P^c and ||b^a||_rho <= k^{-1} P^c + O(k^{-1.9}) (3.44), and the residual satisfies ||r^a||_rho <= exp(-0.7 k^theta log k) =: R_k (3.45).
  • Obligation: The residual must be far smaller than anything the exact correction can lose: the Gronwall factor P^c S exp(P^c S) and the threshold Delta_k = exp(-k^theta / 2) of Lemma 3.3. The transport coefficient b^a must also be small (<= k^{-1/2}) for the correction's energy method.
  • Mechanism: This is optimal truncation of a Gevrey-type asymptotic series. Each order gains k^{-1} but its coefficient grows like (C N_k)^{300} <= k^{0.01}. So the terms decrease like k^{-0.99 p} until p ~ N_k, and truncating there leaves a residual of size k^{-0.99 N_k} ~ exp(-0.99 k^theta log k), which is below exp(-0.7 k^theta log k). The first two coefficients are estimated separately so that the bounds on z^a do not depend on N_k (p. 23). Transverse coefficients drop out of the theta-transport component of b^a because m0.F^{-1} A_p = m.A_p = 0 (p. 23).
  • Antecedent: None cited (optimal truncation of asymptotic expansions).
  • Cost: Condition (3.12), P^Q <= k^{theta/100} with Q = Q(c0) fixed. This ties every stage's frequency to all of its polynomial data sizes, and is the origin of the frequency hierarchy (5.12). It also requires k >= k_0(c0).
  • Backward question: How many terms can the expansion carry before factorial growth of the coefficients overtakes the k^{-1} gain per order, and is the resulting residual small enough to be removed exactly without touching the initial datum?
  • Checkable: Yes, in log space. With theta = 10^{-6}, compute log of the sum over p from N_k + 1 to 2N_k + 2 of k^{1-p+0.01(p+1)} and compare with -0.7 k^theta log k for k with k^theta between 10 and 10^3 (log k between 2.3 x 10^6 and 6.9 x 10^6). Confirm (3.45) and that Delta_k = exp(-k^theta/2) dominates R_k times P^c S exp(P^c S) under (3.12).
  • Depends on: ME.9 (Truncates the expansion (3.34) at N_k; the residual consists of its orders N_k + 1 to 2N_k + 2, with the shifts of (3.39).); ME.8 (Uses (3.40), (n+d)! <= 2^{n+d} n! d!, to split derivative order from shift so the shift factorials become (C N_k)^{O(p)}.); ME.7 (Transverse coefficients drop out of the theta-transport part of b^a because the transverse inverse keeps m.A_p = 0 (m0.F^{-1} A_p = m.A_p).)
  • Refs: pp. 20, 22-23, (3.40)-(3.45); p. 24; p. 13, (3.12).
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.11: Exact correction on R^3 x T with a shrinking Gevrey radius (Lemma 3.3), then restriction to the phase graph

Node ns-me-11-exact-correction-on-r-3-x-t-with-a-shrinking-gevrey, kind move, pp. 24-30.

  • Statement: Lemma 3.3 (pp. 24-30): on R^3 x T, with D_i = kappa d/dy_i + (m0)_i d_theta and W = kappa F z, incompressibility becomes div_D z = 0 and Euler becomes (3.50). The correction e (z = z^a + e, e(0) = 0) of (3.51) is controlled by K-weighted Gevrey energies with radius rho(t) shrinking at rate C P^c (B_0 + Delta_k); Gronwall gives sup_t (||e||_{rho*} + ||e_t||_{rho*} + ||p_e||_{rho*}) <= P^c Delta_k, rho* = P^{-c}, Delta_k = exp(-k^theta/2). Restricted to theta = k m0.y, (3.47)-(3.48) give an exact smooth odd Euler solution with initial increment l W^a(0, y, k m0.y).
  • Obligation: It turns the approximate solution into an EXACT Euler solution without changing the initial datum (e(0) = 0) and without the factor k that each physical derivative along the phase graph costs. The equation is unforced, so there is no force into which a residual could be absorbed; exactness is mandatory.
  • Mechanism: On the lifted space the only large-frequency structure is the constant-coefficient operator D, and the transport field b = (kappa z, m0.z) is small (B_0 <= k^{-1/2}). Transport still loses one derivative. That loss is paid by letting the Gevrey radius rho(t) shrink at rate C P^c (B_0 + Delta_k), an abstract Cauchy-Kovalevskaya device: the Y_m term, which counts the extra derivative, gets a negative coefficient rho'/rho that dominates the positive transport and pressure commutator coefficients. The K-weighted energy makes the leading pressure pairing vanish exactly. The residual R_k is so small that the bootstrap closes with a huge margin. Restriction to theta = k m0.y is legitimate because the lifted equations restrict to (3.8) on the graph, and the L^2 trace bound integral |v(y, k m0.y)|^2 dy <= C integral ||v(y,.)||^2_{H^1(T)} dy transfers Sobolev bounds (p. 30).
  • Antecedent: None cited (a Gevrey energy method with decreasing radius, Cauchy-Kovalevskaya type).
  • Cost: It needs R_k from (3.45), B_0 <= k^{-1/2}, S <= 1, and the scale condition (3.12) so that rho stays >= rho(0)/2. The correction contributes only P^c Delta_k to the gradient and Hessian in Claim 1 (Section 3.7), which is how the O(k^{-1/4}) errors in (3.13)-(3.14) arise together with the O(k^{-1} P^c) expansion terms.
  • Backward question: Once the residual is super-exponentially small, how do I solve the nonlinear correction problem uniformly in an enormous frequency k, when every physical derivative costs a factor k? Is there a space where the fast derivative has constant coefficients and the transport is small?
  • Checkable: None: pure estimate. Only algebraic parts can be verified: symbolically check dtilde = kappa^{-1} F^{-T} D, dtilde.(kappa F z) = div_D z, the P_G symbol, and the identity W.dtilde W = kappa F (z.Dz) + kappa^2 (z.grad_y F) z behind (3.50).
  • Depends on: ME.10 (Needs the residual bound R_k of (3.45), the rho-norm bounds on z^a and the small transport B_0 <= k^{-1/2} from (3.44).); ME.9 (Corrects the truncated two-scale solution of the lifted system (3.8), then restricts to theta = k m0.y, where (3.8) yields Euler's equations.); ME.2 (Uses F to write dtilde = kappa^{-1} F^{-T} D and W = kappa F z, and K = F^T F to weight the energies so the top pressure pairing vanishes.); ME.8 (Its weighted energies use the order-2 Gevrey weights rho^n/(n!)^2 of the rho-norm (3.43).)
  • Refs: pp. 24-30, (3.46)-(3.55), (3.47)-(3.48); p. 30 (Section 3.7).
  • Verification: statement completeness audit 2026-10-01: FRAGMENT; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.12: The child's particle map in Gevrey class without an exponential loss (Claim 2 of Proposition 3.1)

Node ns-me-12-the-child-s-particle-map-in-gevrey-class-without-an, kind move, pp. 13.

  • Statement: If the parent particle map satisfies (3.15), sum_{|I|=n} sup_t ||d_a^I (X - id, X_t, X_tt)||_{H^s} <= K_h^{n+1} (n!)^2 with 1 <= K_h <= P^{c0}, then the child's map satisfies (3.16) with (k C*)^{n+1} (n!)^2 and C* = 10(s+2). Proof (Section 3.8): let Phi be the flow of b = (kappa z, m0.z) on R^3 x T. It is volume preserving (div_{y,theta} b = 0) and leaves the phase graph invariant: d/dt (theta - k m0.y) = m0.z - k kappa m0.z = 0 (p. 32).
  • Obligation: The next stage needs the child's map as its parent map, with K_h polynomial in k (Section 5.2 sets K_h = k_{j-1}^{C*}). "Estimating the new velocity's physical Lipschitz norm and then exponentiating would lose the required frequency bound" (p. 30): the child's gradient has size ~ h_j, and exp(h_j S) would destroy the scale hierarchy.
  • Mechanism: Write the child's trajectories as the parent's trajectories composed with a small correction flow Y. On the lifted space the correction velocity kappa z is O(k^{-1/2}) with P^c Gevrey growth, and it preserves the graph. So Y has polynomial Gevrey bounds with growth constant k P^c (each graph derivative costs k once). No Lipschitz exponential appears. The majorant-series argument is a Faa di Bruno bound with the factorial ratio (3.56) at most one.
  • Antecedent: None cited.
  • Cost: K_h = k_{j-1}^{C*} enters the next packet size P_j (5.10). This forces the frequency hierarchy requirement J >> C* Q / theta (Section 5.2, requirement 1). The spatial-variation error l_j K_h^c / epsilon in (4.5) forces J >> (c C*)^2 (requirement 2).
  • Backward question: How can the Lagrangian map of a flow with an enormous new gradient still obey Gevrey bounds polynomial in the frequency, so that it can serve as the next parent?
  • Checkable: Yes, partly. Verify (3.56) combinatorially (ME.8). Numerically, integrate the lifted flow of a model divergence-free b on R^3 x T and check graph invariance theta(t) = k m0.y(t) and volume preservation. The Gevrey bound itself is a pure estimate.
  • Depends on: ME.11 (Integrates the flow of b = (kappa z, m0.z) built from the exact lifted velocity z = z^a + e of Lemma 3.3; that flow preserves the phase graph.); ME.10 (Uses the transport bound (3.44) on b^a, which with the tiny correction gives B <= 2k^{-1/2} and P^c Gevrey growth for the flow.); ME.8 (States the particle-map bounds (3.15)-(3.16) in the order-2 Gevrey form K^{n+1}(n!)^2 of the shift calculus.); ME.2 (Composes with the parent map X of (2.2), X_new(t,a) = X(t, Y(t,a)), whose bound (3.15) covers X - id, X_t and X_tt.)
  • Refs: p. 13, (3.15)-(3.16); pp. 30-33, (3.56)-(3.59); p. 47; p. 49, (5.10).
  • Verification: statement digest-only; hypotheses not-checked; computation checked False

ME.13: Choosing the activation velocity through the endpoint map of the stationary action

Node ns-me-13-choosing-the-activation-velocity-through-the-endpoint-map, kind move, pp. 35-38.

  • Statement: Section 4.2 (pp. 35-38): choose m0 = F(t0,0)^T n(t0)/|F(t0,0)^T n(t0)|, so the central activation velocity lies in span{p, q}. The endpoint map Lambda Y = proj_{n(t0)^perp} eta^Y_t(t0) of the stationary action is symmetric with 0 <= Lambda <= C_0 h* I. Under (4.6) and the activation conditions (4.7), B_pp < 0 and ||B|| <= zeta h*, a two-case choice of the endpoint (Y = -p if Lambda_pq <= h*/2, else Y = q - (Lambda_pq - B_pq) p/u, u = Lambda_pp - B_pp), normalized, gives (4.8): v_q(t0,0) = 1, -C <= v_p(t0,0) <= 0, |Y| <= C/h*, used at every label via xi_T = R_perp^T F(t0,0)^{-1} Y.
  • Obligation: At activation the transverse velocity must lie in the growing sector. In scaled variables (U,V) = (-lambda, 1) with lambda >= 0, so V' = lambda >= 0 at tau = 0 (ME.15). And it must be reachable by a passive history from zero displacement at time zero (ME.5). Without the sign v_p <= 0 < v_q the ideal solution could start in the decaying direction.
  • Mechanism: The only freedom is the endpoint Y. Its effect on the terminal velocity is Lambda (a Dirichlet-to-Neumann map for the action) minus M, and the large shear h* sits in the (q,p) entry of M. Since Lambda is symmetric, PSD and of size O(h*), a two-case choice of Y makes the p-component nonpositive and the q-component of order h*. The case split handles a possibly large off-diagonal Lambda_pq using PSD (Lambda_pp >= b^2/Lambda_qq).
  • Antecedent: None cited.
  • Cost: Activation conditions (4.7): B_pp < 0 and ||B|| <= zeta h* for B = B(t0) + E(t0), with zeta small in terms of C_M, C_H. History bounds (4.6): ||M||_infty <= C_M h*, ||H||_infty <= C_H h* h_old, 1 <= h_old <= h*, t0^{-1} <= h*. At the next stage these are re-established by the compression estimate (4.11) and (5.14) (Section 5.7, p. 53).
  • Backward question: Since the data at time zero are the only lever, which endpoint displacement at t0 yields an activation velocity with the right signs, when the stationary action is known only to be a nonnegative quadratic form of size O(h*)?
  • Checkable: Yes: the 2x2 algebra. Sample symmetric Lambda with 0 <= Lambda <= C_0 h* I and matrices B with B_pp < 0, ||B|| <= zeta h*. Form the endpoint matrix, apply the two choices of Y, and verify w_p <= 0 and w_q >= c h* with c depending only on C_0 and zeta. Lambda itself can be computed for a model parent by solving the constrained two-point problem (3.27).
  • Depends on: ME.5 (Its endpoint map Lambda is the Dirichlet-to-Neumann map of the history action; coercivity of that action makes Lambda symmetric and >= 0.); ME.14 (Reads the shear form (4.3), M = B + h q p^T + E, in the frame (p, q, n): h* sits in the (q,p) entry of the 2x2 terminal-velocity matrix.); ME.15 (Normalizes the activation velocity into the growing sector V(0) = 1, V'(0) = lambda >= 0, where growth holds uniformly in lambda.); ME.17 (Its activation conditions (4.7), B_pp < 0 and ||B|| <= zeta h*, are re-established at each new stage by the compression estimate (4.11) of the frame transfer.)
  • Refs: pp. 35-38, (4.6)-(4.8), (3.27).
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.14: The rotating scaled frame of the parent shear and the ideal ray-velocity system

Node ns-me-14-the-rotating-scaled-frame-of-the-parent-shear-and-the, kind move, pp. 34-35.

  • Statement: Section 4 (pp. 34-40): let the parent at the origin be M = B + h q p^T + E (4.3), (p, q, n) evolving by (4.2), with frozen scales a = B_pq(t0), beta = B_nq(t0)/a, epsilon = sqrt(a/h*), tau = a(t - t0)/epsilon, x = sqrt(beta) tau (4.4) and budget e* Theta^60 <= x_prev^{-10} (4.5). In the frame (p, q, n) with scaled components (4.16), the exact ray stays within C e* Theta^5 of P0 = x^2, Q0 = -2 beta tau, N0 = 1 (4.17)-(4.18), and the exact velocity coefficients are within C e* Theta^12 of the ideal system (4.20), which reduces to (D V')' = 2(1 - beta P0) V, D = 1 + P0^2 (4.21).
  • Obligation: It reduces the nonautonomous system (2.4), whose coefficients include the huge shear h, to a scale-free model with rigorously bounded coefficient errors. That model is where growth, direction and pressure sign can be proved.
  • Mechanism: The frame moves with the older flow, so the new shear occupies the single (q,p) entry, and the normalization h* epsilon^2 = a turns it into a coefficient 1. Two feedbacks then drive the transverse velocity v = epsilon U p + V q. The new shear sends v_p into v_q (V' = -U). The older flow's B_pq entry, doubled by the frame rotation (S_f)_12 = B_pq, sends v_q into v_p (U' = -2V). This is a hyperbolic loop, V'' ~ 2V. Meanwhile the older entry B_nq (also doubled) tilts the ray from n toward q (Q' = -2 beta), and the shear rotates that tilt into p (P' = -Q). Once P0 = x^2 is of order one, the pressure-projection term 2 P0 [...]/(1 + P0^2) shuts the loop off. The dimensionless time of growth is therefore tau ~ beta^{-1/2}, which is x_prev by (4.4).
  • Antecedent: Lifschitz and Hameiri [28] and Friedlander and Vishik [21] for the ray equations; Craik and Criminale [14] for waves on affine flows. None cited for this frame reduction.
  • Cost: The smallness (4.5). The older flow must vary slowly (epsilon Theta G*^2), the inherited error must be small (E* = k_{j-1}^{-1/4}), and the parent coefficients must vary little across the packet (l K_h^c / epsilon). Also beta <= beta_0, x_tar >= 2, and the horizon limit S <= t_tar + (epsilon/a) Theta^{-60}. These become (5.13)-(5.14) and requirements 2 and 3 of Section 5.2.
  • Backward question: In a frame moving with the older flow, with the new shear in a single matrix entry, which dimensionless combination of the older gradient's entries and the shear strength controls the growth of the transverse amplitude, and over what time?
  • Checkable: Yes. Integrate the exact scaled system (4.15)-(4.16) for M = B + h q p^T with constant B (B_pq = a, B_nq = a beta) and large h, and compare with (4.17), (4.20). Verify symbolically that (4.20) implies (4.21) using D' = -2 P0 Q0, and that the three leading row contributions to J are P B_pq V/a, (h epsilon^2/a) Q U, N B_nq V/a.
  • Depends on: ME.3 (Rescales the ray-velocity system (2.4)/(4.1) in the frame (p, q, n) into (4.15)-(4.21); the shear h q p^T is an earlier packet's leading gradient (3.13).); ME.2 (Uses the origin kinematics Bdot = -B^2 - H of the older central gradient B, behind the rates ||B||, ||Bdot|| in the error budget (4.5).)
  • Refs: pp. 34-35, (4.2)-(4.5); pp. 38-40, (4.15)-(4.21); p. 39, Figure 2.
  • Verification: statement completeness audit 2026-10-01: FRAGMENT; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.15: Growth of the ideal transverse velocity and control of its direction

Node ns-me-15-growth-of-the-ideal-transverse-velocity-and-control-of, kind move, pp. 40-41.

  • Statement: Growth and direction (pp. 40-41): let V_lambda solve (4.21) with V_lambda(0) = 1, V_lambda'(0) = lambda >= 0, U_lambda = -V_lambda'. For x <= 1, V_lambda(tau) >= cosh(tau/sqrt 2), so V_lambda(x = 1) >= exp(b0/sqrt(beta)) (4.22), and l = V'/V <= sqrt 2 coth(sqrt 2 tau) uniformly in lambda. For x >= 1, x V(x) increases, and the direction variable z of (4.23) satisfies z^2 = 2/(1 + rho^4) + O(sqrt beta), rho = 1/x <= 1/2. Hence r_lambda = U_lambda/V_lambda equals -l for x <= 1 and sqrt(beta)/x - z/x^2 for x >= 1 (4.24), bounded for tau >= 1.
  • Obligation: It gives the quantitative amplification factor exp(b0/sqrt beta), which is exp(b x_prev) by (4.4). This factor is the source of the exponentially small initial increment and of the summability of all "before amplification" costs. It also pins the direction ratio U/V up to the target x_tar >= 2, uniformly in the activation slope lambda, so the new frame is predictable.
  • Mechanism: While x <= 1 the right side of (4.21) is positive, so V is increasing and convex, and the integral inequality gives cosh growth over a long scaled time beta^{-1/2}. After x = 1, growth in V is lost, but the amplitude does not collapse: x V(x) keeps increasing. The direction z relaxes exponentially fast, on the scale sqrt(beta), to the positive root mu of the Riccati right side. A singular-perturbation (slow manifold) comparison controls w = z - mu: |w| <= C exp(-c(1 - rho)/sqrt beta) + C sqrt beta.
  • Antecedent: None cited (ODE comparison).
  • Cost: None beyond beta <= beta_0 and x_tar >= 2. It defines the size ratio (4.12), with the factor exp(-b x_prev), used in (4.13) and (5.15).
  • Backward question: How much does the ideal transverse velocity grow before the rotating ray shuts the growth off, and does the direction of v settle so that the next shear frame is determined?
  • Checkable: Yes: growth of the transverse solution. Integrate (4.21) (or (4.20)) numerically for beta = 10^{-2}, 10^{-3}, 10^{-4} and lambda in [0, 10]. Check V_lambda >= cosh(tau/sqrt 2) on x <= 1, fit b0 in V_lambda(x = 1) >= exp(b0/sqrt beta), check l <= sqrt 2 coth(sqrt 2 tau), check that x V(x) increases for x >= 1, and check z^2 against 2/(1 + rho^4) + O(sqrt beta).
  • Depends on: ME.14 (Analyzes the scalar equation (D V')' = 2(1 - beta P0) V of (4.21), with D = 1 + P0^2 and P0 = x^2, obtained from the ideal system.)
  • Refs: pp. 40-41, (4.21)-(4.24).
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.16: Growth-weighted propagator comparison and the pressure sign m.Mv > 0

Node ns-me-16-growth-weighted-propagator-comparison-and-the-pressure, kind move, pp. 41-42.

  • Statement: Propagator comparison (pp. 41-44): solutions of (4.21) satisfy (D V0^2 (Y/V0)')' = 0 (4.25), so V_lambda = V0(1 + lambda I) (4.26) and the ideal propagator obeys ||Phi0(t,s)|| <= C Theta^8 V0(t)/V0(s) (4.27). Comparing growth-weighted, the exact propagator obeys ||Phi(t,s)|| <= 2C Theta^8 V0(t)/V0(s), and |U - U_lambda| + |V - V_lambda| <= C e* Theta^29 (1 + lambda) V0(t) (4.28). For tau >= 1, J/V = P0 + beta + Q0 r_lambda + O(e* Theta^33) (4.29), so with (4.5), m.Mv > 0 on every label |y| <= 1/2 (4.9), and the Claim 4 bound P^c g(t)/g(s) holds.
  • Obligation: It supplies (a) the transverse propagator bound of Section 3.2 (iii), which Proposition 3.1 needs, and (b) the pressure sign (4.9), which ME.4 needs, uniformly over the packet support, for the exact rather than the ideal system.
  • Mechanism: A small coefficient error acting over an interval of exponential growth would normally be amplified by that same exponential. Measuring every propagator relative to the growing solution's own ratio V0(t)/V0(s) (a reduction-of-order, Wronskian-type identity) removes the exponential from the comparison. What remains are polynomial factors Theta^c, which the budget e* Theta^60 <= x_prev^{-10} absorbs. The sign follows because the leading expression for J/V is bounded below by beta or by x^2 - beta and the error is smaller.
  • Antecedent: None cited (reduction of order and Duhamel).
  • Cost: It uses the full strength of (4.5). The O(e* Theta^33) error must be below beta/2 ~ x_prev^{-2}/2, and Section 5.5 verifies this at every stage.
  • Backward question: How do I compare the exact linear system with the ideal one over an interval where the ideal solutions grow exponentially, without the comparison error growing by the same exponential? And does the growing solution make m.Mv positive, so the pressure increment has the favorable sign?
  • Checkable: Yes. From (4.20), compute the ideal 2x2 propagator numerically and check ||Phi0(t,s)|| <= C Theta^8 V0(t)/V0(s) and the explicit formula (4.27). Along the ideal solution, evaluate J/V = P0 + beta + Q0 r_lambda and confirm >= beta for x <= 1 and = x^2 - beta + 2 sqrt(beta) z/x > 0 for x >= 1. Perturb the coefficients by a matrix of size eta and check the error scaling in (4.28).
  • Depends on: ME.15 (Uses V_lambda, V0 and the direction data l, z, r_lambda of (4.24) as the weights and leading terms of the comparison and of J/V.); ME.14 (Compares the exact scaled system with the ideal (4.20)-(4.21) through the coefficient errors C e* Theta^12, and reads J from (4.19).)
  • Refs: pp. 41-42, (4.25)-(4.29); p. 35, (4.9); pp. 43-44.
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.17: Frame transfer, compression, and the normalization alpha = delta h_child / A_tar

Node ns-me-17-frame-transfer-compression-and-the-normalization-alpha, kind move, pp. 35-36.

  • Statement: Proposition 4.1 Claims 2 to 4 (pp. 35-44): at (t_tar, 0) with p2 = m/|m|, q2 = v/|v|, n2 = p2 x q2, the new parameters satisfy a2/a = 1 + O(x_tar^{-4} + beta/x_tar^2 + sqrt(beta)/x_tar^3 + e* Theta^40) and beta2 x_tar^2 = 1 + O(sqrt(beta) + x_tar^{-4} + e* Theta^40) (4.10). Compression: p2.Mp2 <= -c sqrt(h*)/(x_prev x_tar) + C(G* + E*) (4.11). Sizes (4.12) and the normalization alpha = delta h_child / A_tar (4.13) give alpha <= P^c e^{-b x_prev}, sup alpha g <= P^c, and alpha delta^{-1} v (x) m = h_child q2 p2^T at the center (4.14).
  • Obligation: It makes the child's leading gradient a shear of exactly the form (4.3) in a new orthonormal frame, with renormalized parameters a2 ~ a and beta2 ~ x_tar^{-2}. Proposition 4.1 then applies again with x_prev := x_tar and with the old parent as the "older flow". It also creates the exponential gap between the packet's initial size and its target shear, which makes every initial increment and every pre-amplification pressure cost summable.
  • Mechanism: At the target the ray has turned almost onto p (P0 = x_tar^2 dominates) and v points almost along q with a small computable tilt r_lambda. Normalizing removes the amplitudes and reduces a2, beta2 to the component estimates of ME.15 and ME.16. The old shear h q p^T acting on p2 gives p2.(h q p^T) p2 = h (p2.q)(p.p2) = h epsilon Q P/D_a. Here P > 0 and Q < 0 (Q0 = -2 beta tau), so this is large and negative: the new ray direction is compressed. That supplies the sign B_pp < 0 needed by the next activation (ME.13). Because A_tar carries the growth factor exp(b0/sqrt beta), the amplitude alpha that yields h_child at the target is exponentially small, while alpha g stays bounded since the common amplitude factors cancel (p. 44).
  • Antecedent: Cordoba and Martinez-Zoroa [10, Section 1.2], cited at this point (p. 4): "a vorticity layer to amplify a more localized layer" in forced Euler.
  • Cost: The parameters must stay in their windows forever: a in [1/2, 2] needs the SUM of the relative errors (4.10) to be small; beta x_prev^2 in [1/2, 2]; (4.7) needs sqrt(h_{j-1})/(x_{j-1} x_j) >> G* + 1 (5.14). Leading-gradient bookkeeping needs h_j >> h_{j-1}^2 (5.14).
  • Backward question: After amplification, is the new gradient again a rank-one shear in a frame where the same amplification can be repeated, with the same normalized parameters (a ~ 1, beta x_prev^2 ~ 1), so that the stage map is self-similar? And how small can the packet start?
  • Checkable: Yes: the frame transfer. Along the ideal solution at x_tar = 2, 4, 8 and beta -> 0, compute p2, q2, n2, a2 and beta2 from (m, v) and M = B + h q p^T, and verify a2/a -> 1 and beta2 x_tar^2 -> 1 at the rates in (4.10). Verify symbolically the identity -1 + beta P0 + (1 + P0^2) r_lambda^2 + P0 Q0 r_lambda = -1 + (1 + rho^4) z^2 + beta rho^2 - 2 sqrt(beta) z rho^3 with P0 = x^2, Q0 = -2 sqrt(beta) x, r_lambda = sqrt(beta)/x - z/x^2, rho = 1/x. Check the sign and scaling of p2.Mp2 in (4.11).
  • Depends on: ME.16 (Uses the exact-versus-ideal comparison (4.28)-(4.29), r = r_lambda + O(e* Theta^29) and J/V, to compute a2/a by (4.30) and the new frame p2, q2.); ME.15 (Uses r_lambda and z from (4.24) in the identity behind (4.10), and the growth factor exp(b0/sqrt(beta)) that yields the size ratio (4.12).); ME.14 (Works in the scaled frame (p, q, n): the old shear h q p^T acting on p2 gives the compression (4.11), with a, beta, P0, Q0 from (4.4) and (4.17).); ME.3 (The normalization (4.13)-(4.14) sets the frequency-independent leading gradient alpha delta^{-1} v (x) m at the center equal to h_child q2 p2^T.); L.1 (The frame transfer that makes the child's gradient the next parent shear is where the Euler paper cites [10, Section 1.2]: a layer amplifying a more localized layer.)
  • Refs: pp. 35-36, (4.10)-(4.14); pp. 42-44, (4.30); p. 5; p. 53.
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.18: The base flow and the seed packet

Node ns-me-18-the-base-flow-and-the-seed-packet, kind move, pp. 44-45.

  • Statement: Base flow and seed (pp. 44-51): with L_B trace free, L_B q = p + x0^{-2} n, L_B p = L_B n = 0, the datum u_B,0 = curl(-(1/3) chi_B a x L_B a) (5.1) is odd, divergence free, compactly supported and equals L_B a near 0 (a = 1, beta = x0^{-2}); (5.2) gives a smooth solution U_B with lambda_max(H_B) <= K_B. The seed (Section 5.6) applies Proposition 3.1 over U_B with t0 = 0, L = 0, m0 = p, v(0) = q, giving M_{J-1} = M_B + h q p^T + E, h(0) = x0^{1000}, |E| <= k_{J-1}^{-1/4}, increment supported in |x| <= r/2 and Hessian cost <= C x0^{-10} + k_{J-1}^{-1/4}.
  • Obligation: It starts the induction. Stage j = J needs a parent carrying a shear of size x0^{1000} at the origin, over an older gradient with a = 1 and beta = x0^{-2}, and with activation time t_{J-1} = 0 (so no history problem).
  • Mechanism: Localizing the vector potential of a linear field gives compactly supported divergence-free data with a prescribed gradient near 0. The trace-free L_B already has the frame structure the amplification step reads off (B_pq = 1, small B_nq). The seed puts the first shear directly into the initial datum at t0 = 0, with (3.18) giving that initial increment as an explicit curl. Its large initial gradient lives in the ball |x| < r = x0^{-1000}. That is exactly why the mean inverse carries the boundary term L A z(0) and the split constants B_c (inside the ball) and B_e (outside) in (3.11) and (5.5)-(5.6).
  • Antecedent: Local existence: Kato [24] (p. 1). None cited for the base construction.
  • Cost: B_c = C_M h_{J-1} + 2 and L = C_1 B_c + 1 (5.6) grow polynomially in x0. The interior coercivity term C_2 B_c r^3 S must therefore be small: h_{J-1} r^3 S_base -> 0, giving (5.17). All later oscillatory initial supports must lie inside |x| < r (l_j < r in (5.14)).
  • Backward question: What is the simplest smooth, compactly supported, odd, divergence-free datum whose central gradient already has the frame structure (a = 1, small beta) that the amplification step needs? And how is the first shear planted without any history interval?
  • Checkable: Yes. Symbolically verify curl(a x L a) = (tr L) a - 3 L a, so it equals -3 L a for trace-free L, and that the base datum is odd. With M = L_B, integrate (2.4) from m = p, v = q and check m.Mv = 1 at t = 0 and the evolution of h(t) = alpha |m||v|/delta.
  • Depends on: ME.11 (The seed applies Proposition 3.1 over the base flow; Lemma 3.3's exact correction makes the seeded flow U_{J-1} an exact smooth odd Euler solution.); ME.3 (With m0 = p and v(0) = q, the seed's frequency-independent leading gradient is the first shear h q p^T, with h'/h = -(M_B)_pp - (M_B)_qq from (2.4).); ME.14 (The base gradient L_B is built with the frame structure that (4.4) reads: a = B_pq = 1 and beta = B_nq/a = x0^{-2} at the start.); ME.4 (The seed's upper-eigenvalue Hessian cost C delta_{J-1} h_{J-1} + k_{J-1}^{-1/4} comes from the one-sided increment (3.14), with m.M_B v >= 1/2 giving the sign.)
  • Refs: pp. 44-45, (5.1)-(5.2); p. 46, (5.6); p. 51 (Section 5.6); p. 13, (3.18).
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.19: The super-exponential scale hierarchy, its order of choice, and the pressure budget

Node ns-me-19-the-super-exponential-scale-hierarchy-its-order-of-choice, kind move, pp. 45-54.

  • Statement: Scale hierarchy (pp. 45-53): scales (5.3), x_j = j^2 x_{j-1}, log h_j = x_{j-1}/j^5, log k_j = x_{j-1}/j^2, log delta_j^{-1} = x_{j-1}/j^3, log l_j^{-1} = x_{j-1}/j^{7/2}, and times (5.7)-(5.9), chosen in the order of Section 5.2 (p. 47; x0 last), satisfy (5.10)-(5.17): packet smallness, nested horizons, shear separation, summable costs (5.15)-(5.16) and coercivity (5.17). Hence the bounds (5.4)-(5.6) are maintained, and lambda_max(H_j) <= lambda_max(H_{j-1}) + C C_M delta_j h_j h_{j-1} + k_j^{-1/4} sums to lambda_max(H_j) <= K_B + 1 (p. 53), closing Section 5.4.
  • Obligation: It satisfies every requirement at once and uniformly over infinitely many stages. (i) (3.12) at each stage: the new frequency dominates all polynomial data, including the inherited K_h = k_{j-1}^{C*}. (ii) The geometric budget (4.5). (iii) Nested intervals with a finite accumulation time. (iv) Summable pressure-Hessian and initial-gradient changes, which preserve (5.5) and hence coercivity. (v) Summable initial increments in every H^m (used in Section 6).
  • Mechanism: All logarithms of scales are x_{j-1}/j^A with different powers A. So at stage j the ordering is k_j >> delta_j^{-1} >> l_j^{-1} >> h_j, each separated by a factor exp(c x_{j-1}/j^A). Because x_j = j^2 x_{j-1}, each stage's scales dwarf every power of the previous stage's scales. The exponential gain e^{-b x_{j-1}} from amplification beats k_j^m, l_j^{-m} and every polynomial in P_j for each fixed m once j is large, since b x_{j-1} >> m x_{j-1}/j^2. The time increments ~ x_j x_{j-1}/sqrt(h_{j-1}) decay super-exponentially, so t_j -> T_infty <= S_base. The paper stresses that "None of these comparisons requires an inequality of the form e^{P_j^c} << k_j" (p. 51): every loss in the construction is polynomial.
  • Antecedent: None cited.
  • Cost: None downstream. This is the closing layer. The order of choices must respect dependencies: c0 and Q never change when J or x0 change, and B_c and L are evaluated at the final x0 (p. 47).
  • Backward question: Can amplitudes, frequencies, localization lengths, profile concentrations and time widths be chosen so that each stage's frequency dominates every polynomial loss inherited from earlier stages, the amplification gain e^{-b x_{j-1}} dominates the derivative losses k_j^m in the initial data and the Hessian costs h_j h_{j-1}, and the time increments are summable?
  • Checkable: Yes, structurally, in log space. For chosen J and x0, generate log x_j, log h_j, log k_j, log delta_j^{-1}, log l_j^{-1} from (5.3). Verify (5.12), (5.13), (5.14), (5.15), (5.16), the log exponents in (6.1)-(6.2), and summability of W_j. The constants c0, Q, b, c and C are not explicit in the paper, so they must be set to representative values (for example Q = 10, b = 0.1, c = 10, C* = 80). This checks the structure, not the actual thresholds.
  • Depends on: ME.17 (Uses the gap exp(-b x_{j-1}) of (4.12)-(4.13) for the pre-amplification cost (5.15), and keeps a and beta x^2 in their windows by (4.10) and (4.7) by (4.11).); ME.10 (Chooses the frequencies so that (3.12), P_j^Q <= k_j^{theta/100}, holds at every stage for the packet size P_j of (5.10), as verified in (5.12).); ME.12 (P_j contains the inherited particle-map constant K_h = k_{j-1}^{C*} from (3.16), which forces log k_j = x_{j-1}/j^2 and J >> C* Q/theta.); ME.4 (Sums the positive Hessian parts C C_M delta_j h_j h_{j-1} left by the one-sided profile (5.16) to keep lambda_max(H_j) <= K_B + 1 (Section 5.7).)
  • Refs: pp. 45-54, (5.3)-(5.18); p. 47 (order of choice and requirements 1 to 3); p. 51, (5.17); pp. 52-53.
  • Verification: statement completeness audit 2026-10-01: TRUNCATED; statement replaced from the digest; hypotheses not-checked; computation checked False

ME.20: The limiting datum, the stability contradiction, and the continuation criteria

Node ns-me-20-the-limiting-datum-the-stability-contradiction-and-the, kind move, pp. 54-56.

  • Statement: Section 6 (pp. 54-56): by (6.1)-(6.2) the initial increments are summable in every H^m, so U_j(0) -> u0, smooth, compactly supported, odd and divergence free (6.3), with 0 < t_J <= T_infty <= S_base (6.4). If T*(u0) > T_infty, the H^3 stability estimate (6.5) gives U_j -> u on [0, t_j], contradicting ||M_j(t_j,0)|| >= h_j - C_M h_{j-1} - k_j^{-1/4} -> infinity; so T*(u0) <= T_infty < infinity (6.6). Then limsup ||grad u||_infty = infinity, and by (6.7) integral_0^{T*} ||omega||_infty dt = infinity.
  • Obligation: It converts a sequence of distinct exact solutions into one smooth compactly supported datum whose solution must break down, and it proves both divergence statements of Theorem 1.1.
  • Mechanism: Summability comes from the exponential amplification gap: the packet's initial size carries e^{-b x_{j-1}}, which beats the phase-derivative loss k_j^m. The mean increment has no phase factor at all, which is why the term m x_{j-1}/j^2 is absent from (6.2). Stability is a plain H^3 energy estimate, with constants depending only on the hypothetical smooth solution u. Its failure at the target times comes from the exact central gradient lower bound. The vorticity statement is the Beale-Kato-Majda argument, proved here with an explicit three-region Biot-Savart splitting and energy conservation.
  • Antecedent: Beale, Kato and Majda [1] (continuation criterion, p. 1); Kato [24] (local existence).
  • Cost: None downstream. It consumes: common compact support of all increments (|a| <= l_j/2 oscillatory, |a| <= 2 mean), summability in every H^m, t_j increasing to T_infty < infinity, and the target-gradient lower bound.
  • Backward question: Given exact solutions whose initial data converge smoothly and whose gradients at time t_j -> T_infty diverge, why must the solution from the limiting datum fail to be smooth up to T_infty, and which continuation criterion then diverges?
  • Checkable: None: pure estimate (stability and continuation).
  • Depends on: ME.1 (Takes the exact odd solutions U_j with data in a fixed ball, t_j increasing to T_infty, and the targets (2.1), and passes to the limit datum u0.); ME.19 (Uses the scales (5.3), log P_j = o(x_{j-1}/j^2) and T_infty <= S_base to make (6.1)-(6.2) summable and the accumulation time finite.); ME.17 (The oscillatory increments carry alpha_j <= P_j^c e^{-b x_{j-1}} from the normalization (4.13); this gap beats the phase-derivative loss k_j^m in (6.1).); ME.6 (The mean increments obey (3.17), H^m norm <= l^{-m} k^{-2} P^{cm} with support in |a| <= 2, which gives (6.2) and the common compact support.)
  • Refs: pp. 54-56, (6.1)-(6.7); p. 13, (3.17); p. 44, (5.2).
  • Verification: statement completeness audit 2026-10-01: INCOMPLETE; statement replaced from the digest; hypotheses astra-spot-check-2026-10-01; computation checked False; Astra spot-check: correct