is_uniform_bit_prior
deforiginal
A 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 and which assigns probability 1 / (k : ℝ) to every state in its support.
Statement
open Finset in def is_uniform_bit_prior {ι : Type*} [Fintype ι] [DecidableEq ι] (k : ℕ) (μ : (ι → Bool) → ℝ) : Prop
- Related work
- arXiv:2606.22226
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 1
- is_bit_priorA probability distribution on {0,1}^ι.
- Used by 3
- 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…
- 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_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…
Read back from the Lean
For a finite type ι with decidable equality, a natural number k, and a function μ : (ι → Bool) → ℝ, is_uniform_bit_prior k μ asserts that:
1. μ is a bit prior (i.e., μ x ≥ 0 for all x : ι → Bool, and the sum of μ x over all x : ι → Bool equals 1);
2. the number of elements x : ι → Bool with μ x ≠ 0 equals k; and
3. for all x : ι → Bool, if μ x ≠ 0, then μ x = 1 / (k : ℝ).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
open Finset in /-- A probability distribution on {0, 1}^ι is uniform on k states if it is a bit prior whose support has cardinality k and assigns weight 1/k to each point in its support. -/ def is_uniform_bit_prior {ι : Type*} [Fintype ι] [DecidableEq ι] (k : ℕ) (μ : (ι → Bool) → ℝ) : Prop := is_bit_prior μ ∧ ((Finset.univ.filter (fun x => μ x ≠ 0)).card = k) ∧ (∀ x, μ x ≠ 0 → μ x = 1 / (k : ℝ))