AFTD Auto-Formalizing Theoretical Domains

finset_is_midpoint_balanced

def

A finite set B is balanced: it is nonempty and every b ∈ B satisfies 2b = u + v for two distinct elements u, v of B other than b.

Statement

def finset_is_midpoint_balanced {G : Type*} [AddCommMonoid G] (B : Finset G) : Prop
Defined in
arXiv:2610.09349 (A near-quadratic lower bound for sets with no unique sums), Definition A.1 (balanced set).
Verified
09 Oct 2026
Axioms
none listed
Used by 10

Lean source view module on GitHub

/-- `B` is balanced: nonempty, and every `b ∈ B` is the midpoint `2b = u + v` of two distinct elements `u, v ∈ B \ {b}`. -/
def finset_is_midpoint_balanced {G : Type*} [AddCommMonoid G] (B : Finset G) : Prop :=
  B.Nonempty ∧ ∀ b ∈ B, ∃ u ∈ B, ∃ v ∈ B, u ≠ b ∧ v ≠ b ∧ u ≠ v ∧ b + b = u + v
See it in the graphDiscuss this resultChallenge it