Scribd Logo
Upload

Welcome to Scribd!

  • 45 views

    MATH 2141 WK4 (1) Notes DR N Sookia

    Uploaded by

    Ashvin Grace
    This document defines key concepts related to linear transformations and vector spaces, including: 1. A linear transformation T from vector space V to U satisfies T(x+y) = T(x) + T(y) and T(αx) = αT(x) for all x, y in V and scalar α. 2. The kernel (or null space) of T is the set of vectors mapped to 0, which forms a subspace of V. 3. The range (or image) of T is the set of vectors T maps elements of V to, which forms a subspace of U.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    MATH 2141 WK4 (1) Notes DR N Sookia

    Uploaded by

    Ashvin Grace
    45 views5 pages
    This document defines key concepts related to linear transformations and vector spaces, including: 1. A linear transformation T from vector space V to U satisfies T(x+y) = T(x) + T(y) and T(αx) = αT(x) for all x, y in V and scalar α. 2. The kernel (or null space) of T is the set of vectors mapped to 0, which forms a subspace of V. 3. The range (or image) of T is the set of vectors T maps elements of V to, which forms a subspace of U.

    Original Title

    2141noteswk4

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document defines key concepts related to linear transformations and vector spaces, including: 1. A linear transformation T from vector space V to U satisfies T(x+y) = T(x) + T(y) and T(αx) = αT(x) for all x, y in V and scalar α. 2. The kernel (or null space) of T is the set of vectors mapped to 0, which forms a subspace of V. 3. The range (or image) of T is the set of vectors T maps elements of V to, which forms a subspace of U.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    45 views5 pages

    MATH 2141 WK4 (1) Notes DR N Sookia

    Uploaded by

    Ashvin Grace
    This document defines key concepts related to linear transformations and vector spaces, including: 1. A linear transformation T from vector space V to U satisfies T(x+y) = T(x) + T(y) and T(αx) = αT(x) for all x, y in V and scalar α. 2. The kernel (or null space) of T is the set of vectors mapped to 0, which forms a subspace of V. 3. The range (or image) of T is the set of vectors T maps elements of V to, which forms a subspace of U.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 5

    MATH 2141 WK4(1) Notes Dr N Sookia

    Linear Transformations or Homomorphisms Denition: Let V and U be vector spaces over the same eld F. A map T : V U is called a linear transformation or a homomorphism (of vector spaces), if T satises the following conditions: 1. T (x + y ) = T (x) + T (y ) x, y V . 2. T (x) = T (x) F, x V . Now 1. and 2. give rise to 3: 3. T (x + y ) = T (x) + T (y ) , F, x, y V Exercise: Show that conditions 1. and 2. together are equivalent to 3. Example 1: Dene 0 : V U as 0(x) = 0 x V Then 0 is a linear transformation called the zero transformation. Any linear transformation dierent from 0 is called a non-zero linear transformation. Example 2: V = R3 , U = R2 , F = R. Dene T : V U as T (x1 , x2 , x3 ) = (x1 , x2 ) (x1 , x2 , x3 ) R3 . Show that T is a linear transformation. Example 3: The identity transformation I : V U is a linear transformation from V into V, dened by I (x) = x x V Example 4: V = R3 , U = R, F = R. Dene T : V U as
    3 2 2 T (x1 , x2 , x3 ) = x2 1 + x2 + x3 (x1 , x2 , x3 ) R .

    Show that T is not a linear transformation. Result: Let V and U be vector spaces over the same eld F and T : V U a linear transformation. Then 1

    1. T (0) = 0. 2. T (x) = T (x) x V. Proof: 1. T (0) = T (0 + 0) = T (0) + T (0). 2. Let x V. Then 0 = T (0) = T (x + (x)) = T (x) + T (x). Hence T (x) = T (x). 2 Denition: Let ker T = {x V : T (x) = 0}. ker T is called the kernel of T. Result: ker T is a subspace of V. Proof: ker T = since 0 ker T as T (0) = 0. Let , F, x ker T, y ker T. x ker T T (x) = 0 y ker T T (y ) = 0 T (x + y ) = T (x) + T (y ) = 0 x + y ker T. 2 ker T is called the null space of T. Denition: The range of T : V U is dened as T (V ) = {T (x) : x V } = {u U : u = T (v ) for some v V } Result: T (V ) is a subspace of U. Proof: T (V ) = since 0 V T (0) T (V ). Let , F, x T (V ), y T (V ). Then x = T (v1 ), y = T (v2 ) for some v1 , v2 V x + y = T (v1 ) + T (v2 ) = T (v1 + v2 ) T (V ). 2

    T (V ) is called the range space of T : V U. Denition: Let V be a vector space over F & let v1 , v2 , ..., vn , n 1 be elements in V. A vector of the form:
    n

    i vi = 1 v1 + 2 v2 + ... + n vn : i F, i = 1, ..., n
    i=1

    is called a linear combination of v1 , v2 , ..., vn over F. Clearly

    n i=1

    i vi V.

    Denition: Let V be a vector space over F & S be a non-empty subset of V. The linear span of S over F , denoted by L(S ) or Span(S ) is dened as: L(S ) = {1 v1 + 2 v2 + ... + n vn : i F, vi S, i = 1, ..., n; n = 1, 2, ...}. Theorem: L(S ) is the smallest subspace of V containing S. Proof: If 1 = 1, then v S can be written as v = 1.v L(S ). Hence S L(S ). So L(S ) is a non-empty subset of V containing S. Let , F, x L(S ), y L(S ). Now x L(S ) x = 1 v1 + 2 v2 + ... + n vn for some i F, vi S, i = 1, ..., n y L(S ) y = 1 v1 + 2 v2 + ... + m vm for some j F, vj S, j = 1, ..., m Then x + y = (1 v1 + 2 v2 + ... + n vn ) + (1 v1 + 2 v2 + ... + m vm ) = (1 )v1 + (2 )v2 + ... + (n )vn + (1 )v1 + (2 )v2 + ... + (m )vm L(S ) Let W be a subspace of V containing S. Now x L(S ) x = 1 v1 + 2 v2 + ... + n vn for some i F, vi S, i = 1, ..., n x = 1 v1 + 2 v2 + ... + n vn for some i F, vi W, i = 1, ..., n x W. Hence L(S ) W. Thus, L(S ) is the smallest subspace of V containing S. 2

    L(S ) is also called the subspace generated by v1 , v2 , ..., vn and we call v1 , v2 , ..., vn generators for this subspace. 3

    Linear Dependence and Independence Denition: Let V be a vector space over F & v1 , v2 , ..., vn be elements in V. We say that v1 , v2 , ..., vn are linearly dependent over F if there exist scalars i F, i = 1, ..., n in F, i = 0 for at least one i, i = 1, ..., n such that 1 v1 + 2 v2 + ... + n vn = 0 Example: (1, 0), (0, 1) and (2, 3) are linearly dependent over R since 2(1, 0) + 3(0, 1) (2, 3) = (0, 0) = 0 Denition: Let V be a vector space over F & v1 , v2 , ..., vn be elements in V. We say that v1 , v2 , ..., vn are linearly independent over F if 1 v1 + 2 v2 + ... + n vn = 0, i F, i = 1, ..., n i = 0 for all i = 1, ..., n. Example: (1, 0) and (0, 1) are linearly independent over R. (1, 0) + (0, 1) = (0, 0) (, ) = (0, 0) = =0 Exercise: Show that (1, 1, 0), (1, 0, 0) and (0, 1, 1) are linearly independent over R. Denition: Let V be a vector space over F. A non-empty nite set S = {v1 , v2 , ..., vn } of V is said to be linearly dependent(independent) over F if v1 , v2 , ..., vn are linearly dependent(independent) over F . Denition: Let V be a vector space over F. A subset S of V is said to be linearly independent over F if its every nite subset is linearly independent. Convention: is linearly independent over F. Denition: Let V be a vector space over F. A non-empty subset S of V is said to be linearly dependent over F if there exists a nonempty nite subset of it which is linearly dependent. Observations: Let V be a vector space over F. 1. Every v V, v = 0 is linearly independent over F. 2. The zero vector 0 V is linearly dependent over F. 4

    Denition: Let V be a vector space over F. Then V is said to be nite dimensional (or nitely generated) if there exists a non-empty nite subset S of V such that L(S ) = V. Note: Linear dependence or independence of vectors depends on the eld under consideration. Result: Let V be a vector space over F and v, w V. If v, w are linearly dependent over F , then one of them is a scalar multiple of the other. Proof: Do it. Similarly v, w are linearly independent over F i one is not a scalar multiple of the other. Exercise: Show that L({(1, 0, 0), (0, 1, 0),(0, 0, 1)}) = R3 .

    You might also like