The tensorized reproducing kernel of the biased Fourier basis
ProvedNarrowDNF.Fourier.kernelcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, , and . Write , and for every define . Then
The included weight is the mass of . 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 sorrySource