Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.2: uniform narrow monotone DNF approximation at low bias

Proved
NarrowDNF.main_narrow_dnf

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

combinatoricsnarrow-dnf-authors-importprobabilitystoc-2027

There exists an absolute constant C>0C>0C>0, independent of every subsequent parameter, such that for every n≥1n\ge1n≥1, K>0K>0K>0, 0<p≤1/20<p\le1/20<p≤1/2, and 0<ε<10<\varepsilon<10<ε<1, every monotone Boolean function fff on {0,1}n\{0,1\}^n{0,1}n with total resampling influence Ip(f)≤KI_p(f)\le KIp​(f)≤K has a positive DNF ggg satisfying

Pr⁡p(f≠g)≤ε,width⁡(g)≤exp⁡(C(K+1)2ε2).\Pr_p(f\ne g)\le\varepsilon,\qquad \operatorname{width}(g)\le\exp\left(C\frac{(K+1)^2}{\varepsilon^2}\right).pPr​(f=g)≤ε,width(g)≤exp(Cε2(K+1)2​).

Here Ip(f)=∑iPr⁡[f(X)≠f(Xi←B)]I_p(f)=\sum_i\Pr[f(X)\ne f(X^{i\leftarrow B})]Ip​(f)=∑i​Pr[f(X)=f(Xi←B)], where XXX is product Bernoulli ppp and BBB an independent Bernoulli ppp bit. The construction admits C=1013C=10^{13}C=1013.

Preamble
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
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.Algebra.Order.Floor.Ring
import Mathlib.Analysis.MeanInequalities
import Mathlib.Analysis.SpecialFunctions.Exp
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Sqrt
import Mathlib.Data.Bool.Basic
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Image
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Lattice.Fold
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Data.Fintype.Option
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Fintype.Powerset
import Mathlib.Data.Nat.Choose.Bounds
import Mathlib.Data.Real.Basic
import Mathlib.Data.Real.Sqrt
import Mathlib.Logic.Equiv.Prod
import Mathlib.Order.Monotone.Basic
import Mathlib.Tactic
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.GCongr
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.NormNum.RealSqrt
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_MainStatements
import Theorems.Thm_NarrowDNF_HatamiInput_hatami_arity_load
import Theorems.Thm_NarrowDNF_narrowDNF_of_hatami

namespace NarrowDNF
end NarrowDNF
open NarrowDNF
Formal statement
theorem NarrowDNF.main_narrow_dnf : NarrowDNFApproximation := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/Paper.lean#L19-L21

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