With matrix multiplication, we can extend the ways that we manipulate matrices. One method of doing this is matrix mappings and linear mappings. The idea of a matrix mapping is a function that takes in a matrix as an input, and outputs another matrix in as the output. We traditionally define a matrix mapping as

**Example:
**Let . Find and

If , then

From here, we just need to do matrix multiplication with our vector inputs, and we have our answer.

The reason we care about matrix mappings is because several matrix related applications involve multiplying matrices. If we can conclude information about these types of relations, we can conclude the same information when we apply it to other concepts. One such concept that we will see is transformations, which we can use to manipulate objects in space.

**Theorem: **Let A be a matrix, let , and let . The following statements are true:

If a function satisfies the first property, we say that it preserves addition. Similarly, if a function satisfies the second property, we say that it preserves scalar multiplication. If a function has both properties, we call it a linear mapping, since it preserves linear combinations. This means that the following statement holds:

**Example:
**Show that the mapping is a linear mapping.

To prove that this mapping is linear, we need to show that the function preserves addition and scalar multiplication.

Therefore, we can conclude that the function preserves addition.

There are a number of operations we can do with linear mappings, such as compositions and linear combinations of mappings. We are able to conclude that if we have linear mappings L and M, then and are also linear mappings. In addition to this, the composition function is a linear mapping.

Since these operations are linear mappings, we can simplify them in the following ways:

This gives us some tools to be able to combine linear operations, and manipulate them to make problems as clean as possible to solve.

## 1 thought on “Matrix and Linear Mapings”