AFTD Auto-Formalizing Theoretical Domains

lowMul3Targets

def

The set of target bits {z_0, z_1, z_2} of the three-bit low-half multiplier.

Statement

def lowMul3Targets : Set ((Fin 6 → Bool) → ZMod 2)
Defined in
arXiv:2611.15992 Section 2 (Targets)
Verified
16 Nov 2026
Axioms
none listed
Built on 3
  • lowMul3Target0The target function z_0 : (Fin 6 → Bool) → ZMod 2 of the 3-bit low-half multiplier, given by z_0(x) = a_0 * b_0 = x(0) * x(3).
  • lowMul3Target1The target function z_1 : (Fin 6 → Bool) → ZMod 2 of the 3-bit low-half multiplier, given by z_1(x) = a_0 * b_1 + a_1 * b_0 = x(0) * x(4)…
  • lowMul3Target2The target function z_2 : (Fin 6 → Bool) → ZMod 2 of the 3-bit low-half multiplier, given by z_2(x) = x(0)*x(5) + x(1)*x(4) + x(2)*x(3) +…

Read back from the Lean

Definition of lowMul3Targets as the set of three functions from Fin 6 → Bool to ZMod 2, namely {lowMul3Target0, lowMul3Target1, lowMul3Target2}, where: 1. lowMul3Target0 maps x : Fin 6 → Bool to (if x 0 then 1 else 0) * (if x 3 then 1 else 0) : ZMod 2. 2. lowMul3Target1 maps x to (if x 0 then 1 else 0) * (if x 4 then 1 else 0) + (if x 1 then 1 else 0) * (if x 3 then 1 else 0) : ZMod 2. 3. lowMul3Target2 maps x to (if x 0 then 1 else 0) * (if x 5 then 1 else 0) + (if x 1 then 1 else 0) * (if x 4 then 1 else 0) + (if x 2 then 1 else 0) * (if x 3 then 1 else 0) + (if x 0 then 1 else 0) * (if x 1 then 1 else 0) * (if x 3 then 1 else 0) * (if x 4 then 1 else 0) : ZMod 2.

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 output functions {z_0, z_1, z_2} for the 3-bit low-half multiplier. -/
def lowMul3Targets : Set ((Fin 6 → Bool) → ZMod 2) := {lowMul3Target0, lowMul3Target1, lowMul3Target2}
See it in the graphDiscuss this resultChallenge it