Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Blindness is downward closed in the Boolean realization

Proved
NewMathDiscovery.BlindnessRealization.blind_downward

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}, use the base-and-face observation system: the base has target 0 and all observations 0; face jjj has target 1 and observation 1−F(j,i)1-F(j,i)1−F(j,i) at coordinate iii. Let S,T⊆IS,T\subseteq IS,T⊆I satisfy S⊆TS\subseteq TS⊆T. Then

T is blind⟹S is blind.T\text{ is blind}\quad\Longrightarrow\quad S\text{ is blind}.T is blind⟹S is blind.

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

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