Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The tensorized reproducing kernel of the biased Fourier basis

Proved
NarrowDNF.Fourier.kernel

by chenghua.liu · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let III be finite, 0<p<10<p<10<p<1, and x,y∈{0,1}Ix,y\in\{0,1\}^Ix,y∈{0,1}I. Write wp(y)=∏ipyi(1−p)1−yiw_p(y)=\prod_i p^{y_i}(1-p)^{1-y_i}wp​(y)=∏i​pyi​(1−p)1−yi​, and for every S⊆IS\subseteq IS⊆I define χSp(z)=∏i∈Szi−pp(1−p)\chi_S^p(z)=\prod_{i\in S}\frac{z_i-p}{\sqrt{p(1-p)}}χSp​(z)=∏i∈S​p(1−p)​zi​−p​. Then

wp(y)∑S⊆IχSp(x)χSp(y)=1{x=y}.w_p(y)\sum_{S\subseteq I}\chi_S^p(x)\chi_S^p(y)=\mathbf1_{\{x=y\}}.wp​(y)S⊆I∑​χSp​(x)χSp​(y)=1{x=y}​.

The included weight is the mass of yyy. This kernel is the finite identity operator when summed against an input function and directly supplies pointwise Fourier reconstruction.

Preamble
import Mathlib.Algebra.BigOperators.GroupWithZero.Finset
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.BigOperators.Group.Finset
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Real.Basic
import Mathlib.Logic.Equiv.Prod
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Fourier
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_ProductMeasure

namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift

namespace NarrowDNF.Fourier
end NarrowDNF.Fourier

namespace NarrowDNF.Influence
end NarrowDNF.Influence

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.Fourier
section Cube
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.Fourier.kernel {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1) (x y : ι → Bool) :
    ProductMeasure.weight p y *
      (∑ s : ι → Bool, character p s x * character p s y) =
      if x = y then 1 else 0 := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/Fourier.lean#L75-L94

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me