persuasion_slice_coord
abbrev
Coordinates of the slice prior: the m-subsets of Fin (2m+1).
Statement
open Finset in abbrev persuasion_slice_coord (m : ℕ)
- 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
- Used by 11
- 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_card_coordThe slice prior has C(2m+1, m) coordinates.
- persuasion_slice_stateState number s of the slice prior: coordinate i is 1 iff s ∈ i.
- 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_card_filterCounting coordinates of the slice prior with a property of the underlying m-subset is counting m-subsets of Fin (2m+1) with that property.
- persuasion_slice_priorThe slice prior: uniform over the 2m+1 states persuasion_slice_state m s.
- 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_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.
- persuasion_slice_couplingThe coupling that pairs the realised state with a uniformly random different state.
Lean source view module on GitHub
open Finset in /-- Coordinates of the slice prior: the `m`-subsets of `Fin (2m+1)`. -/ abbrev persuasion_slice_coord (m : ℕ) := {i : Finset (Fin (2 * m + 1)) // i.card = m}