AFTD Auto-Formalizing Theoretical Domains

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

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