persuasion_pair_or_scheme
def
The pair-OR scheme of a symmetric coupling ν: draw (X, Y) ∼ ν and recommend X ∨ Y.
Statement
open Finset in noncomputable def persuasion_pair_or_scheme {ι : Type*} [Fintype ι] [DecidableEq ι] (ν : (ι → Bool) → (ι → Bool) → ℝ) : (ι → Bool) → (ι → Bool) → ℝ
- Defined in
- Quantifying Theoretical AI Alignment Guarantees: Receiver-Utility Bounds in Bayesian Persuasion, arXiv:2606.22226 v1, Lemma 4.4 (the OR scheme), generalised to symmetric couplings; formalized by the operator (Claude), 2026-10-03
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Used by 7
- 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_pair_or_scheme_obedientThe pair-OR scheme of a nonnegative symmetric coupling with first marginal μ is obedient.
- bit_persuasion_even_schemeThe direct signaling scheme bit_persuasion_even_scheme m of type (bit_persuasion_even_coord m → Bool) → (bit_persuasion_even_coord m →…
- persuasion_slice_schemeThe optimal scheme for the slice prior.
- persuasion_pair_or_sender_utilitySender utility of a pair-OR scheme.
Lean source view module on GitHub
open Finset in /-- The pair-OR scheme of a symmetric coupling `ν`: draw `(X, Y) ∼ ν` and recommend `X ∨ Y`. -/ noncomputable def persuasion_pair_or_scheme {ι : Type*} [Fintype ι] [DecidableEq ι] (ν : (ι → Bool) → (ι → Bool) → ℝ) : (ι → Bool) → (ι → Bool) → ℝ := fun x a => ∑ y, if (fun i => x i || y i) = a then ν x y else 0