Scribd
Upload
20 views2 pages

1

A linear transformation is a function between vector spaces that satisfies specific properties, such as T(cα + β) = cT(α) + T(β). Examples include zero transformation, identity transformation, differentiation operator, integral operator, and matrix multiplication. Key concepts include the null transformation, linearity conditions, rank and nullity, and applications like invertibility and matrix representation.

Uploaded by

wohwvgpirhgftwevsp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views2 pages

1

A linear transformation is a function between vector spaces that satisfies specific properties, such as T(cα + β) = cT(α) + T(β). Examples include zero transformation, identity transformation, differentiation operator, integral operator, and matrix multiplication. Key concepts include the null transformation, linearity conditions, rank and nullity, and applications like invertibility and matrix representation.

Uploaded by

wohwvgpirhgftwevsp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Linear Transformations

Definition
A linear transformation is a function T : V → W , where V and W are vector
spaces over the same field F , satisfying the properties:

T (cα + β) = cT (α) + T (β),


where α, β ∈ V and c ∈ F .

Examples
1. Zero Transformation:

T (v) = 0 for all v ∈ V.

This transformation is linear because:

T (cα + β) = 0 = cT (α) + T (β).

2. Identity Transformation:

T (v) = v.

This transformation is linear because:

T (cα + β) = cα + β = cT (α) + T (β).

3. Differentiation Operator: For V , the space of polynomials over F , the


operator D : V → V defined as

D(f (x)) = f ′ (x)

is linear since differentiation preserves addition and scalar multiplication.


4. Integral Operator: For continuous functions f : R → R,
Z x
T (f ) = f (t) dt
0

is linear.
5. Matrix Multiplication: If T (X) = AX, where A is a fixed matrix,
then T is linear since:

T (cX + Y ) = A(cX + Y ) = cAX + AY = cT (X) + T (Y ).

1
Properties of Linear Transformations
1. Null Transformation: T (0) = 0. This is proved as follows:
T (0) = T (c · 0 + 0) = cT (0) + T (0).
Simplifying, we get T (0) = 0.
2. Linearity Conditions: The condition
T (cα + β) = cT (α) + T (β)
is equivalent to:
T (α + β) = T (α) + T (β),
and
T (cα) = cT (α).
3. Generalization: For any scalars c1 , c2 , . . . , cn and vectors α1 , α2 , . . . , αn ,
T (c1 α1 + · · · + cn αn ) = c1 T (α1 ) + · · · + cn T (αn ).

Rank and Nullity


1. Range:
R(T ) = {w ∈ W | T (v) = w for some v ∈ V },
which forms a subspace of W .
2. Null Space:
N (T ) = {v ∈ V | T (v) = 0},
which forms a subspace of V .
3. Rank and Nullity:
Rank(T ) = dim(R(T )), Nullity(T ) = dim(N (T )).
4. Rank-Nullity Theorem: For finite-dimensional V ,
Rank(T ) + Nullity(T ) = dim(V ).

Applications and Related Theorems


1. Invertibility: A linear transformation T is invertible if it is both one-to-one
and onto.
2. Matrix Representation: Each linear transformation T : V → W can
be represented by a matrix A, where:
[T (α)]B ′ = A[α]B ,
and B, B ′ are bases of V and W , respectively.
3. Cayley-Hamilton Theorem: Every square matrix satisfies its own
characteristic polynomial. If f (λ) is the characteristic polynomial of A,
f (A) = 0.

You might also like