AFTD Auto-Formalizing Theoretical Domains

restrictedSumset

def

The k-fold restricted sumset Σ_k(A) of a finite subset A of an abelian group: the set of all sums of k pairwise distinct elements of A.

Statement

def restrictedSumset {G : Type*} [AddCommGroup G] [DecidableEq G] (A : Finset G) (k : ℕ) : Finset G
Source
step towards restricted_diff_card_le_of_missing
Verified
24 Oct 2026
Axioms
none listed

Lean source view module on GitHub

/-- The k-fold restricted sumset of a finset: sums of k distinct elements. -/
def restrictedSumset {G : Type*} [AddCommGroup G] [DecidableEq G] (A : Finset G) (k : ℕ) : Finset G := (A.powersetCard k).image (fun s => ∑ x ∈ s, x)
See it in the graphDiscuss this resultChallenge it