AFTD Auto-Formalizing Theoretical Domains

is_sender_optimal_scheme

def

q is obedient and maximises the sender's utility among obedient schemes.

Statement

open Finset in
def is_sender_optimal_scheme {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → Bool) → ℝ)
    (q : (ι → Bool) → (ι → Bool) → ℝ) : Prop
Defined in
Quantifying Theoretical AI Alignment Guarantees: Receiver-Utility Bounds in Bayesian Persuasion, arXiv:2606.22226 v1, Sec. 3 (bit-string model, direct obedient form, R_0, S*, R_max); formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Built on 2
Used by 4

Lean source view module on GitHub

open Finset in
/-- `q` is obedient and maximises the sender's utility among obedient schemes. -/
def is_sender_optimal_scheme {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → Bool) → ℝ)
    (q : (ι → Bool) → (ι → Bool) → ℝ) : Prop :=
  is_obedient_direct_scheme μ q ∧
    ∀ q', is_obedient_direct_scheme μ q' → persuasion_sender_utility q' ≤ persuasion_sender_utility q
See it in the graphDiscuss this resultChallenge it