Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.3, p. 7 — (V^σ)ᴴV^σ = W^σ

Proved
TensorBTD.Cogradient.corollary_4_3

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

gramianhadamard-productkhatri-rao-productp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A(1),…,A(N)A^{(1)},\dots,A^{(N)}A(1),…,A(N) be complex matrices with InI_nIn​ rows and a common set of KKK columns, N=P+QN=P+QN=P+Q, and let σ\sigmaσ be any set of modes. With the Khatri–Rao string Vσ=⨀n∉σA(n)V^\sigma=\bigodot_{n\notin\sigma}A^{(n)}Vσ=⨀n∈/σ​A(n) of (3.2) and

Wσ=∗n∉σA(n)HA(n),W^{\sigma}=\mathop{\ast}_{n\notin\sigma}A^{(n)\mathrm H}A^{(n)},Wσ=∗n∈/σ​A(n)HA(n),

the Hadamard product of the Gramians of the factor matrices outside σ\sigmaσ,

(Vσ)HVσ=Wσ.(V^{\sigma})^{\mathrm H}V^{\sigma}=W^{\sigma}.(Vσ)HVσ=Wσ.

In the proof of Theorem 4.4 it is applied with σ={n}\sigma=\{n\}σ={n}, to compute ∂f(1)/∂A(n)=A‾(n)W{n}\partial f^{(1)}/\partial A^{(n)}=\overline{A}^{(n)}W^{\{n\}}∂f(1)/∂A(n)=A(n)W{n}.

Formalization Note. Modes are Fin P ⊕ Fin Q; the rows of VσV^\sigmaVσ are indexed by the tuple of indices of the modes outside σ\sigmaσ. The column set is an arbitrary finite type (in the mission it is the R′R'R′ columns of the CPD).

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

open Matrix

/-- Corollary 4.3, p. 7: `(V^σ)ᴴ V^σ = W^σ` for every set `σ` of modes and all factor matrices
with a common finite column set `K`. -/
theorem corollary_4_3 {P Q : ℕ} {I : Fin P ⊕ Fin Q → ℕ} {K : Type*} [Fintype K]
    (σ : Finset (Fin P ⊕ Fin Q)) (A : (n : Fin P ⊕ Fin Q) → Matrix (Fin (I n)) K ℂ) :
    (V σ A)ᴴ * V σ A = W σ A := 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. 7, Corollary 4.3; (3.2), p. 4
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