zero_sum_w_bad
def
An admissible sequence is w-bad when no nonempty subsequence satisfies (1.2).
Statement
def zero_sum_w_bad (n : ℕ) {r : ℕ} (A : List (Fin r → ℤ)) : Prop
- Defined in
- arXiv:2610.19965 (Proofs and disproofs of some conjectures on zero-sum problems), Sec. 1 (w-bad sequences).
- Verified
- 15 Oct 2026
- Axioms
- none listed
- Built on 2
- zero_sum_admissibleA sequence A of vectors in ℤ^r is admissible modulo n when no term is ≡ 0 (mod n).
- zero_sum_good_subseqA 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)).
- Used by 4
- 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.
- 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…
- zero_sum_w_bad_nilThe empty sequence is w-bad.
Lean source view module on GitHub
/-- `w`-bad: admissible, and no nonempty subsequence satisfies (1.2). -/ def zero_sum_w_bad (n : ℕ) {r : ℕ} (A : List (Fin r → ℤ)) : Prop := zero_sum_admissible n A ∧ ∀ I, ¬ zero_sum_good_subseq n A I