Pith. sign in

REVIEW 2 major objections 4 minor 33 references

Every two-coloring of the natural numbers contains an infinite set B whose pairwise sums all share one color, answering a 1974 question of Owings.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review

2026-08-01 18:19 UTC pith:BEEAWJD7

load-bearing objection Owings's 50-year-old question is answered, the two-color threshold is exactly two, and the proof looks sound; the main thing to press in review is the imported maximal-equicontinuous-factor machinery. the 2 major comments →

arxiv 2607.17333 v3 pith:BEEAWJD7 submitted 2026-07-19 math.CO math.DSmath.NT

An affirmative answer to Owings's sumset question

Wen Huang , Zhengxing Lian , Song Shao , Rongzhong Xiao , Leiye Xu , Shuhao Zhang This is my paper
classification math.CO math.DSmath.NT MSC 05D1037B1054D35
keywords Owings's questionsumsetstwo-colorings of Nmonochromatic infinite sumsetstopological dynamicsultrafiltersmaximal equicontinuous factorweighted sumsets
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper answers a 1974 problem of Owings: in any red/blue coloring of the natural numbers, one of the color classes contains B+B for some infinite B. The proof encodes the coloring as a point in a product of two-sided shifts, then uses ultrafilter identities and the theory of maximal equicontinuous factors to force the existence of such a B. The result extends to weighted sums: for any m,l and any 2-coloring, there is an infinite B with (m+l)B ∪ {mx+ly: x

Core claim

The paper's central claim is that Owings's question has an affirmative answer: every 2-coloring of N admits an infinite B with B+B contained in one color. The stronger weighted theorem states that for coprime m,l, every 2-coloring has an infinite B for which (m+l)B and all weighted sums mx+ly (x<y) share a single color. To prove this, the coloring is re-encoded into a zero-dimensional shift X_c whose coordinates record all affine samplings of the form n ↦ c(s n + r); on this shift, the nonexistence of the desired configuration becomes an identity between ultrafilter limits: (D_m p + D_l p)c = J(D_{m+l} p)c, where D_k is dilation and J is color complementation. The proof then studies minimal

What carries the argument

The load-bearing object is the affine encoding c of the coloring together with the ultrafilter identity (D_m p + D_l p)c = J(D_{m+l} p)c, which encodes the absence of a monochromatic configuration. Dilation maps Δ_k and the semigroup βN0 translate number-theoretic sumset conditions into dynamical recurrence. A second ingredient is the comparison of the dilation subsystems Γ_l(M) and Γ_{m+l}(M) through their maximal equicontinuous factors—the largest equicontinuous quotient of a minimal system, a rotation on a compact abelian group; the paper imports structural facts about these factors under taking powers, and uses them to prove a thickly-syndetic return-time lemma that runs the recursion se

Load-bearing premise

The proof imports, with citations rather than proofs, structural facts about maximal equicontinuous factors of power components of minimal systems—that the MEF of a T^q-minimal component is its projection, and that equal MEF coordinates imply joint regional proximality—and if those facts fail for the particular shift systems X_c and dilation subsystems Γ_l(M), the thickly-syndetic return-time construction that builds the infinite set collapses.

What would settle it

Finding any 2-coloring of N with no infinite monochromatic B+B would refute the theorem; short of that, a concrete failure of the imported MEF facts—for example, a T^q-minimal component C of one of the dilation systems where C ≠ π^{-1}(π(C))—would break the recursion in the proof and falsify the proof's mechanism.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X LinkedIn Reddit HN

If this is right

  • Owings's 1974 question is settled: every 2-coloring of N has an infinite B with B+B monochromatic.
  • The exact finite-color threshold for the sumset question is two colors: the statement holds for every 2-coloring and fails for every coloring with at least three colors.
  • The weighted theorem extends monochromaticity to configurations of the form (m+ℓ)B ∪ {mx+ℓy : x<y} for all natural m, ℓ, thereby generalizing Hindman's admissible-partition result.
  • The 3-fold version of Owings's question (B+B+B monochromatic) is false, as shown by a 2-coloring derived from the asymmetric obstruction.
  • The proof yields a shifted form: every 2-coloring has a monochromatic B+B+t for some infinite B and shift t≥0.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The ultrafilter-identity strategy may carry over to other linear forms or to polynomial configurations, where the 'order condition' x<y seems essential; the role of the involution J as color complementation suggests a general two-color threshold phenomenon for configurations defined by a single additive identity.
  • Because the paper shows the 3-fold version fails while the 2-fold version holds, there may be a hierarchy: for k-fold sumsets the critical number of colors could be k, a question the paper does not address.
  • A testable extension is to ask whether the weighted theorem remains true when the coefficients m,ℓ are allowed to vary along the sequence B; the current proof fixes them and no monotonicity is claimed.
  • The proof's reliance on maximal-equicontinuous-factor infrastructure suggests that a purely combinatorial reformulation of the key structural lemma, if found, would make the argument more accessible and possibly extend to other amenable groups.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper proves an affirmative answer to Owings's 1974 question: for every 2-coloring of N there is an infinite B ⊆ N with B + B monochromatic (Theorem 1.1). It further proves a weighted generalization (Theorem 1.6): for every m, ℓ ∈ N and every 2-coloring of N, there is an infinite B such that (m + ℓ)B ∪ {mx + ℓy : x, y ∈ B, x < y} is monochromatic. The proof uses an affine encoding of the coloring into a zero-dimensional shift, ultrafilter limits, and two distinct strategies: for m = ℓ = 1 a separation argument combined with Hindman's admissible-partition theorem (Section 3); for general weights a dilation-subsystem analysis on maximal equicontinuous factors and a recursive return-time construction (Section 4). The paper also gives a three-coloring obstruction, an asymmetric two-coloring obstruction, and a counterexample to the three-fold version, and proves in Appendix A a weighted admissible-partition theorem used in Section 4.

Significance. If correct, this settles a fifty-year-old open problem and shows the finite-color threshold for monochromatic unrestricted sumsets is exactly two colors. The weighted generalization is substantial and connects to recent results of Kra–Moreira–Richter–Robertson and Kousek. The proof is original and ambitious, combining ultrafilter algebra, topological dynamics, and a delicate return-time recursion. The paper is largely self-contained: the coding lemmas (Lemmas 2.10–2.12), the key ultrafilter identities (Propositions 3.2 and 4.1), the counterexamples, and the admissible weighted theorem are all proved in detail. The main caveat is the reliance on imported theorems on maximal equicontinuous factors.

major comments (2)
  1. [§4.5, Lemmas 2.4 and 2.6] The recursive construction of the thickly syndetic return-time set H_j (Eq. (4.38) and the following paragraph) applies Lemma 2.7 to the T^{ℓm}-minimal component C_j. This requires Lemma 2.4 (C_j = π_N^{-1}(π_N(C_j)) and π_N|C_j is the maximal equicontinuous factor of (C_j, T^{ℓm})) and Lemma 2.6 (equal MEF coordinates imply joint regional proximality). Lemma 2.4 is quoted as a 'standard consequence' with no proof; Lemma 2.6 is derived by citing [2, Theorem 8], with the algebraic hypothesis asserted to be automatic. Since the contradiction in Theorem 4.7 depends on the full-projection identity π_N(V ∩ C_j) = π_N(C_j), which in turn depends on these facts for the concrete shift N = Γ_ℓ(M), the manuscript should prove these lemmas or give precise statements of the cited results and verify their hypotheses for the systems at hand. This is the most load-bearing unproved premise in the weight
  2. [§4.4, Proposition 4.6, Eq. (4.13)–(4.24)] The proof that the even-m case leads to a contradiction is intricate and, as written, rests on a delicate circle-extension construction. I checked the phase computation leading to Eq. (4.23) and the separation argument following it, and found no error. However, the passage from Eq. (4.23) to Eq. (4.24) — specifically the claim that the continuous invariant function ρ_0 is constant on the minimal lift eM and that translation by -1/2 permutes R without fixed points — is extremely compressed. If the authors expanded this into a short lemma, the paper would be notably easier to verify.
minor comments (4)
  1. [§4.4, after Eq. (4.7)] The text contains a typo: 'Note that Hence Proposition 4.1...' should read 'Note that D_{m+ℓ}p and D_mp + D_ℓp are free. Hence Proposition 4.1...'
  2. [§4.5, Proposition 4.6] Two occurrences of 'm+l' should be 'm+ℓ' (the block length in the thickness argument just before the application of Theorem 2.16).
  3. [§2.5, Lemma 2.11] The map is introduced as π_H, but the next sentence uses π_F. The notation should be made consistent.
  4. [§1.1, reference [18]] The reference to E2492–E2496 lists several proposers; it might be clearer to attribute the problem to Owings alone, as is standard in the literature.

Circularity Check

0 steps flagged

No significant circularity: the proof derives its key ultrafilter identities from the counterfactual hypothesis, and the admissible weighted theorem used to close the contradiction is proved independently in Appendix A from Ramsey-theoretic lemmas.

full rationale

The derivation chain is self-contained in the relevant sense: the contradiction arguments assume the failure of the target statement and derive consequences. Proposition 3.2 derives (3.7) from the standing hypothesis (H) via Lemma 3.4, and Proposition 4.1 derives (4.5) from the assumed absence of configuration (1.1) via Lemma 4.2; there is no fitted parameter or renamed prediction. The final contradictions invoke Hindman's Theorem 2.14 (external) and Theorem 2.16, but Theorem 2.16 is proved in Appendix A using only Lemma A.1, the infinite Ramsey theorem, and elementary counting; it does not assume Theorem 1.1 or Theorem 1.6. The maximal-equicontinuous-factor lemmas (2.4 and 2.6) are cited from published sources [2], [8], [33]; although some authors of [8] overlap with the present paper, they are independently published, parameter-free results whose assumptions do not include Owings's question, and they are not used to define the target. The recursion in §4.5 uses return-time largeness lemmas, not a circular restatement of the conclusion. Thus no load-bearing step reduces by construction or self-citation to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 7 axioms · 0 invented entities

No fitted constants; all numbers are constructed or derived. The only invented objects are mathematical coding points and subsystems, not independent entities requiring falsifiable evidence.

axioms (7)
  • standard math Existence of minimal subsystems, minimal left ideals, and idempotent ultrafilters via Zorn's lemma.
    Used throughout Sections 2.1, 2.4, 3.3, and 4.3 to choose minimal subsystems and ultrafilter idempotents.
  • domain assumption Hindman's admissible two-cell partition theorem (Theorem 2.14).
    Quoted from [12, Corollary 2.10] and used in Section 3.5 to convert a thick color class into a monochromatic B+B.
  • domain assumption Auslander's finite regional proximality theorem and the regional-proximal relation equals the equicontinuous structure relation for minimal abelian actions.
    Imported from [2] to prove Lemma 2.6, which is used to prove Lemma 2.7 and the return-time lemmas in Section 4.5.
  • domain assumption Ye's cyclic decomposition theorem: T^k-minimal components are clopen, and the maximal equicontinuous factor of a T^k-minimal component is its projection.
    Used in Lemmas 2.1 and 2.4, and again in Section 4.5 when selecting T^q-minimal components.
  • standard math Infinite Ramsey theorem.
    Used in Appendix A in the proofs of Lemma A.1 and Proposition A.2 to find infinite monochromatic subsequences.
  • standard math Pontryagin duality: continuous characters separate points of compact abelian groups.
    Used in Proposition 4.6 to detect a nonzero two-torsion translation in the maximal equicontinuous factor.
  • standard math Standard algebraic properties of the Stone-Cech compactification beta-N0 and the dilation maps D_k.
    Used throughout Section 2.4 and the main proofs, including D_k(p+q)=D_kp+D_kq and uniqueness of residue decomposition.

reviewed 2026-08-01 · how reviews work

0 comments
Cite this review

Pith. "Pith review of An affirmative answer to Owings's sumset question." pith.science (2026). https://pith.science/paper/BEEAWJD7

@misc{pith2026260717333,
  author       = {Pith},
  title        = {Pith review of: An affirmative answer to Owings's sumset question},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BEEAWJD7}},
  note         = {Machine review of arXiv:2607.17333}
}
Share X LinkedIn Reddit HN
read the original abstract

We give an affirmative answer to Owings's sumset question: for any $2$-coloring of natural numbers, there is an infinite $B\subseteq\mathbb{N}$ such that $B+B$ is monochromatic. More generally, for every $m,\ell\in\mathbb{N}$ and every $2$-coloring of $\mathbb{N}$, there is an infinite $B\subseteq\mathbb{N}$ such that $$ (m+\ell)B\cup\{mx+\ell y:x,y\in B,\ x<y\} $$ is monochromatic.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

33 extracted references · 1 canonical work pages

  1. [1]

    Auslander, Minimal Flows and Their Extensions , North-Holland Mathematics Studies, vol

    J. Auslander, Minimal Flows and Their Extensions , North-Holland Mathematics Studies, vol. 153, North-Holland, Amsterdam, 1988

    1988

  2. [2]

    Auslander, A group theoretic condition in topological dynamics , Topology Proc

    J. Auslander, A group theoretic condition in topological dynamics , Topology Proc. 28 (2004), no. 2, 327–334

    2004

  3. [3]

    Banakh and L

    T. Banakh and L. Zdomskyy, The coherence of semifilters: A survey , in Selection Principles and Covering Properties in Topology , Quaderni di Matematica, vol. 18, Seconda Universit `a di Napoli, Caserta, 2006, pp. 53–99

    2006

  4. [4]

    Blass, Ultrafilters: where topological dynamics = algebra = combinatorics, Topology Proceedings 18 (1993), 33–56

    A. Blass, Ultrafilters: where topological dynamics = algebra = combinatorics, Topology Proceedings 18 (1993), 33–56

    1993

  5. [5]

    Erd ˝os, Problems and results in combinatorial number theory, Ast´erisque 24–25 (1975), 295–310

    P. Erd ˝os, Problems and results in combinatorial number theory, Ast´erisque 24–25 (1975), 295–310

    1975

  6. [6]

    D. J. Fern ´andez-Bret´on, E. Sarmiento Rosales, and G. Vera, Owings-like theorems for infinitely many colours or finite monochromatic sets, Ann. Pure Appl. Logic 175 (2024), no. 10, Paper No. 103495

    2024

  7. [7]

    Furstenberg, Recurrence in Ergodic Theory and Combinatorial Number Theory, M

    H. Furstenberg, Recurrence in Ergodic Theory and Combinatorial Number Theory, M. B. Porter Lec- tures, Princeton University Press, Princeton, NJ, 1981

    1981

  8. [8]

    Glasner, W

    E. Glasner, W. Huang, S. Shao, B. Weiss, and X. Ye,Topological characteristic factors and nilsystems, J. Eur. Math. Soc. 27 (2025), 279–331

    2025

  9. [9]

    R. L. Graham, B. L. Rothschild, and J. H. Spencer, Ramsey Theory, 2nd ed., Wiley, New York, 1990

    1990

  10. [10]

    J. A. Guzm ´an-Vega, D. J. Fern ´andez-Bret´on, and E. Sarmiento Rosales, Hindman and Owings-like theorems without the Axiom of Choice, arXiv:2603.27163, 2026; to appear in Colloq. Math

    Pith/arXiv arXiv 2026

  11. [11]

    Hindman, Finite sums from sequences within cells of a partition ofN, J

    N. Hindman, Finite sums from sequences within cells of a partition ofN, J. Combin. Theory Ser. A17 (1974), 1–11

    1974

  12. [12]

    Hindman, Partitions and sums of integers with repetition , J

    N. Hindman, Partitions and sums of integers with repetition , J. Combin. Theory Ser. A 27 (1979), 19–32

    1979

  13. [13]

    Hindman, Ultrafilters and combinatorial number theory , in Number Theory, Carbondale 1979 , Lecture Notes in Math., vol

    N. Hindman, Ultrafilters and combinatorial number theory , in Number Theory, Carbondale 1979 , Lecture Notes in Math., vol. 751, Springer, Berlin, 1979, pp. 119–184

    1979

  14. [14]

    N. Hindman, Recent results on partition regularity of infinite matrices , in Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham , Cambridge University Press, Cambridge, 2018, pp. 200–213, doi:10.1017/9781316650295.013

    work page doi:10.1017/9781316650295.013 2018

  15. [15]

    Hindman, I

    N. Hindman, I. Leader, and D. Strauss, Pairwise sums in colourings of the reals, Abh. Math. Semin. Univ. Hambg. 87 (2017), no. 2, 275–287

    2017

  16. [16]

    Hindman and D

    N. Hindman and D. Strauss, Algebra in the Stone– ˇCech Compactification: Theory and Applications , 2nd ed., De Gruyter Studies in Mathematics, vol. 27, Walter de Gruyter, Berlin, 2012

    2012

  17. [17]

    Huang, P

    W. Huang, P. Lu, and X. Ye, Measure-theoretical sensitivity and equicontinuity , Israel Journal of Mathematics 183 (2011), 233–283

    2011

  18. [18]

    Knuth, C

    D. Knuth, C. D. H. Cooper, J. C. Owings, M. S. Klamkin, R. D. Whittekin, J. King, P. Hosford, and M. Geraghty, Elementary problems: E2492–E2496, Amer. Math. Monthly 81 (1974), no. 8, 901–902

    1974

  19. [19]

    Komj ´ath, I

    P. Komj ´ath, I. Leader, P. A. Russell, S. Shelah, D. T. Soukup, and Z. Vidny´anszky, Infinite monochro- matic sumsets for colourings of the reals, Proc. Amer. Math. Soc. 147 (2019), no. 6, 2673–2684

    2019

  20. [20]

    Kousek, Asymmetric infinite sumsets in large sets of integers, Forum Math

    I. Kousek, Asymmetric infinite sumsets in large sets of integers, Forum Math. Sigma 14 (2026), Paper No. e7, 28 pp

    2026

  21. [21]

    Kousek and T

    I. Kousek and T. Radi ´c, Infinite unrestricted sumsets of the form B+ B in sets with large density, Bull. Lond. Math. Soc. 57 (2025), no. 1, 48–68

    2025

  22. [22]

    B. Kra, J. Moreira, F. K. Richter, and D. Robertson, A proof of Erd˝os’s B+B +t conjecture, Commun. Amer. Math. Soc. 4 (2024), 480–494

    2024

  23. [23]

    B. Kra, J. Moreira, F. K. Richter, and D. Robertson, Problems on infinite sumset configurations in the integers and beyond, Bull. Amer. Math. Soc. (N.S.) 62 (2025), no. 4, 537–574

    2025

  24. [24]

    Leader and P

    I. Leader and P. A. Russell, Monochromatic infinite sumsets, New York J. Math.26 (2020), 467–472

    2020

  25. [25]

    Leader and K

    I. Leader and K. Williams, Monochromatic sumsets in countable colourings of abelian groups, Bull. Pol. Acad. Sci. Math. 72 (2024), 97–102. 39

    2024

  26. [26]

    Lian and R

    Z. Lian and R. Xiao, Monochromatic polynomial sumset structures on N, arXiv:2404.05226, 2024; to appear in Acta Math. Sin. (Engl. Ser.)

    arXiv 2024

  27. [27]

    Rudin, Fourier Analysis on Groups, Interscience Tracts in Pure and Applied Mathematics, no

    W. Rudin, Fourier Analysis on Groups, Interscience Tracts in Pure and Applied Mathematics, no. 12, Interscience Publishers, New York–London, 1962

    1962

  28. [28]

    Szemer ´edi, On sets of integers containing no k elements in arithmetic progression , Acta Arith

    E. Szemer ´edi, On sets of integers containing no k elements in arithmetic progression , Acta Arith. 27 (1975), 199–245

    1975

  29. [29]

    B. L. van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw Arch. Wiskd., II. Ser.15 (1927), 212–216

    1927

  30. [30]

    Wojcik, Factorisations des mots de basse complexit ´e, Ph.D

    C. Wojcik, Factorisations des mots de basse complexit ´e, Ph.D. thesis, Universit ´e Claude Bernard Lyon 1, Lyon, 2019

    2019

  31. [31]

    Wojcik and L

    C. Wojcik and L. Q. Zamboni, Monochromatic factorizations of words and periodicity, Mathematika 64 (2018), no. 1, 115–123

    2018

  32. [32]

    Wojcik and L

    C. Wojcik and L. Q. Zamboni, Coloring problems for infinite words, in Sequences, Groups, and Num- ber Theory, Trends in Mathematics, Birkh¨auser/Springer, Cham, 2018, pp. 213–231

    2018

  33. [33]

    Ye, D-function of a minimal set and an extension of Sharkovski˘ı’s theorem to minimal sets, Ergodic Theory Dynam

    X. Ye, D-function of a minimal set and an extension of Sharkovski˘ı’s theorem to minimal sets, Ergodic Theory Dynam. Systems 12 (1992), no. 2, 365–376. (Wen Huang, Song Shao, Rongzhong Xiao, Leiye Xu, and Shuhao Zhang) S CHOOL OF MATHEMAT- ICAL SCIENCES , U NIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA , H EFEI , A NHUI , 230026, PR C HINA Email address: w...

    1992

This paper was first reviewed by deepseek-v4-flash on August 1, 2026.