arXiv:2607.25610v1

Brjuno condition through best approximations and the linearization problem

Nicolas Chevallier, João Lopes Dias, José Pedro Gaivão, Antoine Marnat, Nikolay Moshchevitin

math.DS

Abstract

We consider the classical analytic linearization problem for vector fields on the torus Td\mathbb{T}^d close to a constant vector field ωω. Our goals are twofold. First, we provide a geometric framework in which the arithmetic condition governing analytic linearization arises naturally from the orbit of a unimodular lattice associated with ωω under a diagonal flow on SL(d,Z)\SL(d,R)\operatorname{SL}(d,\mathbb{Z})\backslash \operatorname{SL}(d,\mathbb{R}). Within this framework, a summability condition emerges as the natural criterion for convergence. We prove that it is equivalent to several classical formulations of the Brjuno condition for linear forms, including those involving best approximation vectors and switching times of the diagonal flow. As a byproduct, we obtain a new quantitative linearization theorem with fully explicit estimates. In particular, the loss of analyticity of the conjugacy is controlled by a Brjuno function.

AI-generated audit

Audit summary

Audited against arXiv v1

Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.

Current report

Detailed mathematical audit

Generated August 20, 2026
01Statements3 reported findingsCorrect

The equivalent Brjuno conditions for linear forms and the quantitative analytic linearization theorem are correct. The displayed notation slips identified below do not alter any mathematical claim.

Theorem 1.1Correct

The geometric, best-approximation, and integral Brjuno criteria agree

Pages 3 and 6–14 · Theorem 1.1 and Section 3 · arXiv:2607.25610v1

The switching times of the diagonal-flow shortest-vector function correspond to successive best approximations. On each affine segment the integral contribution is comparable to the associated logarithmic best-approximation term, and the endpoint estimates make all four summability conditions equivalent.

Full paper, version 1
Theorem 1.2Correct

The announced analytic conjugacy follows with the explicit Brjuno loss

Pages 4 and 14–21 · Theorem 1.2 and Section 4 · arXiv:2607.25610v1

The far-from-resonance homological equation is solved with the stated divisor bound, the retained resonance cone is narrowed at every switching time, and the accumulated analyticity loss is exactly the convergent Brjuno quantity controlled in Theorem 1.1.

Local displayed notationTypos · no status impact

The displayed symbol and index mismatches are typos

Pages 11, 18, 30, and 33–34 · Lemma 3.13, Proposition 4.8, and Appendices B–C · arXiv:2607.25610v1

The intermediate inequality in Lemma 3.13 needs akak1a_k-a_{k-1}, not the reversed difference. Proposition 4.8 needs ϕn\phi_n in its condition, not the unbound ϕk\phi_k. Appendix B must read DG(0)1|DG(0)^{-1}| and Lemma B.3 needs ω|\omega|, without the stray subscript ρ\rho. In Appendix C, the norm-equivalence chain must begin with p^n22|\widehat p_n^2|_2, and the last ratio must use p^m11|\widehat p_m^1|_1 in its denominator. Every repair is fixed by the immediately adjacent definition or equality and leaves the estimates unchanged.

02Proofs1 reported findingCorrect

The arithmetic comparison and analytic iteration are complete after the local typo corrections; all convergence estimates use compatible constants and quantifiers.

Sections 3–4 and Appendices A–CCorrect and complete after the stated repairs

The proof chains close after the stated symbol repairs

Pages 6–35 · arithmetic equivalences, iterative scheme, and appendices · arXiv:2607.25610v1

The best-approximation intervals partition the relevant flow scales, while the Banach-space estimates control composition, inversion, and the constant term. The chosen initial radius dominates the sum of later losses, so the coordinate changes converge to the claimed analytic conjugacy.

03Novelty0 reported findingsNo non-novelty findings

No non-novelty findings.

Detailed audit reportFull reasoning, manuscript locations, and references.
Open report PDF ↗

Author response

Challenge an audit finding

Local workflow preview

A listed author may submit formal evidence that an audit is inaccurate. The response would be considered in a fresh AI re-evaluation; it would not edit the audit automatically.

Paper
arXiv:2607.25610v1
Authors listed
Nicolas Chevallier, João Lopes Dias, José Pedro Gaivão, Antoine Marnat, Nikolay Moshchevitin
Audit date
August 20, 2026
  1. 01Establish identityMatch an authenticated scholarly identity to this paper.
  2. 02Submit evidenceIdentify the finding and give a formal mathematical response.
  3. 03Re-evaluateA separate agent checks the response and records a disposition.
Recommended production method

Authenticate with ORCID, then require an exact arXiv match

MathAudit should accept the identity only when ORCID OAuth authenticates the claimant's iD and this exact arXiv paper appears in arXiv's public authority feed for that iD. A matching name alone is not sufficient.

ORCID OAuth and arXiv authority-record lookup are not connected in this local prototype.

Email fallback for papers without a linked ORCID

A production fallback could send a one-time link only when the submitted address matches an independently maintained author-contact allowlist for this paper. MathAudit must return the same message for every address so the form cannot reveal which contacts are on that list.

This demonstration does not send, store, or compare the address.

Structured response preview

This form remains unavailable until production identity verification succeeds. Nothing entered here is submitted.

This panel never establishes authorship in the local prototype. A production result should be described narrowly as an authenticated ORCID match or control of a separately allowlisted author-contact mailbox.