## Section LT Linear Transformations

Early in Chapter VS we prefaced the definition of a vector space with the comment that it was “one of the two most important definitions in the entire course.” Here comes the other. Any capsule summary of linear algebra would have to describe the subject as the interplay of linear transformations and vector spaces. Here we go.

### Subsection LT Linear Transformations

###### Definition LT. Linear Transformation.

A linear transformation, \(\ltdefn{T}{U}{V}\text{,}\) is a function that carries elements of the vector space \(U\) (called the domain) to the vector space \(V\) (called the codomain), and which has two additional properties

- \(\lteval{T}{\vect{u}_1+\vect{u}_2}=\lteval{T}{\vect{u}_1}+\lteval{T}{\vect{u}_2}\) for all \(\vect{u}_1,\,\vect{u}_2\in U\text{.}\)
- \(\lteval{T}{\alpha\vect{u}}=\alpha\lteval{T}{\vect{u}}\) for all \(\vect{u}\in U\) and all \(\alpha\in\complexes\text{.}\)

The two defining conditions in the definition of a linear transformation should “feel linear,” whatever that means. Conversely, these two conditions could be taken as *exactly* what it means *to be* linear. As every vector space property derives from vector addition and scalar multiplication, so too, every property of a linear transformation derives from these two defining properties. While these conditions may be reminiscent of how we test subspaces, they really are quite different, so do not confuse the two.

Here are two diagrams that convey the essence of the two defining properties of a linear transformation. In each case, begin in the upper left-hand corner, and follow the arrows around the rectangle to the lower-right hand corner, taking two different routes and doing the indicated operations labeled on the arrows. There are two results there. For a linear transformation these two expressions are always equal.

A couple of words about notation. \(T\) is the *name* of the linear transformation, and should be used when we want to discuss the function as a whole. \(\lteval{T}{\vect{u}}\) is how we talk about the output of the function, it is a vector in the vector space \(V\text{.}\) When we write \(\lteval{T}{\vect{x}+\vect{y}}=\lteval{T}{\vect{x}}+\lteval{T}{\vect{y}}\text{,}\) the plus sign on the left is the operation of vector addition in the vector space \(U\text{,}\) since \(\vect{x}\) and \(\vect{y}\) are elements of \(U\text{.}\) The plus sign on the right is the operation of vector addition in the vector space \(V\text{,}\) since \(\lteval{T}{\vect{x}}\) and \(\lteval{T}{\vect{y}}\) are elements of the vector space \(V\text{.}\) These two instances of vector addition might be wildly different.

Let us examine several examples and begin to form a catalog of known linear transformations to work with.

###### Example ALT. A linear transformation.

Define \(\ltdefn{T}{\complex{3}}{\complex{2}}\) by describing the output of the function for a generic input with the formula

and check the two defining properties. We have

and

\begin{align*} \lteval{T}{\alpha\vect{x}} &=\lteval{T}{\alpha\colvector{x_1\\x_2\\x_3}} =\lteval{T}{\colvector{\alpha x_1\\\alpha x_2\\\alpha x_3}}\\ &=\colvector{2(\alpha x_1)+(\alpha x_3)\\-4(\alpha x_2)} =\colvector{\alpha(2x_1+x_3)\\\alpha(-4x_2)} =\alpha\colvector{2x_1+x_3\\-4x_2}\\ &=\alpha\lteval{T}{\colvector{x_1\\x_2\\x_3}} =\alpha\lteval{T}{\vect{x}}\text{.} \end{align*}So by Definition LT, \(T\) is a linear transformation.

It can be just as instructive to look at functions that are *not* linear transformations. Since the defining conditions must be true for *all* vectors and scalars, it is enough to find just one situation where the properties fail.

###### Example NLT. Not a linear transformation.

Define \(\ltdefn{S}{\complex{3}}{\complex{3}}\) by

This function “looks” linear, but consider

while

\begin{align*} \lteval{S}{3\,\colvector{1\\2\\3}}&=\lteval{S}{\colvector{3\\6\\9}}=\colvector{24\\0\\28}\text{.} \end{align*}So the second required property fails for the choice of \(\alpha=3\) and \(\vect{x}=\colvector{1\\2\\3}\) and by Definition LT, \(S\) is not a linear transformation. It is just about as easy to find an example where the first defining property fails (try it!). Notice that it is the “-2” in the third component of the definition of \(S\) that prevents the function from being a linear transformation.

###### Example LTPM. Linear transformation, polynomials to matrices.

Define a linear transformation \(\ltdefn{T}{P_3}{M_{22}}\) by

We verify the two defining conditions of a linear transformation. We have

and

\begin{align*} \lteval{T}{\alpha\vect{x}}&=\lteval{T}{\alpha(a+bx+cx^2+dx^3)}\\ &=\lteval{T}{(\alpha a)+(\alpha b)x+(\alpha c)x^2+(\alpha d)x^3}\\ &=\begin{bmatrix} (\alpha a)+(\alpha b)&(\alpha a)-2(\alpha c)\\ \alpha d&(\alpha b)-(\alpha d) \end{bmatrix}\\ &=\begin{bmatrix} \alpha(a+b)&\alpha(a-2c)\\ \alpha d&\alpha(b-d) \end{bmatrix}\\ &=\alpha\begin{bmatrix}a+b&a-2c\\d&b-d\end{bmatrix}\\ &=\alpha\lteval{T}{a+bx+cx^2+dx^3}\\ &=\alpha\lteval{T}{\vect{x}}\text{.} \end{align*}So by Definition LT, \(T\) is a linear transformation.

###### Example LTPP. Linear transformation, polynomials to polynomials.

Define a function \(\ltdefn{S}{P_4}{P_5}\) by

Then

So by Definition LT, \(S\) is a linear transformation.

Linear transformations have many amazing properties, which we will investigate through the next few sections. However, as a taste of things to come, here is a theorem we can prove now and put to use immediately.

###### Theorem LTTZZ. Linear Transformations Take Zero to Zero.

Suppose \(\ltdefn{T}{U}{V}\) is a linear transformation. Then \(\lteval{T}{\zerovector}=\zerovector\text{.}\)

###### Proof.

The two zero vectors in the conclusion of the theorem are different. The first is from \(U\) while the second is from \(V\text{.}\) We will subscript the zero vectors in this proof to highlight the distinction. Think about your objects. (This proof is contributed by Mark Shoemaker). We have

Return to Example NLT and compute \(\lteval{S}{\colvector{0\\0\\0}}=\colvector{0\\0\\-2}\) to quickly see again that \(S\) is not a linear transformation, while in Example LTPM compute

as an example of Theorem LTTZZ at work.

###### Sage LTS. Linear Transformations, Symbolic.

There are several ways to create a linear transformation in Sage, and many natural operations on these objects are possible. As previously, rather than use the complex numbers as our number system, we will instead use the rational numbers, since Sage can model them exactly. We will also use the following transformation repeatedly for examples, when no special properties are required:

To create this linear transformation in Sage, we first create a “symbolic” function, which requires that we also first define some symbolic variables which are `x1`

, `x2`

and `x3`

in this case. (You can bypass the intermediate variable `outputs`

in your own work. We will use it consistently to allow us to spread the definition across several lines without the Sage preparser getting in the way. In other words, it is safe to combine the the two lines below and not use `outputs`

.)

You can experiment with `T_symbolic`

, evaluating it at triples of rational numbers, and perhaps doing things like calculating its partial derivatives. We will use it as input to the `linear_transformation()`

constructor. We just need to specify carefully the domain and codomain, now as vector spaces over the rationals rather than the complex numbers.

You can now, of course, experiment with `T`

via tab-completion, but we will explain the various properties of Sage linear transformations as we work through this chapter. Even some seemingly simple operations, such as printing `T`

will require some explanation. But for starters, we can evaluate `T`

.

Here is a small verification of Theorem LTTZZ.

Note that Sage will recognize some symbolic functions as not being linear transformations (in other words, inconsistent with Definition LT), but this detection is fairly easy to fool. We will see some safer ways to create a linear transformation shortly.

### Subsection LTC Linear Transformation Cartoons

Throughout this chapter, and Chapter R, we will include drawings of linear transformations. We will call them “cartoons,” not because they are humorous, but because they will only expose a portion of the truth. A Bugs Bunny cartoon might give us some insights on human nature, but the rules of physics and biology are routinely (and grossly) violated. So it will be with our linear transformation cartoons. Here is our first, followed by a guide to help you understand how these are meant to describe fundamental truths about linear transformations, while simultaneously violating other truths.

Here we picture a linear transformation \(\ltdefn{T}{U}{V}\text{,}\) where this information will be consistently displayed along the bottom edge. The ovals are meant to represent the vector spaces, in this case \(U\text{,}\) the domain, on the left and \(V\text{,}\) the codomain, on the right. Of course, vector spaces are typically infinite sets, so you will have to imagine that characteristic of these sets. A small dot inside of an oval will represent a vector within that vector space, sometimes with a name, sometimes not (in this case every vector has a name). The sizes of the ovals are meant to be proportional to the dimensions of the vector spaces. However, when we make no assumptions about the dimensions, we will draw the ovals as the same size, as we have done here (which is not meant to suggest that the dimensions have to be equal).

To convey that the linear transformation associates a certain input with a certain output, we will draw an arrow from the input to the output. So, for example, in this cartoon we suggest that \(\lteval{T}{\vect{x}}=\vect{y}\text{.}\) Nothing in the definition of a linear transformation prevents two different inputs being sent to the same output and we see this in \(\lteval{T}{\vect{u}}=\vect{v}=\lteval{T}{\vect{w}}\text{.}\) Similarly, an output may not have any input being sent its way, as illustrated by no arrow pointing at \(\vect{t}\text{.}\) In this cartoon, we have captured the essence of our one general theorem about linear transformations, Theorem LTTZZ, \(\lteval{T}{\zerovector_U}=\zerovector_V\text{.}\) On occasion we might include this basic fact when it is relevant, at other times maybe not. Note that the definition of a linear transformation requires that it be a function, so every element of the domain should be associated with some element of the codomain. This will be reflected by never having an element of the domain without an arrow originating there.

These cartoons are of course no substitute for careful definitions and proofs, but they can be a handy way to think about the various properties we will be studying.

### Subsection MLT Matrices and Linear Transformations

If you give me a matrix, then I can quickly build you a linear transformation. Always. First a motivating example and then the theorem.

###### Example LTM. Linear transformation from a matrix.

Let

and define a function \(\ltdefn{P}{\complex{4}}{\complex{3}}\) by

So we are using an old friend, the matrix-vector product (Definition MVP) as a way to convert a vector with 4 components into a vector with 3 components. Applying Definition MVP allows us to write the defining formula for \(P\) in a slightly different form,

So we recognize the action of the function \(P\) as using the components of the vector (\(x_1,\,x_2,\,x_3,\,x_4\)) as scalars to form the output of \(P\) as a linear combination of the four columns of the matrix \(A\text{,}\) which are all members of \(\complex{3}\text{,}\) so the result is a vector in \(\complex{3}\text{.}\) We can rearrange this expression further, using our definitions of operations in \(\complex{3}\) (Section VO). We have

You might recognize this final expression as being similar in style to some previous examples (Example ALT) and some linear transformations defined in the archetypes (Archetype M through Archetype R). But the expression that says the output of this linear transformation is a linear combination of the columns of \(A\) is probably the most powerful way of thinking about examples of this type.

Almost forgot — we should verify that \(P\) is indeed a linear transformation. This is easy with two matrix properties from Section MM. We have

and

\begin{align*} \lteval{P}{\alpha\vect{x}} &=A\left(\alpha\vect{x}\right)&& \text{Definition of }P\\ &=\alpha\left(A\vect{x}\right)&& \knowl{./knowl/theorem-MMSMM.html}{\text{Theorem MMSMM}}\\ &=\alpha\lteval{P}{\vect{x}}&& \text{Definition of }P\text{.} \end{align*}So by Definition LT, \(P\) is a linear transformation.

So the multiplication of a vector by a matrix “transforms” the input vector into an output vector, possibly of a different size, by performing a linear combination. And this transformation happens in a “linear” fashion. This “functional” view of the matrix-vector product is the most important shift you can make right now in how you think about linear algebra. Here is the theorem, whose proof is very nearly an exact copy of the verification in the last example.

###### Theorem MBLT. Matrices Build Linear Transformations.

Suppose that \(A\) is an \(m\times n\) matrix. Define a function \(\ltdefn{T}{\complex{n}}{\complex{m}}\) by \(\lteval{T}{\vect{x}}=A\vect{x}\text{.}\) Then \(T\) is a linear transformation.

###### Proof.

We have

and

\begin{align*} \lteval{T}{\alpha\vect{x}} &=A\left(\alpha\vect{x}\right)&& \text{Definition of }T\\ &=\alpha\left(A\vect{x}\right)&& \knowl{./knowl/theorem-MMSMM.html}{\text{Theorem MMSMM}}\\ &=\alpha\lteval{T}{\vect{x}}&& \text{Definition of }T\text{.} \end{align*}So by Definition LT, \(T\) is a linear transformation.

So Theorem MBLT gives us a rapid way to construct linear transformations. Grab an \(m\times n\) matrix \(A\text{,}\) define \(\lteval{T}{\vect{x}}=A\vect{x}\) and Theorem MBLT tells us that \(T\) is a linear transformation from \(\complex{n}\) to \(\complex{m}\text{,}\) without any further checking.

We can turn Theorem MBLT around. You give me a linear transformation and I will give you a matrix.

###### Example MFLT. Matrix from a linear transformation.

Define the function \(\ltdefn{R}{\complex{3}}{\complex{4}}\) by

You could verify that \(R\) is a linear transformation by applying the definition, but we will instead massage the expression defining a typical output until we recognize the form of a known class of linear transformations. We have

So if we define the matrix

then \(\lteval{R}{\vect{x}}=B\vect{x}\text{.}\) By Theorem MBLT, we can easily recognize \(R\) as a linear transformation since it has the form described in the hypothesis of the theorem.

Example MFLT was not an accident. Consider any one of the archetypes where both the domain and codomain are sets of column vectors (Archetype M through Archetype R) and you should be able to mimic the previous example. Here is the theorem, which is notable since it is our first occasion to use the full power of the defining properties of a linear transformation when our hypothesis includes a linear transformation.

###### Theorem MLTCV. Matrix of a Linear Transformation, Column Vectors.

Suppose that \(\ltdefn{T}{\complex{n}}{\complex{m}}\) is a linear transformation. Then there is an \(m\times n\) matrix \(A\) such that \(\lteval{T}{\vect{x}}=A\vect{x}\text{.}\)

###### Proof.

The conclusion says a certain matrix exists. What better way to prove something exists than to actually build it? So our proof will be constructive (Proof Technique C), and the procedure that we will use abstractly in the proof can be used concretely in specific examples.

Let \(\vectorlist{e}{n}\) be the columns of the identity matrix of size \(n\text{,}\) \(I_n\) (Definition SUV). Evaluate the linear transformation \(T\) with each of these standard unit vectors as an input, and record the result. In other words, define \(n\) vectors in \(\complex{m}\text{,}\) \(\vect{A}_i\text{,}\) \(1\leq i\leq n\) by

Then package up these vectors as the columns of a matrix

Does \(A\) have the desired properties? First, \(A\) is clearly an \(m\times n\) matrix. Then

as desired.

So if we were to restrict our study of linear transformations to those where the domain and codomain are both vector spaces of column vectors (Definition VSCV), every matrix leads to a linear transformation of this type (Theorem MBLT), while every such linear transformation leads to a matrix (Theorem MLTCV). So matrices and linear transformations are fundamentally the same. We call the matrix \(A\) of Theorem MLTCV the matrix representation of \(T\text{.}\)

We have defined linear transformations for more general vector spaces than just \(\complex{m}\text{.}\) Can we extend this correspondence between linear transformations and matrices to more general linear transformations (more general domains and codomains)? Yes, and this is the main theme of Chapter R. Stay tuned. For now, let us illustrate Theorem MLTCV with an example.

###### Example MOLT. Matrix of a linear transformation.

Suppose \(\ltdefn{S}{\complex{3}}{\complex{4}}\) is defined by

Then

so define

and Theorem MLTCV guarantees that \(\lteval{S}{\vect{x}}=C\vect{x}\text{.}\)

As an illuminating exercise, repeat the computation of \(\lteval{S}{\vect{z}}\) two different ways. First, return to the definition of \(S\) and evaluate \(\lteval{S}{\vect{z}}\) directly. Then do the matrix-vector product \(C\vect{z}\text{.}\) In both cases you should obtain the same result, \(\lteval{S}{\vect{z}}\text{.}\)

###### Sage LTM. Linear Transformations, Matrices.

A second way to build a linear transformation is to use a matrix, as motivated by Theorem MBLT. But there is one caveat. We have seen that Sage has a preference for rows, so when defining a linear transformation with a product of a matrix and a vector, *Sage forms a linear combination of the rows of the matrix with the scalars of the vector*. This is expressed by writing the vector on the left of the matrix, where if we were to interpret the vector as a 1-row matrix, then the definition of matrix multiplication would do the right thing.

Remember throughout, a linear transformation has very little to do with the mechanism by which we define it. Whether or not we use matrix multiplication with vectors on the left (Sage internally) or matrix multiplication with vectors on the right (your text), what matters is the *function* that results. One concession to the “vector on the right” approach is that we can tell Sage that we mean for the matrix to define the linear transformation by multiplication with the vector on the right. Here is our running example again — with some explanation following.

The way `T`

prints reflects the way Sage carries `T`

internally. But notice that we defined `T`

in a way that is consistent with the text, via the use of the optional `side='right'`

keyword. If you rework examples from the text, or use Sage to assist with exercises, be sure to remember this option. In particular, when the matrix is square it might be easy to miss that you have forgotten this option. Note too that Sage uses a more general term for a linear transformation, “vector space morphism.” Just mentally translate from Sage-speak to the terms we use here in the text.

If the standard way that Sage prints a linear transformation is too confusing, you can get all the relevant information with a handful of commands.

So we can build a linear transformation in Sage from a matrix, as promised by Theorem MBLT. Furthermore, Theorem MLTCV says there is a matrix associated with every linear transformation. This matrix is provided in Sage by the `.matrix()`

method, where we use the option `side='right'`

to be consistent with the text. Here is Example MOLT reprised, where we define the linear transformation via a Sage symbolic function and then recover the matrix of the linear transformation.

### Subsection LTLC Linear Transformations and Linear Combinations

It is the interaction between linear transformations and linear combinations that lies at the heart of many of the important theorems of linear algebra. The next theorem distills the essence of this. The proof is not deep, the result is hardly startling, but it will be referenced frequently. We have already passed by one occasion to employ it, in the proof of Theorem MLTCV. Paraphrasing, this theorem says that we can “push” linear transformations “down into” linear combinations, or “pull” linear transformations “up out” of linear combinations. We will have opportunities to both push and pull.

###### Theorem LTLC. Linear Transformations and Linear Combinations.

Suppose that \(\ltdefn{T}{U}{V}\) is a linear transformation, \(\vectorlist{u}{t}\) are vectors from \(U\) and \(\scalarlist{a}{t}\) are scalars from \(\complexes\text{.}\) Then

###### Proof.

We have

Some authors, especially in more advanced texts, take the conclusion of Theorem LTLC as the defining condition of a linear transformation. This has the appeal of being a single condition, rather than the two-part condition of Definition LT. (See Exercise LT.T20).

Our next theorem says, informally, that it is enough to know how a linear transformation behaves for inputs from any basis of the domain, and *all* the other outputs are described by a linear combination of these few values. Again, the statement of the theorem, and its proof, are not remarkable, but the insight that goes along with it is very fundamental.

###### Theorem LTDB. Linear Transformation Defined on a Basis.

Suppose \(U\) is a vector space with basis \(B=\set{\vectorlist{u}{n}}\) and the vector space \(V\) contains the vectors \(\vectorlist{v}{n}\) (which may not be distinct). Then there is a unique linear transformation, \(\ltdefn{T}{U}{V}\text{,}\) such that \(\lteval{T}{\vect{u}_i}=\vect{v}_i\text{,}\) \(1\leq i\leq n\text{.}\)

###### Proof.

To prove the existence of \(T\text{,}\) we construct a function and show that it is a linear transformation (Proof Technique C). Suppose \(\vect{w}\in U\) is an arbitrary element of the domain. Then by Theorem VRRB there are unique scalars \(\scalarlist{a}{n}\) such that

Then *define* the function \(T\) by

It should be clear that \(T\) behaves as required for \(n\) inputs from \(B\text{.}\) Since the scalars provided by Theorem VRRB are unique, there is no ambiguity in this definition, and \(T\) qualifies as a function with domain \(U\) and codomain \(V\) (i.e. \(T\) is well-defined). But is \(T\) a linear transformation as well?

Let \(\vect{x}\in U\) be a second element of the domain, and suppose the scalars provided by Theorem VRRB (relative to \(B\)) are \(\scalarlist{b}{n}\text{.}\) Then

Let \(\alpha\in\complexes\) be any scalar. Then

So by Definition LT, \(T\) is a linear transformation.

Is \(T\) unique (among all linear transformations that take the \(\vect{u}_i\) to the \(\vect{v}_i\))? Applying Proof Technique U, we posit the existence of a second linear transformation, \(\ltdefn{S}{U}{V}\) such that \(\lteval{S}{\vect{u}_i}=\vect{v}_i\text{,}\) \(1\leq i\leq n\text{.}\) Again, let \(\vect{w}\in U\) represent an arbitrary element of \(U\) and let \(\scalarlist{a}{n}\) be the scalars provided by Theorem VRRB (relative to \(B\)). We have,

So the output of \(T\) and \(S\) agree on every input, which means they are equal as functions, \(T=S\text{.}\) So \(T\) is unique.

You might recall facts from analytic geometry, such as “any two points determine a line” and “any three non-collinear points determine a parabola.” Theorem LTDB has much of the same feel. By specifying the \(n\) outputs for inputs from a basis, an entire linear transformation is determined. The analogy is not perfect, but the style of these facts are not very dissimilar from Theorem LTDB.

Notice that the statement of Theorem LTDB asserts the *existence* of a linear transformation with certain properties, while the proof shows us exactly how to define the desired linear transformation. The next two examples show how to compute values of linear transformations that we create this way.

###### Example LTDB1. Linear transformation defined on a basis.

Consider the linear transformation \(\ltdefn{T}{\complex{3}}{\complex{2}}\) that is required to have the following three values,

Because

is a basis for \(\complex{3}\) (Theorem SUVB), Theorem LTDB says there is a unique linear transformation \(T\) that behaves this way.

How do we compute other values of \(T\text{?}\) Consider the input

Then

Doing it again,

so

Any other value of \(T\) could be computed in a similar manner. So rather than being given a *formula* for the outputs of \(T\text{,}\) the *requirement* that \(T\) behave in a certain way for the inputs chosen from a basis of the domain, is as sufficient as a formula for computing any value of the function. You might notice some parallels between this example and Example MOLT or Theorem MLTCV.

###### Example LTDB2. Linear transformation defined on a basis.

Consider the linear transformation \(\ltdefn{R}{\complex{3}}{\complex{2}}\) with the three values,

You can check that

is a basis for \(\complex{3}\) (make the vectors the columns of a square matrix and check that the matrix is nonsingular, Theorem CNMB). By Theorem LTDB we know there is a unique linear transformation \(R\) with the three specified outputs. However, we have to work just a bit harder to take an input vector and express it as a linear combination of the vectors in \(D\text{.}\)

For example, consider,

Then we must first write \(\vect{y}\) as a linear combination of the vectors in \(D\) and solve for the unknown scalars, to arrive at

Then the proof of Theorem LTDB gives us

Any other value of \(R\) could be computed in a similar manner.

Here is a third example of a linear transformation defined by its action on a basis, only with more abstract vector spaces involved.

###### Example LTDB3. Linear transformation defined on a basis.

The set

is a subspace of the vector space of polynomials \(P_3\text{.}\) This subspace has

as a basis (check this!). Suppose we consider the linear transformation \(\ltdefn{S}{P_3}{M_{22}}\) with values

By Theorem LTDB we know there is a unique linear transformation with these two values. To illustrate a sample computation of \(S\text{,}\) consider \(q(x)=9-6x-5x^2+2x^3\text{.}\) Verify that \(q(x)\) is an element of \(W\) (does it have roots at \(x=1\) and \(x=3\text{?}\)), then find the scalars needed to write it as a linear combination of the basis vectors in \(C\text{.}\) Because

The proof of Theorem LTDB gives us

And all the other outputs of \(S\) could be computed in the same manner. Every output of \(S\) will have a zero in the second row, second column. Can you see why this is so?

Informally, we can describe Theorem LTDB by saying “it is enough to know what a linear transformation does to a basis (of the domain).”

###### Sage LTB. Linear Transformations, Bases.

A third way to create a linear transformation in Sage is to provide a list of images for a basis, as motivated by Theorem LTDB. The default is to use the standard basis as the inputs (Definition SUV). We will, once again, create our running example.

Notice that there is no requirement that the list of images (in Sage or in Theorem LTDB) is a basis. They do not even have to be different. They could all be the zero vector (try it).

If we want to use an alternate basis for the domain, it is possible, but there are two caveats. The first caveat is that we must be sure to provide a basis for the domain, Sage will give an error if the proposed basis is not linearly independent and we are responsible for providing the right number of vectors (which should be easy).

We have seen that vector spaces can have alternate bases, which print as a “user basis.” Here will provide the domain with an alternate basis. The relevant command will create a subspace, but for now, we need to provide a big enough set to create the entire domain. It is possible to use fewer linearly independent vectors, and create a proper subspace, but then we will not be able to use this proper subspace to build the linear transformation we want.

We can use this alternate version of `U`

to create a linear transformation from specified images. Superficially there is nothing real special about our choices for `v1, v2, v3`

.

Now we create the linear transformation. Here is the second caveat: the matrix of the linear transformation is no longer that provided by Theorem MLTCV. It may be obvious where the matrix comes from, but a full understanding of its interpretation will have to wait until Section MR.

We suggested our choices for `v1, v2, v3`

were “random.” Not so — the linear transformation `S`

just created is equal to the linear transformation `T`

above. If you have run all the input in this subsection, in order, then you should be able to compare the *functions* `S`

and `T`

. The next command should *always* produce `True`

.

Notice that `T == S`

may not do what you expect here. Instead, the linear transformation method `.is_equal_function()`

will perform a conclusive check of equality of two linear transformations as functions.

Can you reproduce this example? In other words, define some linear transformation, any way you like. Then give the domain an alternate basis and concoct the correct images to create a second linear transformation (by the method of this subsection) which is equal to the first.

### Subsection PI Preimages

The definition of a function requires that for each input in the domain there is *exactly* one output in the codomain. However, the correspondence does not have to behave the other way around. An output from the codomain could have many different inputs from the domain which the transformation sends to that output, or there could be no inputs at all which the transformation sends to that output. To formalize our discussion of this aspect of linear transformations, we define the preimage.

###### Definition PI. Preimage.

Suppose that \(\ltdefn{T}{U}{V}\) is a linear transformation. For each \(\vect{v}\text{,}\) define the preimage of \(\vect{v}\) to be the subset of \(U\) given by

In other words, \(\preimage{T}{\vect{v}}\) is the set of all those vectors in the domain \(U\) that get “sent” to the vector \(\vect{v}\text{.}\)

###### Example SPIAS. Sample preimages, Archetype S.

Archetype S is the linear transformation defined by

We could compute a preimage for every element of the codomain \(M_{22}\text{.}\) However, even in a free textbook, we do not have the room to do that, so we will compute just two.

Choose

for no particular reason. What is \(\preimage{T}{\vect{v}}\text{?}\) Suppose \(\vect{u}=\colvector{u_1\\u_2\\u_3}\in\preimage{T}{\vect{v}}\text{.}\) The condition that \(\lteval{T}{\vect{u}}=\vect{v}\) becomes

Using matrix equality (Definition ME), we arrive at a system of four equations in the three unknowns \(u_1,\,u_2,\,u_3\) with an augmented matrix that we can row-reduce in the hunt for solutions,

We recognize this system as having infinitely many solutions described by the single free variable \(u_3\text{.}\) Eventually obtaining the vector form of the solutions (Theorem VFSLS), we can describe the preimage precisely as,

This last line is merely a suggestive way of describing the set on the previous line. You might create three or four vectors in the preimage, and evaluate \(T\) with each. Was the result what you expected? For a hint of things to come, you might try evaluating \(T\) with just the lone vector in the spanning set above. What was the result? Now take a look back at Theorem PSPHS. Hmmmm.

OK, let us compute another preimage, but with a different outcome this time.Choose

What is \(\preimage{T}{\vect{v}}\text{?}\) Suppose \(\vect{u}=\colvector{u_1\\u_2\\u_3}\in\preimage{T}{\vect{v}}\text{.}\) That \(\lteval{T}{\vect{u}}=\vect{v}\) becomes

Using matrix equality (Definition ME), we arrive at a system of four equations in the three unknowns \(u_1,\,u_2,\,u_3\) with an augmented matrix that we can row-reduce in the hunt for solutions,

By Theorem RCLS we recognize this system as inconsistent. So no vector \(\vect{u}\) is a member of \(\preimage{T}{\vect{v}}\) and so

The preimage is just a set, it is almost never a subspace of \(U\) (you might think about just when \(\preimage{T}{\vect{v}}\) is a subspace, see Exercise ILT.T10). We will describe its properties going forward, and it will be central to the main ideas of this chapter.

###### Sage PI. Preimages.

Sage handles preimages just a bit differently than our approach in the text. For the moment, we can obtain a single vector in the set that is the preimage via the `.preimage_representative()`

method. Understand that this method will return *just one* element of the preimage set, and we have no real control over which one. Also, it is certainly possible that a preimage is the empty set — in this case, the method will raise a `ValueError`

. We will use our running example to illustrate.

Remember, we have defined the preimage as a set, and Sage just gives us a single element of the set. We will see in Sage ILT that the upcoming Theorem KPI explains why this is no great shortcoming in Sage.

### Subsection NLTFO New Linear Transformations From Old

We can combine linear transformations in natural ways to create new linear transformations. So we will define these combinations and then prove that the results really are still linear transformations. First the sum of two linear transformations.

###### Definition LTA. Linear Transformation Addition.

Suppose that \(\ltdefn{T}{U}{V}\) and \(\ltdefn{S}{U}{V}\) are two linear transformations with the same domain and codomain. Then their sum is the function \(\ltdefn{T+S}{U}{V}\) whose outputs are defined by

Notice that the first plus sign in the definition is the operation being defined, while the second one is the vector addition in \(V\text{.}\) (Vector addition in \(U\) will appear just now in the proof that \(T+S\) is a linear transformation.) Definition LTA only provides a function. It would be nice to know that when the constituents (\(T\text{,}\) \(S\)) are linear transformations, then so too is \(T+S\text{.}\)

###### Theorem SLTLT. Sum of Linear Transformations is a Linear Transformation.

Suppose that \(\ltdefn{T}{U}{V}\) and \(\ltdefn{S}{U}{V}\) are two linear transformations with the same domain and codomain. Then \(\ltdefn{T+S}{U}{V}\) is a linear transformation.

###### Proof.

We simply check the defining properties of a linear transformation (Definition LT). This is a good place to consistently ask yourself which objects are being combined with which operations. We have

and

\begin{align*} \lteval{(T+S)}{\alpha\vect{x}}&= \lteval{T}{\alpha\vect{x}}+\lteval{S}{\alpha\vect{x}}&& \knowl{./knowl/definition-LTA.html}{\text{Definition LTA}}\\ &=\alpha\lteval{T}{\vect{x}}+\alpha\lteval{S}{\vect{x}}&& \knowl{./knowl/definition-LT.html}{\text{Definition LT}}\\ &=\alpha\left(\lteval{T}{\vect{x}}+\lteval{S}{\vect{x}}\right)&& \knowl{./knowl/property-DVA.html}{\text{Property DVA}}\text{ in }V\\ &=\alpha\lteval{(T+S)}{\vect{x}}&& \knowl{./knowl/definition-LTA.html}{\text{Definition LTA}}\text{.} \end{align*}###### Example STLT. Sum of two linear transformations.

Suppose that \(\ltdefn{T}{\complex{2}}{\complex{3}}\) and \(\ltdefn{S}{\complex{2}}{\complex{3}}\) are defined by

Then by Definition LTA, we have

and by Theorem SLTLT we know \(T+S\) is also a linear transformation from \(\complex{2}\) to \(\complex{3}\text{.}\)

###### Definition LTSM. Linear Transformation Scalar Multiplication.

Suppose that \(\ltdefn{T}{U}{V}\) is a linear transformation and \(\alpha\in\complexes\text{.}\) Then the scalar multiple is the function \(\ltdefn{\alpha T}{U}{V}\) whose outputs are defined by

Given that \(T\) is a linear transformation, it would be nice to know that \(\alpha T\) is also a linear transformation.

###### Theorem MLTLT. Multiple of a Linear Transformation is a Linear Transformation.

Suppose that \(\ltdefn{T}{U}{V}\) is a linear transformation and \(\alpha\in\complexes\text{.}\) Then \(\ltdefn{(\alpha T)}{U}{V}\) is a linear transformation.

###### Proof.

We simply check the defining properties of a linear transformation (Definition LT). This is another good place to consistently ask yourself which objects are being combined with which operations. We have

and

\begin{align*} \lteval{(\alpha T)}{\beta\vect{x}}&= \alpha\lteval{T}{\beta\vect{x}}&& \knowl{./knowl/definition-LTSM.html}{\text{Definition LTSM}}\\ &=\alpha\left(\beta\lteval{T}{\vect{x}}\right)&& \knowl{./knowl/definition-LT.html}{\text{Definition LT}}\\ &=\left(\alpha\beta\right)\lteval{T}{\vect{x}}&& \knowl{./knowl/property-SMA.html}{\text{Property SMA}}\text{ in }V\\ &=\left(\beta\alpha\right)\lteval{T}{\vect{x}}&& \text{Commutativity}\\ &=\beta\left(\alpha\lteval{T}{\vect{x}}\right)&& \knowl{./knowl/property-SMA.html}{\text{Property SMA}}\text{ in }V\\ &=\beta\left(\lteval{(\alpha T)}{\vect{x}}\right)&& \knowl{./knowl/definition-LTSM.html}{\text{Definition LTSM}}\text{.} \end{align*}###### Example SMLT. Scalar multiple of a linear transformation.

Suppose that \(\ltdefn{T}{\complex{4}}{\complex{3}}\) is defined by

For the sake of an example, choose \(\alpha=2\text{,}\) so by Definition LTSM, we have

and by Theorem MLTLT we know \(2T\) is also a linear transformation from \(\complex{4}\) to \(\complex{3}\text{.}\)

Now, let us imagine we have two vector spaces, \(U\) and \(V\text{,}\) and we collect every possible linear transformation from \(U\) to \(V\) into one big set, and call it \(\vslt{U}{V}\text{.}\) Definition LTA and Definition LTSM tell us how we can “add” and “scalar multiply” two elements of \(\vslt{U}{V}\text{.}\) Theorem SLTLT and Theorem MLTLT tell us that if we do these operations, then the resulting functions are linear transformations that are also in \(\vslt{U}{V}\text{.}\) Hmmmm, sounds like a vector space to me! A set of objects, an addition and a scalar multiplication. Why not?

###### Theorem VSLT. Vector Space of Linear Transformations.

Suppose that \(U\) and \(V\) are vector spaces. Then the set of all linear transformations from \(U\) to \(V\text{,}\) \(\vslt{U}{V}\text{,}\) is a vector space when the operations are those given in Definition LTA and Definition LTSM.

###### Proof.

Theorem SLTLT and Theorem MLTLT provide two of the ten properties in Definition VS. However, we still need to verify the remaining eight properties. By and large, the proofs are straightforward and rely on concocting the obvious object, or by reducing the question to the same vector space property in the vector space \(V\text{.}\)

The zero vector is of some interest, though. What linear transformation would we add to any other linear transformation, so as to keep the second one unchanged? The answer is \(\ltdefn{Z}{U}{V}\) defined by \(\lteval{Z}{\vect{u}}=\zerovector_V\) for every \(\vect{u}\in U\text{.}\) Notice how we do not need to know any of the specifics about \(U\) and \(V\) to make this definition of \(Z\text{.}\)

###### Definition LTC. Linear Transformation Composition.

Suppose that \(\ltdefn{T}{U}{V}\) and \(\ltdefn{S}{V}{W}\) are linear transformations. Then the composition of \(S\) and \(T\) is the function \(\ltdefn{(\compose{S}{T})}{U}{W}\) whose outputs are defined by

Given that \(T\) and \(S\) are linear transformations, it would be nice to know that \(\compose{S}{T}\) is also a linear transformation.

###### Theorem CLTLT. Composition of Linear Transformations is a Linear Transformation.

Suppose that \(\ltdefn{T}{U}{V}\) and \(\ltdefn{S}{V}{W}\) are linear transformations. Then \(\ltdefn{(\compose{S}{T})}{U}{W}\) is a linear transformation.

###### Proof.

We simply check the defining properties of a linear transformation (Definition LT). We have

and

\begin{align*} \lteval{(\compose{S}{T})}{\alpha\vect{x}} &=\lteval{S}{\lteval{T}{\alpha\vect{x}}}&& \knowl{./knowl/definition-LTC.html}{\text{Definition LTC}}\\ &=\lteval{S}{\alpha\lteval{T}{\vect{x}}}&& \knowl{./knowl/definition-LT.html}{\text{Definition LT}}\text{ for }T\\ &=\alpha\lteval{S}{\lteval{T}{\vect{x}}}&& \knowl{./knowl/definition-LT.html}{\text{Definition LT}}\text{ for }S\\ &=\alpha\lteval{(\compose{S}{T})}{\vect{x}}&& \knowl{./knowl/definition-LTC.html}{\text{Definition LTC}}\text{.} \end{align*}###### Example CTLT. Composition of two linear transformations.

Suppose that \(\ltdefn{T}{\complex{2}}{\complex{4}}\) and \(\ltdefn{S}{\complex{4}}{\complex{3}}\) are defined by

Then by Definition LTC

and by Theorem CLTLT \(\compose{S}{T}\) is a linear transformation from \(\complex{2}\) to \(\complex{3}\text{.}\)

Here is an interesting exercise that will presage an important result later. In Example STLT compute (via Theorem MLTCV) the matrix of \(T\text{,}\) \(S\) and \(T+S\text{.}\) Do you see a relationship between these three matrices?

In Example SMLT compute (via Theorem MLTCV) the matrix of \(T\) and \(2T\text{.}\) Do you see a relationship between these two matrices?

Here is the tough one. In Example CTLT compute (via Theorem MLTCV) the matrix of \(T\text{,}\) \(S\) and \(\compose{S}{T}\text{.}\) Do you see a relationship between these three matrices???

###### Sage OLT. Operations on Linear Transformations.

It is possible in Sage to add linear transformations (Definition LTA), multiply them by scalars (Definition LTSM) and compose (Definition LTC) them. Then Theorem SLTLT Theorem MLTLT, and Theorem CLTLT (respectively) tell us the results are again linear transformations. Here are some examples:

Perhaps the only surprise in all this is the necessity of writing scalar multiplication on the right of the linear transformation (rather on the left, as we do in the text). We will recycle the linear transformation `T`

from above and redefine `S`

to form an example of composition.

We use the star symbol (`*`

) to indicate composition of linear transformations. Notice that the order of the two linear transformations we compose is important, and Sage's order agrees with the text. The order does not have to agree, and there are good arguments to have it reversed, so be careful if you read about composition elsewhere.

This is a good place to expand on Theorem VSLT, which says that with definitions of addition and scalar multiplication of linear transformations we then arrive at a vector space. A vector space full of linear transformations. Objects in Sage have “parents” — vectors have vector spaces for parents, fractions of integers have the rationals as parents. What is the parent of a linear transformation? Let us see, by investigating the parent of `S`

just defined above.

“Morphism” is a general term for a function that “preserves structure” or “respects operations.” In Sage a collection of morphisms is referenced as a “homset” or a “homspace.” In this example, we have a homset that is the vector space of linear transformations that go from a dimension 2 vector space over the rationals to a dimension 3 vector space over the rationals. What can we do with it? A few things, but not everything you might imagine. It does have a basis, containing a few very simple linear transformations:

You can create a set of linear transformations with the `Hom()`

function, simply by giving the domain and codomain.

An understanding of Sage's homsets is not critical to understanding the use of Sage during the remainder of this course. But such an understanding can be very useful in understanding some of Sage's more advanced and powerful features.

### Reading Questions LT Reading Questions

###### 1.

Is the function below a linear transformation? Why or why not?

###### 2.

Determine the matrix representation of the linear transformation \(S\) below.

###### 3.

Theorem LTLC has a fairly simple proof. Yet the result itself is very powerful. Comment on why we might say this.

### Exercises LT Exercises

###### C15.

The archetypes below are all linear transformations whose domains and codomains are vector spaces of column vectors (Definition VSCV). For each one, compute the matrix representation described in the proof of Theorem MLTCV.

Archetype M, Archetype N, Archetype O, Archetype P, Archetype Q, Archetype R

###### C16.

Find the matrix representation of \(\ltdefn{T}{\complex{3}}{\complex{4}}\text{,}\) \(\lteval{T}{\colvector{x\\y\\z}} = \colvector{3x + 2y + z\\ x + y + z \\ x - 3y \\2x + 3y + z }\text{.}\)

\(A_T = \begin{bmatrix} 3 & 2 & 1\\ 1 & 1 & 1\\ 1 & -3 & 0\\ 2 & 3 & 1\end{bmatrix}\text{.}\)

###### C20.

Let \(\vect{w}=\colvector{-3\\1\\4}\text{.}\) Referring to Example MOLT, compute \(\lteval{S}{\vect{w}}\) two different ways. First use the definition of \(S\text{,}\) then compute the matrix-vector product \(C\vect{w}\) (Definition MVP).

In both cases the result will be \(\lteval{S}{\vect{w}}=\colvector{9\\2\\-9\\4}\text{.}\)

###### C25.

Define the linear transformation

Verify that \(T\) is a linear transformation.

We can rewrite \(T\) as follows:

and Theorem MBLT tell us that any function of this form is a linear transformation.

###### C26.

Verify that the function below is a linear transformation.

Check the two conditions of Definition LT.

and

\begin{align*} \lteval{T}{\alpha\vect{u}} &=\lteval{T}{\alpha\left(a+bx+cx^2\right)}\\ &=\lteval{T}{\left(\alpha a\right)+\left(\alpha b\right)x+\left(\alpha c\right)x^2}\\ &=\colvector{2(\alpha a)-(\alpha b)\\(\alpha b)+(\alpha c)}\\ &=\colvector{\alpha(2a-b)\\\alpha(b+c)}\\ &=\alpha\colvector{2a-b\\b+c}\\ &=\alpha\lteval{T}{\vect{u}}\text{.} \end{align*}So \(T\) is indeed a linear transformation.

###### C30.

Define the linear transformation

Compute the preimages, \(\preimage{T}{\colvector{2\\3}}\) and \(\preimage{T}{\colvector{4\\-8}}\text{.}\)

For the first preimage, we want \(\vect{x}\in\complex{3}\) such that \(\lteval{T}{\vect{x}}=\colvector{2\\3}\text{.}\) This becomes,

Vector equality gives a system of two linear equations in three variables, represented by the augmented matrix

so the system is inconsistent and the preimage is the empty set. For the second preimage the same procedure leads to an augmented matrix with a different vector of constants

This system is consistent and has infinitely many solutions, as we can see from the presence of the two free variables (\(x_2\) and \(x_3\)) both to zero. We apply Theorem VFSLS to obtain

###### C31.

For the linear transformation \(S\) compute the preimages.

We work from the definition of the preimage, Definition PI. Setting

we arrive at a system of three equations in three variables, with an augmented matrix that we row-reduce in a search for solutions,

With a leading 1 in the last column, this system is inconsistent (Theorem RCLS), and there are no values of \(a\text{,}\) \(b\) and \(c\) that will create an element of the preimage. So the preimage is the empty set.

We work from the definition of the preimage, Definition PI. Setting

we arrive at a system of three equations in three variables, with an augmented matrix that we row-reduce in a search for solutions,

The solution set to this system, which is also the desired preimage, can be expressed using the vector form of the solutions (Theorem VFSLS)

Does the final expression for this set remind you of Theorem KPI?

###### C40.

If \(\ltdefn{T}{\complex{2}}{\complex{2}}\) satisfies \(\lteval{T}{\colvector{2\\1}} = \colvector{3\\4}\) and \(\lteval{T}{\colvector{1\\1}} = \colvector{-1\\2}\text{,}\) find \(\lteval{T}{\colvector{4\\3}}\text{.}\)

Since \(\colvector{4\\3}= \colvector{2\\1} + 2\colvector{1\\1}\text{,}\) we have

###### C41.

If \(\ltdefn{T}{\complex{2}}{\complex{3}}\) satisfies \(\lteval{T}{\colvector{2\\3}} = \colvector{2\\2\\1}\) and \(\lteval{T}{\colvector{3\\4}} = \colvector{-1\\0\\2}\text{,}\) find the matrix representation of \(T\text{.}\)

First, we need to write the standard basis vectors \(\vect{e}_1\) and \(\vect{e}_2\) as linear combinations of \(\colvector{2\\3}\) and \(\colvector{3\\4}\text{.}\) Starting with \(\vect{e}_1\text{,}\) we see that \(\vect{e}_1 = -4\colvector{2\\3} + 3\colvector{3\\4}\text{,}\) so we have

Repeating the process for \(\vect{e}_2\text{,}\) we have \(\vect{e}_2 = 3\colvector{2\\3} - 2\colvector{3\\4}\text{,}\) and we then see that

Thus, the matrix representation of \(T\) is \(A_T = \begin{bmatrix} -11 & 8\\ -8 & 6\\2 & -1 \end{bmatrix}\text{.}\)

###### C42.

Define \(\ltdefn{T}{M_{22}}{\complex{1}}\) by \(\lteval{T}{\begin{bmatrix} a & b \\ c & d \end{bmatrix}} = a + b + c - d\text{.}\) Find the preimage \(\preimage{T}{3}\text{.}\)

The preimage \(\preimage{T}{3}\) is the set of all matrices \(\begin{bmatrix} a & b\\c & d\end{bmatrix}\) so that \(\lteval{T}{\begin{bmatrix}a & b \\ c & d \end{bmatrix}} = 3\text{.}\) A matrix \(\begin{bmatrix} a & b\\ c & d \end{bmatrix}\) is in the preimage if \(a + b + c - d = 3\text{,}\) i.e. \(d = a + b + c - 3\text{.}\) This is the set. (But the set is *not* a vector space. Why not?)

###### C43.

Define \(\ltdefn{T}{P_3}{P_2}\) by \(\lteval{T}{a + bx + cx^2 + dx^3} = b + 2cx + 3dx^2\text{.}\) Find the preimage of \(\zerovector\text{.}\) Does this linear transformation seem familiar?

The preimage \(\preimage{T}{\zerovector}\) is the set of all polynomials \(a + bx + cx^2 + dx^3\) so that \(\lteval{T}{a + bx + cx^2 + dx^3} = \zerovector\text{.}\) Thus, \(b + 2cx + 3dx^2 = 0+0x+0x^2+0x^3\text{,}\) since \(0+0x+0x^2+0x^3\) is the zero polynomial of \(P_3\text{.}\) In order to satisfy this equation, we must have \(b = 0\text{,}\) \(c = 0\text{,}\) and \(d = 0\text{.}\) Thus, \(\preimage{T}{\zerovector}\) is precisely the set of all constant polynomials – polynomials of degree 0. Symbolically, this is \(\preimage{T}{\zerovector} = \setparts{a}{a\in\complexes}\text{.}\)

Does this seem familiar? What other operation sends constant functions to 0?

###### M10.

Define two linear transformations, \(\ltdefn{T}{\complex{4}}{\complex{3}}\) and \(\ltdefn{S}{\complex{3}}{\complex{2}}\) by

Using the proof of Theorem MLTCV compute the matrix representations of the three linear transformations \(T\text{,}\) \(S\) and \(\compose{S}{T}\text{.}\) Discover and comment on the relationship between these three matrices.

We have

###### M60.

Suppose \(U\) and \(V\) are vector spaces and define a function \(\ltdefn{Z}{U}{V}\) by \(\lteval{Z}{\vect{u}}=\zerovector_{V}\) for every \(\vect{u}\in U\text{.}\) Prove that \(Z\) is a (stupid) linear transformation. (See Exercise ILT.M60, Exercise SLT.M60, Exercise IVLT.M60.)

###### T20.

Use the conclusion of Theorem LTLC to motivate a new definition of a linear transformation. Then prove that your new definition is equivalent to Definition LT. (Proof Technique D and Proof Technique E might be helpful if you are not sure what you are being asked to prove here.)

Theorem SER established three properties of matrix similarity that are collectively known as the defining properties of an “equivalence relation”. Exercises T30 and T31 extend this idea to linear transformations.

###### T30.

Suppose that \(\ltdefn{T}{U}{V}\) is a linear transformation. Say that two vectors from \(U\text{,}\) \(\vect{x}\) and \(\vect{y}\text{,}\) are related exactly when \(\lteval{T}{\vect{x}}=\lteval{T}{\vect{y}}\) in \(V\text{.}\) Prove the three properties of an equivalence relation on \(U\text{:}\) (a) for any \(\vect{x}\in U\text{,}\) \(\vect{x}\) is related to \(\vect{x}\text{,}\) (b) if \(\vect{x}\) is related to \(\vect{y}\text{,}\) then \(\vect{y}\) is related to \(\vect{x}\text{,}\) and (c) if \(\vect{x}\) is related to \(\vect{y}\) and \(\vect{y}\) is related to \(\vect{z}\text{,}\) then \(\vect{x}\) is related to \(\vect{z}\text{.}\)

###### T31.

Equivalence relations always create a partition of the set they are defined on, via a construction called equivalence classes. For the relation in the previous problem, the equivalence classes are the preimages. Prove directly that the collection of preimages partition \(U\) by showing that (a) every \(\vect{x}\in U\) is contained in some preimage, and that (b) any two different preimages do not have any elements in common.

Choose \(\vect{x}\in U\text{,}\) then \(\lteval{T}{\vect{x}}\in V\) and we can form \(\preimage{T}{\lteval{T}{\vect{x}}}\text{.}\) Almost trivially, \(\vect{x}\in\preimage{T}{\lteval{T}{\vect{x}}}\text{,}\) so every vector in \(U\) is in *some* preimage. For (b), suppose that \(\preimage{T}{\vect{v}_1}\) and \(\preimage{T}{\vect{v}_2}\) are two *different* preimages, and the vector \(\vect{u}\in U\) is an element of both. Then \(\lteval{T}{\vect{u}}=\vect{v}_1\) and \(\lteval{T}{\vect{u}}=\vect{v}_2\text{.}\) But because \(T\) is a function, we conclude that \(\vect{v}_1=\vect{v}_2\text{.}\) It then follows that \(\preimage{T}{\vect{v}_1}=\preimage{T}{\vect{v}_2}\text{,}\) contrary to our assumption that they were different. So there cannot be a common element \(\vect{u}\text{.}\)