AFTD Auto-Formalizing Theoretical Domains

BoolFourier.fourier_coeff_convolution_aux_h_split

theoremverifiedimported Lean

Multiplicative splitting of a Walsh character along XOR. Let $S \subseteq [n]$, let $f, g : \{0,1\}^n \to \bbr$ be Boolean functions, and suppose the interchange-of-summation identity \[ \sum_{x} \Big(\sum_{y} f(y)\, g(x \oplus y)\Big)\,\chi_S(x) \;=\; \sum_{y} f(y) \sum_{x} g(x \oplus y)\,\chi_S(x) \] holds, where all sums range over $\{0,1\}^n$ and $\oplus$ is componentwise XOR. Then for all $x, y \in \{0,1\}^n$, \[ \chi_S(x) \;=\; \chi_S(x \oplus y)\,\chi_S(y), \] where $\chi_S$ is the Walsh--Fourier character of $S$; that is, $\chi_S$ is a character of the group $(\bbf_2)^n$.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Finset BooleanAnalysis in
lemma BoolFourier.fourier_coeff_convolution_aux_h_split {n : Nat} (f g : BoolFun n) (S : Finset (Fin n))
  (_h_fubini : ∑ x, (∑ y, f y * g (xor_vec x y)) * char_S S x = ∑ y, f y * ∑ x, g (xor_vec x y) * char_S S x)
  (y x : hypercube n) : char_S S x = char_S S (xor_vec x y) * char_S S y
Source
TCSlib, `BoolFourier.fourier_coeff_convolution_aux_h_split`
Lean proof
By Prastik Mohanraj, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Prastik Mohanraj. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
  • BooleanAnalysis.boolToSignThe sign encoding maps $\mathrm{Bool}$ to $\{-1,1\}\subset\bbr$:…
  • BoolFourier.char_SFor a set $S \subseteq [n]$, the Walsh character $\chi_S : \{0,1\}^n \to \mathbb{R}$ is \[ \chi_S(x) = \prod_{i \in S} (-1)^{x_i}, \]…
  • BoolFourier.xor_vecFor $x, y \in \{0,1\}^n$, the vector $\mathrm{xor\_vec}(x,y)_i = x_i \oplus y_i$ is the componentwise XOR, giving the group operation on…
  • BoolFourier.hypercubeThe Boolean hypercube of dimension $n$ is the type $\{0,1\}^n$, defined as an abbreviation for BooleanAnalysis.BoolCube $n$.
  • BooleanAnalysis.chiSThe Walsh--Fourier character associated to $S\subseteq[n]$ is…
  • BoolFourier.BoolFunA Boolean function of arity $n$ is an element of type $\{0,1\}^n \to \mathbb{R}$, defined as an abbreviation for…
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false inset_option autoImplicit false inopen Finset BooleanAnalysis inlemma BoolFourier.fourier_coeff_convolution_aux_h_split {n : Nat} (f g : BoolFun n) (S : Finset (Fin n))  (_h_fubini : ∑ x, (∑ y, f y * g (xor_vec x y)) * char_S S x = ∑ y, f y * ∑ x, g (xor_vec x y) * char_S S x)  (y x : hypercube n) : char_S S x = char_S S (xor_vec x y) * char_S S y := by  simp [chiS, ← Finset.prod_mul_distrib]  congr 1; ext i; simp [xor_vec, boolToSign, Bool.xor]  cases x i <;> cases y i <;> simp
See it in the graphDiscuss this resultChallenge it