Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

One colour: Sm(1,ℓ)=min⁡(ℓ−1,⌊m/ℓ⌋)S_m(1,\ell) = \min(\ell-1, \lfloor m/\ell \rfloor)Sm​(1,ℓ)=min(ℓ−1,⌊m/ℓ⌋) for 2≤ℓ≤m2 \le \ell \le m2≤ℓ≤m

Proved
ModularSchur.schurModResidue_k1

by mysticflounder · Sep 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricscombinatoricsmodular-schur-numbersnumber-theorysum-free-sets

This is the exact single-colour modular Schur number in the range the literature posed it for.

For every m≥2m \ge 2m≥2 and every ℓ\ellℓ with 2≤ℓ≤m2 \le \ell \le m2≤ℓ≤m,

schurModResidue(m,1,ℓ)=min⁡ ⁣(ℓ−1,⌊mℓ⌋).\mathrm{schurModResidue}(m,1,\ell) = \min\!\left(\ell - 1, \left\lfloor \frac{m}{\ell} \right\rfloor\right).schurModResidue(m,1,ℓ)=min(ℓ−1,⌊ℓm​⌋).

The two terms are the two ways a single class can fail. The term ℓ−1\ell - 1ℓ−1 is the no-wrap regime, where the class is defeated by ℓ\ellℓ copies of 111 summing to ℓ\ellℓ; the term ⌊m/ℓ⌋\lfloor m/\ell \rfloor⌊m/ℓ⌋ is the wrap regime, where some ℓ\ellℓ-tuple sums past the modulus and lands back at 1‾\overline{1}1. Which one binds depends on whether ℓ(ℓ−1)<m\ell(\ell-1) < mℓ(ℓ−1)<m.

This is one of the two regimes of the problem that admit an exact formula, the other being the many-colours regime of the main closed form; the intermediate range 1<k<n−11 < k < n-11<k<n−1 has no known formula.

Preamble
import Definitions.Def_ModularSchurBasic
import Definitions.Def_ModularSchurPartition
import Mathlib

open ModularSchur
open Finset Classical
variable {m ℓ : ℕ}
Formal statement
theorem ModularSchur.schurModResidue_k1 (m ℓ : ℕ) (hm : 2 ≤ m) (hℓ : 2 ≤ ℓ) (hlm : ℓ ≤ m) :
    schurModResidue m 1 ℓ = min (ℓ - 1) (m / ℓ) := by sorry
Source
McKenna 2026, "Prime-power structure of the stable regime for modular Schur numbers", docs/paper/modular-schur.pdf in the same repository, Theorem 6.1 (the k=1k=1k=1 case). Prior art: the paper states "This resolves [DSWH2025, Problem 1, part 3]"; see D'orville, Sim, Wong and Ho, "Modular generalizations of Schur numbers", Integers 25 (2025) #A62, https://math.colgate.edu/~integers/z62/z62.pdf. Lean source: https://github.com/mysticflounder/modular-schur/blob/eb6098890f05eff39190e6cd8e41fdea53fa81f9/lean/ModularSchur/K1Theorem.lean#L173-L200
Human review
  • Endorsed by Shuze Chen · Sep 20, 2026

  • Endorsed by mysticflounder · Sep 20, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me