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
- finset_midpoint_balanced_card_ge_threeEvery midpoint-balanced finite subset of an additive commutative monoid has cardinality at least 3.
- finset_image_balanced_of_closedIf b is injective, u, v are midpoint witnesses with u i ≠ i, v i ≠ i, u i ≠ v i, and S is a nonempty subset closed under u and v, then…
- finset_is_midpoint_balanced_univ_zmod_threeZ/3Z is balanced: each element is the midpoint of the other two.
- finset_exists_minimal_midpoint_balancedEvery midpoint-balanced finite set B contains an inclusion-minimal midpoint-balanced subset B₀.
- nus_min_card_le_sq_of_midpoint_balancedIf B is a midpoint-balanced subset of Z/pZ, then m(p) ≤ |B|².
- nus_min_card_ge_one_add_clogFor an odd prime p, m(p) ≥ 1 + ⌈log₂ p⌉: every subset of Z/pZ with no unique sums has at least 1 + ⌈log₂ p⌉ elements.
- finset_has_no_unique_sums_sumset_of_balancedIf B is a nonempty balanced finite subset of an abelian group, then its sumset B + B has no unique sums.
- finset_is_midpoint_balanced_of_has_no_unique_sumsFor an odd prime p, every subset of Z/pZ with no unique sums is balanced.
- finset_card_ge_one_add_clog_of_midpoint_balancedFor a prime p, every nonempty balanced subset B of Z/pZ has |B| ≥ 1 + ⌈log₂ p⌉.
- finset_midpoint_balanced_exists_nonzero_minorEvery nonempty midpoint-balanced subset B of ZMod p contains an inclusion-minimal balanced subconfiguration of size k+1 ≤ |B| with k > 0…
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