Observations determine a target exactly when their common kernel is included in its kernel
ProvedNewMathDiscovery.LinearBlindness.determinesTarget_iff_kernel_inclusionalgebrainformationkernelsodelin-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 . Say the selected observations determine the target if agreement of all selected observations forces equality of the target. Then
This is the positive kernel criterion for target determination. It records exactly the assumptions in the abstract subtraction-preserving system and requires no finiteness assumption on S.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_NewMathDiscovery_LinearBlindness
Formal statement
theorem NewMathDiscovery.LinearBlindness.determinesTarget_iff_kernel_inclusion {Index State Value : Type}
(system : System Index State Value) (selected : Index → Prop) :
DeterminesTarget system selected ↔
∀ direction,
InObservationKernel system selected direction →
system.target direction = system.zeroValue := by sorry
Source