persuasion_slice_coupling_marginal
lemmaverified
The first marginal of the slice coupling is the slice prior.
Statement
open Finset in lemma persuasion_slice_coupling_marginal (m : ℕ) (hm : 1 ≤ m) (x : persuasion_slice_coord m → Bool) : ∑ y, persuasion_slice_coupling m x y = persuasion_slice_prior m x
- 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 5
- persuasion_slice_coordCoordinates of the slice prior: the m-subsets of Fin (2m+1).
- persuasion_slice_couplingThe coupling that pairs the realised state with a uniformly random different state.
- persuasion_slice_priorThe slice prior: uniform over the 2m+1 states persuasion_slice_state m s.
- persuasion_slice_stateState number s of the slice prior: coordinate i is 1 iff s ∈ i.
- persuasion_slice_card_neEach point of Fin (2m+1) differs from exactly 2m points.
- Used by 2
- 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_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 first marginal of the slice coupling is the slice prior. -/lemma persuasion_slice_coupling_marginal (m : ℕ) (hm : 1 ≤ m) (x : persuasion_slice_coord m → Bool) : ∑ y, persuasion_slice_coupling m x y = persuasion_slice_prior m x := by classical unfold persuasion_slice_coupling persuasion_slice_prior rw [sum_comm] apply sum_congr rfl; intro s _ rw [sum_comm] by_cases hs : persuasion_slice_state m s = x · rw [if_pos hs] have e : ∀ t, (∑ y, if s ≠ t ∧ persuasion_slice_state m s = x ∧ persuasion_slice_state m t = y then 1 / ((2 * m + 1 : ℝ) * (2 * m)) else 0) = if s ≠ t then 1 / ((2 * m + 1 : ℝ) * (2 * m)) else 0 := by intro t by_cases ht : s ≠ t · simp only [ht, hs, true_and, if_true, ne_eq, not_false_eq_true] rw [sum_ite_eq] simp · simp [ht] rw [sum_congr rfl (fun t _ => e t), ← sum_filter, Finset.sum_const, persuasion_slice_card_ne, nsmul_eq_mul] have : (m : ℝ) ≠ 0 := by exact_mod_cast (show m ≠ 0 by omega) push_cast field_simp · rw [if_neg hs] apply sum_eq_zero; intro t _ apply sum_eq_zero; intro y _ simp [hs]