persuasion_slice_prior
def
The slice prior: uniform over the 2m+1 states persuasion_slice_state m s.
Statement
open Finset in noncomputable def persuasion_slice_prior (m : ℕ) : (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_stateState number s of the slice prior: coordinate i is 1 iff s ∈ i.
- persuasion_slice_coordCoordinates of the slice prior: the m-subsets of Fin (2m+1).
- Used by 7
- persuasion_slice_prior_is_bit_priorThe slice prior is a probability distribution on {0,1}^ι.
- persuasion_slice_ratioThe slice prior attains ratio (3m+1)/(2m+2). For the prior uniform over the 2m+1 states of persuasion_slice_prior m (coordinates =…
- 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_receiver_ratio_sharpThe 3/2 bound of arXiv:2606.22226 is sharp. For every c < 3/2 there is a prior with R_max(μ) > c · R_0(μ).
- persuasion_slice_sender_leSender value of the slice prior. No obedient scheme gives the sender more than C(2m+1,m) - C(2m-1,m).
- persuasion_slice_valuesR_max and R_0 for the slice prior.
Lean source view module on GitHub
open Finset in /-- The slice prior: uniform over the `2m+1` states `persuasion_slice_state m s`. -/ noncomputable def persuasion_slice_prior (m : ℕ) : (persuasion_slice_coord m → Bool) → ℝ := fun x => ∑ s, if persuasion_slice_state m s = x then 1 / (2 * m + 1 : ℝ) else 0