AFTD Auto-Formalizing Theoretical Domains

has_nonzero_period

def

A Boolean function f has a nonzero period if there exists a nonzero vector a such that f(x + a) = f(x) for all x.

Statement

def has_nonzero_period {n : ℕ} (f : (Fin n → ZMod 2) → ZMod 2) : Prop
Defined in
arXiv:2610.32239 Section 2
Verified
26 Oct 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a natural number $n$ and a function $f : (\mathrm{Fin}\ n \to \mathbb{Z}/2\mathbb{Z}) \to \mathbb{Z}/2\mathbb{Z}$, has_nonzero_period f is the proposition that there exists some $a : \mathrm{Fin}\ n \to \mathbb{Z}/2\mathbb{Z}$ such that $a \neq 0$ (i.e., $a$ is not identically zero) and, for all $x : \mathrm{Fin}\ n \to \mathbb{Z}/2\mathbb{Z}$, $f(x + a) = f(x)$.

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

/-- A Boolean function has a nonzero period if it is invariant under translation by some nonzero vector. -/
def has_nonzero_period {n : ℕ} (f : (Fin n → ZMod 2) → ZMod 2) : Prop := ∃ a : Fin n → ZMod 2, a ≠ 0 ∧ ∀ x, f (x + a) = f x
See it in the graphDiscuss this resultChallenge it