AFTD Auto-Formalizing Theoretical Domains

binary_repetition_code

def

For an explicit natural number n, the binary repetition code binary_repetition_code n is the Finset (Fin n → Fin 2) containing the constant zero function and the constant one function: {(fun _ => 0), (fun _ => 1)}.

Statement

def binary_repetition_code (n : ℕ) : Finset (Fin n → Fin 2)
Defined in
arXiv:2611.18156 Section IV-A
Verified
16 Nov 2026
Axioms
none listed
Used by 3

Read back from the Lean

The definition binary_repetition_code, parameterized by a natural number $n$, is the finite set of functions from Fin n to Fin 2 consisting of two elements: the constant function mapping every element to $0$, and the constant function mapping every element to $1$.

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

/-- The binary repetition code of length n consisting of the all-zeros and all-ones words as a Finset. -/
def binary_repetition_code (n : ℕ) : Finset (Fin n → Fin 2) := {(fun _ => 0), (fun _ => 1)}
See it in the graphDiscuss this resultChallenge it