AFTD Auto-Formalizing Theoretical Domains

highRepSet

def

The set P(A) of all group elements having more than two ordered restricted pair representations from A.

Statement

def highRepSet {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G] (A : Finset G) : Finset G
Source
step towards restricted_diff_card_le_of_missing
Verified
24 Oct 2026
Axioms
none listed
Built on 1
  • orderedPairSumCountThe restricted two-fold representation function ν_A(x): the number of ordered pairs (a, b) of distinct elements of A with a + b = x.

Lean source view module on GitHub

/-- Elements with more than two ordered restricted pair representations (the paper's set P). -/
def highRepSet {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G] (A : Finset G) : Finset G := Finset.univ.filter (fun x => 2 < orderedPairSumCount A x)
See it in the graphDiscuss this resultChallenge it