AFTD Auto-Formalizing Theoretical Domains

zero_sum_basis_seq

def

E_{r,n} = Π_j e_j^{[n−1]} (−e_j)^{[n−1]}: n−1 copies of each standard basis vector e_j of ℤ^r and n−1 copies of −e_j.

Statement

def zero_sum_basis_seq (r n : ℕ) : List (Fin r → ℤ)
Defined in
arXiv:2610.19965 (Proofs and disproofs of some conjectures on zero-sum problems), Lemma 3.1.
Verified
15 Oct 2026
Axioms
none listed
Used by 2
  • 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_gew_r(n) ≥ 2r(n−1) + 1 for all r ≥ 1 and n > 1.

Lean source view module on GitHub

/-- The sequence `E_{r,n}`: `n-1` copies of each `±e_j`. -/
def zero_sum_basis_seq (r n : ℕ) : List (Fin r → ℤ) :=
  (List.finRange r).flatMap fun j =>
    List.replicate (n - 1) (Pi.single j 1) ++ List.replicate (n - 1) (-Pi.single j 1)
See it in the graphDiscuss this resultChallenge it