persuasion_slice_coupling
def
The coupling that pairs the realised state with a uniformly random different state.
Statement
open Finset in noncomputable def persuasion_slice_coupling (m : ℕ) : (persuasion_slice_coord m → Bool) → (persuasion_slice_coord m → Bool) → ℝ
- Source
- step towards persuasion_receiver_ratio_optimal_constant (optimal receiver-utility constant 3/2, open in arXiv:2606.22226 v1, Sec. 5)
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Built on 2
- persuasion_slice_coordCoordinates of the slice prior: the m-subsets of Fin (2m+1).
- persuasion_slice_stateState number s of the slice prior: coordinate i is 1 iff s ∈ i.
- Used by 5
- persuasion_slice_scheme_sender_utilityThe slice scheme gives the sender C(2m+1,m) - C(2m-1,m): a coordinate is recommended 1 iff its m-subset meets the two paired states.
- persuasion_slice_scheme_obedientThe slice scheme (pair the realised state with a uniformly random other state and recommend the coordinatewise OR) is an obedient direct…
- persuasion_slice_coupling_marginalThe first marginal of the slice coupling is the slice prior.
- persuasion_slice_schemeThe optimal scheme for the slice prior.
- persuasion_slice_valuesR_max and R_0 for the slice prior.
Lean source view module on GitHub
open Finset in /-- The coupling that pairs the realised state with a uniformly random different state. -/ noncomputable def persuasion_slice_coupling (m : ℕ) : (persuasion_slice_coord m → Bool) → (persuasion_slice_coord m → Bool) → ℝ := fun x y => ∑ s, ∑ t, if s ≠ t ∧ persuasion_slice_state m s = x ∧ persuasion_slice_state m t = y then 1 / ((2 * m + 1 : ℝ) * (2 * m)) else 0