{"id":"fafcb17b-cc6b-4171-90eb-f95ab49453f7","arxiv_id":"2602.10268","paper_version":3,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"A variable-step second-order ETD-mr-SAV scheme for the periodic NSE is claimed to be uniformly long-time stable, but the proof's key sum bound is erroneous and second-order accuracy is only argued heuristically.","lead":"An exponential time-differencing scheme with a mean-reverting scalar auxiliary variable is claimed to be unconditionally long-time stable for the periodic incompressible Navier-Stokes equations, even with variable time steps. The stability proof contains a false Riemann-sum bound, so the claimed step-independent estimate is not proven; a weaker step-dependent bound appears to hold.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.3 hinges on the false Riemann-sum inequality (4.19); for a single large step the left side is τ while the right side is ~1/θ, so the claimed step-independent bound is unsupported.","rationale":"The reader's weakest_assumption identifies exactly the same load-bearing gap: inequality (4.19) is the unique step in the proof that removes all dependence on the time-step sequence. My independent check confirms the inequality is false as stated — it is a left-endpoint rather than right-endpoint Riemann sum, and a single large step already violates it. Thus Theorem 4.3's advertised unconditionally step-independent bound is unsupported by the proof as written. I do not propose to change the reader's verdict, because the reader already marked the paper CONDITIONAL; this concern reinforces that conditionality rather than moving it. The paper does contain genuine contributions (a new scheme, efficient implementation, and nontrivial numerical experiments), and a repaired argument may be possible using sharper φ1 estimates that saturate the per-step forcing terms; but until such a repair is supplied, the central theorem cannot be taken as established.","tokens_in":20286,"tokens_out":9318,"duration_ms":99834,"concrete_test":"Check (4.19) analytically in the one-step case: take n=1, θ=1, τ_2=10. The left side is τ_2 = 10, while the right side is (1−e^{-10}) ≈ 0.99995, so the inequality fails. Then independently re-derive the iteration (4.17)→(4.8) with a correct summation bound; if the resulting constant contains sup_i τ_i (or an equivalent step-size factor), Theorem 4.3's step-independent form must be revised.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central step of the proof of Theorem 4.3 is inequality (4.19), which claims sum_i e^{-θ S_{i+1}} τ_{i+1} ≤ ∫_0^{S_1} e^{-θx} dx = (1−e^{-θS_1})/θ. But {S_i} is decreasing in i, and e^{-θx} is decreasing, so on each interval [S_{i+1}, S_i] the sum uses the left endpoint S_{i+1}, i.e. the maximum value of the integrand. The displayed sum is a left-endpoint Riemann sum and overestimates the integral; the text's justification ('right-end Riemann sum of a monotonically decreasing function is bounded by the corresponding integral') is exactly backwards. For n=1 the inequality reduces to τ_2 ≤ (1−e^{-θτ_2})/θ, which fails as soon as θτ_2 is large; e.g. θ=1, τ_2=10 gives 10 ≤ 0.99995. Consequently the derivation of the step-independent constant 1/θ in (4.8) from the one-step recursion (4.17) is invalid. A correct discrete Gronwall estimate would leave a dependence on sup_i τ_i (or an equivalent left-sum error). Since Theorem 4.3 is the advertised 'arbitrary step sizes, all Reynolds numbers' stability result, the central claim as stated is not proved. The numerical experiments use small or adaptively controlled steps and do not test the unbounded-step regime needed to justify (4.19).","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a variable-step, second-order exponential time-differencing (ETD) scheme for the periodic incompressible Navier–Stokes equations, combining a mean-reverting scalar auxiliary variable (mr-SAV) formulation with a dynamic second-order SAV correction. An embedded adaptive variant is also given. The central theoretical claim (Theorem 4.3) is an unconditional uniform-in-time L2 bound for arbitrary variable step sizes, holding for all Reynolds numbers under bounded forcing. Numerical experiments in 2D demonstrate second-order convergence, long-time boundedness, and effective adaptive error control.","tokens_in":20737,"tokens_out":14366,"duration_ms":140763,"significance":"The construction is attractive and, if Theorem 4.3 were proved, would constitute a notable advance: to my knowledge no earlier higher-order variable-step scheme for the NSE has a rigorous uniform-in-time energy bound under general forcing. The per-step cost is low (two Stokes solves plus one scalar cubic equation), the stability analysis is self-contained, and the numerical study is fairly thorough. However, the proof of the main theorem contains a false Riemann-sum inequality and an insufficiently sharp one-step forcing estimate; the advertised step-size-independent conclusion is therefore not established.","major_comments":[{"comment":"The claimed inequality is reversed. On the partition 0=S^n_{n+1}<...<S^n_1, the sum Σ_i e^{-θS^n_{i+1}}(S^n_i−S^n_{i+1}) is a left-endpoint Riemann sum for the decreasing function x↦e^{-θx}, hence it is ≥ the integral, not ≤. For n=1 it asserts τ_2≤(1−e^{-θτ_2})/θ, which is false for large θτ_2 (e.g. θ=1, τ_2=10 gives 10≤0.99995). Consequently (4.8) does not follow from (4.18); the step-independent bound in Theorem 4.3 and in the abstract is unsupported.","section":"Section 4, Eq. (4.19)"},{"comment":"Independently of (4.19), the one-step recursion has a forcing increment linear in τ_{n+1}: X_{n+1}≤e^{-θτ_{n+1}}X_n+τ_{n+1}C. Even with a correct discrete Gronwall inequality, this recursion cannot yield a constant independent of the step sizes; for one large step the bound gives τ_2C, whereas the scheme's forcing term τφ_1(τνL)F in (3.3a) tends to (νL)^{-1}F and the exact scalar model gives (1−e^{-θτ})/θ·F. The estimate (4.12) is therefore too crude to support the advertised step-independent constant. A repair should sharpen (4.12) to a factor of (1−e^{-θτ_{n+1}}), or the theorem's claim must be weakened.","section":"Section 4, Eqs. (4.17) and (4.12)"},{"comment":"The experiments use uniform steps τ≤0.01 or adaptive steps with τ_max=1e-2 and tolerances that keep steps small; for the reported parameters θτ is small (e.g. ν=1/40, λ_1=1, τ=0.01 gives θτ≈2.5e-4 when θ=νλ_1). The tests therefore do not exercise the large-θτ regime in which (4.19) fails and cannot be invoked as numerical confirmation of the arbitrary-step claim. A test with a single very large step (or with θτ≫1) would be informative.","section":"Section 5, Examples 5.2–5.3"}],"minor_comments":[{"comment":"The indicator e_q=|r^{n+1}-1| appears to measure deviation from 1, while the construction drives r toward 0; Figure 5(c) plots |r|. This is inconsistent and should be corrected or clarified.","section":"Algorithm 1, Step 4"},{"comment":"For the k=1 variant of (2.4b), the r-update appears to lack the factor (1−¯r^{n+1}) that would make the nonlinear-term cancellation analogous to that in Theorem 4.3; please verify the displayed formula.","section":"Equation (3.9b)"},{"comment":"The symbols S_i^n and S_n are used with overlapping meanings, and the phrase 'right-end Riemann sum' in (4.19) should be corrected to 'left-endpoint' (or the inequality reversed).","section":"Notation around (4.18)–(4.19)"},{"comment":"The claim that the 'explicit Adams–Bashforth ETD multistep scheme is second order; see [30]' is stated without detail; please provide a precise statement or derivation, since this is a key part of the heuristic accuracy argument.","section":"Remark 3.2"}],"recommendation":"major_revision","confidential_remarks":"The false Riemann-sum inequality at (4.19) is a load-bearing error: it is the step that removes all step-size dependence from the final bound. The issue is specific and potentially repairable by sharper φ_1-based estimates, but until then the core novelty claim should not be accepted. The numerical simulations are plausible but do not address the regime where the proof fails."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a genuinely new ETD+SAV scheme with a clean two-Stokes-solve structure and reasonable experiments, but the paper's headline claim — unconditional uniform-in-time L2 stability for arbitrary variable steps — is not established. The proof of Theorem 4.3 breaks at inequality (4.19), and the stress-test note has it right. For a decreasing integrand, e^{-θ S_{i+1}} τ_{i+1} is a left-endpoint sum on [S_{i+1}, S_i], so it overestimates ∫ e^{-θx} dx. For n=1 the claim reduces to τ ≤ (1-e^{-θτ})/θ, which fails for θτ large. So the step-independent constant 1/θ in (4.8) does not follow. That is a load-bearing flaw: the abstract and introduction promise arbitrary time-step sizes and all Reynolds numbers. The one-step recursion (4.17) alone is correct and may still give a useful step-dependent bound, but that is not what is advertised.\n\nWhat is good: the scheme is a real combination of mr-SAV, dynamic second-order correction, and ETD multistep; it costs only two Stokes solves and one cubic root per step, which is attractive. The numerical study is honest in what it shows: second-order rates under variable steps, bounded enstrophy for the tested cases, adaptive step control, and statistical consistency. It does not test the regime that would matter for (4.19) — large or wildly varying steps — so the experiments do not rescue the theorem.\n\nOther soft spots: second-order accuracy is only a heuristic argument; there is no convergence theorem, and the authors say so. The adaptive error indicator e_q=|r^{n+1}-1| looks like a typo; if r should be near zero, that should be |\\bar r - r| or just |r|. Minor compared to the missing theorem.\n\nBottom line: the paper deserves a serious referee but a major revision. If the stability claim can be repaired to a step-dependent bound or a different argument, the scheme is still a useful contribution to long-time NSE integration. As it stands, I would not cite Theorem 4.3 as proved.","headline":"The new scheme and experiments are worth a look, but the central 'arbitrary step size' stability theorem is not proved: (4.19) compares a left-endpoint Riemann sum to an integral in the wrong direction.","tokens_in":21161,"tokens_out":3827,"would_cite":false,"duration_ms":41896,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65M12","65L04","65L05","76D05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proposes a second-order exponential time-differencing scheme for the periodic incompressible Navier–Stokes equations that it claims is unconditionally uniform-in-time stable: the discrete L2 energy stays bounded for all time, for","keywords":["Navier–Stokes equations","exponential time differencing","mean-reverting scalar auxiliary variable","unconditional stability","long-time stability","variable time stepping","adaptive time stepping","uniform-in-time bound"],"falsifier":"For a partition consisting of a single step of size τ, inequality (4.19) would assert τ ≤ ∫_0^τ e^{-θx}dx = (1−e^{-θτ})/θ, which fails for every τ>0; computing these two quantities for any θ>0, τ>0 settles that the proof's key estimate is invalid as written.","tokens_in":20216,"feed_emoji":"🌊","tokens_out":9729,"duration_ms":87872,"temperature":0.7,"pith_summary":"The paper aims to show that a second-order exponential time-differencing scheme, augmented with a mean-reverting scalar auxiliary variable and a dynamic second-order correction, preserves the uniform-in-time energy boundedness of the continuous Navier–Stokes equations even when the time step is changed arbitrarily. If true, this would be the first higher-order variable-step method for the incompressible NSE with a provable L∞(0,∞;L2) bound under general L2 forcing, opening the way to reliable computation of long-time statistics. The scheme is fully linear in the fluid variables, requiring two Stokes solves and one cubic root per step, and comes with an embedded adaptive first-order companion. The central stability theorem is Theorem 4.3, whose proof uses exponential decay factors from the viscous and mean-reverting terms and a purported step-size-independent Riemann-sum estimate.","feed_headline":"All-time stability claimed for variable-step Navier–Stokes ETD","feed_subtitle":"A mean-reverting auxiliary variable is key; the scheme promises a uniform energy bound for any step sizes.","key_machinery":"The mean-reverting scalar auxiliary variable r(t), driven by dr/dt + γr = −(r−1)^{k-1}⟨B(u,u),u⟩ with γ>0, is the load-bearing mechanism: it damps any deviation of r from 0, and the r+1 shift in the stability estimate converts the damping into exponential decay. The ETD filtering functions φ0(z)=e^{-z} and φ1(z)=(1-e^{-z})/z treat the Stokes operator exactly and yield the identity that turns the viscous dissipation into a contraction e^{-θτ} per step. The dynamic second-order correction, using (1-r²) in the nonlinear term, makes the scheme second-order accurate even though r itself is only first-order accurate.","core_discovery":"The central claim is that the ETD-mr-SAV-MS2o scheme is unconditionally long-time stable: for any variable time-step sequence, the quantity ||u^{n+1}||^2 + |r^{n+1}+1|^2 decays like e^{-θ∑τ} toward a data-dependent constant, where θ = min{νλ1, γ} and the constant involves only the forcing size and γ. This bound is independent of the Reynolds number and of all step sizes, meaning the numerical solution cannot blow up even with arbitrarily large or wildly varying time steps. The proof cancels the nonlinear advection exactly via the skew-symmetry relation ⟨B(u,u),u⟩=0, leaving only viscous dissipation and the mean-reverting damping of the auxiliary variable r.","pith_inferences":["The proof's key step-size-independent constant rests on inequality (4.19), which mislabels a left-endpoint Riemann sum as a right-endpoint one; for a single step the claimed inequality requires τ ≤ (1–e^{–θτ})/θ, which is false. A corrected bound would likely replace the constant by one depending on max τ, so the advertised 'unconditional' step-size independence may not follow from this argument, ","The mean-reverting parameter γ is central: as γ→0 the scheme reduces to a standard SAV-ZEC formulation and the uniform bound degrades; testing γ across orders of magnitude would reveal how the long-time constant actually scales.","Because the cancellation of the nonlinear term uses only the skew-symmetry of B, the same proof strategy may extend to spatial discretizations that preserve ⟨B(u,v),v⟩=0, making the variable-step stability robust beyond Fourier spectral methods.","The adaptive controller's step acceptance/rejection rule could be supplemented by monitoring the actual one-step contraction factor e^{-θτ}, giving a computable certificate of the uniform bound during simulation; the paper does not propose such a certificate."],"forward_implications":["If the central claim holds, the method can integrate the 2D/3D periodic NSE over arbitrarily long intervals with a guaranteed uniform L2 bound, regardless of Reynolds number or step-size choices (subject to bounded forcing).","Second-order accuracy under variable steps is achieved at a cost of only two Stokes solves and one scalar cubic root per time step.","The embedded first-order companion enables automatic step-size control with a preserved long-time stability certificate for the accepted steps.","For unforced flows (F=0), the bound predicts exponential decay of the discrete energy with rate θ, matching the continuous dissipation structure.","The framework is positioned as a foundation for approximating long-time statistical quantities and rare-event statistics in turbulent regimes without step-size restrictions."],"fun_headline_variants":["Any step size, zero blow-up: new Navier-Stokes scheme","Unconditional stability for variable-step NSE solvers","Mean-reverting trick stabilizes Navier-Stokes ETD","Variable-step ETD scheme: stable for all Reynolds"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The theorem's step-size-free constant depends on inequality (4.19), which treats a left-endpoint Riemann sum of a decreasing exponential as if it were bounded above by the integral; that inequality is generally false, so the advertised independence from time-step sizes is not established by the given proof.","fun_headline_variants_meta":{"raw":{"variants":["Any step size, zero blow-up: new Navier-Stokes scheme","Unconditional stability for variable-step NSE solvers","Mean-reverting trick stabilizes Navier-Stokes ETD","Variable-step ETD scheme: stable for all Reynolds"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000294,"raw_usage":{"total_tokens":1604,"prompt_tokens":854,"completion_tokens":750,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":598,"completion_tokens_details":{"reasoning_tokens":681}},"tokens_in":598,"tokens_out":750,"duration_ms":6052,"temperature":1.0,"reasoning_tokens":681,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T01:13:27.312813+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a partition consisting of a single step of size τ, inequality (4.19) would assert τ ≤ ∫_0^τ e^{-θx}dx = (1−e^{-θτ})/θ, which fails for every τ>0; computing these two quantities for any θ>0, τ>0 settles that the proof's key estimate is invalid as written.","supporting_citations":[],"review_version":1}