persuasion_slice_prior_is_bit_prior
lemmaverified
The slice prior is a probability distribution on {0,1}^ι.
Statement
open Finset in lemma persuasion_slice_prior_is_bit_prior (m : ℕ) : is_bit_prior (persuasion_slice_prior 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
Classical.choiceQuot.soundpropext- Built on 2
- is_bit_priorA probability distribution on {0,1}^ι.
- persuasion_slice_priorThe slice prior: uniform over the 2m+1 states persuasion_slice_state m s.
- Used by 3
- 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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Finset in/-- The slice prior is a probability distribution on `{0,1}^ι`. -/lemma persuasion_slice_prior_is_bit_prior (m : ℕ) : is_bit_prior (persuasion_slice_prior m) := by refine ⟨fun x => sum_nonneg fun s _ => ?_, ?_⟩ · split_ifs · positivity · exact le_refl 0 · unfold persuasion_slice_prior rw [sum_comm] simp only [sum_ite_eq, Finset.mem_univ, if_true, Finset.sum_const, card_univ, Fintype.card_fin, nsmul_eq_mul] push_cast field_simp