persuasion_pair_or_receiver_add_sender
lemmaverified
A 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.
Statement
open Finset in lemma persuasion_pair_or_receiver_add_sender {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → Bool) → ℝ) (hμ : ∑ x, μ x = 1) (ν : (ι → Bool) → (ι → Bool) → ℝ) (hνμ : ∀ x, ∑ y, ν x y = μ x) : persuasion_receiver_utility (persuasion_pair_or_scheme ν) + persuasion_sender_utility (persuasion_pair_or_scheme ν) = Fintype.card ι + ∑ i, persuasion_marginal μ i
- 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_receiver_utilityReceiver utility R(q): expected number of correctly guessed coordinates.
- persuasion_pair_or_schemeThe pair-OR scheme of a symmetric coupling ν: draw (X, Y) ∼ ν and recommend X ∨ Y.
- persuasion_sender_utilitySender utility S(q): expected number of coordinates recommended as 1.
- persuasion_marginalThe marginal p_i(μ) = Pr_μ[X_i = 1].
- persuasion_pair_or_sender_utilitySender utility of a pair-OR scheme.
- Used by 1
- 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/-- A pair-OR scheme never recommends `0` on a coordinate equal to `1`, so the trade-off ofLemma 4.2 is an equality for it. -/lemma persuasion_pair_or_receiver_add_sender {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → Bool) → ℝ) (hμ : ∑ x, μ x = 1) (ν : (ι → Bool) → (ι → Bool) → ℝ) (hνμ : ∀ x, ∑ y, ν x y = μ x) : persuasion_receiver_utility (persuasion_pair_or_scheme ν) + persuasion_sender_utility (persuasion_pair_or_scheme ν) = Fintype.card ι + ∑ i, persuasion_marginal μ i := by classical have hc : (Fintype.card ι : ℝ) = ∑ _i : ι, (1 : ℝ) := by simp have pt : ∀ x y : ι → Bool, ((Finset.univ.filter (fun i => (x i || y i) = x i)).card : ℝ) + ((Finset.univ.filter (fun i => (x i || y i) = true)).card : ℝ) = Fintype.card ι + ((Finset.univ.filter (fun i => x i = true)).card : ℝ) := by intro x y rw [hc, natCast_card_filter, natCast_card_filter, natCast_card_filter, ← sum_add_distrib, ← sum_add_distrib] apply sum_congr rfl intro i _ cases x i <;> cases y i <;> norm_num have hR : persuasion_receiver_utility (persuasion_pair_or_scheme ν) = ∑ x, ∑ y, ν x y * ((Finset.univ.filter (fun i => (x i || y i) = x i)).card : ℝ) := by unfold persuasion_receiver_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 rw [hR, persuasion_pair_or_sender_utility, ← sum_add_distrib] have : ∀ x, ∑ y, ν x y * ((Finset.univ.filter (fun i => (x i || y i) = x i)).card : ℝ) + ∑ y, ν x y * ((Finset.univ.filter (fun i => (x i || y i) = true)).card : ℝ) = μ x * ((Fintype.card ι : ℝ) + ((Finset.univ.filter (fun i => x i = true)).card : ℝ)) := by intro x rw [← sum_add_distrib, ← hνμ x, sum_mul] apply sum_congr rfl; intro y _ rw [← mul_add, pt] rw [sum_congr rfl (fun x _ => this x)] simp only [mul_add, sum_add_distrib] rw [← sum_mul, hμ, one_mul] congr 1 unfold persuasion_marginal simp only [natCast_card_filter, mul_sum] rw [sum_comm] apply sum_congr rfl; intro i _ apply sum_congr rfl; intro x _ split_ifs <;> simp