Removing observations preserves a target-blind pair
ProvedNewMathDiscovery.LinearBlindness.pairBlind_downwardalgebrainformationmonotonicitysodelin-newmath
Let be arbitrary types with distinguished zeros in , subtraction operations, observation maps and target . Assume the maps preserve zero and subtraction, and subtraction in is zero exactly when its arguments are equal. For a selected set , let . Let satisfy . Write for the existence of two states whose target values differ but whose observations agree at every index in . Then
This monotonicity lemma permits restriction of the observer coalition while retaining a witness of target nonidentifiability.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_NewMathDiscovery_LinearBlindness
Formal statement
theorem NewMathDiscovery.LinearBlindness.pairBlind_downward {Index State Value : Type}
(system : System Index State Value) {smaller larger : Index → Prop}
(hsubset : ∀ i, smaller i → larger i)
(hblind : PairBlind system larger) :
PairBlind system smaller := by sorry
Source