ell
def
The 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 contained in S.
Statement
noncomputable def ell {n : ℕ} (S : Finset (Fin n)) : ℕ
- Source
- step towards two_thirds_convex_random_marginal_core_logarithmic_lower_bound
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 2
- Used by 1
- gameVThe constructed 2/3-convex cooperative game v_n(S) = (4n+1)·N(S) - ell(S) on players Fin n.
Lean source view module on GitHub
/-- Length of the initial run of groups fully contained in S; the small correction term of the game. -/ noncomputable def ell {n : ℕ} (S : Finset (Fin n)) : ℕ := by classical exact ((Finset.range (numGroups n)).filter (fun g => ∀ h ∈ Finset.range (g + 1), groupSet h ⊆ S)).card