is_bit_prior
def
A probability distribution on {0,1}^ι.
Statement
open Finset in def is_bit_prior {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → 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
- Used by 10
- persuasion_slice_prior_is_bit_priorThe slice prior is a probability distribution on {0,1}^ι.
- 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_receiver_ratio_optimal_constantThe optimal constant is 3/2. 3/2 is the least c with R_max(μ) ≤ c R_0(μ) for all priors μ (over all finite coordinate sets).
- bit_persuasion_bounded_support_ratio_le_three_halvesFor every natural number m, every finite type ι with [DecidableEq ι], and every prior μ on ι → Bool that is a bit prior supported on at…
- bit_persuasion_even_prior_is_uniformFor every natural number m with 1 ≤ m, the function bit_persuasion_even_prior m is a uniform bit prior on 2 * m states…
- persuasion_receiver_ratio_sharpThe 3/2 bound of arXiv:2606.22226 is sharp. For every c < 3/2 there is a prior with R_max(μ) > c · R_0(μ).
- persuasion_uniform_even_ratio_le_three_halvesFor every natural number m, every finite type ι, and every prior μ on ι → Bool that is uniform on 2m distinct states, the maximum receiver…
- bit_persuasion_even_prior_is_bit_priorFor every natural number m ≥ 1, the function bit_persuasion_even_prior m is a bit prior (is_bit_prior (bit_persuasion_even_prior m)).
- is_uniform_bit_priorA real-valued function μ on ι → Bool is a uniform bit prior on k states if it is a bit prior whose support {x | μ x ≠ 0} has cardinality k…
Lean source view module on GitHub
open Finset in /-- A probability distribution on `{0,1}^ι`. -/ def is_bit_prior {ι : Type*} [Fintype ι] [DecidableEq ι] (μ : (ι → Bool) → ℝ) : Prop := (∀ x, 0 ≤ μ x) ∧ ∑ x, μ x = 1