# Hadamard product (matrices)

In mathematics, the **Hadamard product** (also known as the **Schur product** ^{[1]} or the **entrywise product**^{[2]}) is a binary operation that takes two matrices of the same dimensions, and produces another matrix where each element *ij* is the product of elements *ij* of the original two matrices. It should not be confused with the more common matrix product. It is attributed to, and named after, either French mathematician Jacques Hadamard, or German mathematician Issai Schur.

The Hadamard product is associative and distributive, and unlike the matrix product it is also commutative.

## Contents

## Definition

For two matrices, , of the same dimension, the Hadamard product, , is a matrix, of the same dimension as the operands, with elements given by

For matrices of different dimensions ( and , where or or both) the Hadamard product is undefined.

## Example

For example the Hadamard product for a 3x3 matrix A with a 3x3 matrix B is:

## Properties

The Hadamard product is commutative, associative and distributive over addition. That is,

The identity matrix under Hadamard multiplication of two *m-by-n* matrices is *m-by-n* matrix where all elements are equal to 1. This is different from the identity matrix under regular matrix multiplication, where only the elements of the main diagonal are equal to 1. Furthermore, a matrix has an inverse under Hadamard multiplication if and only if none of the elements are equal to zero.^{[3]}

For vectors and , and corresponding diagonal matrices and with these vectors as their leading diagonals, the following identity holds:^{[4]}

where denotes the conjugate transpose of . In particular, using vectors of ones, this shows that the sum of all elements in the Hadamard product is the trace of . A related result for square and , is that the row-sums of their Hadamard product are the diagonal elements of ^{[5]}

The Hadamard product is a principal submatrix of the Kronecker product.

## Schur product theorem

{{#invoke:main|main}}
The Hadamard product of two positive-semidefinite matrices is positive-semidefinite.^{[5]} This is known as the Schur product theorem,^{[3]} after German mathematician Issai Schur. For positive-semidefinite matrices *A* and *B*, it is also known that

## In programming languages

Hadamard multiplication is built into certain programming languages under various names. In MATLAB, GNU Octave and GAUSS, it is known as "array multiplication", with the symbol `.*`

.^{[6]} In Fortran, R^{[7]} and Mathematica, it is done through simple multiplication operator `*`

, whereas the matrix product is done through the function `matmul`

, `%*%`

and the `.`

operators, respectively. In Python with the numpy numerical library or the sympy symbolic library, multiplication of `array`

objects as `a1*a2`

produces the Hadamard product, but with otherwise `matrix`

objects `m1*m2`

will produce a matrix product. The Eigen C++ library provides a `cwiseProduct`

member function for the `Matrix`

class (`a.cwiseProduct(b)`

), while the Armadillo library use the operator `%`

to make compact expressions (`a % b`

; `a * b`

is a matrix product).

## Applications

The Hadamard product appears in lossy compression algorithms such as JPEG. The decoding step involves an entry-for-entry product, i.e., Hadamard product.

## See also

## References

- ↑ Davis, Chandler. "The norm of the Schur product operation." Numerische Mathematik 4.1 (1962): 343-344.
- ↑ Template:Harvard citations
- ↑
^{3.0}^{3.1}Template:Cite web - ↑ Template:Harvard citations
- ↑
^{5.0}^{5.1}^{5.2}Template:Harvard citations - ↑ Template:Cite web
- ↑ Template:Cite web