Controlled monotonicization of an adaptive approximation
ProvedNarrowDNF.Activation.controlled_monotonicizationcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite and let be independent Bernoulli measure with . An activation family has local tests on coordinate sets; write for the union of firing sets and for its load. Suppose its tests are increasing and only sets of size at most fire. Let , with monotone and determined by the active coordinates and their labels. Assume , , and . For every , some coordinate set and monotone function , measurable for , satisfy
Here evaluates activation tests after setting coordinates in to one, while retaining the original input labels.
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.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_Certificates
import Definitions.Def_NarrowDNF_CoordinateShift
import Definitions.Def_NarrowDNF_FiberShift
import Definitions.Def_NarrowDNF_LoadTransport
import Definitions.Def_NarrowDNF_ProductMeasure
import Definitions.Def_NarrowDNF_ShiftProbability
import Theorems.Thm_NarrowDNF_Activation_load_forcing_le
import Theorems.Thm_NarrowDNF_Activation_sameAtom_of_active_subset_of_agree
import Theorems.Thm_NarrowDNF_ProductMeasure_expectation_split
import Theorems.Thm_NarrowDNF_ProductMeasure_forcing_mass
import Theorems.Thm_NarrowDNF_ShiftProbability_one_coordinate_error_le
import Theorems.Thm_NarrowDNF_Weighted_select_two_budgets
import Theorems.Thm_NarrowDNF_monotone_of_coordinateMonotone
namespace NarrowDNF
end NarrowDNF
namespace NarrowDNF.Activation
end NarrowDNF.Activation
namespace NarrowDNF.FiberShift
end NarrowDNF.FiberShift
namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
namespace NarrowDNF.ShiftProbability
end NarrowDNF.ShiftProbability
noncomputable section
open NarrowDNF
open NarrowDNF
open NarrowDNF.Activation
open ProductMeasure ShiftProbability
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
Formal statement
theorem NarrowDNF.Activation.controlled_monotonicization {p : ℝ} (hp0 : 0 < p) (hp1 : p < 1)
{d : ℕ} {e L : ℝ} (_he0 : 0 ≤ e) (hL0 : 0 ≤ L)
{f : Cube ι → Bool} (hf : Monotone f)
{J : Activation ι} (hJ : J.Increasing) (hd : J.ArityLE d)
{h : Cube ι → Bool} (hh : J.Measurable h)
(he : error p f h ≤ e) (hL : J.load p ≤ L)
(τ : ℝ) (hτ : 0 < τ) :
∃ (D : Finset ι) (u : Cube ι → Bool),
Monotone u ∧ (J.force D).Measurable u ∧ error p f u ≤ e + τ ∧
expectation p (fun x => (((J.force D).activeFinset x).card : ℝ)) ≤
(2-p)^d * L * (1 + e / τ) := by sorrySource