Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Closed form at residue level: schurModResidue(m,k,ℓ)=n−1\mathrm{schurModResidue}(m,k,\ell) = n - 1schurModResidue(m,k,ℓ)=n−1

Proved
ModularSchur.schurModResidue_eq

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

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

This is the closed form for the residue-level modular Schur number in the many-colours regime.

Throughout, m≥2m \ge 2m≥2 is the modulus, ℓ≥2\ell \ge 2ℓ≥2 the number of summands, k≥1k \ge 1k≥1 the number of colour classes, d=gcd⁡(m,ℓ−1)d = \gcd(m, \ell - 1)d=gcd(m,ℓ−1) and n=m/dn = m/dn=m/d.

For every m≥2m \ge 2m≥2, every ℓ≥2\ell \ge 2ℓ≥2, and every k≥n−1k \ge n - 1k≥n−1,

schurModResidue(m,k,ℓ)=mgcd⁡(m,ℓ−1)−1.\mathrm{schurModResidue}(m,k,\ell) = \frac{m}{\gcd(m, \ell - 1)} - 1.schurModResidue(m,k,ℓ)=gcd(m,ℓ−1)m​−1.

The value is obtained by combining the uniform upper bound with the singleton-colouring lower bound, which meet exactly.

This is the residue-level form of the mission's headline identity. It is stated separately from the integer-level version because the residue side is where the argument lives, and because a consumer already working in the cyclic group can use it without passing through the reduction theorem.

Preamble
import Definitions.Def_ModularSchurPartition
import Mathlib

open ModularSchur
open Finset
variable {m : ℕ}
Formal statement
theorem ModularSchur.schurModResidue_eq (m k ℓ : ℕ) (hm : 2 ≤ m) (hℓ : 2 ≤ ℓ)
    (hk : m / Nat.gcd m (ℓ - 1) - 1 ≤ k) :
    schurModResidue m k ℓ = m / Nat.gcd m (ℓ - 1) - 1 := 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 1.2 (main closed form), residue level. Lean source: https://github.com/mysticflounder/modular-schur/blob/eb6098890f05eff39190e6cd8e41fdea53fa81f9/lean/ModularSchur/Partition.lean#L97-L102
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