Target blindness is equivalent to a common-kernel witness
ProvedNewMathDiscovery.LinearBlindness.pairBlind_iff_kernelWitnessalgebrainformationkernelsodelin-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 .
This difference-witness criterion applies to the stated subtraction-preserving interface. Linear maps satisfy that interface, but no vector-space or scalar-multiplication assumptions are needed.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_NewMathDiscovery_LinearBlindness
Formal statement
theorem NewMathDiscovery.LinearBlindness.pairBlind_iff_kernelWitness {Index State Value : Type}
(system : System Index State Value) (selected : Index → Prop) :
PairBlind system selected ↔ KernelWitness system selected := by sorry
Source