AFTD Auto-Formalizing Theoretical Domains

parityCharacter

def

For an implicit natural number n and a Boolean assignment x : Fin n → Bool, parityCharacter x is the real number defined by the product over all i : Fin n of (if x i then (1 : ℝ) else -1).

Statement

def parityCharacter {n : ℕ} (x : Fin n → Bool) : ℝ
Defined in
arXiv:2610.19174, Section 2.3 and Listing A.13
Verified
21 Oct 2026
Axioms
none listed
Used by 4
  • 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 -…
  • 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 function $x : \text{Fin } n \to \text{Bool}$, parityCharacter x is defined as the real number equal to the product over all indices $i \in \text{Fin } n$ of $1$ if $x(i)$ is true and $-1$ if $x(i)$ is false.

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 alternating-sign parity character χ(x) = ∏_{i=1}^n (2x_i - 1). -/
def parityCharacter {n : ℕ} (x : Fin n → Bool) : ℝ := ∏ i : Fin n, (if x i then (1 : ℝ) else -1)
See it in the graphDiscuss this resultChallenge it