AFTD Auto-Formalizing Theoretical Domains

word_block_exchange_c

def

The commuting minimum degree word_block_exchange_c E u v is the infimum in WithTop Nat of mask_u_runs N over all commuting masks N of the exchanged word word_block_exchange_after E satisfying is_word_mask u v (word_block_exchange_after E) N and word_block_exchange_is_commuting E N.

Statement

noncomputable def word_block_exchange_c {α : Type*} (E : WordBlockExchange α) (u v : List α) : WithTop ℕ
Defined in
arXiv:2610.39941, Section 4, equation (2)
Verified
31 Oct 2026
Axioms
none listed
Built on 5
  • mask_u_runsThe number of maximal nonempty U-runs in a binary mask M is defined by mask_u_runs M = mask_u_runs_aux false M, counting contiguous blocks…
  • is_word_maskA binary mask of a word with respect to sources u and v has the same length as the word and projects to u on true and to v on false.
  • word_block_exchange_afterThe word after a block exchange is the concatenation XBAY.
  • WordBlockExchangeA word block exchange consists of four words X, A, B, Y over an alphabet.
  • word_block_exchange_is_commutingA mask N of XBAY is commuting for exchange E if its U-projections and V-projections on the exchanged blocks satisfy A_U B_U = B_U A_U and…

Read back from the Lean

The definition word_block_exchange_c {α : Type*} (E : WordBlockExchange α) (u v : List α) : WithTop ℕ defines an element of WithTop ℕ as the infimum (sInf) of the set of run counts mask_u_runs N (as elements of WithTop ℕ), taken over all boolean lists N : List Bool such that: 1. N is a word mask for u and v along the word word_block_exchange_after E, and 2. N satisfies the commuting condition word_block_exchange_is_commuting E N. If no such mask N exists, the infimum over the empty set evaluates to ⊤.

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

/-- Minimum run count over all commuting masks of XBAY for exchange E. -/
noncomputable def word_block_exchange_c {α : Type*} (E : WordBlockExchange α) (u v : List α) : WithTop ℕ :=
  sInf { (mask_u_runs N : WithTop ℕ) | (N : List Bool) (_ : is_word_mask u v (word_block_exchange_after E) N) (_ : word_block_exchange_is_commuting E N) }
See it in the graphDiscuss this resultChallenge it