AFTD Auto-Formalizing Theoretical Domains

bent_sum_counterexample_func

def

For any integer m ≥ 4, the Boolean function on (Fin (2 * m) → ZMod 2) defined by multiplying the first m - 2 coordinates and the sum of three disjoint quadratic terms on the next 6 coordinates.

Statement

def bent_sum_counterexample_func (m : ℕ) (hm : 4 ≤ m) (x : Fin (2 * m) → ZMod 2) : ZMod 2
Defined in
arXiv:2610.32239, Section 4.1, Eq. (4.3)
Verified
26 Oct 2026
Axioms
none listed
Used by 2

Read back from the Lean

A function definition that, given a natural number m, a proof hm : 4 ≤ m, and a vector x : Fin (2 * m) → ZMod 2, returns the value in ZMod 2 given by: (∏ i : Fin (m - 2), x ⟨i.val, _⟩) * (x ⟨m - 2, _⟩ * x ⟨m - 1, _⟩ + x ⟨m, _⟩ * x ⟨m + 1, _⟩ + x ⟨m + 2, _⟩ * x ⟨m + 3, _⟩). In standard mathematical notation, this is the function on (ℤ/2ℤ)^(2m) defined by: (∏_{i=0}^{m-3} x_i) · (x_{m-2} x_{m-1} + x_m x_{m+1} + x_{m+2} x_{m+3})

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 Boolean function f_n on (Fin (2 * m) → ZMod 2) for m ≥ 4, defined as the product of the first m - 2 variables times a 6-variable quadratic form. -/
def bent_sum_counterexample_func (m : ℕ) (hm : 4 ≤ m) (x : Fin (2 * m) → ZMod 2) : ZMod 2 :=
  (∏ i : Fin (m - 2), x ⟨i.val, by omega⟩) *
    (x ⟨m - 2, by omega⟩ * x ⟨m - 1, by omega⟩ +
     x ⟨m, by omega⟩ * x ⟨m + 1, by omega⟩ +
     x ⟨m + 2, by omega⟩ * x ⟨m + 3, by omega⟩)
See it in the graphDiscuss this resultChallenge it