multiset_is_minimal_zero_sum
def
A minimal zero-sum sequence: a nonempty finite sequence (multiset) with sum zero, no nonempty proper subsequence of which has sum zero.
Statement
def multiset_is_minimal_zero_sum {G : Type*} [AddCommMonoid G] (s : Multiset G) : Prop
- Defined in
- arXiv:2610.16562 (The Davenport constant of low-dimensional boxes), Sec. 1 (minimal zero-sum sequences).
- Verified
- 14 Oct 2026
- Axioms
- none listed
- Used by 8
- davenport_constantThe Davenport constant D(X) of a subset X of an abelian group: the supremum (in ℕ ∪ {∞}) of the lengths of minimal zero-sum sequences with…
- davenport_constant_support_four_int_box_three_ge_oddTheorem 3 of arXiv:2610.16562, odd m: for every odd m ≥ 2, the maximal length of a minimal zero-sum sequence over [[-m,m]]^3 with support…
- davenport_constant_support_le_davenport_constantRestricting the support size can only lower the maximal length: D^{(k)}(X) ≤ D(X).
- davenport_box_three_even_sequence_minimalFor m ≥ 2 even, T(m) is a minimal zero-sum sequence: no proper nonempty subsequence sums to zero.
- davenport_constant_int_box_two_geFor every m ≥ 2, the Davenport constant of the box ⟦−m, m⟧² is at least 4m² − q(m), q(m) the smallest prime not dividing m: S(m) is a…
- davenport_constant_supportD^{(k)}(X): the maximal length (a supremum in ℕ∞) of a minimal zero-sum sequence over X whose support has exactly k elements.
- davenport_box_three_odd_sequence_minimalFor m ≥ 2 odd, T(m) is a minimal zero-sum sequence: no proper nonempty subsequence sums to zero.
- davenport_constant_support_four_int_box_three_ge_evenTheorem 3 of arXiv:2610.16562, even m: for every even m ≥ 2, the maximal length of a minimal zero-sum sequence over [[-m,m]]^3 with…
Lean source view module on GitHub
/-- A minimal zero-sum sequence. -/ def multiset_is_minimal_zero_sum {G : Type*} [AddCommMonoid G] (s : Multiset G) : Prop := s ≠ 0 ∧ s.sum = 0 ∧ ∀ t ≤ s, t ≠ 0 → t.sum = 0 → t = s