bit_persuasion_even_coord
The 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 - 1} × Fin (m + 1)) and ({B : Finset (Fin (2 * m)) // B.card = m} × Fin (3 * m)), pairing each (m-1)-subset of Fin (2 * m) with a multiplicity index in Fin (m + 1) and each m-subset of Fin (2 * m) with a multiplicity index in Fin (3 * m).
Statement
open Finset in abbrev bit_persuasion_even_coord (m : ℕ)
- Defined in
- arXiv:2606.22226
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 7
- 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…
- 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_schemeThe direct signaling scheme bit_persuasion_even_scheme m of type (bit_persuasion_even_coord m → Bool) → (bit_persuasion_even_coord m →…
- 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_priorThe function bit_persuasion_even_prior m of type (bit_persuasion_even_coord m → Bool) → ℝ mapping each configuration x to the sum over all…
- 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)).
- bit_persuasion_even_couplingThe function bit_persuasion_even_coupling m of type (bit_persuasion_even_coord m → Bool) → (bit_persuasion_even_coord m → Bool) → ℝ…
Read back from the Lean
Given a natural number m, bit_persuasion_even_coord m is the type defined as the disjoint union (Sum / ⊕) of:
1. The Cartesian product of the subtype of finite subsets A ⊆ Fin (2 * m) with cardinality m - 1 (using natural number subtraction) and the type Fin (m + 1).
2. The Cartesian product of the subtype of finite subsets B ⊆ Fin (2 * m) with cardinality m and the type Fin (3 * m).
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 coordinate type of the two-layer prior on 2m states: (m-1)-subsets with multiplicity m+1, and m-subsets with multiplicity 3m. -/ abbrev bit_persuasion_even_coord (m : ℕ) := ({A : Finset (Fin (2 * m)) // A.card = m - 1} × Fin (m + 1)) ⊕ ({B : Finset (Fin (2 * m)) // B.card = m} × Fin (3 * m))