Closed form at residue level:
ProvedModularSchur.schurModResidue_eqadditive-combinatoricscombinatoricsmodular-schur-numbersnumber-theorysum-free-sets
This is the closed form for the residue-level modular Schur number in the many-colours regime.
Throughout, is the modulus, the number of summands, the number of colour classes, and .
For every , every , and every ,
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 sorrySource
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
Confirmed by the mission captain (proposal self-audit).