The finite adaptive code identifies exactly the adaptive atoms
ProvedNarrowDNF.ConditionalExpectation.adaptiveCode_eq_iffcombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be finite and a local activation family: whether a subset fires depends only on the input coordinates in . For an input , let be the union of all firing subsets. Define to equal on and zero outside it, and encode the input as . For all inputs ,
Thus this finite code realizes exactly the adaptive partition specified by the active set and its observed labels.
Preamble
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.BigOperators.Ring.Finset
import Mathlib.Data.Bool.Basic
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.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Adaptive
import Definitions.Def_NarrowDNF_ConditionalExpectation
import Definitions.Def_NarrowDNF_ProductMeasure
namespace NarrowDNF.ConditionalExpectation
end NarrowDNF.ConditionalExpectation
namespace NarrowDNF.ProductMeasure
end NarrowDNF.ProductMeasure
noncomputable section
open scoped BigOperators
open NarrowDNF
open NarrowDNF.ConditionalExpectation
variable {α β : Type*} [Fintype α] [Fintype β] [DecidableEq β]
section Adaptive
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
omit [DecidableEq ι]
Formal statement
theorem NarrowDNF.ConditionalExpectation.adaptiveCode_eq_iff (J : Activation ι) (x y : Cube ι) :
adaptiveCode J x = adaptiveCode J y ↔ J.SameAtom x y := by sorrySource