AFTD Auto-Formalizing Theoretical Domains

low_half_mul_three_targets

def

The set of three Boolean functions of type Set ((Fin 6 → ZMod 2) → ZMod 2) representing the output bits z₀, z₁, z₂ of the 3-bit low-half multiplier on input x : Fin 6 → ZMod 2, given by x ↦ x 0 * x 3, x ↦ x 0 * x 4 + x 1 * x 3, and x ↦ x 0 * x 5 + x 1 * x 4 + x 2 * x 3 + x 0 * x 1 * x 3 * x 4.

Statement

def low_half_mul_three_targets : Set ((Fin 6 → ZMod 2) → ZMod 2)
Defined in
arXiv:2611.15992 Section 2
Verified
16 Nov 2026
Axioms
none listed

Read back from the Lean

low_half_mul_three_targets is defined as the set of three functions from Fin 6 → ZMod 2 to ZMod 2: 1. $x \mapsto x(0) \cdot x(3)$ 2. $x \mapsto x(0) \cdot x(4) + x(1) \cdot x(3)$ 3. $x \mapsto x(0) \cdot x(5) + x(1) \cdot x(4) + x(2) \cdot x(3) + x(0) \cdot x(1) \cdot x(3) \cdot x(4)$ where addition and multiplication are in $\mathbb{Z}/2\mathbb{Z}$.

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 set of target Boolean functions {z₀, z₁, z₂} of the three-bit low-half multiplier. -/
def low_half_mul_three_targets : Set ((Fin 6 → ZMod 2) → ZMod 2) := { (fun x => x 0 * x 3), (fun x => x 0 * x 4 + x 1 * x 3), (fun x => x 0 * x 5 + x 1 * x 4 + x 2 * x 3 + x 0 * x 1 * x 3 * x 4) }
See it in the graphDiscuss this resultChallenge it