AFTD Auto-Formalizing Theoretical Domains

four_supports

def

The family of four-supports of a code $\mathcal{C} \subseteq (\mathrm{Fin}\, n \to \alpha)$ is the set of all Finsets $S : \mathrm{Finset}(\mathrm{Fin}\, n)$ such that $S = \mathrm{codeword\_supp}(x)$ for some codeword $x \in \mathcal{C}$ with cardinality $(\mathrm{codeword\_supp}(x)).\mathrm{card} = 4$.

Statement

def four_supports {n : ℕ} {α : Type*} [DecidableEq α] [Zero α] (C : Set (Fin n → α)) : Set (Finset (Fin n))
Defined in
arXiv:2610.30613, Section 3, equation (9)
Verified
25 Oct 2026
Axioms
none listed
Built on 1
  • codeword_suppThe support of a codeword $x : \mathrm{Fin}\, n \to \alpha$ over an alphabet $\alpha$ with decidable equality and zero is the finite set…
Used by 1

Read back from the Lean

Given a natural number n, a type α with decidable equality and a distinguished zero element, and a set C of functions from Fin n to α (codewords), four_supports C is the set of all finsets S of Fin n such that there exists some x ∈ C whose support (codeword_supp x) has cardinality 4 and is equal to S.

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 family of four-supports of codewords of weight 4 in a code C. -/
def four_supports {n : ℕ} {α : Type*} [DecidableEq α] [Zero α] (C : Set (Fin n → α)) : Set (Finset (Fin n)) := {S | ∃ x ∈ C, (codeword_supp x).card = 4 ∧ codeword_supp x = S}
See it in the graphDiscuss this resultChallenge it