AFTD Auto-Formalizing Theoretical Domains

bit_persuasion_even_state

def

The 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 of the indexing subset of c.

Statement

open Finset in
def bit_persuasion_even_state (m : ℕ) (s : Fin (2 * m)) : bit_persuasion_even_coord m → Bool
Defined in
arXiv:2606.22226
Verified
11 Nov 2026
Axioms
none listed
Built on 1
  • 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 -…
Used by 5
  • 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_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 and an element s : Fin (2 * m), bit_persuasion_even_state m s defines a boolean-valued function on bit_persuasion_even_coord m. For any coordinate c: - If c is of the form Sum.inl (A, _), where A is a subtype element representing a finset of Fin (2 * m) of cardinality m - 1 (paired with an element of Fin (m + 1)), it returns true if s ∈ A.val and false otherwise. - If c is of the form Sum.inr (B, _), where B is a subtype element representing a finset of Fin (2 * m) of cardinality m (paired with an element of Fin (3 * m)), it returns true if s ∈ B.val and false otherwise. In both cases, the second component of the pair is ignored.

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
/-- State s of the two-layer construction: coordinate c is 1 iff s belongs to the indexing subset of c. -/
def bit_persuasion_even_state (m : ℕ) (s : Fin (2 * m)) : bit_persuasion_even_coord m → Bool :=
  fun c => match c with
  | Sum.inl (A, _) => decide (s ∈ A.1)
  | Sum.inr (B, _) => decide (s ∈ B.1)
See it in the graphDiscuss this resultChallenge it