Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.7 — the 2×22\times22×2 minors of [v w][\mathbf v\ \mathbf w][v w] vanish iff v=cw\mathbf v = c\mathbf wv=cw

Proved
TensorNP.Bilinear.minors_vanish_iff_proportional

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

determinantslinear-algebrap2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let v,w∈CN\mathbf v, \mathbf w \in \mathbb C^Nv,w∈CN be nonzero vectors, and for each pair of indices a<ba < ba<b let A(a,b)A_{(a,b)}A(a,b)​ be the {−1,0,1}\{-1,0,1\}{−1,0,1}-matrix with v⊤A(a,b)w=vawb−vbwa\mathbf v^\top A_{(a,b)} \mathbf w = v_a w_b - v_b w_av⊤A(a,b)​w=va​wb​−vb​wa​, the 2×22\times 22×2 minor of rows a,ba, ba,b of the N×2N\times 2N×2 matrix [v w][\mathbf v\ \mathbf w][v w]. Then

v⊤A(a,b)w=0  for all a<b  ⟺  ∃ c∈C: v=c w.\mathbf v^\top A_{(a,b)} \mathbf w = 0 \ \text{ for all } a < b \iff \exists\, c \in \mathbb C:\ \mathbf v = c\,\mathbf w .v⊤A(a,b)​w=0  for all a<b⟺∃c∈C: v=cw.

In the proof of Theorem 3.7 (N=2v+1N = 2v+1N=2v+1) these minors are the first v(2v+1)v(2v+1)v(2v+1) slices of AG\mathcal A_GAG​; they force the two vectors of a solution to be proportional, which turns the bilinear system back into the quadratic system CGC_GCG​.

Formalization Note The paper says the minors "have a common nontrivial zero v,w\mathbf v, \mathbf wv,w iff v=cw\mathbf v = c\mathbf wv=cw"; "nontrivial" is read as both v\mathbf vv and w\mathbf ww nonzero, as in Problem 3.1. Without w≠0\mathbf w \neq 0w=0 the claim is false (w=0≠v\mathbf w = 0 \neq \mathbf vw=0=v makes every minor vanish). The statement is given for every length NNN; the proof uses N=2v+1N = 2v+1N=2v+1.

Preamble
import Mathlib
import Definitions.Def_TensorNP_Bilinear_Construction
Formal statement
namespace TensorNP.Bilinear

/-- Proof of Theorem 3.7 (p. 0:17), the 2×2 minors: for nonzero `v, w ∈ ℂ^N`, all the minors
`vᵀ A_{(a,b)} w = v_a w_b − v_b w_a` (`a < b`) vanish iff `v = c w` for some `c ∈ ℂ`. -/
theorem minors_vanish_iff_proportional {N : ℕ} (v w : Fin N → ℂ) (hv : v ≠ 0) (hw : w ≠ 0) :
    (∀ ab : MinorIdx N, ∑ p, ∑ q, (minorSlice ab p q : ℂ) * v p * w q = 0) ↔
      ∃ c : ℂ, v = c • w := by sorry

end TensorNP.Bilinear
Source
Hillar & Lim, Most Tensor Problems Are NP-Hard, J. ACM 60(6) (2013), Art. 45 (final version, arXiv:0911.1393v5), p. 0:17, proof of Theorem 3.7 (the 2 × 2 minors)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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