1 · The essentials
Imagine giving every positive whole number a color, using only finitely many colors. The manuscript claims that, however you do this, you can find a group of distinct numbers with a striking shared feature. Choose any nonempty selection from the group and add its numbers: the answer has one particular color. Multiply the numbers in any nonempty selection instead: the answer has that very same color. You can prescribe how many numbers the group must contain before looking for it. The manuscript presents this as a resolution of Hindman’s finite sums and products conjecture. The main result is not formalized in Lean and has not been formally verified.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine every positive whole number carrying a colored sticker. The claim says you can choose a group of any requested finite size so that every total and every product made from a nonempty selection points to a number bearing the same sticker color. The image helps describe the requirement, but does not explain why such a group should exist.
Why it matters
The claim requires addition and multiplication to produce a common color from the same chosen set, rather than allowing a separate set or color for each operation. It applies to every finite coloring of the positive integers, without requiring a special coloring rule. The supplied abstract identifies this assertion as Hindman’s finite sums and products conjecture.
2 · Going further
A finite coloring assigns each positive integer one of finitely many colors. The precise claim is that for every such coloring and every positive integer , there exists a set of distinct positive integers such that all numbers in have one common color. Here and .
The requirement covers every nonempty subset, including singletons. Thus the elements of themselves must have the common color, as must all the indicated sums and products. The same set must work for both operations, and the color must be shared across both collections of outcomes.
The repository summary and the abstract of “Monochromatic finite sums and products in the positive integers” present this statement as a resolution of Hindman’s conjecture. However, the supplied abstract states only the result: it gives no argument, construction, or intermediate steps from which to explain the main idea. Only one manuscript is supplied, so no relationship to companion manuscripts can be described. The main result is not formalized in Lean and has not been formally verified.
Useful notions
- Positive integers
- Finite sets and their sizes
- Nonempty subsets
- Sums and products
- Assigning finitely many colors to numbers
What was known before / what is new
Before
The source identifies the target statement as Hindman’s finite sums and products conjecture. It supplies no account of earlier partial results or methods, so no more detailed historical comparison can be made from this material.
New
The manuscript claims the full statement for every finite coloring of the positive integers and every prescribed positive integer . Its assertion is simultaneous: all nonempty subset sums and all nonempty subset products of one -element set share a single color.
Limits and assumptions
The hypotheses concern positive integers colored with finitely many colors, and the conclusion concerns a set of any prescribed finite size. The supplied text does not assert an infinite-set version, give bounds on the selected numbers, or describe a method for finding them. It provides no argument details or discussion of remaining open questions. The main result is not formalized in Lean and has not been formally verified; its resolution of the conjecture is reported here as a manuscript claim.
Mini glossary
- Finite coloring —
- An assignment of one of finitely many colors to each number under consideration.
- Monochromatic —
- Having one common color.
- Nonempty subset —
- A selection containing at least one element of a given set.
- Subset sum —
- The number obtained by adding the elements of a nonempty subset.
- Subset product —
- The number obtained by multiplying the elements of a nonempty subset.
Keywords : Finite coloring · Subset sums · Subset products
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
Proves Hindman's finite sums and products conjecture: every finite coloring of the positive integers contains sets of any prescribed finite size whose nonempty subset sums and nonempty subset products all have one common color.
To be verified: the proof is written in the manuscript, but no software has checked it and no validation by independent mathematicians is established. It may contain errors.
Manuscripts in this family
Monochromatic finite sums and products in the positive integers
23/09/2026We prove Hindman's finite sums and products conjecture: for every finite coloring of the positive integers and every positive integer k, there is a k-element set whose nonempty subset sums and nonempty subset products all have the same color.