Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.4, p. 8 — f_BTD = ½(f^(1) − f^(2) − f̄^(2) + f^(3)) for every mode n

Proved
TensorBTD.Cogradient.fBTD_decomposition

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

canonical-polyadic-decompositionleast-squaresp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1tensor-decomposition

Let T\mathcal TT be an NNNth-order tensor, N=P+QN=P+QN=P+Q. First, fBTDf_{\mathrm{BTD}}fBTD​ is the objective of the unstructured CPD evaluated at the structured factor matrices (3.6): for all unknowns zzz,

fBTD(z)=12∥∑r′ar′(1)∘⋯∘ar′(N)−T∥2with A(P+q)=C(q)E.f_{\mathrm{BTD}}(z)=\tfrac12\Big\|\sum_{r'}a^{(1)}_{r'}\circ\cdots\circ a^{(N)}_{r'}-\mathcal T\Big\|^2\quad\text{with } A^{(P+q)}=C^{(q)}E .fBTD​(z)=21​​r′∑​ar′(1)​∘⋯∘ar′(N)​−T​2with A(P+q)=C(q)E.

Second, for all factor matrices A(1),…,A(N)∈CIn×R′A^{(1)},\dots,A^{(N)}\in\mathbb C^{I_n\times R'}A(1),…,A(N)∈CIn​×R′ of the unstructured CPD and every mode nnn, with

f(1)=∥A(n)V{n}T∥2,f(2)=⟨T(n),A(n)V{n}T⟩,f(3)=∥T(n)∥2,f^{(1)}=\|A^{(n)}V^{\{n\}\mathrm T}\|^2,\qquad f^{(2)}=\langle T_{(n)},A^{(n)}V^{\{n\}\mathrm T}\rangle,\qquad f^{(3)}=\|T_{(n)}\|^2,f(1)=∥A(n)V{n}T∥2,f(2)=⟨T(n)​,A(n)V{n}T⟩,f(3)=∥T(n)​∥2,

one has

f=12(f(1)−f(2)−f(2)‾+f(3)),f=\tfrac12\big(f^{(1)}-f^{(2)}-\overline{f^{(2)}}+f^{(3)}\big),f=21​(f(1)−f(2)−f(2)​+f(3)),

where f=12∥F∥2f=\frac12\|\mathcal F\|^2f=21​∥F∥2 is the objective of the unstructured CPD.

This splits the objective into a part depending only on the factors, a part linear in the data, and a constant; it opens the proof of Theorem 4.4.

Formalization Note. The inner product is Definition 2.1's, conjugate on the first argument. The identity holds for every mode nnn simultaneously, because the mode-nnn unfolding of the residual is A(n)V{n}T−T(n)A^{(n)}V^{\{n\}\mathrm T}-T_{(n)}A(n)V{n}T−T(n)​ (3.8). All quantities are cast to C\mathbb CC.

Preamble
import Mathlib
import Definitions.Def_TensorBTD_Cogradient_Setting
Formal statement
namespace TensorBTD.Cogradient

open Matrix

/-- Proof of Theorem 4.4, p. 8, first sentence: `f_BTD` is the objective of the unstructured CPD
at the factor matrices `A^(n)` of (3.6), and for every mode `n`,
`f = ½ (f^(1) − f^(2) − conj f^(2) + f^(3))` with `f^(1) = ‖A^(n) V^{n}ᵀ‖²`,
`f^(2) = ⟨T_(n), A^(n) V^{n}ᵀ⟩`, `f^(3) = ‖T_(n)‖²`. -/
theorem fBTD_decomposition {P Q R : ℕ} {I : Fin P ⊕ Fin Q → ℕ} {L : Fin R → ℕ} (T : TensorBTD.Gramian.Tensor I) :
    (∀ z : TensorBTD.Gramian.Unk I L → ℂ, fBTD T z = fCPD T (TensorBTD.Gramian.fullVec z)) ∧
    ∀ (x : TensorBTD.Gramian.GIdx I L → ℂ) (n : Fin P ⊕ Fin Q),
      fCPD T x = (1 / 2 : ℂ) *
        (fOne n x - fTwo T n x - starRingEnd ℂ (fTwo T n x) + fThree T n) := by sorry

end TensorBTD.Cogradient
Source
Sorber, Van Barel & De Lathauwer, Optimization-Based Algorithms for Tensor Decompositions, SIAM J. Optim. 23(2) (2013), doi:10.1137/120868323, authors' manuscript (Lirias), p. 8, proof of Theorem 4.4, first sentence; (3.6)–(3.8), p. 6
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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