Frobenius Inner Product

In mathematics, the Frobenius inner product is a binary operation that takes two matrices and returns a scalar. It is often denoted $\langle \mathbf,\mathbf \rangle_\mathrm$. The operation is a component-wise inner product of two matrices as though they are vectors, and satisfies the axioms for an inner product. The two matrices must have the same dimension—same number of rows and columns—but are not restricted to be square matrices.

It is named after Ferdinand Georg Frobenius.

Definition

Given two complex-number-valued ''n''×''m'' matrices A and B, written explicitly as

:$\mathbf = \,, \quad \mathbf =,$

the Frobenius inner product is defined as

:$\langle \mathbf, \mathbf \rangle_\mathrm =\sum_\overline B_ \, = \mathrm\left(\overline \mathbf\right) \equiv \mathrm\left(\mathbf^ \mathbf\right),$

where the overline denotes the complex conjugate, and $\dagger$ denotes the Hermitian conjugate. Explicitly, this sum is

:$\begin \langle \mathbf, \mathbf \rangle_\mathrm = & \overline_ B_ + \overline_ B_ + \cdots + \overline_ B_ \\ & + \overline_ B_ + \overline_ B_ + \cdots + \overline_ B_ \\ & \vdots \\ & + \overline_ B_ + \overline_ B_ + \cdots + \overline_ B_ \\ \end$

The calculation is very similar to the dot product, which in turn is an example of an inner product.

Relation to other products

If A and B are each real-valued matrices, then the Frobenius inner product is the sum of the entries of the Hadamard product. If the matrices are vectorized (i.e., converted into column vectors, denoted by "$\mathrm(\cdot)$"), then

:$\mathrm(\mathbf ) = ,\quad \mathrm(\mathbf ) = \,,$$\quad \overline^T\mathrm(\mathbf ) =$

Therefore

:$\langle \mathbf, \mathbf \rangle_\mathrm = \overline^T \mathrm(\mathbf) \, .$

Properties

Like any inner product, it is a sesquilinear form, for four complex-valued matrices A, B, C, D, and two complex numbers ''a'' and ''b'':

:$\langle a\mathbf, b\mathbf \rangle_\mathrm = \overlineb\langle \mathbf, \mathbf \rangle_\mathrm$
:$\langle \mathbf+\mathbf, \mathbf + \mathbf \rangle_\mathrm = \langle \mathbf, \mathbf \rangle_\mathrm + \langle \mathbf, \mathbf \rangle_\mathrm + \langle \mathbf, \mathbf \rangle_\mathrm + \langle \mathbf, \mathbf \rangle_\mathrm$

Also, exchanging the matrices amounts to complex conjugation:

:$\langle \mathbf, \mathbf \rangle_\mathrm = \overline$

For the same matrix, the inner product induces the Frobenius norm

:$\langle \mathbf, \mathbf \rangle_\mathrm = \, \mathbf\, _\mathrm^2 \geq 0$,

and is zero for a zero matrix,
:$\langle \mathbf, \mathbf \rangle_\mathrm = 0 \Longleftrightarrow \mathbf = \mathbf$.

Examples

Real-valued matrices

For two real-valued matrices, if

:$\mathbf = \begin 2 & 0 & 6 \\ 1 & -1 & 2 \end \,,\quad \mathbf = \begin 8 & -3 & 2 \\ 4 & 1 & -5 \end,$

then

:$\begin\langle \mathbf ,\mathbf\rangle_\mathrm & = 2\cdot 8 + 0\cdot (-3) + 6\cdot 2 + 1\cdot 4 + (-1)\cdot 1 + 2\cdot(-5) \\ & = 21. \end$

Complex-valued matrices

For two complex-valued matrices, if

:$\mathbf = \begin 1+i & -2i \\ 3 & -5 \end \,,\quad \mathbf = \begin -2 & 3i \\ 4-3i & 6 \end,$

then

:$\begin \langle \mathbf ,\mathbf\rangle_\mathrm & = (1-i)\cdot (-2) + (2i)\cdot 3i + 3\cdot (4-3i) + (-5)\cdot 6 \\ & = -26 -7i, \end$

while

:$\begin \langle \mathbf ,\mathbf\rangle_\mathrm & = (-2)\cdot (1+i) + (-3i)\cdot (-2i) + (4+3i)\cdot 3 + 6 \cdot (-5) \\ & = -26 + 7i. \end$

The Frobenius inner products of A with itself, and B with itself, are respectively

:$\langle \mathbf, \mathbf \rangle_\mathrm = 2 + 4 + 9 + 25 = 40$$\qquad \langle \mathbf, \mathbf \rangle_\mathrm = 4 + 9 + 25 + 36 = 74.$

See also

*Hadamard product (matrices)
* Hilbert–Schmidt inner product
*Kronecker product
* Matrix analysis
*Matrix multiplication
*Matrix norm
*Tensor product of Hilbert spaces – the Frobenius inner product is the special case where the vector spaces are finite-dimensional real or complex vector spaces with the usual Euclidean inner product

References

{{DEFAULTSORT:Matrix Multiplication
Matrix theory
Bilinear maps
Multiplication
Numerical linear algebra