Frobenius Norm — Definition, Formula & Examples

The Frobenius norm is the square root of the sum of the squares of all entries in a matrix. It generalizes the idea of vector length (Euclidean norm) to matrices.

For an $m \times n$ matrix $A$ with entries $a_{ij}$ , the Frobenius norm is defined as $\|A\|_F = \sqrt{\sum_{i=1}^{m}\sum_{j=1}^{n} |a_{ij}|^2}$ . Equivalently, $\|A\|_F = \sqrt{\operatorname{tr}(A^T A)}$ , where $\operatorname{tr}$ denotes the trace.

Key Formula

\|A\|_F = \sqrt{\sum_{i=1}^{m}\sum_{j=1}^{n} a_{ij}^2}

Where:

$A$ = An m × n matrix
$a_{ij}$ = The entry in row i and column j of A
$m$ = Number of rows
$n$ = Number of columns

How It Works

To compute the Frobenius norm, square every entry of the matrix, add all the squared values together, and take the square root. You can think of it as treating the matrix as one long vector and finding its Euclidean length. The Frobenius norm satisfies all the properties of a norm: it is zero only for the zero matrix, it scales linearly with scalar multiplication, and it obeys the triangle inequality.

Worked Example

Problem: Find the Frobenius norm of the matrix A = [[1, 2], [3, 4]].

Step 1: Square each entry of the matrix.

1^2 = 1,\quad 2^2 = 4,\quad 3^2 = 9,\quad 4^2 = 16

Step 2: Sum all the squared entries.

1 + 4 + 9 + 16 = 30

Step 3: Take the square root of the sum.

\|A\|_F = \sqrt{30} \approx 5.477

Answer: The Frobenius norm of A is

\sqrt{30} \approx 5.477

Why It Matters

The Frobenius norm is widely used in numerical linear algebra and machine learning to measure the "size" of a matrix or the error between two matrices. For instance, in low-rank matrix approximation and data compression, the Frobenius norm quantifies how well a simplified matrix approximates the original.

Common Mistakes

Mistake: Forgetting to take the square root after summing the squared entries.

Correction: The sum of squared entries gives

\|A\|_F^2

, not

\|A\|_F

. Always take the square root as the final step.