Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A matrix of rank kkk has a nonzero k×kk \times kk×k minor

Proved
LatticePrepro.exists_det_submatrix_ne_zero

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let KKK be a field, let mmm and nnn be finite index sets, and let A=(Aij)∈Km×nA = (A_{ij}) \in K^{m \times n}A=(Aij​)∈Km×n be a matrix of rank kkk. Then AAA has a nonsingular k×kk \times kk×k submatrix: there are row indices r1,…,rk∈mr_1, \dots, r_k \in mr1​,…,rk​∈m and column indices c1,…,ck∈nc_1, \dots, c_k \in nc1​,…,ck​∈n such that

det⁡(Ari,cj)1≤i,j≤k≠0.\det\bigl(A_{r_i, c_j}\bigr)_{1 \le i, j \le k} \neq 0.det(Ari​,cj​​)1≤i,j≤k​=0.

This is one direction of the characterization of the rank as the size of a largest nonvanishing minor. It is used in Lemma A.6, the rank bound for the polynomial matrix H(X)\mathbf H(X)H(X) of an evaluation table: a nonsingular minor of the evaluation H(γ)\mathbf H(\gamma)H(γ) at the generator γ\gammaγ of the moment field selects a square submatrix of H(X)\mathbf H(X)H(X) whose determinant is a nonzero polynomial.

Formalization Note: The row and column choices are maps r ⁣:Fin k→mr\colon \mathrm{Fin}\,k \to mr:Fink→m and c ⁣:Fin k→nc\colon \mathrm{Fin}\,k \to nc:Fink→n (not required to be injective in the statement), the submatrix is A.submatrix r c, and the rank is Mathlib's Matrix.rank. For k=0k = 0k=0 the statement is trivial, since the empty determinant is 111.

Preamble
import Mathlib

open Polynomial Matrix
variable {K : Type*} [Field K] {m n : Type*} [Fintype n]
Formal statement
theorem LatticePrepro.exists_det_submatrix_ne_zero [Fintype m] (A : Matrix m n K) {k : ℕ} (hk : A.rank = k) :
    ∃ (r : Fin k → m) (c : Fin k → n), (A.submatrix r c).det ≠ 0 := 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.exists_det_submatrix_ne_zero

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