Recovery of an adaptive atom from a common coordinate set
ProvedNarrowDNF.Activation.sameAtom_of_active_subset_of_agreecombinatoricsnarrow-dnf-authors-importprobabilitystoc-2027
Let be a coordinate set and an activation family whose test on every finite set depends only on the coordinates in . For an input , let be the union of all sets whose tests fire. Suppose and satisfy
Then and belong to the same adaptive atom:
This recovers the full adaptive information from labels on any common superset of the active unions.
Preamble
import Mathlib.Data.Bool.Basic
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Lattice.Fold
import Mathlib.Data.Fintype.Pi
import Mathlib.Data.Real.Basic
import Mathlib.Order.Monotone.Basic
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Definitions.Def_NarrowDNF_Adaptive
namespace NarrowDNF
end NarrowDNF
namespace NarrowDNF.Activation
end NarrowDNF.Activation
open NarrowDNF
variable {ι : Type*} [DecidableEq ι]
open NarrowDNF
open NarrowDNF.Activation
omit [DecidableEq ι]
Formal statement
theorem NarrowDNF.Activation.sameAtom_of_active_subset_of_agree {J : Activation ι} {x y : Cube ι}
{B : Set ι} (hx : J.active x ⊆ B) (hy : J.active y ⊆ B)
(hxy : ∀ i ∈ B, x i = y i) : J.SameAtom x y := by sorrySource