{"id":"edd9888d-18ea-4f14-b541-0542db1befef","arxiv_id":"1908.02523","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"An optimized Arnold scheme yields explicit sharp smallness conditions and optimal oscillation estimates for persisted KAM tori.","lead":"This paper makes Arnold's 1963 proof of Kolmogorov's KAM theorem fully quantitative, with every constant written out. It shows that Arnold's pointwise scheme achieves the same sharp smallness threshold and optimal torus oscillation bounds as the modern Kolmogorov scheme.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Weakest point is the unverified induction constants in the post-first-step iteration; a single algebraic slip would break the claimed sharpness.","rationale":"The reader's verdict is ACCEPT with moderate confidence, and their weakest_assumption points to the delicate control of K_j and T_j in the iteration, which is indeed the heart of the proof. My stress-test agrees that this is the load-bearing part. However, I differ in that I identify a more specific and testable sub-issue: the explicit constants C* and the final verification of Lemma 3's hypothesis (51) are not machine-checked, and the chain of inequalities in §3.3 is compact and involves several non-sharp bounds. A single algebraic slip in the definition of C10, C11, C12, C14 or in the exponent of (s−s*) would break the stated smallness condition without affecting the overall KAM strategy. This warrants a conditional verdict rather than unconditional acceptance, because the central claim is quantitative and the constants must be exactly right. The concrete test—recomputing the chain with the given definitions—would settle this. If the recomputation succeeds, the paper's claim stands; if not, the constant C* must be adjusted, which is a meaningful but repairable defect. I do not see a fundamental flaw in the proof structure, and the sharpness argument via the pendulum example is convincing, so REJECT or UNVERDICTED would be too harsh.","tokens_in":22835,"tokens_out":882,"duration_ms":12069,"concrete_test":"Independently re-derive the inequalities in §3.2.2, step by step, substituting the definitions of C6, C7, C8, C9, C10, C11, C12, C14, C and C* into the final verification in §3.3. In particular, check that C8 θ_0^{1/8} ˆǫ1 ≤ 1 follows from the final smallness condition ǫ ≤ (s−s*)^a / (C* θ^4), and that the exponent a = 6τ+3d+8 matches the exponent in (62) and in the final convergence bound. This could be done by hand or with a symbolic algebra system; if the inequality fails for some allowed parameter values (e.g., d=2, τ=1), the stated C* is too small and the quantitative claim must be weakened.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper's central claim is the sharp asymptotic smallness condition ε ≲ (s−s*)^a / (C* θ^4). The proof rests on Lemma 3's induction, where the contraction factor is C8 θ^{1/8} ˆǫ1 < 1. The derivation of this factor uses a chain of explicit constants (C6, C7, C8, C14, C*) and multiple crude bounds, e.g., the estimate in §3.2.2 bounding ε^{2i} L_i (3σ_i^{-1}) by ˆǫ_i / θ_* and then using (log t)^{2ν} ≤ t^{1/2} and (log t)^{4ν} ≤ (4νe^{-1})^{4ν} √t. A single algebra error in the exponent of σ_0 or θ_0, or in the power of ˆǫ1, would invalidate the stated condition (14). The authors explicitly say 'all constants are explicitly computed' but provide no machine check; the expressions for C10, C11, C12, C14 and the final C, C* involve nested definitions that are easy to mistranscribe. The reader's weakest_assumption points to the delicate control of K_j and T_j; I agree that this is the core, but the more specific risk is that the explicit constant C* does not actually satisfy the chain of inequalities required by Lemma 3. This is not an objection to the strategy—which is standard—but to the quantitative claim being exactly as stated.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper revisits Arnold's 1963 proof of Kolmogorov's theorem and develops a quantitative, pointwise version of Arnold's scheme. The main result, Theorem A, asserts that under the Diophantine and non-degeneracy assumptions (12), if α ≤ r/T and the rescaled perturbation ǫ = K P ε/α² satisfies (14) with exponent a = 6τ+3d+8, then the unperturbed torus persists as a real-analytic Lagrangian torus and satisfies the displacement bounds (16). The proof is organized as an explicit one-step estimate (Lemma 1), a special first step (Lemma 2), an iterative construction with a super-exponentially convergent sequence (Lemma 3), and a final constant-collection argument in §3.3 and Appendix A. The paper also uses the pendulum to illustrate that the resulting ε/α² smallness condition and the ε/α oscillation bound are asymptotically sharp in their dependence on ε and α.","tokens_in":1231,"tokens_out":1459,"duration_ms":266905,"significance":"If correct, this is a valuable contribution: it turns Arnold's pointwise scheme into a fully quantitative theorem with explicit constants depending only on d and τ, it isolates the technical reason why the first step must be treated separately, and it demonstrates that the scheme reaches the same asymptotic scalings as the pendulum benchmark. The proof is self-contained, uses standard Cauchy and Fourier estimates plus an implicit function theorem, and the constants are collected in Appendix A. The paper also proves Kolmogorov non-degeneracy of the constructed torus in Appendix B. The main risk is the intricate chain of explicit constants, which is not machine-checked; I checked the closing inequalities of §3.3 and found them broadly consistent, with one important exception discussed below.","major_comments":[{"comment":"The displayed inequality (63), namely (log t)^{4ν} ≤ (4ν e^{-1})^{4ν} √t for all t > 1, is false as stated; for ν = 1 and t = e^2 the left side is 16 and the right side is about 7.39. The related footnote claim in §3.2.2, \"(log t)^{2s} ≤ t^{1/2} for all t ≥ e, s ≥ 1/4\", is also false (take ν = 1, s = 1, t = e^2). These inequalities are used in the proof of the logarithmic bound (62) that controls κ_j in Lemma 3, and again in §3.3 to pass from ǫ^2 (log ǫ^{-1})^{2ν} to ǫ^{3/2}. The written proof therefore contains a gap at a load-bearing point. The needed estimates are weaker than the false statements and appear to follow from the explicit smallness conditions (41) and the size of C9, C14, and C*, so the gap is repairable, but the authors must replace the false inequalities with correct ones and justify them in the parameter range actually used.","section":"§3.2.2 and §3.3, Eq. (63) and footnote 14"}],"minor_comments":[{"comment":"In the block of definitions before Lemma 2, the formula for ¯s_j contains an undefined index i; it should read ¯s_j := s_j − 2σ_j/3.","section":"§3.2, definition of ¯s_j"},{"comment":"The notation pκP for the Fourier truncation is easily confused with the product of the scalar κ and P; a clearer notation such as p_κ P or Π_κ P would improve readability.","section":"§3.1, Step 1 and Eq. (27)"},{"comment":"The sentence 'deforms ... into a a Lagrangian torus' contains a duplicated article 'a'.","section":"Introduction, paragraph b"},{"comment":"The sharpness comparison uses the pendulum, which is one-dimensional, while Theorem A is stated for d ≥ 2; a sentence clarifying that the sharpness refers to the scaling in ε and α rather than to a matching counterexample in the theorem's range would avoid a possible misunderstanding.","section":"Introduction, pendulum discussion"},{"comment":"Given the length and nested structure of the constant list, a short computer-assisted verification of the algebraic inequalities involving C0, ..., C*, C, and C* would substantially increase confidence in the explicit-constant claim.","section":"Appendix A and §3.3"}],"recommendation":"major_revision","confidential_remarks":"The paper is strategically sound and very likely correct after a small but real technical fix: the false logarithmic inequality in §3.2.2 and §3.3 must be replaced by a valid estimate valid in the parameter range forced by (41). Because the issue appears in the core induction, I recommend major revision rather than acceptance in the current form; I do not see reasons to doubt the central claim, and the explicit-constant verification would be a welcome addition."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This paper does something real: it takes Arnold's 1963 pointwise scheme, separates the first step from the iteration, and proves sharp asymptotic smallness and oscillation bounds with all constants written out. The comparison with Villanueva's optimized Kolmogorov scheme is fair, and the authors are right that no one had shown Arnold's scheme achieves the same optimal epsilon/alpha-squared threshold and O(epsilon/alpha) displacement bound. The first-step treatment is a genuine technical device, not just bookkeeping; it removes a logarithmic loss that would otherwise spoil the displacement estimate. The pendulum example justifies the sharpness claim about the need for epsilon/alpha-squared smallness, and the paper correctly treats it as a benchmark rather than as a derivation. I believe the central theorem is new and significant for quantitative KAM theory.\n\nThe proof is detailed and follows standard machinery: Cauchy estimates, Fourier decay, an implicit function theorem, and a contraction argument for the inverse transformation. I did not verify every algebraic constant, and neither, apparently, did the stress-test note. That is the soft spot, and it is the only real one. The final constants C and C* are built from a long chain of nested definitions (C7, C9, C10, C14, C*), and a single transcription error or slipped exponent in Lemma 3's induction would compromise the precise form of (14). The authors say all constants are explicitly computed, but there is no machine-checked or computer-assisted verification. For a paper whose entire contribution is the quantitative statement, that is a legitimate referee concern, not a fatal one. Nothing in the logic looks circular or fitted; the smallness condition is derived from the scheme, and the constants are not post-hoc tuned to hit the pendulum bound.\n\nI also think the paper is honest about its own limitations. It states that the threshold is not optimal (Remark 5), notes the iso-energetic extension is only discussed, and does not oversell the measure estimate for the Kolmogorov set, which it only mentions as a potential application. The citation pattern is reasonable; self-citations are used for background and not as support for the main theorem.\n\nWho is this for? Researchers working on quantitative KAM, especially those who care about explicit smallness conditions or want to apply KAM to specific systems. The paper deserves a serious referee; the ideal referee would spend the time to check the constant chain in Lemma 3, especially the definitions of C10, C11, C12, and the final C*, and verify that (51) follows from (14). I would recommend sending it to peer review with that expectation. If the constants check out, it is a solid addition to the literature.","headline":"A genuinely new quantitative KAM theorem for Arnold's pointwise scheme, with explicit constants; the proof structure is sound and the sharpness claim is credible, though the unverified algebraic chain of constants is the main risk.","tokens_in":23604,"tokens_out":904,"would_cite":true,"duration_ms":12135,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37J40","70H08","37J25"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper shows that optimizing the original 1963 pointwise KAM scheme turns it into a quantitatively sharp machine: under mild Diophantine and non-degeneracy assumptions, a real-analytic invariant Lagrangian torus persists as soon as…","keywords":["KAM theory","pointwise KAM scheme","invariant Lagrangian tori","small divisors","Diophantine frequencies","quantitative estimates","Hamiltonian perturbation theory"],"falsifier":"Pick $d=2$, $\\tau=1$, take $H=\\frac12(y_1^2+y_2^2)+\\epsilon(\\cos x_1+\\cos x_2)$ with $\\omega=(1,\\sqrt2)$, compute the Diophantine constant $\\alpha$ and the constants in Appendix A, and check numerically whether the invariant torus exists and obeys (16) whenever (14) holds; a single counterexample below the stated threshold would refute the quantitative theorem.","tokens_in":22653,"feed_emoji":"⚙️","tokens_out":10400,"duration_ms":102917,"temperature":0.7,"pith_summary":"This paper takes a 1963 proof of the classical conservation theorem for conditionally periodic motions, the one that builds an invariant torus as a limit of symplectic transformations on action domains shrinking to a point, and asks how small the perturbation really has to be for the construction to work. The answer is a quantitative Theorem A: for $d\\ge 2$, $\\tau\\ge d-1$, under the Diophantine and non-degeneracy conditions (12), the unperturbed torus persists as a real-analytic Lagrangian torus whenever $\\alpha\\le r/T$ and $\\epsilon=KP\\varepsilon/\\alpha^2\\le (s-s_*)^a/(C_*\\theta^4)$. The smallness condition has the form $\\epsilon/\\alpha^2<c$, and the oscillation of the torus is bounded by a constant times $\\epsilon/\\alpha$; a one-dimensional pendulum computation shows both asymptotic forms are optimal in $\\varepsilon$ and $\\alpha$. All constants are explicit and depend only on $d$ and $\\tau$, so the estimates can be used directly rather than as a bare existence assertion.","feed_headline":"Optimized 1963 KAM proof yields sharp torus bounds","feed_subtitle":"Explicit smallness condition epsilon/alpha^2 < c and displacement O(epsilon/alpha) match a pendulum's limits.","key_machinery":"The engine is a quadratically convergent Newton scheme with a finite small-divisor cutoff. At step $j$ the Hamiltonian is $H_j=K_j+\\varepsilon^{2^j}P_j$, with $K_j$ integrable, $K_j(y_j)=\\omega$, and $K_j$ non-degenerate; a near-identity symplectic map $\\varphi_j$ is built from a generating function $y'\\cdot x+\\varepsilon g(y',x)$, solving the homological equation only for Fourier modes $|k|_1\\le\\kappa_j$ with $\\kappa_j\\sim|\\log(\\varepsilon^{2^j}\\|P_j\\|)|$. The quadratic scheme makes the new perturbation of order $\\varepsilon^{2^{j+1}}$, while the Fourier cutoff controls only finitely many small divisors per step. Two tunings carry the quantitative content: the action radii $r_j$ shrink to a point so that the Diophantine condition holds uniformly on the small domain, and the first step is isolated from the later steps so that a logarithmic factor does not contaminate the leading displacement estimate. The constants $K_j$, $T_j$ are kept within a factor $\\sqrt2$ of their initial values, which is what fixes the constant $\\theta$ in the final threshold.","core_discovery":"On the paper's own terms, the central claim is that the pointwise KAM scheme is quantitatively sharp. Theorem A states that for a real-analytic near-integrable Hamiltonian $H=K+\\varepsilon P$ whose unperturbed frequency $\\omega=K_y(y_0)$ is Diophantine and whose Hessian $K_{yy}(y_0)$ is invertible, there are constants $C,C_*$ depending only on $d$ and $\\tau$ such that the smallness conditions $\\alpha\\le r/T$ and $\\epsilon\\le(s-s_*)^a/(C_*\\theta^4)$ imply the existence of a real-analytic Lagrangian torus $\\mathcal T_{\\omega,\\varepsilon}=\\varphi_*(\\mathbb T^d)$ invariant under the perturbed flow, with frequency $\\omega$ and displacement bounds $\\max\\{\\|u_*\\|_{s_*},\\frac{1}{2e}\\|d_xu_*\\|_{s_*},\\frac{K}{\\alpha}\\|v_*\\|_{s_*}\\}\\le C\\theta^3(s-s_*)^{-a}\\epsilon$. The displacement estimate is the advertised sharp form: the action oscillation is $O(\\varepsilon/\\alpha)$, exactly the size forced by the pendulum's separatrix. The torus is also Kolmogorov non-degenerate, and its dependence on parameters is real-analytic.","pith_inferences":["The same tuning of the scheme should transfer to the iso-energetically non-degenerate case, giving an equally explicit smallness condition on a fixed energy shell; the paper indicates the adaptation is routine.","The logarithmic corrections from the Fourier cutoff are the only non-sharp ingredient in the estimates; a sharper treatment of the Fourier tail might push the threshold closer to the pure $\\varepsilon\\lesssim\\alpha^2$ form.","For concrete low-dimensional Hamiltonians the explicit constants could be evaluated numerically to produce breakdown thresholds for invariant tori, testable against computed invariant curves.","The device of isolating the first step to avoid logarithmic losses in the leading estimate is likely useful in other Newton-type KAM constructions."],"forward_implications":["If Theorem A is correct, the asymptotic threshold for persistence of a Diophantine torus is $\\varepsilon\\lesssim\\alpha^2$, with displacement of order $\\varepsilon/\\alpha$; no hidden steep dependence on $\\alpha$ appears.","The explicit constants make the smallness condition ready for quantitative applications, such as estimating the measure of the Kolmogorov set with complement of size $O(\\sqrt\\varepsilon)$ along the lines the paper discusses.","The constructed torus is Kolmogorov non-degenerate, so the perturbed Hamiltonian admits a normal form with non-degenerate quadratic part, allowing secondary KAM-type arguments to be applied nearby.","The torus depends real-analytically on external parameters whenever the Hamiltonian does, so the quantitative theorem extends to parametric families of perturbations.","The sharper estimates can be used to improve the exponentially long stability time estimates for nearly invariant tori, as the paper notes."],"supporting_citations":[{"why":"Supplies the original pointwise KAM scheme whose quantitative optimization is the paper's subject.","marker":"[1]"},{"why":"States the persistence theorem that the scheme is designed to prove.","marker":"[11]"},{"why":"Gives the quantitative revisitation of the alternative scheme that sets the benchmark for optimal asymptotics.","marker":"[16]"},{"why":"Supplies the Cauchy and Fourier estimates used throughout Lemma 1.","marker":"[4]"},{"why":"Supplies the implicit function theorem used to construct the shifted centers and inverse transformations.","marker":"[6]"},{"why":"Provides the symplectic conjugation argument used in Appendix B to prove Kolmogorov non-degeneracy.","marker":"[15]"},{"why":"Used for the comparison showing the smallness condition is compatible with the optimal measure estimate for the Kolmogorov set.","marker":"[14]"}],"fun_headline_variants":["Arnold's KAM proof sharpened to optimal bounds","Pointwise KAM: explicit smallness and displacement","Sharp tori: Arnold scheme meets pendulum limit","Optimized 1963 KAM yields sharp displacement","KAM tori: explicit constants, sharp asymptotics"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The iteration must keep the Hessian of every intermediate integrable Hamiltonian $K_j$ invertible and keep its norm bounds within a factor of order $\\sqrt2$ of the original values while the action domain shrinks to a point; if the choice of shrinking radii and Fourier cutoffs cannot enforce that, the construction collapses.","fun_headline_variants_meta":{"raw":{"variants":["Arnold's KAM proof sharpened to optimal bounds","Pointwise KAM: explicit smallness and displacement","Sharp tori: Arnold scheme meets pendulum limit","Optimized 1963 KAM yields sharp displacement","KAM tori: explicit constants, sharp asymptotics"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000308,"raw_usage":{"total_tokens":1735,"prompt_tokens":894,"completion_tokens":841,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":510,"completion_tokens_details":{"reasoning_tokens":764}},"tokens_in":510,"tokens_out":841,"duration_ms":9474,"temperature":1.0,"reasoning_tokens":764,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:40:26.003313+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Pick $d=2$, $\\tau=1$, take $H=\\frac12(y_1^2+y_2^2)+\\epsilon(\\cos x_1+\\cos x_2)$ with $\\omega=(1,\\sqrt2)$, compute the Diophantine constant $\\alpha$ and the constants in Appendix A, and check numerically whether the invariant torus exists and obeys (16) whenever (14) holds; a single counterexample below the stated threshold would refute the quantitative theorem.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the original pointwise KAM scheme whose quantitative optimization is the paper's subject."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"States the persistence theorem that the scheme is designed to prove."},{"cited_title":"Villanueva","cited_arxiv_id":null,"evidence_quote":"Gives the quantitative revisitation of the alternative scheme that sets the benchmark for optimal asymptotics."},{"cited_title":"Celletti and L","cited_arxiv_id":null,"evidence_quote":"Supplies the Cauchy and Fourier estimates used throughout Lemma 1."},{"cited_title":"Chierchia, Kolmogorov–Arnold–Moser (KAM) Theory , In : Mathematics of Complexity and Dynamical Systems, Springer New York, 2012","cited_arxiv_id":null,"evidence_quote":"Supplies the implicit function theorem used to construct the shifted centers and inverse transformations."},{"cited_title":"Salamon, The Kolmogorov-Arnold-Moser theorem","cited_arxiv_id":null,"evidence_quote":"Provides the symplectic conjugation argument used in Appendix B to prove Kolmogorov non-degeneracy."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Used for the comparison showing the smallness condition is compatible with the optimal measure estimate for the Kolmogorov set."}],"review_version":1}