An increasing adaptive representation yields a narrow monotone DNF
ProvedNarrowDNF.adaptive_approximation_to_dnfcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite, , , , and . Let be Boolean functions with monotone. Suppose is an increasing local activation family, no activation of size above fires, and is constant on its adaptive atoms. Assume and . There is a finite family of positive conjunctions such that
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 sorrySource