Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Each explicit sensor-kernel witness has nonzero target

Proved
NewMathDiscovery.LinearBlindness.RankTwoInstability.target_nonzero_on_witness

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

algebrainteger-arithmetickernelsodelin-newmath

For n∈Nn\in\mathbb Nn∈N and x=(x1,x2)∈Z2x=(x_1,x_2)\in\mathbb Z^2x=(x1​,x2​)∈Z2, define the observation rn(x)=x1+(n+1)x2r_n(x)=x_1+(n+1)x_2rn​(x)=x1​+(n+1)x2​, target q(x)=x1q(x)=x_1q(x)=x1​, and witness wn=(n+1,−1)w_n=(n+1,-1)wn​=(n+1,−1).

q(wn)≠0(n∈N).q(w_n)\ne0\qquad(n\in\mathbb N).q(wn​)=0(n∈N).

This gives the nonvanishing-target component of the explicit blindness witness. The separate kernel identity identifies the associated observation that vanishes.

Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_NewMathDiscovery_LinearBlindness



Formal statement
theorem NewMathDiscovery.LinearBlindness.RankTwoInstability.target_nonzero_on_witness (n : Nat) :
    target (witness n) ≠ 0 := by sorry

Source
https://github.com/Sodelin/new-math-discovery/blob/fc2ce68341a0556cebb4e5843a3127f0881b91db/lean/NewMathDiscovery/LinearBlindness.lean#L170-L173

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