AFTD Auto-Formalizing Theoretical Domains

ejr_support_density_bound

def

The finite supporter-density bound: for every candidate subset T, its undersatisfied supporter count times q is at most |T| times the number of voters. The proposed size-k invariant uses q=k+1.

Statement

def ejr_support_density_bound {n m : ℕ} (A : Fin n → Finset (Fin m))
    (q : ℕ) (W : Finset (Fin m)) : Prop
Source
Supporting work for OP-22, arXiv:2007.01795, Q2, and the proposed max-group-density invariant in memory attempt 4342. These helpers neither settle full-chain existence nor refute the actual greedy rule. No research advance is claimed.
Verified
25 Oct 2026
Axioms
none listed
Used by 6

Lean source view module on GitHub

def ejr_support_density_bound {n m : ℕ} (A : Fin n → Finset (Fin m))
    (q : ℕ) (W : Finset (Fin m)) : Prop := ∀ T : Finset (Fin m),
    (Finset.univ.filter fun i => T ⊆ A i ∧ (A i ∩ W).card < T.card).card * q ≤
      T.card * n
See it in the graphDiscuss this resultChallenge it