5.

- Linear Transformations
5.1 Definition of a kernel linear transformation and image of a linear
transformation and its properties

A linear transformation is any function, T, whose domain and codomain are

vector spaces and the following conditions are met:

1. T(u + v) = T(u) + T(v)

2. T(ku) = kT(u) where k is a scalar.

Null Linear Transformation

Linear Identity Transformation

Homothecies
with

Yes |k| > 1 are called Si |k| dilations <

1 are called contractions

Property of Linear Transformations

1.

Kernel transformation

Let it be a linear transformation. The Kernel or Nucleus of the linear

transformation is defined, denoted by the set of preimages of the null
vector, i.e.

If linear, the core and T image are defined as follows:

That is, the kernel of a linear transformation is formed by the set of all

vectors of the domain that have the null vector of the codomain as an
image.
The core of any linear transformation is a subspace of the domain:

Page 1
 1. since T(0V) = 0W
2. Dice

3. Dice

The dimension of the nucleus is called nullity. Nullity(T) = dim(Nu(T))

In other words, the image of a linear transformation is formed by the

set of all vectors of the codomain that are images of at least some
vector of the domain.
The image of every linear transformation is a subspace of the codomain.
The range of a linear transformation is the dimension of the image.
rg(T) = dim(Im(T))

example
A linear transformation of R2 into R3
xy   1
x   2  
T   y   x  y . for example, we have T      5 . Then
       3
3y 9
   
 x1  x2  y1  y2 
 x1   x2   x1  x2   
T    and    Tand   x1  x2  y1  y2 
 y 
y  1   2  1 2  
 3y  3y2 
1 
 x1  y2   x2  y2 xy  x2  y2 

       x1     x2 
  x1  y2 .   x2  but  x  and .  T    x2  y2 .  T  
y2  and and
and
 3y1   3y   3 and   1  3y   2
   2     2 
 x1 
 x2  x1  x2 
 
Like this T    .  T    T and
 and
y y
 1   2   1  2
Similarly
 x   and   x  and 
  x  x     x
T    and   T   and  x  y .    x  y   T  y 
   
   3y   3 and   
   

Page 2
Arrays as Linear Transformations

Definition 2.1.1 Dice V, W vector spaces on one linear transformation

between and it's a function

That satisfies the following condition, for all, : Exercise

1 : Yes is linear, then , and .

example:

Yes Meets , , then

It's a linear transformation.
Definition 2.1.2
, we define how The Multiplication Function
Given by '', i.e.,

with

Theorem 2.1.3 Be a matrix, and his Associated

Linear Transformation Then:

1. .

2. .

3. .

4. .

5. .

5.2 Linear Representation of a Linear Transformation

Let T:V → W be a linear transformation, where V and W are vector spaces. Are
e1 = (1, 0, 0, ., 0),e2 = (0, 1, 0, 0, ., 0), e3 = (0, 0, 1 , 0, ., 0) , .,
in
Page 3
= (0, 0, 0, ., 0, 1). Suppose {e1, e2, e3, ., in} is a basis of V. Now, let it be

Page 4
 T(e1) = w1, T(e2) = w2, T(e3) = w3, ., T(en) = wn. We call AT the matrix
whose columns are w1, w2, w3, . , wn.
So the AT matrix is called the matrix representation of T.

Example
Find the At transformation matrix corresponding to the projection of a vector in R3
onto the xy plane.

x x  1 1   0   0  0
0
         
Solution here T   and    and  . In particular, T  0   0,T 1    1  yT 
0   0
 with  0   0  0  0  1   0
0
         
1 0 x 1 0  x 
0 x
0
        
Like this At   0 1 0 Note that At   and    0 0 and    and 
0 0  with  1
0 0 0 0 with   with 
        

5.3. Transformations and systems of linear equations

SYSTEMS OF LINEAR EQUATIONS

A system of linear equations is a set of linear equations that we can write

in the traditional way like this:

A system thus expressed has "m" equations and "n" unknowns, where aij
are real numbers, called system coefficients, bm values are real numbers, called
system-independent terms, the unknowns xj are the variables of the system,
and the solution of the system is an ordered set of real numbers (s1, s2, ..., sn)
such that by substituting the unknowns x1, x2, ... , xn by the values s1, s2, ..., sn
Page 5
the "m" equations of the system are verified at the same time.

Page 6
This same system of linear equations in matrix notation has this form:

Where:

 We call the system matrix the matrix of dimension m×n formed by the
coefficients of the system, and we designate it by A.
 X is the matrix column formed by the unknowns.
 We denote by B to The column matrix formed by the independent
terms.

and we call the matrix of dimension m×(n+1) the matrix obtained by

adding to the matrix of the system (= matrix of coefficients) the column of the
independent terms, and denoting it by A*, i.e.

If we represent each matrix with a single letter, we get:

Ax = b,

where A is a matrix m times n, x is a column vector of length n, and b is

another column vector of length m. The above-mentioned system of Gauss-Jordan
elimination applies to this type of system, regardless of the body from which the
coefficients come.

If the field is infinite (as is the case with real or complex numbers), then only
one of the following three situations can occur:

Page 7
  The system has no solution (in which case we say that the system is
overdetermined or incompatible)
 The system has a single solution (the system is supported determined)
 The system has an infinite number of solutions (the system is supported
indeterminately).

The equation 2x - 3 = 0 is called the linear equation of one variable. Obviously it

only has one solution.

The equation -3x + 2y = 7 is called the two-variable linear equation . Their

solutions are ordered pairs of numbers. It has infinite solutions that are obtained by
clearing one variable and giving any values to the other.

The equation x - 2y + 5z = 1 is called the linear three-variable equation . Their

solutions are ordered trios of numbers. It has infinite solutions that are obtained by
clearing one variable and giving any values to the other two.

In general, a linear equation of "n" variables is of the type :

 The solutions are the sequences of numbers s1, s2, s3, ..., sn that make
equality true [1]
 If the coefficients are 0 and the independent term is not, the equation is
called incompatible. It has no solution and is also called an impossible
equation, false proposition, or absurd equality.
 If the coefficients and the independent term are zero, the equation is said to
be an identity.

5.3.-LINEAR TRANSFORMATIONS

A linear transformation is a set of operations performed on a vector to

convert it into another vector. Sometimes working with vectors is very simple since
they can be easily interpreted within a graphic context, unfortunately it does not
always happen and it is necessary to transform vectors to be able to work with
them more easily.

On the other hand, working with linear systems is much simpler than with
nonlinear systems, since you can use a technique called superposition, which
greatly simplifies a wide variety of calculations.

Page 8
that it is of great interest to show that a process can be reduced to a linear system,
which can only be achieved by showing that these operations form a linear
transformation.

A linear transformation, linear function, or linear application is any

application whose domain and codomain are vector spaces and the following
conditions are met:

Let V and W be vector spaces over the same field K, and T a function of V
in W. T is a linear transformation if for each pair of vectors of you and v
belonging to V and for each scalar k belonging to K, it is satisfied that:

1.
2. where k is a climb.

Systems of linear equations are equations that have n unknowns, which we

can represent in a matrix notation, a technique called superposition can be used,
which greatly simplifies a variety of calculations, so it is of great interest to
demonstrate that a process can be reduced to a linear system, which can only be
achieved by demonstrating that these operations form a linear transformation.

From a linear equation we can make the linear transformations to have

scalars as a result.

For example

T: R2 R2 given by T(X, Y)= (2X, X+2Y). Assuming A (2.2) and B

(1.2). Determine the T(A+B)

T(A+B)= (2+1, 2+2)

= 2(2)+2(1), 2+2(2)+ 1+2(2)

Page 9
 = (4 + 2 , 6 + 2)

=(6 , 11)

5.5 Algebra of the Linear Sum Transformations

The sum C=A+B is defined where A and B are linear transformations to make the
function C(x)=A(x)+B(x). It can easily be verified that it is also a linear
transformation. You can verify that there are two linear transformations A and B,
such that
1. A+B=B+A
2. (A+B)+C=C+(B+A)
3. A+0=A
4. A+(-A)=0
where 0 is the zero operator, -A is the function -A(x) which can easily verify that a
linear transformation has occurred.

Scalar multiplication

Given a transformation a, defined by the function μA where μ is an element of a

field to make the function (μ A)(x) = μ(A(x)).
You can easily verify that given the linear transformations
A and B and some elements of the field μ, μ1, and μ2, such that

1. μ1(μ2A) = (μ1μ2)A

2. 1A = A

3. (μ1 + μ2)A = μ1A + μ 2A

4. μ(A + B) = μA + μ B

This involves the linear form of transformations in a vector space

.
Multiplication

Given a linear transformation A from X to Y and a linear transformation B

from Y to Z, then define the function AB from X to Z to be the composition of
the two functions.
It can easily be verified that this is also a linear transformation. Here are
some useful relationships that can be easily verified:

Page 10
 1. μ(AB) = (μA)B
2. (A + B)C = AC + BC
3. C(A + B) = CA + CB
4. (AB)C = A(BC).
5.

5.5.. Applying Linear Transformations

Linear transformations are useful in computer graphing. These geometric

interpretations are represented by elementary 2 x 2 matrices. The following is a
summary of the various types of 2x2 elementary matrices.

Elementary Matrices of Linear Transformations in a Plane

Reflection on the y-axis Reflection on the x-axis Reflection on the y=x

 1 0 1 0  axis
A A 0  1  0 1
0 1   A   1 0
 

Horizontal Expansion Vertical Expansion

(k>1) or Contraction (k>1) or Contraction
(0<k<1) (0<k<1)
k 0 1 0 
A  0 A  0 k1
 1  

Horizontal Scrolling Vertical scrolling

1 towards  1 0
A 0 1 A  k
   1

Example

The matrices defined by the following transformations are called reflections.

Reflections have the effect of mapping a point on the xy plane
With its "mirror" image with respect to the axes of coordinates or the defined line
x=y. As shown in the figure below.
Page 11
(-x,y)

(x,y) (x,y)
(x,y)

(y,-x)

(x,-y)

a) . b). c).

a) Reflection on the y-axis:

T x, y   x, y
 1 0 x  x
 0 1 y  and 
    

b) Reflection on the x-axis:

T x, y  x, y

1 0  x  x 
0   y
 1 y
    

c) Reflection on the y=x axis:

T x, y  y, x
0 1 x  y
1 0 y  x
   

Page 12
EXERCISE

The student:

*Determine the kernel of the following linear

transformation

*A fundamental fact is that and It is a linear transformation between the

spaces
* Investigate the theorems of Linear Transformations
*Determine the standard matrix of a linear transformation

T : R3  R 2 defined by T(x,y,z)=(x-2y,2x+y)
 The transformations defined by the following matrices are
slippages.
T x, y  x  T x, y  x,
, y  x
0kytowards y  kx 0 x
1 
x 
1 
 a  kx
 0  y
 k
 1     
n swipe which is defined
Set the horizontal y by T(x,y)=(x+2y,y)

Page 13