# 2.3. Linear Algebra¶ Open the notebook in Colab

Now that you can store and manipulate data, let’s briefly review the subset of basic linear algebra that you will need to understand and implement most of models covered in this book. Below, we introduce the basic mathematical objects, arithmetic, and operations in linear algebra, expressing each of them through mathematical notation and the corresponding implementation in code.

## 2.3.1. Scalars¶

If you never studied linear algebra or machine learning, then your past
experience with math probably consisted of thinking about one number at
a time. And, if you ever balanced a checkbook or even paid for dinner at
a restaurant then you already know how to do basic things like adding
and multiplying pairs of numbers. For example, the temperature in Palo
Alto is \(52\) degrees Fahrenheit. Formally, we call values
consisting of just one numerical quantity *scalars*. If you wanted to
convert this value to Celsius (the metric system’s more sensible
temperature scale), you would evaluate the expression
\(c = \frac{5}{9}(f - 32)\), setting \(f\) to \(52\). In
this equation, each of the terms—\(5\), \(9\), and
\(32\)—are scalar values. The placeholders \(c\) and \(f\)
are called *variables* and they represent unknown scalar values.

In this book, we adopt the mathematical notation where scalar variables
are denoted by ordinary lower-cased letters (e.g., \(x\), \(y\),
and \(z\)). We denote the space of all (continuous) *real-valued*
scalars by \(\mathbb{R}\). For expedience, we will punt on rigorous
definitions of what precisely *space* is, but just remember for now that
the expression \(x \in \mathbb{R}\) is a formal way to say that
\(x\) is a real-valued scalar. The symbol \(\in\) can be
pronounced “in” and simply denotes membership in a set. Analogously, we
could write \(x, y \in \{0, 1\}\) to state that \(x\) and
\(y\) are numbers whose value can only be \(0\) or \(1\).

In MXNet code, a scalar is represented by an `ndarray`

with just one
element. In the next snippet, we instantiate two scalars and perform
some familiar arithmetic operations with them, namely addition,
multiplication, division, and exponentiation.

```
from mxnet import np, npx
npx.set_np()
x = np.array(3.0)
y = np.array(2.0)
x + y, x * y, x / y, x ** y
```

```
(array(5.), array(6.), array(1.5), array(9.))
```

## 2.3.2. Vectors¶

You can think of a vector as simply a list of scalar values. We call
these values the *elements* (*entries* or *components*) of the vector.
When our vectors represent examples from our dataset, their values hold
some real-world significance. For example, if we were training a model
to predict the risk that a loan defaults, we might associate each
applicant with a vector whose components correspond to their income,
length of employment, number of previous defaults, and other factors. If
we were studying the risk of heart attacks hospital patients potentially
face, we might represent each patient by a vector whose components
capture their most recent vital signs, cholesterol levels, minutes of
exercise per day, etc. In math notation, we will usually denote vectors
as bold-faced, lower-cased letters (e.g., \(\mathbf{x}\),
\(\mathbf{y}\), and \(\mathbf{z})\).

In MXNet, we work with vectors via \(1\)-dimensional `ndarray`

s.
In general `ndarray`

s can have arbitrary lengths, subject to the
memory limits of your machine.

```
x = np.arange(4)
x
```

```
array([0., 1., 2., 3.])
```

We can refer to any element of a vector by using a subscript. For example, we can refer to the \(i^\mathrm{th}\) element of \(\mathbf{x}\) by \(x_i\). Note that the element \(x_i\) is a scalar, so we do not bold-face the font when referring to it. Extensive literature considers column vectors to be the default orientation of vectors, so does this book. In math, a vector \(\mathbf{x}\) can be written as

where \(x_1, \ldots, x_n\) are elements of the vector. In code, we
access any element by indexing into the `ndarray`

.

```
x[3]
```

```
array(3.)
```

### 2.3.2.1. Length, Dimensionality, and Shape¶

Let’s revisit some concepts from Section 2.1. A vector is
just an array of numbers. And just as every array has a length, so does
every vector. In math notation, if we want to say that a vector
\(\mathbf{x}\) consists of \(n\) real-valued scalars, we can
express this as \(\mathbf{x} \in \mathbb{R}^n\). The length of a
vector is commonly called the *dimension* of the vector.

As with an ordinary Python array, we can access the length of an
`ndarray`

by calling Python’s built-in `len()`

function.

```
len(x)
```

```
4
```

When an `ndarray`

represents a vector (with precisely one axis), we
can also access its length via the `.shape`

attribute. The shape is a
tuple that lists the length (dimensionality) along each axis of the
`ndarray`

. For `ndarray`

s with just one axis, the shape has just
one element.

```
x.shape
```

```
(4,)
```

Note that the word “dimension” tends to get overloaded in these contexts
and this tends to confuse people. To clarify, we use the dimensionality
of a *vector* or an *axis* to refer to its length, i.e., the number of
elements of a vector or an axis. However, we use the dimensionality of
an `ndarray`

to refer to the number of axes that an `ndarray`

has.
In this sense, the dimensionality of some axis of an `ndarray`

will be
the length of that axis.

## 2.3.3. Matrices¶

Just as vectors generalize scalars from order \(0\) to order
\(1\), matrices generalize vectors from order \(1\) to order
\(2\). Matrices, which we will typically denote with bold-faced,
capital letters (e.g., \(\mathbf{X}\), \(\mathbf{Y}\), and
\(\mathbf{Z}\)), are represented in code as `ndarray`

s with
\(2\) axes.

In math notation, we use \(\mathbf{A} \in \mathbb{R}^{m \times n}\) to express that the matrix \(\mathbf{A}\) consists of \(m\) rows and \(n\) columns of real-valued scalars. Visually, we can illustrate any matrix \(\mathbf{A} \in \mathbb{R}^{m \times n}\) as a table, where each element \(a_{ij}\) belongs to the \(i^{\mathrm{th}}\) row and \(j^{\mathrm{th}}\) column:

For any \(\mathbf{A} \in \mathbb{R}^{m \times n}\), the shape of
\(\mathbf{A}\) is (\(m\), \(n\)) or \(m \times n\).
Specifically, when a matrix has the same number of rows and columns, its
shape becomes a square; thus, it is called a *square matrix*.

We can create an \(m \times n\) matrix in MXNet by specifying a
shape with two components \(m\) and \(n\) when calling any of
our favorite functions for instantiating an `ndarray`

.

```
A = np.arange(20).reshape(5, 4)
A
```

```
array([[ 0., 1., 2., 3.],
[ 4., 5., 6., 7.],
[ 8., 9., 10., 11.],
[12., 13., 14., 15.],
[16., 17., 18., 19.]])
```

We can access the scalar element \(a_{ij}\) of a matrix \(\mathbf{A}\) in (2.3.2) by specifying the indices for the row (\(i\)) and column (\(j\)), such as \([\mathbf{A}]_{ij}\). When the scalar elements of a matrix \(\mathbf{A}\), such as in (2.3.2), are not given, we may simply use the lower-case letter of the matrix \(\mathbf{A}\) with the index subscript, \(a_{ij}\), to refer to \([\mathbf{A}]_{ij}\). To keep notation simple, commas are inserted to separate indices only when necessary, such as \(a_{2, 3j}\) and \([\mathbf{A}]_{2i-1, 3}\).

Sometimes, we want to flip the axes. When we exchange a matrix’s rows
and columns, the result is called the *transpose* of the matrix.
Formally, we signify a matrix \(\mathbf{A}\)’s transpose by
\(\mathbf{A}^\top\) and if \(\mathbf{B} = \mathbf{A}^\top\),
then \(b_{ij} = a_{ji}\) for any \(i\) and \(j\). Thus, the
transpose of \(\mathbf{A}\) in (2.3.2) is a
\(n \times m\) matrix:

In code, we access a matrix’s transpose via the `T`

attribute.

```
A.T
```

```
array([[ 0., 4., 8., 12., 16.],
[ 1., 5., 9., 13., 17.],
[ 2., 6., 10., 14., 18.],
[ 3., 7., 11., 15., 19.]])
```

As a special type of the square matrix, a *symmetric matrix*
\(\mathbf{A}\) is equal to its transpose:
\(\mathbf{A} = \mathbf{A}^\top\).

```
B = np.array([[1, 2, 3], [2, 0, 4], [3, 4, 5]])
B
```

```
array([[1., 2., 3.],
[2., 0., 4.],
[3., 4., 5.]])
```

```
B == B.T
```

```
array([[ True, True, True],
[ True, True, True],
[ True, True, True]])
```

Matrices are useful data structures: they allow us to organize data that
have different modalities of variation. For example, rows in our matrix
might correspond to different houses (data points), while columns might
correspond to different attributes. This should sound familiar if you
have ever used spreadsheet software or have read Section 2.2.
Thus, although the default orientation of a single vector is a column
vector, in a matrix that represents a tabular dataset, it is more
conventional to treat each data point as a row vector in the matrix.
And, as we will see in later chapters, this convention will enable
common deep learning practices. For example, along the outermost axis of
an `ndarray`

, we can access or enumerate minibatches of data points,
or just data points if no minibatch exists.

## 2.3.4. Tensors¶

Just as vectors generalize scalars, and matrices generalize vectors, we
can build data structures with even more axes. Tensors give us a generic
way of describing `ndarray`

s with an arbitrary number of axes.
Vectors, for example, are first-order tensors, and matrices are
second-order tensors. Tensors are denoted with capital letters of a
special font face (e.g., \(\mathsf{X}\), \(\mathsf{Y}\), and
\(\mathsf{Z}\)) and their indexing mechanism (e.g., \(x_{ijk}\)
and \([\mathsf{X}]_{1, 2i-1, 3}\)) is similar to that of matrices.

Tensors will become more important when we start working with images,
which arrive as `ndarray`

s with 3 axes corresponding to the height,
width, and a *channel* axis for stacking the color channels (red, green,
and blue). For now, we will skip over higher order tensors and focus on
the basics.

```
X = np.arange(24).reshape(2, 3, 4)
X
```

```
array([[[ 0., 1., 2., 3.],
[ 4., 5., 6., 7.],
[ 8., 9., 10., 11.]],
[[12., 13., 14., 15.],
[16., 17., 18., 19.],
[20., 21., 22., 23.]]])
```

## 2.3.5. Basic Properties of Tensor Arithmetic¶

Scalars, vectors, matrices, and tensors of an arbitrary number of axes have some nice properties that often come in handy. For example, you might have noticed from the definition of an elementwise operation that any elementwise unary operation does not change the shape of its operand. Similarly, given any two tensors with the same shape, the result of any binary elementwise operation will be a tensor of that same shape. For example, adding two matrices of the same shape performs elementwise addition over these two matrices.

```
A = np.arange(20).reshape(5, 4)
B = A.copy() # Assign a copy of A to B by allocating new memory
A, A + B
```

```
(array([[ 0., 1., 2., 3.],
[ 4., 5., 6., 7.],
[ 8., 9., 10., 11.],
[12., 13., 14., 15.],
[16., 17., 18., 19.]]), array([[ 0., 2., 4., 6.],
[ 8., 10., 12., 14.],
[16., 18., 20., 22.],
[24., 26., 28., 30.],
[32., 34., 36., 38.]]))
```

Specifically, elementwise multiplication of two matrices is called their
*Hadamard product* (math notation \(\odot\)). Consider matrix
\(\mathbf{B} \in \mathbb{R}^{m \times n}\) whose element of row
\(i\) and column \(j\) is \(b_{ij}\). The Hadamard product
of matrices \(\mathbf{A}\) (defined in (2.3.2)) and
\(\mathbf{B}\)

```
A * B
```

```
array([[ 0., 1., 4., 9.],
[ 16., 25., 36., 49.],
[ 64., 81., 100., 121.],
[144., 169., 196., 225.],
[256., 289., 324., 361.]])
```

Multiplying or adding a tensor by a scalar also does not change the shape of the tensor, where each element of the operand tensor will be added or multiplied by the scalar.

```
a = 2
X = np.arange(24).reshape(2, 3, 4)
a + X, (a * X).shape
```

```
(array([[[ 2., 3., 4., 5.],
[ 6., 7., 8., 9.],
[10., 11., 12., 13.]],
[[14., 15., 16., 17.],
[18., 19., 20., 21.],
[22., 23., 24., 25.]]]), (2, 3, 4))
```

## 2.3.6. Reduction¶

One useful operation that we can perform with arbitrary tensors is to
calculate the sum of their elements. In mathematical notation, we
express sums using the \(\sum\) symbol. To express the sum of the
elements in a vector \(\mathbf{x}\) of length \(d\), we write
\(\sum_{i=1}^d x_i\). In code, we can just call the `sum`

function.

```
x = np.arange(4)
x, x.sum()
```

```
(array([0., 1., 2., 3.]), array(6.))
```

We can express sums over the elements of tensors of arbitrary shape. For example, the sum of the elements of an \(m \times n\) matrix \(\mathbf{A}\) could be written \(\sum_{i=1}^{m} \sum_{j=1}^{n} a_{ij}\).

```
A.shape, A.sum()
```

```
((5, 4), array(190.))
```

By default, invoking the `sum`

function *reduces* a tensor along all
its axes to a scalar. We can also specify the axes along which the
tensor is reduced via summation. Take matrices as an example. To reduce
the row dimension (axis \(0\)) by summing up elements of all the
rows, we specify `axis=0`

when invoking `sum`

. Since the input
matrix reduces along axis \(0\) to generate the output vector, the
dimension of axis \(0\) of the input is lost in the output shape.

```
A_sum_axis0 = A.sum(axis=0)
A_sum_axis0, A_sum_axis0.shape
```

```
(array([40., 45., 50., 55.]), (4,))
```

Specifying `axis=1`

will reduce the column dimension (axis \(1\))
by summing up elements of all the columns. Thus, the dimension of axis
\(1\) of the input is lost in the output shape.

```
A_sum_axis1 = A.sum(axis=1)
A_sum_axis1, A_sum_axis1.shape
```

```
(array([ 6., 22., 38., 54., 70.]), (5,))
```

Reducing a matrix along both rows and columns via summation is equivalent to summing up all the elements of the matrix.

```
A.sum(axis=[0, 1]) # Same as A.sum()
```

```
array(190.)
```

A related quantity is the *mean*, which is also called the *average*. We
calculate the mean by dividing the sum by the total number of elements.
In code, we could just call `mean`

on tensors of arbitrary shape.

```
A.mean(), A.sum() / A.size
```

```
(array(9.5), array(9.5))
```

Like `sum`

, `mean`

can also reduce a tensor along the specified
axes.

```
A.mean(axis=0), A.sum(axis=0) / A.shape[0]
```

```
(array([ 8., 9., 10., 11.]), array([ 8., 9., 10., 11.]))
```

### 2.3.6.1. Non-Reduction Sum¶

However, sometimes it can be useful to keep the number of axes unchanged
when invoking `sum`

or `mean`

by setting `keepdims=True`

.

```
sum_A = A.sum(axis=1, keepdims=True)
sum_A
```

```
array([[ 6.],
[22.],
[38.],
[54.],
[70.]])
```

For instance, since `sum_A`

still keeps its \(2\) axes after
summing each row, we can divide `A`

by `sum_A`

with broadcasting.

```
A / sum_A
```

```
array([[0. , 0.16666667, 0.33333334, 0.5 ],
[0.18181819, 0.22727273, 0.27272728, 0.3181818 ],
[0.21052632, 0.23684211, 0.2631579 , 0.28947368],
[0.22222222, 0.24074075, 0.25925925, 0.2777778 ],
[0.22857143, 0.24285714, 0.25714287, 0.27142859]])
```

If we want to calculate the cumulative sum of elements of `A`

along
some axis, say `axis=0`

(row by row), we can call the `cumsum`

function. This function will not reduce the input tensor along any axis.

```
A.cumsum(axis=0)
```

```
array([[ 0., 1., 2., 3.],
[ 4., 6., 8., 10.],
[12., 15., 18., 21.],
[24., 28., 32., 36.],
[40., 45., 50., 55.]])
```

## 2.3.7. Dot Products¶

So far, we have only performed elementwise operations, sums, and
averages. And if this was all we could do, linear algebra probably would
not deserve its own section. However, one of the most fundamental
operations is the dot product. Given two vectors
\(\mathbf{x}, \mathbf{y} \in \mathbb{R}^d\), their *dot product*
\(\mathbf{x}^\top \mathbf{y}\) (or
\(\langle \mathbf{x}, \mathbf{y} \rangle\)) is a sum over the
products of the elements at the same position:
\(\mathbf{x}^\top \mathbf{y} = \sum_{i=1}^{d} x_i y_i\).

```
y = np.ones(4)
x, y, np.dot(x, y)
```

```
(array([0., 1., 2., 3.]), array([1., 1., 1., 1.]), array(6.))
```

Note that we can express the dot product of two vectors equivalently by performing an elementwise multiplication and then a sum:

```
np.sum(x * y)
```

```
array(6.)
```

Dot products are useful in a wide range of contexts. For example, given
some set of values, denoted by a vector
\(\mathbf{x} \in \mathbb{R}^d\) and a set of weights denoted by
\(\mathbf{w} \in \mathbb{R}^d\), the weighted sum of the values in
\(\mathbf{x}\) according to the weights \(\mathbf{w}\) could be
expressed as the dot product \(\mathbf{x}^\top \mathbf{w}\). When
the weights are non-negative and sum to one (i.e.,
\(\left(\sum_{i=1}^{d} {w_i} = 1\right)\)), the dot product
expresses a *weighted average*. After normalizing two vectors to have
the unit length, the dot products express the cosine of the angle
between them. We will formally introduce this notion of *length* later
in this section.

## 2.3.8. Matrix-Vector Products¶

Now that we know how to calculate dot products, we can begin to
understand *matrix-vector products*. Recall the matrix
\(\mathbf{A} \in \mathbb{R}^{m \times n}\) and the vector
\(\mathbf{x} \in \mathbb{R}^n\) defined and visualized in
(2.3.2) and (2.3.1) respectively. Let’s
start off by visualizing the matrix \(\mathbf{A}\) in terms of its
row vectors

where each \(\mathbf{a}^\top_{i} \in \mathbb{R}^n\) is a row vector representing the \(i^\mathrm{th}\) row of the matrix \(\mathbf{A}\). The matrix-vector product \(\mathbf{A}\mathbf{x}\) is simply a column vector of length \(m\), whose \(i^\mathrm{th}\) element is the dot product \(\mathbf{a}^\top_i \mathbf{x}\):

We can think of multiplication by a matrix \(\mathbf{A}\in \mathbb{R}^{m \times n}\) as a transformation that projects vectors from \(\mathbb{R}^{n}\) to \(\mathbb{R}^{m}\). These transformations turn out to be remarkably useful. For example, we can represent rotations as multiplications by a square matrix. As we will see in subsequent chapters, we can also use matrix-vector products to describe the most intensive calculations required when computing each layer in a neural network given the values of the previous layer.

Expressing matrix-vector products in code with `ndarray`

s, we use
the same `dot`

function as for dot products. When we call
`np.dot(A, x)`

with a matrix `A`

and a vector `x`

, the
matrix-vector product is performed. Note that the column dimension of
`A`

(its length along axis \(1\)) must be the same as the
dimension of `x`

(its length).

```
A.shape, x.shape, np.dot(A, x)
```

```
((5, 4), (4,), array([ 14., 38., 62., 86., 110.]))
```

## 2.3.9. Matrix-Matrix Multiplication¶

If you have gotten the hang of dot products and matrix-vector products,
then *matrix-matrix multiplication* should be straightforward.

Say that we have two matrices \(\mathbf{A} \in \mathbb{R}^{n \times k}\) and \(\mathbf{B} \in \mathbb{R}^{k \times m}\):

Denote by \(\mathbf{a}^\top_{i} \in \mathbb{R}^k\) the row vector representing the \(i^\mathrm{th}\) row of the matrix \(\mathbf{A}\), and let \(\mathbf{b}_{j} \in \mathbb{R}^k\) be the column vector from the \(j^\mathrm{th}\) column of the matrix \(\mathbf{B}\). To produce the matrix product \(\mathbf{C} = \mathbf{A}\mathbf{B}\), it is easiest to think of \(\mathbf{A}\) in terms of its row vectors and \(\mathbf{B}\) in terms of its column vectors:

Then the matrix product \(\mathbf{C} \in \mathbb{R}^{n \times m}\) is produced as we simply compute each element \(c_{ij}\) as the dot product \(\mathbf{a}^\top_i \mathbf{b}_j\):

We can think of the matrix-matrix multiplication \(\mathbf{AB}\) as
simply performing \(m\) matrix-vector products and stitching the
results together to form an \(n \times m\) matrix. Just as with
ordinary dot products and matrix-vector products, we can compute
matrix-matrix multiplication by using the `dot`

function. In the
following snippet, we perform matrix multiplication on `A`

and `B`

.
Here, `A`

is a matrix with \(5\) rows and \(4\) columns, and
`B`

is a matrix with \(4\) rows and \(3\) columns. After
multiplication, we obtain a matrix with \(5\) rows and \(3\)
columns.

```
B = np.ones(shape=(4, 3))
np.dot(A, B)
```

```
array([[ 6., 6., 6.],
[22., 22., 22.],
[38., 38., 38.],
[54., 54., 54.],
[70., 70., 70.]])
```

Matrix-matrix multiplication can be simply called *matrix
multiplication*, and should not be confused with the Hadamard product.

## 2.3.10. Norms¶

Some of the most useful operators in linear algebra are *norms*.
Informally, the norm of a vector tells us how *big* a vector is. The
notion of *size* under consideration here concerns not dimensionality
but rather the magnitude of the components.

In linear algebra, a vector norm is a function \(f\) that maps a
vector to a scalar, satisfying a handful of properties. Given any vector
\(\mathbf{x}\), the first property says that if we scale all the
elements of a vector by a constant factor \(\alpha\), its norm also
scales by the *absolute value* of the same constant factor:

The second property is the familiar triangle inequality:

The third property simply says that the norm must be non-negative:

That makes sense, as in most contexts the smallest *size* for anything
is 0. The final property requires that the smallest norm is achieved and
only achieved by a vector consisting of all zeros.

You might notice that norms sound a lot like measures of distance. And
if you remember Euclidean distances (think Pythagoras’ theorem) from
grade school, then the concepts of non-negativity and the triangle
inequality might ring a bell. In fact, the Euclidean distance is a norm:
specifically it is the \(\ell_2\) norm. Suppose that the elements in
the \(n\)-dimensional vector \(\mathbf{x}\) are
\(x_1, \ldots, x_n\). The \(\ell_2\) *norm* of
\(\mathbf{x}\) is the square root of the sum of the squares of the
vector elements:

where the subscript \(2\) is often omitted in \(\ell_2\) norms,
i.e., \(\|\mathbf{x}\|\) is equivalent to \(\|\mathbf{x}\|_2\).
In code, we can calculate the \(\ell_2\) norm of a vector by calling
`linalg.norm`

.

```
u = np.array([3, -4])
np.linalg.norm(u)
```

```
array(5.)
```

In deep learning, we work more often with the squared \(\ell_2\)
norm. You will also frequently encounter the \(\ell_1\) *norm*,
which is expressed as the sum of the absolute values of the vector
elements:

As compared with the \(\ell_2\) norm, it is less influenced by outliers. To calculate the \(\ell_1\) norm, we compose the absolute value function with a sum over the elements.

```
np.abs(u).sum()
```

```
array(7.)
```

Both the \(\ell_2\) norm and the \(\ell_1\) norm are special
cases of the more general \(\ell_p\) *norm*:

Analogous to \(\ell_2\) norms of vectors, the *Frobenius norm* of a
matrix \(\mathbf{X} \in \mathbb{R}^{m \times n}\) is the square root
of the sum of the squares of the matrix elements:

The Frobenius norm satisfies all the properties of vector norms. It
behaves as if it were an \(\ell_2\) norm of a matrix-shaped vector.
Invoking `linalg.norm`

will calculate the Frobenius norm of a matrix.

```
np.linalg.norm(np.ones((4, 9)))
```

```
array(6.)
```

### 2.3.10.1. Norms and Objectives¶

While we do not want to get too far ahead of ourselves, we can plant
some intuition already about why these concepts are useful. In deep
learning, we are often trying to solve optimization problems: *maximize*
the probability assigned to observed data; *minimize* the distance
between predictions and the ground-truth observations. Assign vector
representations to items (like words, products, or news articles) such
that the distance between similar items is minimized, and the distance
between dissimilar items is maximized. Oftentimes, the objectives,
perhaps the most important components of deep learning algorithms
(besides the data), are expressed as norms.

## 2.3.11. More on Linear Algebra¶

In just this section, we have taught you all the linear algebra that you will need to understand a remarkable chunk of modern deep learning. There is a lot more to linear algebra and a lot of that mathematics is useful for machine learning. For example, matrices can be decomposed into factors, and these decompositions can reveal low-dimensional structure in real-world datasets. There are entire subfields of machine learning that focus on using matrix decompositions and their generalizations to high-order tensors to discover structure in datasets and solve prediction problems. But this book focuses on deep learning. And we believe you will be much more inclined to learn more mathematics once you have gotten your hands dirty deploying useful machine learning models on real datasets. So while we reserve the right to introduce more mathematics much later on, we will wrap up this section here.

If you are eager to learn more about linear algebra, you may refer to either Section 17.1 or other excellent resources [Strang, 1993][Kolter, 2008][Petersen et al., 2008].

## 2.3.12. Summary¶

Scalars, vectors, matrices, and tensors are basic mathematical objects in linear algebra.

Vectors generalize scalars, and matrices generalize vectors.

In the

`ndarray`

representation, scalars, vectors, matrices, and tensors have 0, 1, 2, and an arbitrary number of axes, respectively.A tensor can be reduced along the specified axes by

`sum`

and`mean`

.Elementwise multiplication of two matrices is called their Hadamard product. It is different from matrix multiplication.

In deep learning, we often work with norms such as the \(\ell_1\) norm, the \(\ell_2\) norm, and the Frobenius norm.

We can perform a variety of operations over scalars, vectors, matrices, and tensors with

`ndarray`

functions.

## 2.3.13. Exercises¶

Prove that the transpose of a matrix \(\mathbf{A}\)’s transpose is \(\mathbf{A}\): \((\mathbf{A}^\top)^\top = \mathbf{A}\).

Given two matrices \(\mathbf{A}\) and \(\mathbf{B}\), show that the sum of transposes is equal to the transpose of a sum: \(\mathbf{A}^\top + \mathbf{B}^\top = (\mathbf{A} + \mathbf{B})^\top\).

Given any square matrix \(\mathbf{A}\), is \(\mathbf{A} + \mathbf{A}^\top\) always symmetric? Why?

We defined the tensor

`X`

of shape (\(2\), \(3\), \(4\)) in this section. What is the output of`len(X)`

?For a tensor

`X`

of arbitrary shape, does`len(X)`

always correspond to the length of a certain axis of`X`

? What is that axis?Run

`A / A.sum(axis=1)`

and see what happens. Can you analyze the reason?When traveling between two points in Manhattan, what is the distance that you need to cover in terms of the coordinates, i.e., in terms of avenues and streets? Can you travel diagonally?

Consider a tensor with shape (\(2\), \(3\), \(4\)). What are the shapes of the summation outputs along axis \(0\), \(1\), and \(2\)?

Feed a tensor with 3 or more axes to the

`linalg.norm`

function and observe its output. What does this function compute for`ndarray`

s of arbitrary shape?