AFTD Auto-Formalizing Theoretical Domains

zero_sum_constant_s_star

def

The zero-sum constant $\mathsf{s}_p^*$ is defined as the infimum of lengths $l$ such that every multiset $W$ of size $l$ of units in $\mathbb{Z}/p^2\mathbb{Z}$ has a sub-multiset $T \le W$ of cardinality $p$ with (T.sum : ZMod (p^2)).val % p = 0 and (T.sum : ZMod (p^2)).val % p^2 ≠ 0.

Statement

noncomputable def zero_sum_constant_s_star (p : ℕ) : ℕ
Defined in
scout/2611-14248-the-zero-sum-constant-mathsf-s-p-and-inverse-problem.md:116
Verified
12 Nov 2026
Axioms
none listed

Read back from the Lean

The definition zero_sum_constant_s_star assigns to each natural number p the infimum (in ℕ, where sInf ∅ = 0) of the set of all natural numbers l such that: for every multiset W of elements of ZMod (p ^ 2), if the cardinality of W is l and every element of W is a unit in ZMod (p ^ 2), then there exists a sub-multiset T ≤ W such that: 1. T has cardinality p, 2. the natural number representative T.sum.val of the sum of T in ZMod (p ^ 2) is divisible by p (T.sum.val % p = 0), and 3. T.sum.val is not divisible by p ^ 2 (T.sum.val % p ^ 2 ≠ 0).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The zero-sum constant s_p^*: the infimum of lengths l such that every multiset of l units in ZMod (p^2) has a p-subsequence with sum divisible by p but not p^2. -/
noncomputable def zero_sum_constant_s_star (p : ℕ) : ℕ := sInf {l : ℕ | ∀ W : Multiset (ZMod (p ^ 2)), W.card = l →
    (∀ x ∈ W, IsUnit x) →
    ∃ T ≤ W, T.card = p ∧ T.sum.val % p = 0 ∧ T.sum.val % p ^ 2 ≠ 0}
See it in the graphDiscuss this resultChallenge it