Proof of Theorem 4.5, p. 12 — diagonal blocks: ⟨∂ℱ/∂a^(n)_{i r1}, ∂ℱ/∂a^(n)_{j r2}⟩ = w^{n}_{r1r2} δ_ij
ProvedTensorBTD.Gramian.diagonal_blockscanonical-polyadic-decompositiongramianjacobianp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1tensor-decomposition
In the setting of the unstructured CPD in rank-one terms, with factor matrices and residual , let be the Hadamard product of the Gramians of all factor matrices except the -th, with entries . Then for every mode , columns and rows of mode :
- the tensor inner product (Definition 2.1, conjugate on the first argument) of two partial derivatives with respect to entries of the same factor matrix is
- consequently the block of the Gramian of the CPD Jacobian at rows belonging to column and columns belonging to is
These are the diagonal blocks of (4.12). The statement holds for every tensor and every choice of factor matrices.
Formalization Note. Indices are 0-based; the Jacobian is the complex Jacobian of the unstructured CPD residual of the mission's setting, and the block is extracted from at the unknowns and .
Preamble
import Mathlib import Definitions.Def_TensorBTD_Gramian_Setting
Formal statement
namespace TensorBTD.Gramian
open Matrix
theorem diagonal_blocks {P Q R : ℕ} {I : Fin P ⊕ Fin Q → ℕ} {L : Fin R → ℕ}
(T : Tensor I) (x : GIdx I L → ℂ) (n : Fin P ⊕ Fin Q) (r1 r2 : Col L) :
(∀ i j : Fin (I n),
tensorInner (fun ι => jac (cpdResidual T) x ι ⟨n, (r1, i)⟩)
(fun ι => jac (cpdResidual T) x ι ⟨n, (r2, j)⟩) =
if i = j then W {n} (cpdFactor x) r1 r2 else 0) ∧
(Matrix.of fun i j : Fin (I n) =>
((jac (cpdResidual T) x)ᴴ * jac (cpdResidual T) x) ⟨n, (r1, i)⟩ ⟨n, (r2, j)⟩) =
W {n} (cpdFactor x) r1 r2 • (1 : Matrix (Fin (I n)) (Fin (I n)) ℂ) := 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), p. 12, proof of Theorem 4.5, "Diagonal blocks" displays
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.