Monochromatic sums and quotients in mathbb N
Pith reviewed 2026-05-15 16:27 UTC · model grok-4.3
The pith
The configuration x, y, x+y, y/x is partition regular over the natural numbers in a strong infinitary sense that extends Hindman's theorem.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We prove that the configuration consisting of x, y, x + y and y/x is partition regular in a strong infinitary form: for every finite coloring of the natural numbers there is an infinite monochromatic set A such that there exist x, y in A with x + y in A and y/x in A (where the division is exact). The same methods reduce the partition regularity problem for configurations of the form p(x) · q(y) to a handful of special instances.
What carries the argument
The partition regularity of the four-term configuration x, y, x + y, y/x, where y/x is required to be an integer.
If this is right
- Hindman's theorem on monochromatic finite sums is extended by the forced presence of exact quotients.
- Any finite coloring of ℕ admits infinite monochromatic solutions to the system {x, y, x+y, y/x}.
- Partition regularity questions for products of two degree-one polynomials reduce to checking a small list of base cases.
- The result holds in the strong infinitary form, guaranteeing an entire infinite monochromatic set rather than a single tuple.
Where Pith is reading between the lines
- Similar configurations mixing addition and exact division may turn out to be partition regular by the same ultrafilter or idempotent techniques.
- The reduction to special cases could allow exhaustive computer checks for small numbers of colors before tackling the general polynomial-product problem.
- One could test whether the same regularity persists if the quotient condition is relaxed to y being a multiple of x plus a fixed constant.
Load-bearing premise
The configuration is considered only when x exactly divides y so that y/x is again a natural number.
What would settle it
A finite coloring of the natural numbers in which no infinite monochromatic subset contains both some x and y together with x + y and the exact integer y/x.
read the original abstract
We prove partition regularity of the configuration $x,y,x+y,y/x$ in a strong infinitary form that extends Hindman's Theorem. We study the related issue of partition regularity of configurations involving products of a degree one polynomial in $x$ with one in $y$, reducing the general problem to a handful of special cases.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims to prove partition regularity of the configuration x, y, x+y, y/x over the natural numbers in a strong infinitary form extending Hindman's theorem. It further reduces the partition regularity question for configurations formed as products of degree-one polynomials in x and y to a small collection of special cases.
Significance. If the central claim holds, the result would strengthen Hindman's theorem by incorporating a multiplicative quotient under an exact divisibility constraint, yielding new monochromatic solutions in combined additive-multiplicative Ramsey theory. The reduction of general polynomial-product configurations to special cases offers a concrete simplification that could facilitate further work in the area.
major comments (2)
- [Abstract] Abstract: the partition-regularity claim for {x, y, x+y, y/x} requires that the monochromatic IP set construction explicitly enforce x | y so that y/x lies in ℕ; the abstract gives no indication that the argument selects y as a multiple of x inside the monochromatic set or otherwise preserves the divisibility constraint while extending Hindman's theorem.
- [Abstract] The manuscript states the main theorem but supplies no proof details, error analysis, or verification steps, so soundness of the infinitary construction cannot be assessed beyond the bare claim.
Simulated Author's Rebuttal
We thank the referee for the careful reading and for highlighting the need for greater clarity in the abstract regarding the divisibility constraint and for more accessible proof details. We will revise the manuscript to address both points while preserving the core arguments.
read point-by-point responses
-
Referee: [Abstract] Abstract: the partition-regularity claim for {x, y, x+y, y/x} requires that the monochromatic IP set construction explicitly enforce x | y so that y/x lies in ℕ; the abstract gives no indication that the argument selects y as a multiple of x inside the monochromatic set or otherwise preserves the divisibility constraint while extending Hindman's theorem.
Authors: We agree that the abstract should explicitly note the handling of the divisibility condition. In the full proof, the monochromatic IP set is constructed inductively so that each new generator is chosen as a multiple of the relevant earlier elements (ensuring x divides y while maintaining the IP property). We will revise the abstract to state that the construction enforces the necessary divisibility constraints within the monochromatic set. revision: yes
-
Referee: [Abstract] The manuscript states the main theorem but supplies no proof details, error analysis, or verification steps, so soundness of the infinitary construction cannot be assessed beyond the bare claim.
Authors: The full manuscript contains the complete proof of the main theorem, including the explicit IP-set construction extending Hindman's theorem and verification that the configuration is realized monochromatically. To improve accessibility, we will add a concise proof sketch to the introduction and expand the abstract with a high-level outline of the key steps. We maintain that the argument is sound, as it relies on standard techniques from Ramsey theory for IP sets with controlled divisibility. revision: partial
Circularity Check
No circularity: proof extends Hindman's theorem via independent combinatorial arguments
full rationale
The paper claims a new infinitary partition regularity result for the configuration x, y, x+y, y/x (with x|y) that properly extends Hindman's theorem on monochromatic IP sets. No step reduces the target configuration to a fitted parameter, a self-defined quantity, or a load-bearing self-citation whose justification is internal to the present work. The abstract and claimed proof strategy treat the divisibility condition as part of the configuration to be preserved monochromatically, without renaming or smuggling an ansatz. The derivation is therefore self-contained against external benchmarks such as Hindman's theorem and standard results on partition regularity.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Hindman's theorem on monochromatic finite sums in any finite coloring of the naturals
- domain assumption Natural numbers are closed under addition and under exact division when the divisor divides the dividend
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We prove partition regularity of the configuration x,y,x+y,y/x in a strong infinitary form that extends Hindman’s Theorem.
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Forward citations
Cited by 1 Pith paper
-
Monochromatic Sums and Quotients Near Zero
In dense subsemigroups of ((0,∞), +), the set {a, b, ab, b(a+1)} is monochromatic near zero under any finite coloring, and the pattern x, y, x+y, y/x is partition regular near zero.
Reference graph
Works this paper leans on
-
[1]
Polynomial Extensions of the Milliken-Taylor Theorem
Vitaly Bergelson, Neil Hindman and Kendall Williams. “Polynomial Extensions of the Milliken-Taylor Theorem”.Transactions of the American Mathematical Society366.11 (2014), pp. 5727–5748.doi: 10.1090/S0002-9947-2014-05958-8
-
[2]
Monochromatic Products and Sums in 2-Colorings ofN
Matt Bowen. “Monochromatic Products and Sums in 2-Colorings ofN”.Advances in Mathematics 462 (2025), p. 110095.doi: 10.1016/j.aim.2024.110095
-
[3]
Monochromatic Products and Sums in the Rationals
Matt Bowen and Marcin Sabok. “Monochromatic Products and Sums in the Rationals”.Forum of Mathematics, Pi 12 (2024), e17.doi: 10.1017/fmp.2024.19
-
[4]
Hypernatural Numbers as Ultrafilters
Mauro Di Nasso. “Hypernatural Numbers as Ultrafilters”.Nonstandard Analysis for the Working Mathematician. Ed. by Peter A. Loeb and Manfred P. H. Wolff. Dordrecht: Springer Netherlands, 2015, pp. 443–474.doi: 10.1007/978-94-017-7327-0_11
-
[5]
Lecture Notes in Mathematics 2239
Mauro Di Nasso, Isaac Goldbring and Martino Lupini.Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory. Lecture Notes in Mathematics 2239. Springer, 2019.doi: 10.1007/ 978-3-030-17956-4
work page 2019
-
[6]
Ramsey Properties of Nonlinear Diophantine Equa- tions
Mauro Di Nasso and Lorenzo Luperi Baglini. “Ramsey Properties of Nonlinear Diophantine Equa- tions”.Advances in Mathematics324 (2018), pp. 84–117.doi: 10.1016/j.aim.2017.11.003
-
[7]
Mauro Di Nasso, Lorenzo Luperi Baglini, Marcello Mamino, Rosario Mennuni and Mariaclara Ra- gosta. “Ramsey’s Witnesses”.Combinatorial Theory(to appear) (2026). Preprint available at arXiv: 2503.09246
-
[8]
Self-Divisible Ultrafilters and Congruences inβZ
Mauro Di Nasso, Lorenzo Luperi Baglini, Rosario Mennuni, Moreno Pierobon and Mariaclara Ra- gosta. “Self-Divisible Ultrafilters and Congruences inβZ”.The Journal of Symbolic Logic90.3 (2025), pp. 1180–1197.doi: 10.1017/jsl.2023.51
-
[9]
Goswami,Monochromatic Translated Product and Answering Sahasrabudhe’s Conjecture, arXiv:2412.17868v1
SayanGoswami. Monochromatic Translated Product and Answering Sahasrabudhe’s Conjecture.2024. arXiv: 2412.17868
-
[10]
Finite Sums from Sequences within Cells of a Partition ofN
Neil Hindman. “Finite Sums from Sequences within Cells of a Partition ofN”.Journal of Combinat- orial Theory, Series A17.1 (1974), pp. 1–11.doi: 10.1016/0097-3165(74)90023-5
-
[11]
Partitions and Sums and Products of Integers
Neil Hindman. “Partitions and Sums and Products of Integers”.Transactions of the American Math- ematical Society247 (1979), pp. 227–245.doi: 10.1090/S0002-9947-1979-0517693-4
-
[12]
Partitions and Pairwise Sums and Products
Neil Hindman. “Partitions and Pairwise Sums and Products”.Journal of Combinatorial Theory, Series A37.1 (1984), pp. 46–60.doi: 10.1016/0097-3165(84)90018-9
-
[13]
Algebra in the Stone-Čech Compactification: Theory and Applica- tions
Neil Hindman and Dona Strauss. Algebra in the Stone-Čech Compactification: Theory and Applica- tions. 2nd revised and extended edition. De Gruyter, 2011.doi: 10.1515/9783110258356
-
[14]
Hyperintegers and Nonstandard Techniques in Combinatorics of Numbers
Lorenzo Luperi Baglini. “Hyperintegers and Nonstandard Techniques in Combinatorics of Numbers”. PhD thesis. Università di Siena, 2012. arXiv:1212.2049
work page internal anchor Pith review Pith/arXiv arXiv 2012
-
[15]
Monochromatic Sums and Products inN
Joel Moreira. “Monochromatic Sums and Products inN”.Annals of Mathematics185.3 (2017). doi: 10.4007/annals.2017.185.3.10
-
[16]
Exponential patterns in arithmetic Ramsey theory
Julian Sahasrabudhe. “Exponential patterns in arithmetic Ramsey theory”.Acta Arithmetica 182 (2018), pp. 13–42.doi: 10.4064/aa8603-9-2017
-
[17]
UberDieKongruenz xm+ym = zm (mod p)
IssaiSchur.“UberDieKongruenz xm+ym = zm (mod p)”.Jahresbericht Der Deutschen Mathematiker- vereinigung 25 (1916), pp. 114–117. 21
work page 1916
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.