crossPairCount
def
The number, written as a real number, of ordered pairs (a,b) of elements of S whose group indices a.val/2 and b.val/2 differ (equivalently twice the number of unordered cross-group pairs inside S).
Statement
noncomputable def crossPairCount {n : ℕ} (S : 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
- 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
/-- Ordered cross-group pair count N(S); the supermodular part of the constructed game. -/ noncomputable def crossPairCount {n : ℕ} (S : Finset (Fin n)) : ℝ := ∑ a : Fin n, ∑ b : Fin n, (if a ∈ S ∧ b ∈ S ∧ a.val / 2 ≠ b.val / 2 then (1 : ℝ) else 0)