The Hadamard product operates on identically-shaped matrices and produces a third matrix of the same dimensions.

In mathematics, the Hadamard product (also known as the Schur product[1] or the entrywise product[2]:ch. 5) is a binary operation that takes two matrices of the same dimensions, and produces another matrix where each element i,j is the product of elements i,j 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.

## Definition

For two matrices, ${\displaystyle A,B}$, of the same dimension, ${\displaystyle m\times n}$, the Hadamard product, ${\displaystyle A\circ B}$, is a matrix, of the same dimension as the operands, with elements given by

${\displaystyle (A\circ B)_{i,j}=(A)_{i,j}(B)_{i,j}}$.

For matrices of different dimensions (${\displaystyle m\times n}$ and ${\displaystyle p\times q}$, where ${\displaystyle m\not =p}$ or ${\displaystyle n\not =q}$ or both) the Hadamard product is undefined.

## Example

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

${\displaystyle \left[{\begin{array}{ccc}\mathrm {a} _{11}&\mathrm {a} _{12}&\mathrm {a} _{13}\\\mathrm {a} _{21}&\mathrm {a} _{22}&\mathrm {a} _{23}\\\mathrm {a} _{31}&\mathrm {a} _{32}&\mathrm {a} _{33}\end{array}}\right]\bullet \left[{\begin{array}{ccc}\mathrm {b} _{11}&\mathrm {b} _{12}&\mathrm {b} _{13}\\\mathrm {b} _{21}&\mathrm {b} _{22}&\mathrm {b} _{23}\\\mathrm {b} _{31}&\mathrm {b} _{32}&\mathrm {b} _{33}\end{array}}\right]=\left[{\begin{array}{ccc}\mathrm {a} _{11}\,\mathrm {b} _{11}&\mathrm {a} _{12}\,\mathrm {b} _{12}&\mathrm {a} _{13}\,\mathrm {b} _{13}\\\mathrm {a} _{21}\,\mathrm {b} _{21}&\mathrm {a} _{22}\,\mathrm {b} _{22}&\mathrm {a} _{23}\,\mathrm {b} _{23}\\\mathrm {a} _{31}\,\mathrm {b} _{31}&\mathrm {a} _{32}\,\mathrm {b} _{32}&\mathrm {a} _{33}\,\mathrm {b} _{33}\end{array}}\right]}$

## Properties

{\displaystyle {\begin{aligned}A\circ B&=B\circ A,\\A\circ (B\circ C)&=(A\circ B)\circ C,\\A\circ (B+C)&=A\circ B+A\circ C.\end{aligned}}}
• The identity matrix under Hadamard multiplication of two m-by-n matrices is an 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 ${\displaystyle x}$ and ${\displaystyle y}$, and corresponding diagonal matrices ${\displaystyle D_{x}}$ and ${\displaystyle D_{y}}$ with these vectors as their leading diagonals, the following identity holds:[2]:479
${\displaystyle x^{*}(A\circ B)y=\mathrm {tr} \left(D_{x}^{*}AD_{y}B^{\mathrm {T} }\right),}$
where ${\displaystyle x^{*}}$ denotes the conjugate transpose of ${\displaystyle x}$. In particular, using vectors of ones, this shows that the sum of all elements in the Hadamard product is the trace of ${\displaystyle AB^{\mathrm {T} }}$. A related result for square ${\displaystyle A}$ and ${\displaystyle B}$, is that the row-sums of their Hadamard product are the diagonal elements of ${\displaystyle AB^{\mathrm {T} }}$:[4]
${\displaystyle \sum _{i}(A\circ B)_{i,j}=\left(B^{\mathrm {T} }A\right)_{j,j}.}$
${\displaystyle \sum _{j}(A\circ B)_{i,j}=\left(AB^{\mathrm {T} }\right)_{i,i}.}$
${\displaystyle \operatorname {rank} (A\circ B)\leq \operatorname {rank} (A)\operatorname {rank} (B)}$
• If ${\displaystyle A}$ and ${\displaystyle B}$ are positive-definite matrices, then the following inequality involving the Hadamard product is valid:[5]
${\displaystyle \prod _{i=k}^{n}\lambda _{i}(A\circ B)\geq \prod _{i=k}^{n}\lambda _{i}(AB),\quad k=1,\ldots ,n,}$
where ${\displaystyle \lambda _{i}(A)}$ is the ith largest eigenvalue of ${\displaystyle A}$.

## Schur product theorem

The Hadamard product of two positive-semidefinite matrices is positive-semidefinite.[4] 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

${\displaystyle \det(A\circ B)\geq \det(A)\det(B).\,}$[4]

## In programming languages

Hadamard multiplication is built into certain programming languages under various names. In MATLAB, GNU Octave, GAUSS and HP Prime, it is known as array multiplication, or in Julia broadcast multiplication, with the symbol .*.[6] In Fortran, R,[7] J and Wolfram Language (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 otherwise multiplication as a1@a2 or 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 uses 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.

## Analogous operations

Other Hadamard operations are also seen in the mathematical literature,[8] namely the Hadamard root and Hadamard power (which are in effect the same thing because of fractional indices), defined for a matrix such that: For

{\displaystyle {\begin{aligned}B&=A^{\circ 2}\\B_{ij}&=A_{ij}^{2}\end{aligned}}}

and for

{\displaystyle {\begin{aligned}B&=A^{\circ {\frac {1}{2}}}\\B_{ij}&=A_{ij}^{\frac {1}{2}}\end{aligned}}}

{\displaystyle {\begin{aligned}B&=A^{\circ -1}\\B_{ij}&=A_{ij}^{-1}\end{aligned}}}

A Hadamard division is defined as:[9][10]

{\displaystyle {\begin{aligned}C&=A{\oslash }B\\C_{ij}&=A_{ij}/B_{ij}\end{aligned}}}

4. ^ a b c Styan (1973), Missing or empty |title= (help)[full citation needed]