Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.14 — there is a rational tensor A ∈ ℚ^{2×2×2} with rank_ℝ(A) < rank_ℚ(A)

Proved
TensorNP.Rank.theorem_1_14

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1rational-pointstensor-rank

Tensor rank depends on the field. There is a tensor A∈Q2×2×2\mathcal A \in \mathbb Q^{2\times2\times2}A∈Q2×2×2 with rational entries such that

rank⁡R(A)<rank⁡Q(A),\operatorname{rank}_{\mathbb R}(\mathcal A) < \operatorname{rank}_{\mathbb Q}(\mathcal A),rankR​(A)<rankQ​(A),

where rank⁡E\operatorname{rank}_ErankE​ is the rank (6) computed with coefficients and vectors from the field EEE.

For matrices the rank does not change when the field is enlarged; this theorem shows that for 3-tensors it can, even between Q\mathbb QQ and R\mathbb RR. In particular Håstad's NP-hardness of tensor rank over Q\mathbb QQ does not transfer to R\mathbb RR automatically.

Formalization Note The existential is the printed statement. The milestones of this mission concern the paper's explicit tensor 2x⊗x⊗x−4y⊗y⊗x+4y⊗x⊗y−4x⊗y⊗y2\mathbf x\otimes\mathbf x\otimes\mathbf x - 4\mathbf y\otimes\mathbf y\otimes\mathbf x + 4\mathbf y\otimes\mathbf x\otimes\mathbf y - 4\mathbf x\otimes\mathbf y\otimes\mathbf y2x⊗x⊗x−4y⊗y⊗x+4y⊗x⊗y−4x⊗y⊗y, for which rank⁡R≤2<rank⁡Q\operatorname{rank}_{\mathbb R} \le 2 < \operatorname{rank}_{\mathbb Q}rankR​≤2<rankQ​. The real rank is the rank of A\mathcal AA with its entries cast to R\mathbb RR.

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

theorem theorem_1_14 :
    ∃ A : Fin 2 → Fin 2 → Fin 2 → ℚ,
      rankOver ℝ (fun i j k => (A i j k : ℝ)) < rankOver ℚ A := 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:11, Theorem 1.14 (proof p. 0:26)
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