Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An increasing adaptive representation yields a narrow monotone DNF

Proved
NarrowDNF.adaptive_approximation_to_dnf

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, ε>0\varepsilon>0ε>0, L≥0L\ge0L≥0, and d∈Nd\in\mathbb Nd∈N. Let f,hf,hf,h be Boolean functions with fff monotone. Suppose JJJ is an increasing local activation family, no activation of size above ddd fires, and hhh is constant on its adaptive atoms. Assume Pr⁡p(f≠h)≤ε/4\Pr_p(f\ne h)\le\varepsilon/4Prp​(f=h)≤ε/4 and load⁡p(J)=∑S∣S∣Pr⁡p(JS fires)≤L\operatorname{load}_p(J)=\sum_S|S|\Pr_p(J_S\text{ fires})\le Lloadp​(J)=∑S​∣S∣Prp​(JS​ fires)≤L. There is a finite family T\mathcal TT of positive conjunctions such that

∀T∈T: ∣T∣≤⌈4 2dLε⌉,Pr⁡p[f≠⋁T∈T⋀i∈Txi]≤ε.\forall T\in\mathcal T:\ |T|\le\left\lceil\frac{4\,2^dL}{\varepsilon}\right\rceil, \qquad \Pr_p\left[f\ne\bigvee_{T\in\mathcal T}\bigwedge_{i\in T}x_i\right]\le\varepsilon.∀T∈T: ∣T∣≤⌈ε42dL​⌉,pPr​[f=T∈T⋁​i∈T⋀​xi​]≤ε.
Preamble
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
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.SpecialFunctions.Exp
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.Fintype.BigOperators
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Real.Basic
import Mathlib.Logic.Equiv.Prod
import Mathlib.Order.Monotone.Basic
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_ActivationLoad
import Definitions.Def_NarrowDNF_Adaptive
import Definitions.Def_NarrowDNF_AdaptiveShift
import Definitions.Def_NarrowDNF_CertificateBounds
import Definitions.Def_NarrowDNF_Certificates
import Definitions.Def_NarrowDNF_CoordinateShift
import Definitions.Def_NarrowDNF_MainStatements
import Definitions.Def_NarrowDNF_ProductMeasure
import Theorems.Thm_NarrowDNF_Activation_controlled_monotonicization
import Theorems.Thm_NarrowDNF_Activation_positive_certificate
import Theorems.Thm_NarrowDNF_Activation_truncatedDNF_error_bound

namespace NarrowDNF
end NarrowDNF

namespace NarrowDNF.Activation
end NarrowDNF.Activation

namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift

namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open NarrowDNF
open ProductMeasure
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.adaptive_approximation_to_dnf {p ε L : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
    (hε : 0 < ε) (hL0 : 0 ≤ L) {d : ℕ} {f h : Cube ι → Bool}
    (hf : Monotone f) {J : Activation ι} (hJ : J.Increasing)
    (hd : J.ArityLE d) (hh : J.Measurable h)
    (he : error p f h ≤ ε/4) (hL : J.load p ≤ L) :
    ∃ terms : Finset (Finset ι),
      (∀ T ∈ terms, T.card ≤ Nat.ceil (4 * (2 : ℝ)^d * L / ε)) ∧
      error p f (evalDNF terms) ≤ ε := by sorry
Source
https://github.com/liuchliuch/narrow-dnf-lean/blob/eecadd6a5ea0a331d6cf9fd5cb39fc6ec854b372/NarrowDNF/AdaptiveApproximation.lean#L13-L49

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