Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rank deficiency at a point divides the determinant of a polynomial matrix

Proved
LatticePrepro.pow_X_sub_C_dvd_det

by WizardOfMenlo · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let S\mathbb SS be a field, nnn a finite index set, and M(X)∈S[X]n×nM(X) \in \mathbb S[X]^{n \times n}M(X)∈S[X]n×n a square matrix of polynomials. For s∈Ss \in \mathbb Ss∈S, write M(s)∈Sn×nM(s) \in \mathbb S^{n\times n}M(s)∈Sn×n for the matrix obtained by evaluating every entry at sss. Then the rank deficiency of M(s)M(s)M(s) bounds the multiplicity of sss as a root of det⁡M(X)\det M(X)detM(X):

(X−s) ∣n∣−rank⁡M(s) ∣ det⁡M(X)in S[X],(X - s)^{\,|n| - \operatorname{rank} M(s)} \ \Big|\ \det M(X) \qquad \text{in } \mathbb S[X],(X−s)∣n∣−rankM(s) ​ detM(X)in S[X],

where ∣n∣|n|∣n∣ is the number of rows and the rank is taken over S\mathbb SS.

This is the divisibility step in the proof of Lemma A.6 (as in Fancsali–Sziklai). It is applied to a nonsingular square submatrix of the polynomial matrix of an evaluation table; since the factors X−sX - sX−s for distinct s∈Ss \in \mathbb Ss∈S are coprime, the total rank deficiency over all sample points is at most the degree of the determinant, which yields the weight bound of Lemma A.6.

Formalization Note: M(s)M(s)M(s) is M.map (eval s) and X−sX - sX−s is X - C s. The exponent uses natural-number subtraction, which never truncates because rank⁡M(s)≤∣n∣\operatorname{rank} M(s) \le |n|rankM(s)≤∣n∣.

Preamble
import Mathlib

open Polynomial Matrix
variable {𝕊 : Type*} [Field 𝕊] {n : Type*} [Fintype n] [DecidableEq n]
Formal statement
theorem LatticePrepro.pow_X_sub_C_dvd_det (M : Matrix n n 𝕊[X]) (s : 𝕊) :
    (X - C s) ^ (Fintype.card n - (M.map (eval s)).rank) ∣ M.det := by sorry
Source
G. Fenzi, G. Weissenberg, Nearly Optimal Hardness for CVP and NCP with Preprocessing (STOC 2027 submission #847; IACR ePrint 2026/2634, https://eprint.iacr.org/2026/2634), auxiliary lemma used in the proof of Lemma A.6 (\label{lem:table-rank}); Lean: LatticePrepro/Basic/Matrix.lean, LatticePrepro.pow_X_sub_C_dvd_det

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