persuasion_pair_or_sender_utility
lemmaverified
Sender utility of a pair-OR scheme.
Statement
open Finset in lemma persuasion_pair_or_sender_utility {ι : Type*} [Fintype ι] [DecidableEq ι] (ν : (ι → Bool) → (ι → Bool) → ℝ) : persuasion_sender_utility (persuasion_pair_or_scheme ν) = ∑ x, ∑ y, ν x y * ((Finset.univ.filter (fun i => (x i || y i) = true)).card : ℝ)
- 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
- persuasion_sender_utilitySender utility S(q): expected number of coordinates recommended as 1.
- persuasion_pair_or_schemeThe pair-OR scheme of a symmetric coupling ν: draw (X, Y) ∼ ν and recommend X ∨ Y.
- Used by 4
- persuasion_uniform_two_states_ratio_leFor every finite type ι and every prior μ on ι → Bool that is uniform on 2 distinct states, the maximum receiver utility R_max(μ) is at…
- persuasion_max_receiver_utility_learXiv:2606.22226, Theorem 4.5 (ratio form). For every prior, R_max(μ) ≤ (3/2) R_0(μ).
- persuasion_pair_or_receiver_add_senderA pair-OR scheme never recommends 0 on a coordinate equal to 1, so the trade-off of Lemma 4.2 is an equality for it.
- 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.
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/-- Sender utility of a pair-OR scheme. -/lemma persuasion_pair_or_sender_utility {ι : Type*} [Fintype ι] [DecidableEq ι] (ν : (ι → Bool) → (ι → Bool) → ℝ) : persuasion_sender_utility (persuasion_pair_or_scheme ν) = ∑ x, ∑ y, ν x y * ((Finset.univ.filter (fun i => (x i || y i) = true)).card : ℝ) := by classical unfold persuasion_sender_utility persuasion_pair_or_scheme apply sum_congr rfl; intro x _ simp only [sum_mul] rw [sum_comm] apply sum_congr rfl; intro y _ simp only [ite_mul, zero_mul] rw [sum_ite_eq] simp