Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A base-and-face Boolean observation system

Definition
NewMathDiscovery_BlindnessRealization

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

boolean-systemscombinatoricsinformationsodelin-newmath

For arbitrary types I,JI,JI,J and a Boolean family F:J×I→{0,1}F:J\times I\to\{0,1\}F:J×I→{0,1}, form one base state ∗*∗ and one face state [j][j][j] per generator. The target qqq and observations rir_iri​ are

q(∗)=0,q([j])=1,ri(∗)=0,ri([j])=1−F(j,i).q(*)=0,\quad q([j])=1,\qquad r_i(*)=0,\quad r_i([j])=1-F(j,i).q(∗)=0,q([j])=1,ri​(∗)=0,ri​([j])=1−F(j,i).

Agreement on a coalition S⊆IS\subseteq IS⊆I means equality of observations for all selected indices. Blindness means existence of an agreeing pair with different targets.

This finite-or-infinite interface realizes families of blind coalitions in the associated theorem. The types I and J are arbitrary and need not be nonempty.

Definition code
import Std
import Init.Grind.Ordered.Module
namespace NewMathDiscovery.BlindnessRealization

/-- One target-false base state and one target-true state for each generator. -/
inductive State (J : Type) where
  | base
  | face (j : J)
  deriving DecidableEq

namespace State

def target {J : Type} : State J → Bool
  | .base => false
  | .face _ => true

/-- The base state reports `false`. A face state reports `false` exactly on
coordinates belonging to that face. -/
def observe {I J : Type} (F : J → I → Bool) (i : I) : State J → Bool
  | .base => false
  | .face j => !(F j i)

end State

/-- Two states are observationally indistinguishable to coalition `S`. -/
def AgreeOn {I X : Type} (S : I → Prop) (r : I → X → Bool)
    (x y : X) : Prop :=
  ∀ i, S i → r i x = r i y

/-- A coalition is target-blind if it cannot distinguish two states with
opposite Boolean targets. -/
def Blind {I X : Type} (S : I → Prop) (r : I → X → Bool)
    (q : X → Bool) : Prop :=
  ∃ x y, q x ≠ q y ∧ AgreeOn S r x y








end NewMathDiscovery.BlindnessRealization
Source
https://github.com/Sodelin/new-math-discovery/blob/fc2ce68341a0556cebb4e5843a3127f0881b91db/lean/NewMathDiscovery/BlindnessRealization.lean#L1-L81

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