AFTD Auto-Formalizing Theoretical Domains

fullMonomial

def

The full monomial x_[n] = ∏_{i=1}^n x_i evaluated at a point in {0,1}^n.

Statement

def fullMonomial {n : ℕ} (x : Fin n → Bool) : ℝ
Defined in
arXiv:2610.19174, Listing A.13
Verified
21 Oct 2026
Axioms
none listed
Built on 1
  • bitThe real embedding of a Boolean value, sending false to 0 and true to 1.
Used by 5
  • explicitApproximant_mem_degreeSpaceFor any Boolean function f : (Fin n → Bool) → Bool on n > 0 variables, the explicit approximant P_f belongs to degreeSpace (K := ℝ) (Fin…
  • explicitApproximant_torusDistanceFor any Boolean function f : (Fin n → Bool) → Bool on n > 0 variables and any x : Fin n → Bool, torusDistance (explicitApproximant f x -…
  • explicitApproximantFor a Boolean function f : (Fin n → Bool) → Bool and input x : Fin n → Bool, explicitApproximant f x is (if f x then 1 else 0)/2 -…
  • ndeg_le_nFor any natural number n and any Boolean function f : (Fin n → Bool) → Bool, the non-deterministic degree of f is at most n.
  • explicitApproximant_permFor any Boolean function f : (Fin n → Bool) → Bool on n variables, any permutation e : Equiv.Perm (Fin n), if f (x ∘ e) = f x for all x…

Read back from the Lean

Given a natural number $n$ (implicit) and a vector of booleans $x : \text{Fin } n \to \text{Bool}$, fullMonomial x is defined as the product over all $i \in \text{Fin } n$ of $\text{bit}(x(i))$, taking values in $\mathbb{R}$.

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 full monomial x_[n] evaluated on a Boolean input. -/
def fullMonomial {n : ℕ} (x : Fin n → Bool) : ℝ := ∏ i : Fin n, bit (x i)
See it in the graphDiscuss this resultChallenge it