AFTD Auto-Formalizing Theoretical Domains

bit_persuasion_even_coupling

def

The function bit_persuasion_even_coupling m of type (bit_persuasion_even_coord m → Bool) → (bit_persuasion_even_coord m → Bool) → ℝ mapping each pair of configurations (x, y) to the sum over all s, t : Fin (2 * m) of 1 / ((2 * m : ℝ) * (2 * m - 1)) if s ≠ t and bit_persuasion_even_state m s = x and bit_persuasion_even_state m t = y, and 0 otherwise.

Statement

open Finset in
noncomputable def bit_persuasion_even_coupling (m : ℕ) :
    (bit_persuasion_even_coord m → Bool) → (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 2
  • 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…

Read back from the Lean

Given a natural number m, bit_persuasion_even_coupling m is the function mapping two Boolean configurations x, y : bit_persuasion_even_coord m → Bool to the real number given by the double sum over s, t : Fin (2 * m) of: 1 / ((2 * m : ℝ) * (2 * m - 1)) if s ≠ t, bit_persuasion_even_state m s = x, and bit_persuasion_even_state m t = y, 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 coupling that pairs each realized state with a uniformly random different state among the 2m states. -/
noncomputable def bit_persuasion_even_coupling (m : ℕ) :
    (bit_persuasion_even_coord m → Bool) → (bit_persuasion_even_coord m → Bool) → ℝ :=
  fun x y => ∑ s, ∑ t, if s ≠ t ∧ bit_persuasion_even_state m s = x ∧ bit_persuasion_even_state m t = y
    then 1 / ((2 * m : ℝ) * (2 * m - 1)) else 0
See it in the graphDiscuss this resultChallenge it