Exact realization of blind coalitions by Boolean generators
ProvedNewMathDiscovery.BlindnessRealization.blind_iff_below_generatorboolean-systemscombinatoricsinformationsodelin-newmath
Let be arbitrary types and a Boolean family. Construct a base state with target 0 and a state of target 1 for each . Observer returns 0 at the base and at . A coalition is blind when two states have different targets but equal observations on every . Then
This realizes exactly the family of coalitions lying below at least one Boolean generator. No finiteness or nonemptiness assumptions on either index type are required.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_NewMathDiscovery_BlindnessRealization
Formal statement
theorem NewMathDiscovery.BlindnessRealization.blind_iff_below_generator {I J : Type} (F : J → I → Bool)
(S : I → Prop) :
Blind S (State.observe F) State.target ↔
∃ j, ∀ i, S i → F j i = true := by sorry
Source