AFTD Auto-Formalizing Theoretical Domains

is_obedient_direct_scheme

def

An obedient direct scheme for the prior μ on {0,1}^ι.

Statement

open Finset in
def is_obedient_direct_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 1
Used by 7

Lean source view module on GitHub

open Finset in
/-- An obedient direct scheme for the prior `μ` on `{0,1}^ι`. -/
def is_obedient_direct_scheme {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → Bool) → ℝ)
    (q : (ι → Bool) → (ι → Bool) → ℝ) : Prop :=
  (∀ x a, 0 ≤ q x a) ∧ (∀ x, ∑ a, q x a = μ x) ∧
    ∀ a i, ∑ x, q x a * persuasion_obedience_cost i x a ≤ 0
See it in the graphDiscuss this resultChallenge it