Blindness is downward closed in the Boolean realization
ProvedNewMathDiscovery.BlindnessRealization.blind_downwardboolean-systemscombinatoricsinformationsodelin-newmath
For arbitrary types and a Boolean family , use the base-and-face observation system: the base has target 0 and all observations 0; face has target 1 and observation at coordinate . Let satisfy . Then
Here blindness means that two states with different Boolean targets agree at every selected observation. The result expresses monotonicity under removal of observations.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_NewMathDiscovery_BlindnessRealization import Theorems.Thm_NewMathDiscovery_BlindnessRealization_blind_iff_below_generator
Formal statement
theorem NewMathDiscovery.BlindnessRealization.blind_downward {I J : Type} (F : J → I → Bool)
{S T : I → Prop}
(hsub : ∀ i, S i → T i)
(hblind : Blind T (State.observe F) State.target) :
Blind S (State.observe F) State.target := by sorry
Source