Proof of Theorem 1.14, (29) — rank ≤ 2 gives two outer products, and (29) for A is the system (30)
ProvedTensorNP.Rank.eq29_iff_system30This item makes precise the step "Suppose not and that there exist with (29). Identity (29) gives eight equations found in (30)" of the proof of Theorem 1.14. It has two parts.
- Let be a field and . If , then there are , , with .
- Let be a field of characteristic zero, the rational tensor of Theorem 1.14 with entries read in , and , for . Then
holds if and only if satisfy the eight equations (30).
Applied with , the two parts turn "" into a rational solution of (30).
Formalization Note The paper only says "suppose not"; part 1 is the step that absorbs the scalars and pads a decomposition with fewer than two terms by zero terms. It is stated for an arbitrary tensor over an arbitrary field so that it is not vacuous (for the paper's over its hypothesis is false, by Lemma 8.1). Part 2 is stated over every field of characteristic zero for the same reason; over both sides hold for the decomposition of the first milestone. The paper says (29) "gives" (30); the equivalence states that (30) is exactly the entrywise reading of (29). Vectors are indexed from 0, so is u_i 0 and is u_i 1.
import Mathlib import Definitions.Def_TensorNP_Rank_Defs import Definitions.Def_TensorNP_Rank_Construction
namespace TensorNP.Rank
theorem eq29_iff_system30 :
(∀ {E : Type} [Field E] {l m n : ℕ} (B : Fin l → Fin m → Fin n → E),
rankOver E B ≤ 2 →
∃ (u₁ v₁ : Fin l → E) (u₂ v₂ : Fin m → E) (u₃ v₃ : Fin n → E),
B = outer u₁ u₂ u₃ + outer v₁ v₂ v₃) ∧
(∀ {K : Type} [Field K] [CharZero K] (u₁ u₂ u₃ v₁ v₂ v₃ : Fin 2 → K),
((fun i j k => (tensorA i j k : K)) = outer u₁ u₂ u₃ + outer v₁ v₂ v₃ ↔
System30 (u₁ 0) (u₂ 0) (u₃ 0) (u₁ 1) (u₂ 1) (u₃ 1)
(v₁ 0) (v₂ 0) (v₃ 0) (v₁ 1) (v₂ 1) (v₃ 1))) := by sorry
end TensorNP.Rank
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.