Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A product-kernel operator splits into one bit and the remaining coordinates

Proved
NarrowDNF.Hypercontractivity.productOperator_option

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let III be finite, w:{0,1}→Rw:\{0,1\}\to\mathbb Rw:{0,1}→R, and K:{0,1}2→RK:\{0,1\}^2\to\mathbb RK:{0,1}2→R. For coordinates I∪{∗}I\cup\{*\}I∪{∗}, define PKF(x)=∑y∏j[w(yj)K(xj,yj)]F(y)P_KF(x)=\sum_y\prod_j[w(y_j)K(x_j,y_j)]F(y)PK​F(x)=∑y​∏j​[w(yj​)K(xj​,yj​)]F(y), and define Ah(b)=∑cw(c)K(b,c)h(c)Ah(b)=\sum_cw(c)K(b,c)h(c)Ah(b)=∑c​w(c)K(b,c)h(c). If xIx_IxI​ is the restriction of xxx to III, then

PKF(x)=A[b↦PK(F(b,⋅))(xI)](x∗).P_KF(x)=A\bigl[b\mapsto P_K(F(b,\cdot))(x_I)\bigr](x_*).PK​F(x)=A[b↦PK​(F(b,⋅))(xI​)](x∗​).

In the inner operator the coordinate set is III. The identity holds for every real FFF, with no sign or normalization hypotheses on the weights or kernel.

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.MeanInequalities
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Option
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.NormNum.RealSqrt
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Fourier
import Definitions.Def_NarrowDNF_Influence
import Definitions.Def_NarrowDNF_ProductMeasure
import Definitions.Def_NarrowDNF_UniformHypercontractivity

namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift

namespace NarrowDNF.Fourier
end NarrowDNF.Fourier

namespace NarrowDNF.Hypercontractivity
end NarrowDNF.Hypercontractivity

namespace NarrowDNF.Influence
end NarrowDNF.Influence

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.Hypercontractivity
attribute [local instance] Classical.decEq
variable {α β : Type*} [Fintype α] [Fintype β]
Formal statement
theorem NarrowDNF.Hypercontractivity.productOperator_option {ι : Type*} [Fintype ι] (w : Bool → ℝ)
    (K : Bool → Bool → ℝ) (f : (Option ι → Bool) → ℝ) (x : Option ι → Bool) :
    productOperator w K f x =
      kernelOperator w K (fun b => productOperator w K
        (fun y => f (Equiv.piOptionEquivProd.symm (b,y)))
        (fun i => x (some i))) (x none) := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/UniformHypercontractivity.lean#L203-L237

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