Matrix calculation and linear transformations 線型変換 せんけいへんかん - Basic Exercises
1Exercise plan
Before computing with a
Before multiplying matrices, check dimensions and meaning. The product means first applying and then applying , so the order is part of the statement. The columns of a matrix are the images of the standard basis vectors, which is often the fastest way to identify the associated linear transformation.
For inverse and transpose questions, keep the structural rules visible: , , and a map is invertible only when it is one-to-one and onto in the square finite-dimensional setting. If a calculation fails by dimension mismatch, that is not a minor arithmetic error; it means the proposed composition is not defined.
Order note: the detailed computation of inverse matrices is treated later. In this exercise, we use only the definition: for a square matrix , an
2Check problem: linearity 線型性 せんけいせい
Define by
Show linearity by checking additivity and homogeneity.
2.1Answer example
For and ,
For a scalar ,
Therefore is a
2.2Explanation
The proof uses arbitrary vectors and scalars, not a few examples.
The additivity check compares the two full expressions
and
for arbitrary and , and the two components agree term by term. The homogeneity check also uses an arbitrary scalar . This is why the argument is a proof from the
3Problem 1
For
find and , and explain why they are defined.
3.1Answer example
Both are matrices, so addition and subtraction are defined.
3.2Explanation
Matrix sums are entrywise, so row and column counts must match.
4Problem 2
For
compute and and explain the difference.
4.1Answer example
Thus .
4.2Explanation
applies first and then . reverses the order.
The product means that the transformation represented by is applied first and the transformation represented by is applied second. Reversing the order changes the geometry: shearing and stretching in different orders generally give different outputs.
5Problem 3
A linear transformation satisfies
Find its
5.1Answer example
The representation matrix is
Then
5.2Explanation
The columns of a matrix are the images of the standard basis vectors, and matrix multiplication is a linear combination of columns.
6Problem 4
Let be and be . Decide whether , , , and are defined.
6.1Answer example
is defined and has size . is not defined. Since is , is not defined. is also not defined.
6.2Explanation
For a product, the number of columns of the left matrix must equal the number of rows of the right matrix. Recheck sizes after transposition.
7Problem 5
Let be . Explain and from sizes and transformations. Also state what and represent.
7.1Answer example
is the identity on and is the identity on . Thus does nothing before , and does nothing after . Both equal .
Multiplying by a zero matrix of suitable size sends everything to zero.
7.2Explanation
The identity matrix preserves information; the zero matrix collapses all input differences. Therefore composing with an identity matrix leaves the transformation unchanged, while composing with a zero matrix can drastically change later invariants such as rank and kernel. Rank and kernel are later vocabulary here; in this problem, the main distinction is that identity keeps the transformation and zero destroys input information.
8Supplementary problems: operations and transpose
8.1Problem 6
Why is the sum of two matrices defined?
8.2Answer example
Matrix addition is entrywise, so the row and column counts must match; both are .
8.3Problem 7
For , compute .
8.4Answer example
8.5Problem 8
Compare the sizes of and .
8.6Answer example
The first is and the second is .
8.7Problem 9
What is the size of the product of a matrix and a matrix?
8.8Answer example
The product is defined and has size .
8.9Problem 10
For and , compute .
8.10Answer example
8.11Problem 11
Give an example where matrix multiplication is not
8.12Answer example
For and ,
8.13Problem 12
Find for .
8.14Answer example
8.15Problem 13
For to hold, what number of rows must have?
8.16Answer example
Since is , must have 2 rows.
8.17Problem 14
Why does order reverse in ?
8.18Answer example
means first and then . Transposition swaps row and column roles, so the composition is read back in the reversed order.
8.19Problem 15
Preview note: rank, row space, and column space are developed in the later rank lectures and exercises. Read this problem as an advanced check of how transpose exchanges rows and columns.
Explain why .
8.20Answer example
The row space of corresponds to the column space of , and row rank equals column rank. Therefore .
8.21Problem 16
Preview note:
For , apply to get . What column operation changes into ?
8.22Answer example
Since , the operation is .
8.23Problem 17
For
compute and .
8.24Answer example
, so . Also , so .
8.25Problem 18
For
confirm that the columns of are .
8.26Answer example
Thus .
9Related lectures
data/lecture/math/linear-algebra/linearity-basics.lecture.n.md data/lecture/math/linear-algebra/matrix-operations.lecture.n.md data/lecture/math/linear-algebra/meaning-of-matrix-multiplication.lecture.n.md data/lecture/math/linear-algebra/identity-zero-and-transpose-matrices.lecture.n.md data/lecture/math/linear-algebra/complex-inner-products-and-unitary-matrices.lecture.n.md data/lecture/math/linear-algebra/linear-maps-and-matrices.lecture.n.md10Proof exercise: matrix products and inverse matrices
10.1Problem
Prove using the column viewpoint. Also prove that an inverse matrix, if it exists, is unique.
10.2Answer
Let the columns of be . Then . By linearity,
The -th column of is , so gives the same expression.
If are both inverses of , then
10.3Explanation
Matrix product is composition of linear maps, and an inverse matrix is the unique map that undoes the composition.