Schur–Brauer version of van der Waerden's theorem for semimodules

About 11 years old · traced to

Let G=B1∪⋯∪BqG=B_1\cup\dotsm\cup B_q be a finite partition of a semimodule (G,+)(G,\pmb{+}) over a semiring (R,+,⋅)(R,+,\cdot). For a subset F⊆RF\subseteq R, write Fb={fb:f∈F}Fb=\{fb:f\in F\}. Schur–Brauer version of van der Waerden's theorem. One of the sets BjB_j has the property that, for every finite subset FF of RR, there are elements a∈Ga\in G and b∈Bjb\in B_j with b≠ob\not=\boldsymbol{o} such that

a+Fb⊆Bj.a\pmb{+}Fb\subseteq B_j.

This is posed as an open question closely related to the paper's semimodule versions of van der Waerden's theorem and to Schur–Brauer-type partition results. The source does not state a resolution.

References

Primary source

Xiongping Dai, “Grünwald version of van der Waerden's theorem for semi-modules”, arXiv:1512.08695 (2018).

Progress summary

Refreshed
Claimed progress

A reader-submitted example claims the statement is false, but no independent verification was found and the general question remains unsettled.

Dai posed this semimodule partition question as an open problem in a paper first posted on December 29, 2015, with version 4 dated September 14, 2018. The paper proves a related recurrence theorem under additional assumptions, not this assertion.

Known results

  • For finite colorings over a discrete semiring, Dai proves a related result involving, for every finite F⊆GF\subseteq G, a syndetic set DF⊆RD_F\subseteq R and translates satisfying a+dF⊆Bja\pmb{+}dF\subseteq B_j; this is not the stated theorem (2015; version 4, 2018).

Community submission (unverified), August 26, 2026

A submitted counterexample takes the regular semimodule R=M=F2R=M=\mathbb F_2 with B1={0}B_1=\{0\} and B2={1}B_2=\{1\}. With F=RF=R, the first cell has no allowed nonzero bb, while for the second cell a+Fb=F2a+Fb=\mathbb F_2 for every aa, so neither cell satisfies the assertion. This would refute the theorem, but the argument has not been independently verified.

Current status (as of August 2026): The assertion remains officially open, while a community-submitted F2\mathbb F_2 counterexample claims to refute it and is unverified.

Sources

Solutions 1

This solution needs a summarySee full solutionHide full solution

MathDB #332161: a two-element counterexample

Result

The stated Schur--Brauer conjecture for semimodules is false. A counterexample is the regular one-dimensional module over the field F2\mathbb F_2, split into its two singleton color classes.

The source statement

Conjecture 3.26 of Xiongping Dai, “Grünwald version of van der Waerden's theorem for semi-modules,” arXiv:1512.08695v4, says the following. If

M=B1∪⋯∪BqM=B_1\cup\cdots\cup B_q

is any finite partition of a semimodule MM over a semiring RR, then some fixed cell BjB_j has the property that, for every finite F⊆RF\subseteq R, there are a∈Ma\in M and b∈Bj∖{o}b\in B_j\setminus\{\boldsymbol o\} such that

a+Fb⊆Bj.(1)a+Fb\subseteq B_j. \tag{1}

Here Fb={fb:f∈F}Fb=\{fb:f\in F\}. The source does not require RR or MM to be infinite, cancellative, torsion-free, or a ∗*-semiring, and it places no restriction on the finite subset FF beyond F⊆RF\subseteq R.

Counterexample

Take

R=M=F2={0,1}R=M=\mathbb F_2=\{0,1\}

with the usual operations, and let MM be the regular left RR-module. Partition it as

B1={0},B2={1}.B_1=\{0\},\qquad B_2=\{1\}.

Choose the finite set

F=R={0,1}.F=R=\{0,1\}.

The cell B1B_1 cannot satisfy (1), because it contains no permitted element b≠o=0b\ne\boldsymbol o=0.

For B2B_2, the only possible bb is b=1b=1. For either a∈Ma\in M,

a+Fb={a+0⋅1,a+1⋅1}={a,a+1}=F2,a+Fb=\{a+0\cdot1,a+1\cdot1\}=\{a,a+1\}=\mathbb F_2,

which is not contained in the singleton B2B_2. Thus the same finite set FF defeats both color classes. No cell has the asserted property, so the conjecture is false.

Hypothesis check

The source defines a semiring by requiring an abelian additive semigroup with zero, an associative multiplicative semigroup with unit and absorbing zero, and both distributive laws. It defines a left semimodule as an abelian additive semigroup with zero and an action satisfying

(r+t)g=rg+tg,r(g+h)=rg+rh,1g=g,0g=o.(r+t)g=rg+tg,\qquad r(g+h)=rg+rh,\qquad 1g=g,\qquad 0g=\boldsymbol o.

The field F2\mathbb F_2 and its regular module satisfy every one of these axioms (as well as the usual scalar-associativity axiom). A finite algebra also causes no issue with the paper's use of the discrete topology.

There is likewise no quantifier ambiguity. The conjecture asserts

∃j ∀F⊆finR ∃a∈M ∃b∈Bj∖{o}:a+Fb⊆Bj.\exists j\ \forall F\subseteq_{\rm fin}R\ \exists a\in M\ \exists b\in B_j\setminus\{\boldsymbol o\}:a+Fb\subseteq B_j.

The construction proves its negation using one common choice F={0,1}F=\{0,1\} for both cells. Although the source only requires a∈Ma\in M, the presence of 0∈F0\in F would force a=a+0b∈Bja=a+0b\in B_j whenever (1) held, so allowing aa outside the cell cannot rescue the claim.

Exact verification

The accompanying certificate.json records the two operation tables, the regular scalar action, the partition, and FF. The standard-library script verify_counterexample.py independently checks all finite semiring and semimodule identities, the partition axioms, and every possible pair (a,b)(a,b) in the conjecture's conclusion. Run

python verify_counterexample.py

from this directory. All checks use explicit exceptions and therefore remain active under python -O.

Scope

This refutes the conjecture exactly as stated in all arXiv versions and in MathDB #332161. It does not decide a repaired version restricted to an infinite or otherwise nonperiodic class of semirings/semimodules. Any such repair needs new hypotheses that explicitly exclude this finite-field obstruction.

Lean: https://github.com/antoshashakov/Principia-Math-In-Progress/blob/main/mathdb-open-problems/problems/332161/Problem332161.lean

Solved by the Principia Math harness. Check out our work at principia-math.com

Models used: GPT 5.6 Sol, Fable