AFTD Auto-Formalizing Theoretical Domains

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
Used by 4

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it