Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8.1, p. 0:26 — the system (30) of 8 equations in 12 unknowns has no rational solution

Proved
TensorNP.Rank.lemma_8_1

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-systemsrational-pointstensor-rank

The system of eight equations in the twelve unknowns a1,a2,a3,b1,b2,b3,c1,c2,c3,d1,d2,d3a_1,a_2,a_3,b_1,b_2,b_3,c_1,c_2,c_3,d_1,d_2,d_3a1​,a2​,a3​,b1​,b2​,b3​,c1​,c2​,c3​,d1​,d2​,d3​

a1a2a3+c1c2c3=2,a1a3b2+c1c3d2=0,a2a3b1+c2c3d1=0,a3b1b2+c3d1d2=−4,a1a2b3+c1c2d3=0,a1b2b3+c1d2d3=−4,a2b1b3+c2d3d1=4,b1b2b3+d1d2d3=0(30)\begin{aligned} &a_1a_2a_3 + c_1c_2c_3 = 2, && a_1a_3b_2 + c_1c_3d_2 = 0, && a_2a_3b_1 + c_2c_3d_1 = 0, && a_3b_1b_2 + c_3d_1d_2 = -4,\\ &a_1a_2b_3 + c_1c_2d_3 = 0, && a_1b_2b_3 + c_1d_2d_3 = -4, && a_2b_1b_3 + c_2d_3d_1 = 4, && b_1b_2b_3 + d_1d_2d_3 = 0 \end{aligned} \tag{30}​a1​a2​a3​+c1​c2​c3​=2,a1​a2​b3​+c1​c2​d3​=0,​​a1​a3​b2​+c1​c3​d2​=0,a1​b2​b3​+c1​d2​d3​=−4,​​a2​a3​b1​+c2​c3​d1​=0,a2​b1​b3​+c2​d3​d1​=4,​​a3​b1​b2​+c3​d1​d2​=−4,b1​b2​b3​+d1​d2​d3​=0​(30)

has no solution in rational numbers.

It has real solutions (for instance the one coming from zˉ⊗z⊗zˉ+z⊗zˉ⊗z\bar{\mathbf z}\otimes\mathbf z\otimes\bar{\mathbf z} + \mathbf z\otimes\bar{\mathbf z}\otimes\mathbf zzˉ⊗z⊗zˉ+z⊗zˉ⊗z with z=[1,2]⊤\mathbf z = [1,\sqrt2]^\topz=[1,2​]⊤), so the obstruction is arithmetic, not real-algebraic. This lemma is the lower half of Theorem 1.14.

Preamble
import Mathlib
import Definitions.Def_TensorNP_Rank_Construction
Formal statement
namespace TensorNP.Rank

theorem lemma_8_1 :
    ¬ ∃ a₁ a₂ a₃ b₁ b₂ b₃ c₁ c₂ c₃ d₁ d₂ d₃ : ℚ,
      System30 a₁ a₂ a₃ b₁ b₂ b₃ c₁ c₂ c₃ d₁ d₂ d₃ := by sorry

end TensorNP.Rank
Source
Hillar & Lim, Most Tensor Problems Are NP-Hard, J. ACM 60(6) (2013), Art. 45 (final version, arXiv:0911.1393v5), p. 0:26, Lemma 8.1
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