AFTD Auto-Formalizing Theoretical Domains

codeword_supp_zero

theoremverified

The support of the all-zero codeword $0 : \mathrm{Fin}\, n \to \alpha$ is the empty Finset $\emptyset$.

Statement

theorem codeword_supp_zero {n : ℕ} {α : Type*} [DecidableEq α] [Zero α] :
    codeword_supp (0 : Fin n → α) = ∅
Source
folklore
Verified
25 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
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…

Read back from the Lean

For any natural number $n$ and any type $\alpha$ equipped with decidable equality and a zero element, the codeword support of the all-zero function $0 : \mathrm{Fin}\ n \to \alpha$ is the empty set $\emptyset$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

By definition, the support of a codeword $x$ is the finite set of indices $i$ where $x(i) \neq 0$. For the all-zero codeword $0$, each coordinate evaluates to $0$, making the condition $0 \neq 0$ everywhere false. Consequently, filtering the indices by this condition yields the empty set.

  1. The support of the all-zero codeword is the empty set $\emptyset$. automation

    Unfolding the definition of codeword support (`codeword_supp`), the support of $0$ is the set of indices $i \in \mathrm{Fin}\, n$ such that $0(i) \neq 0$. For the constant zero function, $0(i) = 0$ for all $i$, making the condition $0 \neq 0$ universally false. Filtering the universe by this false condition yields the empty set $\emptyset$, which the simplifier closes directly.

    line 4

    uses codeword_supp

      simp [codeword_supp]
codeword_supp
The support of a codeword $x : \mathrm{Fin}\, n \to \alpha$, defined as the finite set of indices $i$ where $x(i) \neq 0$.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The support of the all-zero codeword is empty. -/theorem codeword_supp_zero {n : ℕ} {α : Type*} [DecidableEq α] [Zero α] :    codeword_supp (0 : Fin n → α) = ∅ := by  simp [codeword_supp]
See it in the graphDiscuss this resultChallenge it