Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact realization of blind coalitions by Boolean generators

Proved
NewMathDiscovery.BlindnessRealization.blind_iff_below_generator

by Sodelin · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

boolean-systemscombinatoricsinformationsodelin-newmath

Let I,JI,JI,J be arbitrary types and F:J×I→{0,1}F:J\times I\to\{0,1\}F:J×I→{0,1} a Boolean family. Construct a base state ∗*∗ with target 0 and a state [j][j][j] of target 1 for each j∈Jj\in Jj∈J. Observer iii returns 0 at the base and 1−F(j,i)1-F(j,i)1−F(j,i) at [j][j][j]. A coalition S⊆IS\subseteq IS⊆I is blind when two states have different targets but equal observations on every i∈Si\in Si∈S. Then

S is blind⟺∃j∈J ∀i∈S, F(j,i)=1.S\text{ is blind}\quad\Longleftrightarrow\quad\exists j\in J\ \forall i\in S,\ F(j,i)=1.S is blind⟺∃j∈J ∀i∈S, F(j,i)=1.

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
https://github.com/Sodelin/new-math-discovery/blob/fc2ce68341a0556cebb4e5843a3127f0881b91db/lean/NewMathDiscovery/BlindnessRealization.lean#L36-L66

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me