bit_persuasion_even_prior
def
The function bit_persuasion_even_prior m of type (bit_persuasion_even_coord m → Bool) → ℝ mapping each configuration x to the sum over all s : Fin (2 * m) of 1 / (2 * m : ℝ) if bit_persuasion_even_state m s = x and 0 otherwise.
Statement
open Finset in noncomputable def bit_persuasion_even_prior (m : ℕ) : (bit_persuasion_even_coord m → Bool) → ℝ
- Defined in
- arXiv:2606.22226
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 2
- bit_persuasion_even_coordThe type of coordinates of the two-layer prior for 2m states, defined as the coproduct type of ({A : Finset (Fin (2 * m)) // A.card = m -…
- bit_persuasion_even_stateThe bit-vector state corresponding to s ∈ Fin (2m) in the two-layer construction, where coordinate c is 1 if and only if s is an element…
- Used by 3
- 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…
- bit_persuasion_even_scheme_obedientFor every natural number m ≥ 1, bit_persuasion_even_scheme m is an obedient direct scheme for bit_persuasion_even_prior m…
- 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)).
Read back from the Lean
For a natural number m, bit_persuasion_even_prior m is the function that maps each boolean configuration x : bit_persuasion_even_coord m → Bool to the real number given by the sum over all s : Fin (2 * m) of: 1 / (2 * m : ℝ) if bit_persuasion_even_state m s = x, and 0 otherwise.
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 /-- The two-layer prior on 2m states: uniform distribution over the 2m states bit_persuasion_even_state m s. -/ noncomputable def bit_persuasion_even_prior (m : ℕ) : (bit_persuasion_even_coord m → Bool) → ℝ := fun x => ∑ s, if bit_persuasion_even_state m s = x then 1 / (2 * m : ℝ) else 0