AFTD Auto-Formalizing Theoretical Domains

IsRegularSequence

def

A sequence S over an additive commutative group G is regular if for every proper additive subgroup H < G, the number of terms of S belonging to H is at most Nat.card H - 1.

Statement

def IsRegularSequence {G : Type*} [AddCommGroup G] (S : Multiset G) : Prop
Defined in
scout/2610-13103-additive-bases-and-the-zero-sum-invariant-mathsf-n-g-for-gr.md:93
Verified
26 Oct 2026
Axioms
none listed
Used by 4
  • is_regular_sequence_zeroThe empty multiset is a regular sequence over any additive commutative group G.
  • is_regular_sequence_of_leAny submultiset of a regular sequence over an additive commutative group is also a regular sequence.
  • additive_basis_thresholdThe additive basis threshold c_0(G) of an additive commutative group G is the minimal integer l, defined as the infimum of the set of…
  • additive_basis_threshold_le_of_card_eqTo bound the additive basis threshold c_0(G) ≤ m, it suffices to show that every regular sequence S over G of cardinality exactly m is an…

Read back from the Lean

Given an additive commutative group G and a multiset S of elements of G, IsRegularSequence S asserts that for every additive subgroup H of G, if H is a strictly proper subgroup of G (H < ⊤), then the number of elements of S belonging to H (counted with multiplicity) is at most Nat.card H - 1 (using natural number subtraction).

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 S over G is regular if for every proper subgroup H < ⊤, |S ∩ H| ≤ |H| - 1. -/
def IsRegularSequence {G : Type*} [AddCommGroup G] (S : Multiset G) : Prop := open scoped Classical in
  ∀ H : AddSubgroup G, H < ⊤ → (S.filter (· ∈ H)).card ≤ Nat.card H - 1
See it in the graphDiscuss this resultChallenge it