ALL Minggu 5
ALL Minggu 5
ALL Minggu 5
.
Sutopo
Uha Isnaini
Minggu ke-5
TRANSFORMASI LINEAR
Definition. Let V and W be vector spaces over the field F. A linear
transformation T : V → W is a function (map, transformation), which
satisfies the following two conditions:
i. for every v1 , v2 ∈ V, T v1 + v2 = T v1 + T(v2); and
ii. for every v ∈ V and scalar c ∈ F, T (cv) = cT (v). We will denote the
collection of all linear maps from V to W by L(V, W).
Example.
1. Let V and W be a vectors spaces. For all v ∈ V, define T (v) = 0𝑊 .
This is the zero map from V to W.
2. Define D : F[x] → F[x] by D(𝑎0+𝑎1𝑥 + ⋯ + 𝑎𝑛 𝑥 𝑛 ) = 𝑎1 + 2𝑎2𝑥 +
⋯ + 𝑛𝑎𝑛 𝑥 𝑛−1 . The map D is called a derivation of F[x].
3. Let V and W be vector spaces over the field F. Let B = (v1, v2, … , vn )
be a basis for V, (𝑤1 , 𝑤2, … , 𝑤𝑛 ) a sequence of n vectors in W.
Define T : V → W by T (𝑎1𝑣1 + ⋯ + 𝑎𝑛 𝑣𝑛 ) = 𝑎1𝑤1 + ⋯ + 𝑎𝑛 𝑤𝑛 .
4. Let F be the collection of functions from F to F and a ∈ F. Define
Ea: F ⟶ F by Ea (f) = f(a). This is called evaluation at a.
• Theorem.Let T : V → W be a transformation. Then T is linear if and
only if for every pair of vectors v1, v2 ∈ V and scalars c1 , c2 ∈ F,
T (c1 v1 + c2 v2) = c1 T v1 + c2 T(v2).
Theorem. Let T : V → W be a linear transformation. Then the following
hold: i) T (0𝑉 ) = 0𝑊 ; and ii) T (u − v) = T (u) − T (v).
Proof.
Theorem. Let T : V → W be a linear transformation. Then Image(T ) is a
subspace of W.
Bukti.
Lemma. Let T : V → W be a linear transformation. Let v1, v2, … , vk be
vectors in V and c1 , c2 , … , c𝑘 be scalars. Then T (c1 v1 + c2 v2 + ⋯ +
ck vk) = c1 T(v1) + c2T(v2) + ⋯ + ck T(vk).
• Theorem. Let V be an n-dimensional vector space over the field F with
basis 𝐵𝑉 = (𝑣1, 𝑣2, … , 𝑣𝑛 ) and W a vector space over F. Let
(𝑤1, 𝑤2, … , 𝑤𝑛 ) be a sequence of vectors from W. Define a function
T : V → W as follows: T (𝑐1 𝑣1 + ⋯ + 𝑐𝑛 𝑣𝑛 ) = 𝑐1 𝑤1 + ⋯ + 𝑐𝑛 𝑤𝑛 . .
Then T is a linear transformation. Moreover, every linear
transformation from V to W is defined in this way.
• Theorem. Let V be a finite-dimensional vector space over a field F
with basis 𝐵𝑉 , W an F-vector space, and (𝑤1, 𝑤2, … , 𝑤𝑛 ) a sequence
of vectors from W. Then there exists a unique linear transformation
T : V → W such that T (𝑣𝑗 ) = 𝑤𝑗 for j = 1, 2, . . . , n.
Definition .
1) Let T ∈ L(V, W) and c ∈ F. Define (cT ) : V → W by (cT )(v) = c · T (v).
This is referred to as the scalar multiplication of T by c.
2) Let S, T ∈ L(V, W). Define (S +T ) : V → W by (S +T )(v) = S(v)+T (v).
This is the sum of the transformations S and T
Lemma.
i. Let T ∈ L(V, W) and c be an element of F. Then (cT ) ∈ L(V, W).
ii. Let S, T ∈ L(V, W). Then S + T ∈ L(V, W).
• Definition. Let T : V → W be a linear transformation. The kernel of T,
denoted by Ker(T ), consists of all vectors in V which go to the zero
vector of W, Ker(T ) := {v ∈ V |T (v) =0𝑊 }.
• Theorem. Let T : V → W be a linear transformation. Then Ker(T ) is a
subspace of V.
Definition. Let V and W be vector spaces over the field F and
T : V → W be a linear transformation. We will refer to the dimension of
the image of T as the rank of T and denote this by rank(T ). Thus,
rank(T ) = dim(Image(T )). The dimension of the kernel of T is called the
nullity of T . We denote this by nullity(T ). Thus,
nullity(T ) = dim(Ker(T )).
Theorem. (Rank and nullity theorem for linear transformations) Let V
be an n-dimensional vector space and T : V → W be a linear
transformation. Then n = dim(V ) = rank(T ) + nullity(T ).
Definition. Let f : X → Y be a function. Then f is said to be injective or
one-to-one if whenever x ≠ x ′ , then f(x) ≠ f(x′). Equivalently, if
f(x) = f(x′) then x = x′ . The function f is said to be surjective or onto if
Y = Image(f). Finally, f is bijective if it both injective and surjective.