Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.2, p. 7 — V = A^(p_1) ⊙ ⋯ ⊙ A^(p_N) satisfies VᴴV = ∗ₙ A^(n)ᴴA^(n)

Proved
TensorBTD.Cogradient.proposition_4_2

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(n)∈CIn×JA^{(n)}\in\mathbb C^{I_n\times J}A(n)∈CIn​×J for n=1,…,Nn=1,\dots,Nn=1,…,N, let ppp be any permutation of {1,…,N}\{1,\dots,N\}{1,…,N}, and let

V=A(p1)⊙⋯⊙A(pN)V=A^{(p_1)}\odot\cdots\odot A^{(p_N)}V=A(p1​)⊙⋯⊙A(pN​)

be the Khatri–Rao product of the matrices in the order ppp. Let W=∗n=1NA(n)HA(n)W=\ast_{n=1}^N A^{(n)\mathrm H}A^{(n)}W=∗n=1N​A(n)HA(n) be the Hadamard (entrywise) product of all the Gramians A(n)HA(n)A^{(n)\mathrm H}A^{(n)}A(n)HA(n). Then

VHV=W.V^{\mathrm H}V=W .VHV=W.

This is the standard identity that turns the Gramian of a Khatri–Rao product into a Hadamard product of small J×JJ\times JJ×J Gramians; it is the reason the cogradient of Theorem 4.4 can be evaluated without forming VVV.

Formalization Note. The rows of VVV are indexed by the tuple (ip1,…,ipN)(i_{p_1},\dots,i_{p_N})(ip1​​,…,ipN​​) rather than by an integer; the entry in row (ip1,…,ipN)(i_{p_1},\dots,i_{p_N})(ip1​​,…,ipN​​) and column jjj is ∏kaipkj(pk)\prod_k a^{(p_k)}_{i_{p_k}j}∏k​aipk​​j(pk​)​. Columns are 0-based. For N=0N=0N=0 both sides are the all-ones matrix (empty products).

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

open Matrix

/-- Proposition 4.2, p. 7: for matrices `A^(n) ∈ ℂ^{I_n × J}`, `n = 1, …, N`, and any permutation
`p` of the modes, the Khatri–Rao string `V = A^(p_1) ⊙ ⋯ ⊙ A^(p_N)` satisfies `Vᴴ V = W`, where
`W = ∗_n A^(n)ᴴ A^(n)` is the Hadamard product of the Gramians. -/
theorem proposition_4_2 {N J : ℕ} {I : Fin N → ℕ} (A : (n : Fin N) → Matrix (Fin (I n)) (Fin J) ℂ)
    (p : Equiv.Perm (Fin N)) :
    (krString A p)ᴴ * krString A p = Matrix.of fun j j' => ∏ n, ((A n)ᴴ * A n) j j' := 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, Proposition 4.2
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