is_rigid_sequence
A sequence S over an abelian group G without an n-term zero-sum subsequence is called rigid with parameters n and m if every term of S has multiplicity n - 1 (heavy) or at most m - 1 (light), and every n-term zero-sum multiset W with support in the support of S is of the form x^n for some x in S, or h^k l^(n-k) for some heavy term h, light term l, and 0 < k < n.
Statement
def is_rigid_sequence (n m : ℕ) {G : Type*} [AddCommGroup G] [DecidableEq G] (S : Multiset G) : Prop
- Defined in
- arXiv:2610.35819 Definition 4.1
- Verified
- 28 Oct 2026
- Axioms
- none listed
- Used by 2
- not_rigid_sequence_product_zero_sum_freeThe statement
rigid_sequence_product_zero_sum_freeis false: The statement is false for a = 1, m = 3, n = 6, t = 1, r(0) = 1 over G =… - rigid_sequence_light_count_ge_mLet S be a rigid sequence with parameters n and m over an additive commutative group G with m < n, such that every term in S has…
- not_rigid_sequence_product_zero_sum_freeThe statement
Read back from the Lean
Given natural numbers n and m, a type G equipped with an AddCommGroup and DecidableEq instance, and a multiset S of elements of G, is_rigid_sequence n m S asserts that all of the following three conditions hold:
1. There does not exist a multiset W ≤ S such that W has cardinality n and the sum of elements in W is 0.
2. For every element x ∈ S, either the multiplicity of x in S is n - 1, or 0 < S.count x ≤ m - 1 (note: 0 < S.count x is already implied by x ∈ S).
3. For every multiset W of elements of G, if W has cardinality n, the sum of elements in W is 0, and every element of W is in S (i.e., ∀ x ∈ W, x ∈ S), then at least one of the following holds:
- There exists x ∈ S such that W is the multiset consisting of n copies of x (Multiset.replicate n x).
- There exist elements h, l ∈ G and a natural number k such that:
- S.count h = n - 1,
- 0 < S.count l ≤ m - 1,
- 0 < k < n, and
- W is the multiset sum of k copies of h and (n - k) copies of l (Multiset.replicate k h + Multiset.replicate (n - k) l).
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
/-- A sequence over an abelian group without n-term zero-sum is rigid if terms are heavy (multiplicity n-1) or light (multiplicity at most m-1), and every n-term zero-sum on its support has the form x^n or h^k l^(n-k). -/ def is_rigid_sequence (n m : ℕ) {G : Type*} [AddCommGroup G] [DecidableEq G] (S : Multiset G) : Prop := (¬ ∃ W : Multiset G, W ≤ S ∧ W.card = n ∧ W.sum = 0) ∧ (∀ x ∈ S, S.count x = n - 1 ∨ (0 < S.count x ∧ S.count x ≤ m - 1)) ∧ (∀ W : Multiset G, W.card = n → W.sum = 0 → (∀ x ∈ W, x ∈ S) → (∃ x ∈ S, W = Multiset.replicate n x) ∨ (∃ (h l : G) (k : ℕ), S.count h = n - 1 ∧ (0 < S.count l ∧ S.count l ≤ m - 1) ∧ 0 < k ∧ k < n ∧ W = Multiset.replicate k h + Multiset.replicate (n - k) l))