chapter 6- linear mappings lecture 8 prof. dr. zafer aslan
DESCRIPTION
LINEAR MAPPINGS MAPPINGS We call f(A’) the image of A’ and f-1(B’) the inverse image or preimage of B’. In particular, the set of all images, i.e. F(A), is called the image ( or: range) of f. Furthermore A is called the domain of the mapping f: A B, and B is called its co-domain. To each mapping f: A B there corresponds the subset of AxB given by {(a,f(a)): a A}. We call this set the graph of f.TRANSCRIPT
![Page 1: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/1.jpg)
1
Chapter 6- LINEAR MAPPINGS
LECTURE 8
Prof. Dr. Zafer ASLAN
![Page 2: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/2.jpg)
2
LINEAR MAPPINGS
MAPPINGS
Let A and B be arbitrary sets. Suppose to each aA there is assigned a unique element of B; the collection, f, of such assignments is called a function or
mapping (or: map) from A into B, and is written
f: A B or a f B
We write f(a), read “f of a”, for the element of B that f assigns to aA; it is called the value of f at a or the image of a under f. If A’ is any subset of A, then
f(A’) denotes the set of images of elements of A’; and if B’ is any subset of A, then f(A’) denotes the set of images of elements of A’; and if B’ is any subset of B, then f-1(B’) denotes the set of elements of A each of qhose image lies in B’:
f(A’) = {f(a): aA’} and f-1(B’) = {aA: f(a)B’}
![Page 3: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/3.jpg)
3
LINEAR MAPPINGS
MAPPINGS
We call f(A’) the image of A’ and f-1(B’) the inverse image or preimage of B’. In particular, the set of all images, i.e. F(A), is called the image ( or: range) of f.
Furthermore A is called the domain of the mapping f: A B, and B is called its co-domain.
To each mapping f: A B there corresponds the subset of AxB given by {(a,f(a)): aA}. We call this set the graph of f.
![Page 4: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/4.jpg)
4
LINEAR MAPPINGS
THEOREM 6.1:
Let f: A B, g: B C and h: C D. Then ho(gof) = (hog)of.
We prove this theorem now. If aA, then
(ho(gof))(a) = h((gof)(a))=h(g(f(a)))
and ((hog)of)(a) = (gog)(f(a))= h(g(f(a)))
Thus (ho(gof)(a) = ((gog)of(a) for every aA, and so ho(gof)=(hog)of
![Page 5: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/5.jpg)
5
LINEAR MAPPINGS
Definition:
A mapping f: A B, is said to be one –to-one ( or one – one or 1-1) or injective if different elements of A have distinct images; that is,
if aa’ implies f(a)f(a’) or, equivalently, f(a) = f(A’) implies a=a’
A mapping f: A B is said to be onto (or: f maps A onto B) or surfective if every b B is the image of at least one aA.
![Page 6: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/6.jpg)
6
LINEAR MAPPINGS
Let V and U be vector spaces over the same field K. A mapping F:V U is called a linear mapping ( or linear transformation or vector space homomorphism) if it satisfies the following two conditions:
(1) For any v,w V, F (v+w) = F(v) + F(w). (2) For any kK and any vV, F(kv) = kF(v).
In other words F: V U is linear if it “ preserves “ the two basic operations f a vector space, that of vector addition and that of scalar multiplication.
Substituting k = 0 into (2) we obtain F(0). That is, every linear mapping takes the zero vector into the zero vector.
Substituting k = 0 into (2) we obtain F(0)=0. That is, every linear mapping takes the zero vector into the zero vector.
![Page 7: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/7.jpg)
7
LINEAR MAPPINGS
Definition:
A linear mapping F: V U is called an isomorphism if it is one – to – one. The vector spaces V, U are said to be isomorphic if there is an isomorphism of V onto U. THEOREM 6.2: Let V and B vector spaces over a field K. Let {v1, v2, ..., vn} be a basis of V and u1, u2, ..., un be any vectors in U. Then there exists a unique linear mapping F: V U such that F(v1) = u1, F(v2) = u2, ..., F(vn) = un. We emphasize that the vectors u1, ..., un in the preceding theorem are completely arbitrary; they may be linearly dependent or they may even be equal to each other.
![Page 8: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/8.jpg)
8
LINEAR MAPPINGS
THEOREM 6.4:
Let V be of finite dimension and let F: V U be a linear mapping. Then
dim V =dim (Ker F) + dim(Im F)
That is, the sum of the dimensions of the image and kernel of a linear mapping is equal to the dimension of its domain. This formula is easily seen to hold for the projection mapping F.
Remark: Let F: V U be a linear mapping. Then the rank of F is defined to be the dimension of its image, and the nullity of F is defined to be the dimension of its kernel:
rank (F) = dim(ImF) and nullity (F) = dim(Ker F)
Thus the preceding theorem yields the following formula for F then V has finite dimension: rank(F) + nullity (F) = dimV
![Page 9: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/9.jpg)
9
LINEAR MAPPINGS
THEOREM 6.5:
A linear mapping F: V U is an isomorphism if and only if it is non singular.
We remark that nonsingular mappings can also be characterized as those mappings which carry independent sets into independent sets.
![Page 10: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/10.jpg)
10
LINEAR MAPPINGS
LINEAR MAPPINGS AND SYSTEMS OF LINEAR EQUATIONS
Consider a system of m linear equations in n unknowns over a filed K:
a11x1 + a12x2 + ... + a1nxn = b1
a21x1 + a22x2 + ....+ a2nxn = b2
................................................am1x1+ am2x2+ ....+ amnxn = bm
which is equivalent to the matrix equation.
Ax = b
where A =(aij) is the coefficient matrix, and (x = xi) and b = ( bi) are the column vectors of the unknowns and the constants, respectively. Now the matrix A may also be viewed as the linear mapping
A: Kn Km
![Page 11: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/11.jpg)
11
LINEAR MAPPINGS
THEOREM 6.6:
Let V and U be vector spaces over a filed K. Then the collection of all linear mapping from V into U with the operations of addition and scalar multiplication form a vector space over K.
The space in the above theorem is usually denoted by
Hom (V,U)
Here Hom comes from the word homomorphism. In the case that V and U are of finite dimension, we have the following theorem.
![Page 12: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/12.jpg)
12
LINEAR MAPPINGS
THEOREM 6.7:
Suppose dim V = m and dim U = n. Then dim Hom(V,U) = mn.
Now suppose that V, U and W are vector spaces over the same field K, and that F: V U and G: U W are linear mappings:
r GV U W
![Page 13: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/13.jpg)
13
LINEAR MAPPINGS
THEOREM 6.8:
Let V, U and W be vector spaces over K. Let F, F’ be linear mappings from V into U and G, G’ linear mappings from U into W, and let kK. Then:
(i) F(G+H) = FG + FH
(ii) (G+H)F = GF + HF
(iii) k(GF) = (kG)F = G (kF).
If the associative law also holds for the multiplication, i.e. İf for every F,G, H A,
(iv) (FG)H = F(GH).
![Page 14: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/14.jpg)
14
LINEAR MAPPINGS
INVERTIBLE OPERATORS
A linear operator T: V V is said to be invertible if it has an inverse, i.e. İf here exists T-1 A(V) such that TT-1=T-1T = 1
Now T is invertible if and only if it is one-one and onto. Thus in particular, if T is invertible then ony 0V can map into itself, i.e. T is nonsingular. On the other hand, suppose T is nonsingular, i.e. Ker T = {0}. Recall that T is also one-one. Moreover, assuming V ahs finite dimension, we have by Theorem 6.4,
dim V = dim (ImT ) + dim (Ker T) = dim(Im T)+dim({0}) =dim(ImT)+0=dim(ImT)
Then ImT = V, i.e. The image of T is V; thus T is onto. Hence T is both one-one and onto and so is invertible. We have jist proven.
![Page 15: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/15.jpg)
15
LINEAR MAPPINGS
THEOREM 6.9:
A linear operator T: V V on a vector space of finite dimension is invertible if and only if it is nonsingular.
![Page 16: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/16.jpg)
16
LINEAR MAPPINGS
THEOREM 6.10:
Consider the following system of linear equations:
a11x1 + a12x2 + ... + a1nxn = b1
a21x1 + a22x2 + ....+ a2nxn = b2
................................................am1x1+ am2x2+ ....+ amnxn = bm
(i) If the corresponding homogeneous system has only the zero solution, then the above system has a unique solution for any values of the bi.
(ii) If the corresponding homogeneous system has a nonzero solution, then: (i) there are values for the bi for which the above system does not have a solution; (ii) whenever a solution of the above system exists, it is not unique.
![Page 17: Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN](https://reader036.vdocument.in/reader036/viewer/2022082501/5a4d1bef7f8b9ab0599e57a8/html5/thumbnails/17.jpg)
17
ReferenceSeymour LIPSCHUTZ, (1987): Schaum’s
Outline of Theory and Problems of LINEAR ALGEBRA, SI (Metric) Edition, ISBN: 0-07-
099012-3, pp. 334, McGraw – Hill Book Co., Singapore.
Next Lecture (Week 8-9)Chapter 7:MATRICES AND
LINEAR OPERATORS