arXiv:2609.30410v2
Abstract
Fix . We prove that there exists a subadditive density on such that, for every polynomial of degree and with , every set of positive density contains configurations for arbitrarily large . This provides a density strengthening of Moreira's result on partition regularity for .
AI-generated audit
Audit summary
Not a correctness certificate. A green “no issues found” result may include yellow suspected typos or minor formal issues 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
01Statements2 reported findingsNo statement issues found
The constructed subadditive density supports the polynomial sum-product configurations claimed in the current version. The familiar partition-regularity consequences are explicitly identified as consequences of known results, not separate new claims.
The localized invariant-mean density has the required positivity and subadditivity
PDF pp. 2–5, 14–17 · arXiv:2609.30410v2
Polynomial Bohr neighborhoods have a positive uniform interval density, so conditioning a shift-invariant mean on them is defined. Directed limsup preserves monotonicity, normalization and the subadditive bound. Ergodicity of the inner mean passes to the separable affine algebra; its Gelfand system and natural extension retain all finite correlation identities. Positive recurrence therefore gives , , and in the same set.
The corrected polynomial characteristic-factor reduction handles both coefficient regimes
PDF pp. 8–10, 15, 20–22 · arXiv:2609.30410v2
For linearly independent polynomial iterates, adjoining rotations absorbs the polynomial phase and weak mixing gives orthogonality to every rational eigenfactor. For dependent iterates, the family has algebraic complexity at most one: the coefficient of removes the lower-degree quadratic coefficients, and the coefficient of degree then forces the two remaining ones to vanish because . The corresponding characteristic-factor theorem applies to the ergodic extension.
02Proofs2 reported findingsNo proof issues found
The current proof closes the compact/uniform decomposition, twisted polynomial averages, and the final fourth-power lower bound. The order of limits is consistent with the divisibility restrictions.
Ergodicity survives the algebra restriction and correspondence construction
PDF pp. 12–16 · arXiv:2609.30410v2
A proposed nontrivial decomposition of the restricted mean can be extended by a positive functional dominated by the original mean. Averaging its shifts preserves domination and the restriction, contradicting extremality after normalization. The Gelfand representation then identifies extremal invariant means with ergodic invariant probability measures; the natural extension supplies the negative polynomial iterates without changing the correlations.
The weak-mixing contribution vanishes and the structured part gives a positive lower bound
PDF pp. 18–22 · arXiv:2609.30410v2
Bohr restrictions simultaneously enforce divisibility and near-invariance of finitely many compact components. Cauchy–Schwarz eliminates the moving bounded function; after the negligible diagonal is removed, distinct indices give polynomial iterates with distinct leading coefficients, permitting Proposition 2.3. Approximation of the Bohr indicator by polynomial phases is legitimate because its boundary has zero limiting measure. Ramsey stabilization and a second Cauchy–Schwarz step compare the pair average with the square of the single average. Orthogonality and conditional expectation then give the lower bound with the stated adjustable error.
03Novelty0 reported findingsNo novelty concerns found
No non-novelty findings.