Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.5, pp. 12–13 — the blocks of JᴴJ involving C^(q) are Π·F^(q)ᵀ, F^(q)·Π and F^(q1)·Π·F^(q2)ᵀ

Proved
TensorBTD.Gramian.blocks_via_sigma

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

block-term-decompositiongauss-newtongramianjacobianp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1tensor-decomposition

Let J=∂ vec(FBTD)/∂zTJ = \partial\,\mathrm{vec}(\mathcal F_{\mathrm{BTD}})/\partial z^{\mathrm T}J=∂vec(FBTD​)/∂zT be the Jacobian of the (rank-Lr∘L_r\circLr​∘ rank-1) BTD residual with respect to its unknowns zzz, and let JCPDJ_{\mathrm{CPD}}JCPD​ be the Jacobian of the unstructured CPD residual in R′R'R′ terms (all factor matrices A(1),…,A(N)A^{(1)},\dots,A^{(N)}A(1),…,A(N) free), evaluated at the factor matrices of zzz, so that A(P+q)=C(q)EA^{(P+q)} = C^{(q)}EA(P+q)=C(q)E. Write

Π(n1,n2)=(∂ vec(F)∂ vec(A(n1))T)H(∂ vec(F)∂ vec(A(n2))T)\Pi^{(n_1,n_2)} = \left(\frac{\partial\,\mathrm{vec}(\mathcal F)}{\partial\,\mathrm{vec}(A^{(n_1)})^{\mathrm T}}\right)^{\mathrm H}\left(\frac{\partial\,\mathrm{vec}(\mathcal F)}{\partial\,\mathrm{vec}(A^{(n_2)})^{\mathrm T}}\right)Π(n1​,n2​)=(∂vec(A(n1​))T∂vec(F)​)H(∂vec(A(n2​))T∂vec(F)​)

for the blocks of JCPDHJCPDJ_{\mathrm{CPD}}^{\mathrm H}J_{\mathrm{CPD}}JCPDH​JCPD​, and Σ=diag(II1R′,…,IIPR′,F(1),…,F(Q))\Sigma = \mathrm{diag}(\mathbb I_{I_1R'},\dots,\mathbb I_{I_PR'},F^{(1)},\dots,F^{(Q)})Σ=diag(II1​R′​,…,IIP​R′​,F(1),…,F(Q)) with F(q)=E⊗IIP+qF^{(q)} = E\otimes\mathbb I_{I_{P+q}}F(q)=E⊗IIP+q​​. Then for every tensor T\mathcal TT and every zzz,

JHJ=Σ⋅(JCPDHJCPD)⋅ΣT.J^{\mathrm H}J = \Sigma\cdot\left(J_{\mathrm{CPD}}^{\mathrm H}J_{\mathrm{CPD}}\right)\cdot\Sigma^{\mathrm T}.JHJ=Σ⋅(JCPDH​JCPD​)⋅ΣT.

Block by block this says: the (p1,p2)(p_1,p_2)(p1​,p2​) block of JHJJ^{\mathrm H}JJHJ is Π(p1,p2)\Pi^{(p_1,p_2)}Π(p1​,p2​); the (p,P+q)(p,P+q)(p,P+q) block is Π(p,P+q)F(q)T\Pi^{(p,P+q)}F^{(q)\mathrm T}Π(p,P+q)F(q)T; the (P+q,p)(P+q,p)(P+q,p) block is F(q)Π(P+q,p)F^{(q)}\Pi^{(P+q,p)}F(q)Π(P+q,p); and the (P+q1,P+q2)(P+q_1,P+q_2)(P+q1​,P+q2​) block is F(q1)Π(P+q1,P+q2)F(q2)TF^{(q_1)}\Pi^{(P+q_1,P+q_2)}F^{(q_2)\mathrm T}F(q1​)Π(P+q1​,P+q2​)F(q2​)T.

Formalization Note. The paper prints the (P+q,p)(P+q,p)(P+q,p) block as F(q)⋅Π(p,P+q)F^{(q)}\cdot\Pi^{(p,P+q)}F(q)⋅Π(p,P+q), a misprint for F(q)⋅Π(P+q,p)F^{(q)}\cdot\Pi^{(P+q,p)}F(q)⋅Π(P+q,p) (the printed product does not even have matching dimensions unless Ip=IP+qI_p = I_{P+q}Ip​=IP+q​); the Lean states the correct identity, in assembled matrix form. Σ\SigmaΣ has rows indexed by the unknowns zzz and columns by the unknowns of the unstructured CPD; it is real, so ΣT=ΣH\Sigma^{\mathrm T} = \Sigma^{\mathrm H}ΣT=ΣH.

Preamble
import Mathlib
import Definitions.Def_TensorBTD_Gramian_Setting
Formal statement
namespace TensorBTD.Gramian

open Matrix

theorem blocks_via_sigma {P Q R : ℕ} {I : Fin P ⊕ Fin Q → ℕ} {L : Fin R → ℕ}
    (T : Tensor I) (z : Unk I L → ℂ) :
    (jac (residual T) z)ᴴ * jac (residual T) z =
      Sigma I L * ((jac (cpdResidual T) (fullVec z))ᴴ * jac (cpdResidual T) (fullVec z)) *
        (Sigma I L)ᵀ := by sorry

end TensorBTD.Gramian
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), pp. 12–13, proof of Theorem 4.5, closing paragraph
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