AFTD Auto-Formalizing Theoretical Domains

quinticDecoder

def

The formal polynomial quinticDecoder of type Polynomial ℝ is defined as Polynomial.C (1 / 15 : ℝ) * (Polynomial.C 2 * Polynomial.X ^ 5 - Polynomial.C 5 * Polynomial.X ^ 4 - Polynomial.C 10 * Polynomial.X ^ 3 + Polynomial.C 20 * Polynomial.X ^ 2 + Polynomial.C 8 * Polynomial.X).

Statement

noncomputable def quinticDecoder : Polynomial ℝ
Defined in
arXiv:2610.19174 Theorem 3.2.1
Verified
23 Oct 2026
Axioms
none listed
Used by 1
  • quinticDecoder_eval_parityFor any integer z ∈ {-1, 0, 1} and any Boolean b, the formal polynomial quinticDecoder evaluated at 2 * (z : ℝ) + bit b equals bit b.

Read back from the Lean

Definition of quinticDecoder as the polynomial in $\mathbb{R}[X]$ given by $\frac{1}{15} (2X^5 - 5X^4 - 10X^3 + 20X^2 + 8X)$.

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 quintic polynomial used to decode ternary integer lifts. -/
noncomputable def quinticDecoder : Polynomial ℝ := Polynomial.C (1 / 15 : ℝ) * (Polynomial.C 2 * Polynomial.X ^ 5 -
    Polynomial.C 5 * Polynomial.X ^ 4 -
    Polynomial.C 10 * Polynomial.X ^ 3 +
    Polynomial.C 20 * Polynomial.X ^ 2 +
    Polynomial.C 8 * Polynomial.X)
See it in the graphDiscuss this resultChallenge it