{"id":"ee6c6a91-8db8-4361-8fd8-38d5ad863fe8","arxiv_id":"2607.18635","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Global a priori estimates for Davie solutions of rough differential equations are established under Lipschitz-only regularity of elementary differentials via a new explicit remainder formula.","lead":"This paper proves global a priori bounds for rough differential equations driven by α-Hölder paths for all α∈(0,1], assuming only Lipschitz continuity of the elementary differentials—no boundedness or coercivity. It develops a new closed-form Taylor remainder formula built from planar binary trees, providing the key analytic tool for a global solution theory.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Corollary 4.31 as displayed inserts the wrong leaf decoration: `•_k` should be `•_{p(k)}`; for k=2 the stated formula produces spurious τ2↷(τ2↷τ0) terms, so the combinatorial route to Theorem 5.4 is broken as written.","rationale":"The reader identified the combinatorial identity as the main risk, and I agree that this is the load-bearing point. However, I found a concrete internal inconsistency in the displayed statement of Corollary 4.31: the inserted leaf is indexed by `k` rather than by `p(k)`. This makes the stated corollary false for k≥2, because a permutation p with p(k)≠k duplicates label k and omits label p(k), producing grafting terms that do not appear in the Guin–Oudom expansion. The proof of Proposition 4.38 uses the correct `•_{p(k)}` version, suggesting the intended mathematics is sound and the issue is a mis-indexed statement. Nevertheless, as written, the proof chain contains a false formula, and Theorem 5.4 is not fully supported until Corollary 4.31 is corrected and independently verified. This is not a rejection of the paper's potential, but a concrete condition for acceptance: correct the statement and confirm the corrected identity. The verdict is therefore CONDITIONAL rather than UNCHANGED or ACCEPT.","tokens_in":52933,"tokens_out":29549,"duration_ms":242703,"concrete_test":"Symbolically verify Corollary 4.31 for k=2 with the displayed `•_k`: compute both sides using the paper's own definitions (Definition 2.3, Lemma 4.11, Definition 4.16). The RHS will contain the spurious terms `τ2↷(τ2↷τ0)` and `(τ2↷τ2)↷τ0` from p=(2,1), so equality fails for generic τ1,τ2. Then repeat the computation with `•_{p(k)}` instead of `•_k` and confirm the equality holds; also run k=3 symbolically to check signs and J-multi-indices. This isolates whether the error is a simple typo or indicates a deeper combinatorial defect.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central a priori bound in Theorem 5.4 depends on the generalised Taylor expansion of Theorem 4.36, whose proof relies on Corollary 4.31 (via Proposition 4.38). Corollary 4.31 as stated contains `•_k →ℓ ϱ`, but the preceding Lemma 4.30 and the proof of Proposition 4.38 require `•_{p(k)} →ℓ ϱ`. This is not cosmetic. For k=2, take τ1≠τ2. The displayed Corollary gives, for p=(2,1), ϱ=[•2,•0], the terms `τ2↷(τ2↷τ0) − (τ2↷τ2)↷τ0`, multiplied by 1/2, which are neither zero nor part of `(τ2τ1)↷τ0 = τ2↷(τ1↷τ0) − (τ2↷τ1)↷τ0`. Hence the displayed Corollary 4.31 is false as written. The proof of Proposition 4.38 explicitly uses `•_{p(k)}` when it says 'all possible insertions of •_{p(k)} over all trees in T^{p(I_{k−1})}_b span T^{p(I_k)}_b', so the intended statement is repairable. But the chain Lemma 4.11 → Corollary 4.31 → Proposition 4.38 → Lemma 5.10 → Theorem 5.4 contains a false formulated step, and the correctness of the central claim currently rests on an unverified correction of this index.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops an explicit algebraic representation for the remainder of a generalised Taylor expansion of elementary differentials, expressed through planar binary trees, reduction chains, and a family of multi-indices. This representation (Theorem 4.36) is then used to prove global a priori bounds for Davie solutions of branched rough differential equations under only Lipschitz/Hölder regularity of the elementary differentials, with no boundedness or coercivity assumption. The central result is Theorem 5.4 (Theorem 1.1), which controls all solution remainders by the driver, the initial condition, and the initial values of the elementary differentials. The paper is largely combinatorial in character and the analytic part is comparatively short once the algebraic formula is accepted.","tokens_in":53291,"tokens_out":6676,"duration_ms":74859,"significance":"If the main result is correct, it is a substantial contribution: it removes boundedness/coercivity assumptions that appear in earlier treatments and provides quantitative global control of Davie solution remainders. The combinatorial machinery — especially Lemma 4.11 and Theorem 4.36 — is novel and likely to be of independent interest. The proof is detailed and self-contained, with definitions and lemmas checked locally; the paper also contains useful appendices on grafting and weighted norms. The principal risk is the correctness of the extremely intricate combinatorial identity chain; the argument is not machine-checked and independent verification is needed.","major_comments":[{"comment":"The displayed formula has a wrong leaf decoration: the insertion should be •_{p(k)}, not •_k. For a fixed p∈Σ_k, the tree ϱ is in T^{p(I_{k−1})}_b, so its leaves carry decorations p(1),...,p(k−1); the missing label needed to obtain a tree in T^{p(I_k)}_b is p(k). As stated, for k=2, τ1≠τ2 and p=(2,1), the formula produces terms G(•_2→ℓ ϱ), i.e. insertions of τ2 into a tree already labelled by τ1, rather than the correct G(•_1→ℓ ϱ). This is not cosmetic: Proposition 4.38 explicitly invokes this corollary, and its proof at equations (4.34)–(4.36) uses •_{p(k)} with the explicit statement that insertions of •_{p(k)} span T^{p(I_k)}_b. Thus the manuscript as written contains a false statement in the load-bearing combinatorial chain Lemma 4.11 → Corollary 4.31 → Proposition 4.38 → Theorem 4.36 → Lemma 5.10 → Theorem 5.4. The intended statement is clearly repairable by replacing •_k with •_{p(","section":"Corollary 4.31"}],"minor_comments":[{"comment":"In the first display, the summand 'Σ_{m+1}^{ℓ=2} ∥Z[ℓ]∥_{ℓα,µ}' appears to contain a typo: the upper limit should presumably be N+1 (or the sum should be over ℓ=2,...,N+1), since m is not defined in the statement.","section":"Theorem 5.4"},{"comment":"The abstract says α∈(0,1] while the Introduction says α∈(0,1); the main theorem is stated for α∈(0,1] in Assumption 5.1, so the abstract should be aligned.","section":"Abstract and Introduction"},{"comment":"In the base case m=0, the text writes 'R_t^s ∇G(•0)(u1)·z[1] dt1' with an undefined t,s; this is a notational slip from the rough-path specialization and should be written as an integral over u1∈[0,1].","section":"Proof of Theorem 4.36"}],"recommendation":"major_revision","confidential_remarks":"The paper is promising and the central idea appears sound, but the false indexing in Corollary 4.31 is load-bearing. The correction is local and the proof already uses the right index, so I would not reject; however, the manuscript should not be accepted in its current form. I recommend the authors fix Corollary 4.31 and any subsequent references, and carefully re-check the surrounding combinatorial identities for similar label-dependent errors."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a substantial paper and worth one full referee cycle. The new a priori estimates for Davie solutions under Lipschitz elementary differentials — no boundedness or coercivity, all α∈(0,1] — look right, and the analytic skeleton (Sewing bound plus a bootstrap inequality absorbed for small ε) is sound. The genuinely new ingredient is the closed-form remainder formula that only involves gradients, and the planar-binary-tree expansion of Guin–Oudom grafting. The authors are honest about what they do and do not prove, and the comparison with [BCMW22, CG25, Lej12] is accurate.\n\nThe soft spot is exactly where the reader's report suspected: the 30-page combinatorial section 4 is not machine-checked and is extremely intricate. I found a concrete error in Corollary 4.31 as displayed. The sum is over ϱ∈T^{p(I_{k−1})}_b but the insertion is written as •_k→_ℓϱ. To build a tree in T^{p(I_k)}_b from one in the (k−1)-tree set, the new leaf must carry decoration p(k), not k. The displayed formula is false as written: for k=2, p=(2,1), it produces spurious τ2↷(τ2↷τ0) terms. The proof of Proposition 4.38 explicitly uses all possible insertions of •_{p(k)}, so the intended statement is clear and the mistake is a typo with consequences. But a false statement in the middle of the main theorem's proof chain is not cosmetic; the manuscript must be corrected before the chain can be trusted.\n\nAlso minor: the metadata abstract says α∈(0,1), the full text says (0,1]; normalize it. The paper defers global well-posedness to a companion paper — that's a limitation, but clearly stated and not an overclaim.\n\nIf the Corollary is fixed (or a referee confirms the intended statement is the one used in Prop 4.38), the main theorem stands and the contribution is significant: it removes a standard boundedness/coercivity crutch and gives quantitative control of all solution remainders in terms of the driver and initial data.\n\nI would send this to peer review. The referee should verify §4.1–4.4, especially the signs in Lemma 4.11 / Corollary 4.31 and the evaluation multi-indices in Lemma 4.25. The analytic part of §5 is in good shape.","headline":"Real advance in rough path a priori bounds, but the central combinatorial identity (Cor 4.31) has a wrong leaf label as written; likely repairable, but needs correction before the proof chain can be trusted.","tokens_in":53841,"tokens_out":4469,"would_cite":true,"duration_ms":142894,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60L20","16T05","05C05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves global a priori bounds for rough differential equations assuming only Lipschitz continuity of the coefficient combinations called elementary differentials, for any Hölder exponent in (0,1].","keywords":["rough differential equations","branched rough paths","a priori estimates","elementary differentials","generalised Taylor expansions","pre-Lie algebras","planar binary trees","grafting operation"],"falsifier":"Expand (τ1τ2τ3)↷τ0 directly from the recursive definition of the grafting extension and compare it, term by term, with the formula's signed sum over planar binary trees for k=3; any mismatch in a coefficient, sign, or evaluation point disproves the central identity and therefore the remainder representation.","tokens_in":52776,"feed_emoji":"📈","tokens_out":6495,"duration_ms":73150,"temperature":0.7,"pith_summary":"The paper establishes that every solution remainder in the paper's local truncated expansion of a rough differential equation is controlled by the driver, the initial condition, and the elementary differentials — no boundedness or coercivity of the coefficients is needed. The engine is a closed formula for the remainder of a generalised Taylor expansion, written purely in terms of gradients of those elementary differentials, which exploits cancellations optimally. If the proof is right, it provides the quantitative control needed for a global solution theory and for continuity of the solution map in the full Hölder range.","feed_headline":"Global bounds for rough equations from Lipschitz coefficients","feed_subtitle":"A closed Taylor-remainder formula controls every solution remainder, with no bounded or coercive coefficients required.","key_machinery":"The central object is the explicit expansion of the forest-grafting operation — the canonical pre-Lie grafting extended to forests — as a signed sum over planar binary trees, with combinatorial coefficients C(ϱ) that count reduction chains and multi-indices J_{ϱ,ℓ} that choose evaluation points. This expansion rewrites the remainder B^{m+1}(τ) so that only first derivatives ∇Υτ appear, making global Lipschitz assumptions on the elementary differentials sufficient for the bounds.","core_discovery":"The main result is a quantitative a priori bound: under global Lipschitz continuity of the elementary differentials of order at most N-1 and Hölder continuity of those of order N, every weighted Hölder norm of the solution remainders is bounded by a constant times sums of |τ| |Υτ(Z0)| ‖X(τ)‖_{|τ|α} over all decorated trees up to order N. The bound holds for sufficiently small interval length T or weight parameter μ. The proof rests on an explicit algebraic formula, Theorem 4.36, expressing the generalised Taylor remainder as a sum over planar binary trees of products of first derivatives of elementary differentials evaluated at carefully chosen interpolation points.","pith_inferences":["Editorial extension: the cancellation mechanism encoded by the planar-binary-tree expansion may transfer to regularity structures, where the analogous post-Lie grafting could yield a priori bounds for singular SPDEs with unbounded coefficients.","Editorial extension: the combinatorial coefficients C(ϱ) are defined by a natural reduction-chain recurrence; a concrete test is to compare them against direct expansions for forests of size 2 and 3 — a symbolic computation could settle the identity independently.","Editorial extension: the smallness condition on T or μ, needed to absorb error terms, might be removable in many concrete equations by a continuation/bootstrap argument, giving genuinely global-in-time bounds.","Editorial extension: the explicit formula may allow computing the proportionality constants, enabling quantitative rather than merely qualitative a priori estimates."],"forward_implications":["A full well-posedness theory for local (Davie-type) solutions of rough differential equations becomes possible without bounded or coercive coefficients.","The solution map (initial condition, driving path) to the solution is continuous in the natural Hölder topologies.","The a priori control of the highest-order remainder reduces to control of lower-order remainders, yielding a recursive estimate scheme that is uniform in the initial condition.","The result covers the entire range α∈(0,1], including α=1, and requires no separate treatment of linear-growth or unbounded coefficients.","The same remainder representation could serve as a quantitative tool for numerical error analysis of rough-path integrators."],"fun_headline_variants":["Global bounds for rough DEs with no coercivity","Taylor remainder formula yields rough DE bounds","Rough DE bounds from Lipschitz elementary differentials","No coercivity needed for global rough DE bounds","Taylor remainder formula controls rough equation solutions"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The argument collapses if the explicit combinatorial identity for the grafted forest expansion — the signed sum over planar binary trees with coefficients C(ϱ) and evaluation points J_{ϱ,ℓ} — contains any error in signs, coefficients, or evaluation points.","fun_headline_variants_meta":{"raw":{"variants":["Global bounds for rough DEs with no coercivity","Taylor remainder formula yields rough DE bounds","Rough DE bounds from Lipschitz elementary differentials","No coercivity needed for global rough DE bounds","Taylor remainder formula controls rough equation solutions"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000591,"raw_usage":{"total_tokens":2545,"prompt_tokens":616,"completion_tokens":1929,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":360,"completion_tokens_details":{"reasoning_tokens":1859}},"tokens_in":360,"tokens_out":1929,"duration_ms":15928,"temperature":1.0,"reasoning_tokens":1859,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T14:47:44.278192+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Expand (τ1τ2τ3)↷τ0 directly from the recursive definition of the grafting extension and compare it, term by term, with the formula's signed sum over planar binary trees for k=3; any mismatch in a coefficient, sign, or evaluation point disproves the central identity and therefore the remainder representation.","supporting_citations":[],"review_version":1}