Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dual fourth-moment contraction for a self-adjoint map

Proved
NarrowDNF.BourgainDuality.dual_fourth_contraction

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

Let α\alphaα be finite, let wx≥0w_x\ge0wx​≥0, and let TTT map real functions on α\alphaα to real functions. Assume weighted self-adjointness, ∑xwx(Ta)xbx=∑xwxax(Tb)x\sum_xw_x(Ta)_xb_x=\sum_xw_xa_x(Tb)_x∑x​wx​(Ta)x​bx​=∑x​wx​ax​(Tb)x​ for all functions a,ba,ba,b. Suppose also that TTT contracts fourth moments: ∑xwx(Ta)x4≤∑xwxax4\sum_xw_x(Ta)_x^4\le\sum_xw_xa_x^4∑x​wx​(Ta)x4​≤∑x​wx​ax4​ for every aaa. Then every real function fff satisfies

∑xwx∣(Tf)x∣4/3≤∑xwx∣fx∣4/3.\sum_xw_x|(Tf)_x|^{4/3}\le\sum_xw_x|f_x|^{4/3}.x∑​wx​∣(Tf)x​∣4/3≤x∑​wx​∣fx​∣4/3.

Thus fourth-moment contraction transfers to the conjugate exponent 4/34/34/3, for arbitrary nonnegative finite weights.

Preamble
import Mathlib.Analysis.MeanInequalities
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Definitions.Def_NarrowDNF_BourgainDuality
import Theorems.Thm_NarrowDNF_BourgainDuality_weighted_holder43

namespace NarrowDNF.BourgainDuality
end NarrowDNF.BourgainDuality
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.BourgainDuality
variable {α : Type*} [Fintype α]
Formal statement
theorem NarrowDNF.BourgainDuality.dual_fourth_contraction (w : α → ℝ) (hw : ∀ x, 0 ≤ w x)
    (T : (α → ℝ) → α → ℝ)
    (hself : ∀ f g, (∑ x, w x * T f x * g x) = ∑ x, w x * f x * T g x)
    (hfourth : ∀ f, (∑ x, w x * T f x ^ 4) ≤ ∑ x, w x * f x ^ 4)
    (f : α → ℝ) : moment43 w (T f) ≤ moment43 w f := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/BourgainDuality.lean#L102-L129

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