{"id":"ef2f9ec9-366b-4e2e-ad11-896e5a7a34f7","arxiv_id":"2412.12670","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"Every iterated paraproduct has local Taylor-type expansions described by one universal regularity structure, and every paracontrolled system lifts to a modelled distribution on that structure.","lead":"The paper introduces a general algebraic framework, called a universal regularity structure, that can describe the local behavior of iterated paraproducts, the basic building blocks of paracontrolled systems. It proves that any paracontrolled system can be lifted into this framework, connecting two major toolkits for singular stochastic PDEs.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 2 invokes Theorem 1 on word-size tuples that can violate Assumption (A), so the claimed universal lift of arbitrary paracontrolled systems is not proved for integer interval sums.","rationale":"The reader identified Assumption (A) as the weakest assumption, but applied it mainly to Theorem 1 as a restriction on input exponents. The stress-test reading shows the same assumption is imported, without being stated or verified, into the proof of Theorem 2 via the use of Theorem 1 on the enlarged alphabet A = L ⊔ W. This is more than a routine verification gap: it affects the headline universal-lift theorem. The example of two letters of size 1/2 shows integer interval sums are allowed by the hypotheses of Theorem 2, so the proof overreaches its stated assumptions. The concern is not that the paper's mathematics is fraudulent or that the main idea is wrong; rather, a concrete hypothesis is missing or a substantial extra argument is needed. The verdict remains CONDITIONAL rather than ACCEPT or REJECT: the paper is likely salvageable by adding an explicit non-resonance condition on word sizes or by extending the analytic estimates to the δ0 = 0 boundary, but as written the central 'any r-paracontrolled system' claim is not fully proved. The algebraic coassociativity point raised by the reader is also legitimate, but the unstated Assumption (A) in Theorem 2 is the more load-bearing issue because it concerns the statement of the theorem itself, not just a deferred verification.","tokens_in":51013,"tokens_out":9392,"duration_ms":95297,"concrete_test":"Work in dimension 1 with L = {l1,l2}, |l1|_L = |l2|_L = 1/2, r = 3/2, and [l1],[l2] ∈ C^{1/2}_∘; let the paracontrolled system contain the word w = l1l2, so |w|_L = 1 < r. Carry out the construction of u_{[w]} in Section 6.2 and the model estimate (5.16)/(c)_n for α = (1/2,1/2). Specifically, check whether the bound (2.8) remains uniform with exponent θ = 1 and no logarithmic loss when δ0 = 0. If a logarithmic factor or a loss to |h|^{1-ε} appears, Theorem 2 needs an extra integer-sum exclusion; if the bound survives, the proof must supply the missing argument in place of the invocation of Theorem 1.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The proof of Theorem 2 in Section 6.2 introduces an enlarged alphabet A = L ⊔ W and says 'Theorem 1 provides a regularity structure associated with A and a model M'. But Theorem 1 is proved only under Assumption (A): every interval sum Σ_{a≤j≤b} α_j must be non-integral. No such assumption appears in Theorem 2, either for the original sizes |l|_L or for the extended sizes on A. The word sizes in a paracontrolled system are arbitrary real numbers; for example, take L = {l1,l2} with |l1|_L = |l2|_L = 1/2 and r > 1. Then the word l1l2 has size 1, and the interval sum (1/2,1/2) equals an integer, violating Assumption (A). The analytic estimates used in Theorem 1, e.g. (2.6), (2.8), Lemma 10, and Proposition 16, rely on the positive gap δ0 = dist(Z, {Σ_{a≤j≤b} α_j}); when δ0 = 0 these estimates do not control remainders at the critical integer order. Therefore the statement 'any r-paracontrolled system' is not established by the given proof. A repaired version needs either an explicit non-resonance condition on all word-size interval sums appearing in (1.10), or a separate argument handling integer interval sums, possibly using Hoshino's n=2,3 results as a guide.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops an algebraic structure tailored to iterated paraproducts. Theorem 1 states that under Assumption (A) — no interval sum ∑_{a≤j≤b} α_j is an integer — the pair (Π,g) defined by (1.5)–(1.9) is a model on a concrete regularity structure Tα, giving local expansions of arbitrary iterated paraproducts P(f1,…,fn) to order ∑ α_j. Theorem 2 attaches to any r-paracontrolled system (1.10) a universal regularity structure T_L, a model M, and a modelled distribution u of regularity r with u_{w∅}=R_M(u). The proof strategy introduces simplified paraproducts P<, generalized derivatives ∂^k_⋆, and a representation formula expressing true iterated paraproducts as sums of P< terms involving bracket functions [τ]; the analytic estimates are detailed and the induction in Section 5.3 is coherent.","tokens_in":80,"tokens_out":6997,"duration_ms":122673,"significance":"If both theorems are correct, the paper substantially extends Hoshino's n=2,3 expansion results to arbitrary n and offers a universal algebraic link between paracontrolled systems and regularity structures. The estimates in Sections 2–3, the representation formula of Section 5.2, and the explicit construction of T_L are substantial and potentially reusable. The paper does not fit parameters to an output and does not rely circularly on its own claims; it builds on independent published results [1,3,4,11]. The main weakness is that the proof of Theorem 2 invokes Theorem 1 in a regime where the standing non-resonance Assumption (A) is not guaranteed, so the universal claim is not established as stated.","major_comments":[{"comment":"The proof invokes Theorem 1 for the enlarged alphabet A = L ⊔ W, but Theorem 1 is proved only under Assumption (A), which requires every interval sum of the regularity exponents to be non-integral. The sizes |λ|_A defined in Section 6.2 include values r − |w|_L for letters λ = (w) ∈ W, and no non-resonance condition is imposed on the original sizes |l|_L or on the induced sizes on A. For example, taking L = {l1,l2} with |l1|_L = |l2|_L = 1/2 and r > 1, the word l1l2 has size 1, so the tuple (1/2,1/2) violates Assumption (A); the estimates (2.6), (2.8), Lemma 10, and Proposition 16 rely on the positive gap δ0 = dist(Z, {∑_{a≤j≤b} α_j}) and lose control at δ0 = 0. Consequently the statement 'any r-paracontrolled system' in Theorem 2 is not established by the given proof. The theorem should either be restated with an explicit non-resonance condition on all interval sums of word sizes appearing in (1.10), or a separate argument handling integer interval sums must be supplied.","section":"Section 6.2, proof of Theorem 26"},{"comment":"The proof of Proposition 17 only verifies the comodule identity (Δ⊗Id)Δ = (Id⊗Δ+)Δ and explicitly leaves the coassociativity identity for Δ+ and 'the other conditions' of Definition 27 to the reader. Since the model estimates in Section 5 and the definition of the characters g and g_{yx} depend on the Hopf algebra structure of (T+,Δ+), these axioms are part of the mathematical claim, not merely a presentational detail. Please provide the full verification of coassociativity and the remaining axioms, or state precisely which axioms are meant and give a complete reference for their verification.","section":"Proposition 17 (Section 4)"},{"comment":"The proof of Theorem 26 asserts that there is a canonical injection ι: T_L ↪ T_A that commutes with the coproducts and that the model M on T_A is an extension of the model on T_L. This is used to rewrite the coefficients uτ in terms of g_x and to transfer the modelled-distribution property from T_A back to T_L. The existence and compatibility of this injection are not demonstrated. Please provide the explicit map on symbols, verify that it intertwines the coproducts and homogeneities, or give a precise reference for this compatibility.","section":"Section 6.2, canonical injection"}],"minor_comments":[{"comment":"The auxiliary exponent α′_n is introduced so that ∑_{s=j}^{n−1} α_s + α′_n > 0 for all j, but the augmented tuple α′ = (α1,…,α_{n−1}, α′_n) must also satisfy Assumption (A) for Theorem 1 to apply. Only finitely many values of α′_n are forbidden, so the choice is possible, but the non-resonance requirement should be stated explicitly.","section":"Section 5.3, point (b)_n"},{"comment":"There are several typos and formatting artifacts, e.g., 'begining' for 'beginning', 'the a begining', and the garbled rendering of /llbracketa, b/rrbracket in the arXiv text. The notation should be cleaned up.","section":"Throughout"},{"comment":"The notation for the remainder operators △^α_{h,o}P< and △_{yx}P< is introduced and used with slightly different decoration in different places; for readability, please collect the definitions in one place and use a consistent symbol throughout.","section":"Sections 2–3"}],"recommendation":"major_revision","confidential_remarks":"The main issue is the unproved use of Assumption (A) in Theorem 2. I recommend asking the authors to either add a non-resonance condition to Theorem 2 or supply a supplementary argument for the integer-sum boundary case, and to complete the verification of Proposition 17's axioms. If these points are addressed, the paper's contribution would be significant."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. First, Theorem 1 is a genuinely substantial result: arbitrary-length iterated paraproducts with mixed-sign regularities get local expansions, with the full tower of coefficient expansions, under a clean non-resonance assumption (A). That is new relative to Hoshino's n=2,3 positive-exponent cases, and the analytic machinery — simplified paraproducts, the ~P operators, the star-derivative recursion, the induction in Section 5.3 — is detailed and coherent. I read the analytic estimates as the real work and they look sound. Second, Theorem 2 as stated is not proved. The proof applies Theorem 1 on the enlarged alphabet A = L ⊔ W with sizes r − |w| for letters (w), and Theorem 1 requires every interval sum to be non-integral. Nothing in Theorem 2's hypotheses gives that. The example is immediate: two letters of size 1/2 each give a word of size 1, and the interval sum (1/2, 1/2) hits an integer. The estimates (2.6), (2.8) and Lemma 10 need the positive gap δ0; at δ0 = 0 the remainders are not controlled. So 'any r-paracontrolled system' is an overclaim. The fix is likely an explicit non-resonance condition on the letter sizes and on the r − |w| sizes in the A-alphabet, or a separate boundary argument; Hoshino's low-order results suggest it is doable, but it is not in the paper.\n\nMinor soft spots: Proposition 17 proves the comodule identity and leaves coassociativity and the other concrete-regularity-structure axioms to the reader. That is a real proof obligation, though plausibly routine given the comodule computation. The abstract's 'can host all the regularity structures' also outruns what Theorem 2 proves; the introduction is more careful.\n\nCredit where due: the paper is honest about the literature, cites Hoshino and Bailleul–Hoshino appropriately, and the self-citations point to independent published theorems. No data or code, and I found no circular step.\n\nWho this is for: people working in paracontrolled calculus or regularity structures who want local-expansion technology for high-order iterated paraproducts. Theorem 1 deserves a serious referee. Theorem 2 needs either a repaired hypothesis or a genuinely new argument for the integer-sum cases. I would send it to review expecting major revision, with the recommendation to narrow Theorem 2 if the non-resonance fix turns out to be necessary.","headline":"Theorem 1 is a genuine, mostly sound extension of Hoshino's local expansion results to arbitrary length and mixed-sign regularities; Theorem 2 overreaches, since its proof invokes Theorem 1 on word-size tuples that routinely violate Assumption (A).","tokens_in":51851,"tokens_out":5104,"would_cite":true,"duration_ms":44533,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60H17","35R60","46E35"],"pacs":[],"model":"deepseek-v4-flash","headline":"Iterated paraproducts of any length admit full local expansions governed by a single concrete regularity structure, and every paracontrolled system lifts to a modelled distribution over a universal word-based structure.","keywords":["iterated paraproducts","local expansions","regularity structures","paracontrolled systems","modelled distributions","concrete regularity structure","Littlewood-Paley decomposition","Besov-Hölder spaces"],"falsifier":"Take $n=2$, $\\alpha_1=\\alpha_2=1/2$, so $\\alpha_1+\\alpha_2=1$ violates Assumption (A). Compute the quantity $P(f_1,f_2)(y)-\\sum_{|k|<1}\\partial^k_\\star P(f_1,f_2)(x)(y-x)^k/k! - f_1(x)R^1(f_2)(y,x)$ for two explicit $C^{1/2}_\\circ$ functions and test whether it decays like $|y-x|$; if the bound fails or holds only with a logarithmic loss, Assumption (A) is a genuine restriction rather than a removable technicality.","tokens_in":2160,"feed_emoji":"📐","tokens_out":2371,"duration_ms":85368,"temperature":0.7,"pith_summary":"This paper proves that iterated paraproducts of distributions admit local expansions of arbitrary depth: around any point, the iterated paraproduct can be written as a Taylor-type polynomial plus recursively expandable coefficient terms, to an accuracy governed by the sum of the regularity exponents. The statement holds for any number of factors and any real exponents, provided no sum of consecutive exponents is an integer; this covers the earlier two- and three-factor positive-exponent results as a special case. The expansion is not an isolated estimate: the paper builds a concrete regularity structure depending only on the exponent tuple, and proves that the analytically defined pair of maps is a model on it. On the paracontrolled side, it shows that any paracontrolled system with reference distributions can be lifted to a modelled distribution over an explicit universal word-based regularity structure, so that the two languages used for singular stochastic PDEs share one algebraic backbone.","feed_headline":"Every iterated paraproduct has a full local expansion","feed_subtitle":"A single universal regularity structure hosts expansions of any length and lifts paracontrolled systems to modelled distributions.","key_machinery":"The central object is the concrete regularity structure $T_\\alpha$: the vector space spanned by symbols $\\llbracket a,b\\rrbracket^{\\ell}X^{p}$ and the algebra generated by symbols $\\llbracket a,b\\rrbracket^{k}_{\\ell}$ satisfying the positivity condition $\\|\\ell\\|+\\sum_{a\\le j\\le b}\\alpha_j>\\|k\\|$, together with explicit coproducts verified through a generalised Vandermonde identity. The analytic engine is the simplified iterated paraproduct $P_<(f_1,\\ldots,f_n)$ and its correction operators $\\widetilde{P}^{\\beta}_<$ built from admissible cuts of the exponent tuple; these satisfy sharp dyadic estimates and local expansions. A representation formula writes every true iterated paraproduct as a sum of simplified paraproducts applied to bracket functions built from the input distributions, so the expansion properties of the simplified operators transfer to the original ones. The universal structure $T_L$ repeats the same construction with words over the alphabet $L$ as the indexing objects, which is what makes Theorem 2 possible.","core_discovery":"On the paper's own terms, the central discovery is a parameter-dependent universal regularity structure that turns local expansion properties of iterated paraproducts into a model statement. Theorem 1 says that for any tuple of exponents satisfying Assumption (A) and any distributions in the corresponding closed Besov-Hölder spaces, the maps defined by $\\Pi(\\llbracket a,b\\rrbracket^{\\ell}X^{p})=\\cdot^{p}P^{\\ell}(f_a,\\ldots,f_b)$ and $g(\\llbracket a,b\\rrbracket^{k}_{\\ell})=\\widetilde{P}^{\\alpha_{[a,b]}-|k|}_{\\ell}(\\partial^{k_a}f_a,\\ldots,\\partial^{k_b}f_b)$ define a model on the concrete regularity structure $T_\\alpha$; in particular the iterated paraproduct $P(f_1,\\ldots,f_n)$ has a local expansion around every point with coefficients that are themselves locally expandable to lower precision. Theorem 2 states that any $r$-paracontrolled system is the reconstruction of a modelled distribution of regularity $r$ over the universal structure built from words on the alphabet of reference distributions, so the paracontrolled-system description contains no less information than a modelled-distribution description.","pith_inferences":["Implicit consequence not stated in the paper: the integer-sum boundary excluded by Assumption (A) is a natural place to expect logarithmic corrections, by analogy with resonances in rough-path theory; one could test whether the expansions hold with a factor $|y-x|^\\gamma\\log(1/|y-x|)$ when a partial sum is an integer.","Not stated in the paper: the universal structure $T_L$ could be instantiated for the alphabet of a concrete singular stochastic PDE and compared with the equation-specific regularity structure, making the claimed universality quantitative.","A natural follow-up not addressed here is whether the correspondence of Theorem 2 is bijective, namely which choices of brackets on $T_L$ correspond to which paracontrolled systems, and whether the parametrisation is as explicit as the one known for fixed regularity structures."],"forward_implications":["For every $n$ and every tuple of exponents satisfying Assumption (A), the iterated paraproduct $P(f_1,\\ldots,f_n)$ has a local expansion to order $\\sum_{j=1}^n\\alpha_j$, with coefficients that are themselves locally expandable to lower orders; this is the content of Theorem 1 read through the local expansion propositions.","The model $\\Pi,g$ depends continuously on the input distributions in $\\prod_j C^{\\alpha_j}_\\circ$, so small changes in the factors give uniformly controlled changes in all coefficients of the expansions.","Theorem 2 gives a canonical way to attach to any finite-alphabet paracontrolled system a model on the universal structure $T_L$ and a modelled distribution whose reconstruction is the first component of the system, so paracontrolled calculus and regularity structures describe the same local-expansion content.","The algebraic identities of Proposition 17 and Lemma 24 show the coproduct structure of $T_\\alpha$ is compatible with the analytic operators, so the structure can be reused as a general-purpose backbone for expansions involving iterated paraproducts without re-deriving the algebra for each equation."],"supporting_citations":[{"why":"Supplies the high-order paracontrolled calculus and the two-factor local expansion result that this paper generalises.","marker":"[1]"},{"why":"Establishes that models and modelled distributions on a fixed regularity structure give paracontrolled systems; the bracket maps and a key analytic lemma used here come from this paper.","marker":"[3]"},{"why":"Proves that brackets parametrize models, providing the inverse correspondence that Theorem 2 extends to arbitrary paracontrolled systems.","marker":"[4]"},{"why":"Introduced paracontrolled systems in the generality used in Section 1.3, the starting point of Theorem 2.","marker":"[5]"},{"why":"Gives the paracontrolled-distribution framework; two lemmas from this paper are used to verify the model estimates.","marker":"[6]"},{"why":"Introduces regularity structures and the definitions of model and modelled distribution used throughout.","marker":"[7]"},{"why":"First investigated the algebraic structure behind iterated paraproducts in a restricted setting; the present structure generalises it.","marker":"[9]"},{"why":"Contains the summation lemma used here to convert dyadic bounds into the required $|y-x|^\\gamma$ estimates for remainders.","marker":"[10]"},{"why":"Proves local expansion results for iterated paraproducts with two or three positive exponents, the results that Theorem 1 extends to arbitrary length and real exponents.","marker":"[11]"}],"fun_headline_variants":["Universal structure hosts every iterated paraproduct expansion","One regularity structure unifies all singular SPDE expansions","Iterated paraproducts expand via a single universal model","Local expansion properties of paracontrolled systems unified","Every iterated paraproduct has expansions of any length"],"cache_read_input_tokens":53888,"weakest_assumption_plain":"The load-bearing assumption is Assumption (A): no sum of consecutive regularity exponents $\\sum_{a\\le j\\le b}\\alpha_j$ may be an integer, because the recursive definition of the cut operators and the proof of the key algebraic identities require all partial sums to be distinct and nonzero.","fun_headline_variants_meta":{"raw":{"variants":["Universal structure hosts every iterated paraproduct expansion","One regularity structure unifies all singular SPDE expansions","Iterated paraproducts expand via a single universal model","Local expansion properties of paracontrolled systems unified","Every iterated paraproduct has expansions of any length"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000484,"raw_usage":{"total_tokens":2366,"prompt_tokens":895,"completion_tokens":1471,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":511,"completion_tokens_details":{"reasoning_tokens":1392}},"tokens_in":511,"tokens_out":1471,"duration_ms":10210,"temperature":1.0,"reasoning_tokens":1392,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T13:51:21.674848+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $n=2$, $\\alpha_1=\\alpha_2=1/2$, so $\\alpha_1+\\alpha_2=1$ violates Assumption (A). Compute the quantity $P(f_1,f_2)(y)-\\sum_{|k|<1}\\partial^k_\\star P(f_1,f_2)(x)(y-x)^k/k! - f_1(x)R^1(f_2)(y,x)$ for two explicit $C^{1/2}_\\circ$ functions and test whether it decays like $|y-x|$; if the bound fails or holds only with a logarithmic loss, Assumption (A) is a genuine restriction rather than a removable technicality.","supporting_citations":[{"cited_title":"and Bernicot F","cited_arxiv_id":null,"evidence_quote":"Supplies the high-order paracontrolled calculus and the two-factor local expansion result that this paper generalises."},{"cited_title":"and Hoshino M","cited_arxiv_id":null,"evidence_quote":"Establishes that models and modelled distributions on a fixed regularity structure give paracontrolled systems; the bracket maps and a key analytic lemma used here come from this paper."},{"cited_title":"and Hoshino M., Paracontrolled calculus and regularity structures II","cited_arxiv_id":null,"evidence_quote":"Proves that brackets parametrize models, providing the inverse correspondence that Theorem 2 extends to arbitrary paracontrolled systems."},{"cited_title":"and Mouzard A","cited_arxiv_id":null,"evidence_quote":"Introduced paracontrolled systems in the generality used in Section 1.3, the starting point of Theorem 2."},{"cited_title":"and Perkowski N., Paracontrolled distributions and singular PDEs","cited_arxiv_id":null,"evidence_quote":"Gives the paracontrolled-distribution framework; two lemmas from this paper are used to verify the model estimates."},{"cited_title":", A theory of regularity structures","cited_arxiv_id":null,"evidence_quote":"Introduces regularity structures and the definitions of model and modelled distribution used throughout."},{"cited_title":", Iterated paraproducts and iterated commutator estimates i n Besov spaces","cited_arxiv_id":null,"evidence_quote":"First investigated the algebraic structure behind iterated paraproducts in a restricted setting; the present structure generalises it."},{"cited_title":", Commutator estimates from a viewpoints of regularity struc tures","cited_arxiv_id":null,"evidence_quote":"Contains the summation lemma used here to convert dyadic bounds into the required $|y-x|^\\gamma$ estimates for remainders."}],"review_version":1}