AFTD Auto-Formalizing Theoretical Domains

lowMul3Target0

def

The 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).

Statement

def lowMul3Target0 : (Fin 6 → Bool) → ZMod 2
Defined in
arXiv:2611.15992 Section 2 (Targets)
Verified
16 Nov 2026
Axioms
none listed
Used by 1
  • lowMul3TargetsThe set of target bits {z_0, z_1, z_2} of the three-bit low-half multiplier.

Read back from the Lean

The definition lowMul3Target0 is the function from Fin 6 → Bool to ZMod 2 defined as the pointwise product of two functions: the function mapping x to 1 (in ZMod 2) if x 0 is true and 0 otherwise, and the function mapping x to 1 if x 3 is true and 0 otherwise. That is, for any x : Fin 6 → Bool, it outputs (if x 0 then 1 else 0) * (if x 3 then 1 else 0), which equals 1 if both x 0 and x 3 are true, and 0 otherwise.

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 first output bit z_0 = a_0 * b_0 of the three-bit low-half multiplier. -/
def lowMul3Target0 : (Fin 6 → Bool) → ZMod 2 := (fun x => if x 0 then (1 : ZMod 2) else 0) * (fun x => if x 3 then 1 else 0)
See it in the graphDiscuss this resultChallenge it