AFTD Auto-Formalizing Theoretical Domains

BoolFourier.fourier_coeff_convolution_aux_h_fubini

theoremverifiedimported Lean

Interchange of summation in the convolution coefficient. Let $n$ be a natural number, let $f, g : \{0,1\}^n \to \bbr$ be Boolean functions, and let $S \subseteq [n]$ with associated Walsh character $\chi_S(x) = \prod_{i \in S}(-1)^{x_i}$. Writing $x \oplus y$ for the componentwise XOR of $x, y \in \{0,1\}^n$, the following identity holds: \[ \sum_{x \in \{0,1\}^n} \Bigl(\sum_{y \in \{0,1\}^n} f(y)\,g(x \oplus y)\Bigr)\,\chi_S(x) \;=\; \sum_{y \in \{0,1\}^n} f(y) \sum_{x \in \{0,1\}^n} g(x \oplus y)\,\chi_S(x). \]

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
open Finset BooleanAnalysis in
lemma BoolFourier.fourier_coeff_convolution_aux_h_fubini {n : Nat} (f g : BoolFun n) (S : Finset (Fin n)) :
  ∑ 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
Source
TCSlib, `BoolFourier.fourier_coeff_convolution_aux_h_fubini`
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 3
  • 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.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_fubini {n : Nat} (f g : BoolFun n) (S : Finset (Fin n)) :  ∑ 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 := by  simpa only [Finset.mul_sum _ _ _, mul_assoc, Finset.sum_mul] using Finset.sum_comm
See it in the graphDiscuss this resultChallenge it