AFTD Auto-Formalizing Theoretical Domains

zero_sum_good_subseq

def

A nonempty set I of positions of A is good when Σ_{i∈I} a_i ≡ 0 (mod n) but Σ_{i∈I} a_i ≢ 0 (mod n²) (condition (1.2)).

Statement

def zero_sum_good_subseq (n : ℕ) {r : ℕ} (A : List (Fin r → ℤ)) (I : Finset (Fin A.length)) : Prop
Defined in
arXiv:2610.19965 (Proofs and disproofs of some conjectures on zero-sum problems), condition (1.2).
Verified
15 Oct 2026
Axioms
none listed
Used by 7
  • zero_sum_ww_r(n): the least N such that every admissible sequence of length N in ℤ^r has a nonempty subsequence whose sum is ≡ 0 (mod n) but ≢ 0…
  • zero_sum_basis_seq_w_badFor n > 1 and r ≥ 1, the admissible sequence E_{r,n} (length 2r(n−1)) has no nonempty subsequence whose sum is ≡ 0 (mod n) but ≢ 0 (mod n²).
  • zero_sum_w_two_leUpper bound w_r(2) <= 2r + 1: every sequence of 2r + 1 vectors of Z^r, each nonzero mod 2, has a nonempty subsequence whose sum is 0 mod 2…
  • zero_sum_w_badAn admissible sequence is w-bad when no nonempty subsequence satisfies (1.2).
  • zero_sum_w_gew_r(n) ≥ 2r(n−1) + 1 for all r ≥ 1 and n > 1.
  • zero_sum_w_three_threew_3(3) = 13: every admissible sequence (no term ≡ 0 mod 3) of 13 vectors in ℤ^3 has a nonempty subsequence whose sum is ≡ 0 (mod 3) but ≢…
  • zero_sum_w_bad_concat_box_complement_length_leIf B++A is w-bad and every vector of [0,n-1]^r is the exact sum of a subsequence of B, then the complementary list A has length at most…

Lean source view module on GitHub

/-- Positions `I` whose sum is `≡ 0 (mod n)` but `≢ 0 (mod n²)`. -/
def zero_sum_good_subseq (n : ℕ) {r : ℕ} (A : List (Fin r → ℤ)) (I : Finset (Fin A.length)) : Prop :=
  I.Nonempty ∧ (∀ j, (n : ℤ) ∣ ∑ i ∈ I, A.get i j) ∧ ∃ j, ¬ ((n : ℤ) ^ 2 ∣ ∑ i ∈ I, A.get i j)
See it in the graphDiscuss this resultChallenge it