AFTD Auto-Formalizing Theoretical Domains

groupSet

def

The g-th group of players, i.e. the players i : Fin n with i.val / 2 = g (so {0,1},{2,3},... and a final singleton when n is odd).

Statement

def groupSet {n : ℕ} (g : ℕ) : Finset (Fin n)
Source
step towards two_thirds_convex_random_marginal_core_logarithmic_lower_bound
Verified
13 Nov 2026
Axioms
none listed
Used by 1
  • ellThe length of the initial run of full groups contained in S: the number of g in range(numGroups n) such that every group h ≤ g is…

Lean source view module on GitHub

/-- The g-th pair-group of players, {2g, 2g+1} intersected with Fin n. -/
def groupSet {n : ℕ} (g : ℕ) : Finset (Fin n) := Finset.univ.filter (fun i : Fin n => i.val / 2 = g)
See it in the graphDiscuss this resultChallenge it