Chapter III - Mapping I

Basic concepts Injective, surjective, bijective mappings Composition of maps, inverse maps
Mappings
NGUYEN CANH Nam1
1 Faculty of Applied Mathematics Department of Applied Mathematics and Informatics Hanoi University of Technologies namnc@mail.hut.edu.vn
HUT - 2010
NGUYEN CANH Nam
Mathematics I - Chapter 3
Agenda
Basic concepts Injective, surjective, bijective mappings Injective mapping Surjective mapping Bijective mapping Composition of maps, inverse maps Composition of maps Inverse maps
NGUYEN CANH Nam
Mappings
Denition
Denition Let S, T be sets; a mapping (or a map or a function) from S to T is a rule that assigns to each element s S a unique element t T . This means that if s is a given element of S, then there is only one element t T that is associated to s by the mapping. Denote f is a mapping from S to T by f : S T and write t = f (s). S is called the domain and T is called the codomain. The symbols f (s) are read f of s".
NGUYEN CANH Nam
Mappings
continue...
We have constantly encountered mapping often in the form of formulas. But mappings need not be restricted to sets of numbers. They can occur in any area. Example
1
Let S = {all men who have ever lived} and T = {all women who have ever lived}. Dene f : S T by f (s) = mother of s. Therefore f (John F. Kennedy) = Rose Kenendy, and according to our denition, Rose Kennedy is the image under f of John F. Kennedy.
NGUYEN CANH Nam Mathematics I - Chapter 3
Mappings
continue...
Example
2
Let S be the set of all objects for sale in Vincom and let T = {all real numbers}. Dene f : S T by f (s) = price of s. This denes a mapping from S to T . Let S = {all legally employed citizens of Viet Nam} and T = {positive integers}. Dene, for s S, f (s) by f (s) = ID card number of s. Then f denes a mapping from S to T . Let S be the set of the colors of the rainbow. Let T = {1, 2, 3, 4, 5, 6, 7}. Dene f : S T by f (s) = the number of letters in a given color of the rainbow. Then f denes a mapping from S to T .
Mappings
continue...
Denition The mapping iX : X X given by iX (x) = x for every x X is called the identity on X . Denition Let f be a mapping from S to T . For s S, f (s) is called the image of s under f , also the value of f at s. The set of all elements f (s), when s ranges over all elements of S, is called the image of S under f or the range of f , and is denoted by f (S): f (S) := {t | t = f (s), s S} or f (S) := {t | s S, t = f (s)}
Mappings
continue...
Example Denote IN the set of strictly positive integers, IN = IN \ {0}

1
The mapping f : IN {1, 1} given by f (n) = (1)n (n IN )
has domain IN , codomain and range {1, 1}
NGUYEN CANH Nam
Mappings
continue...
Example
2
The mapping f : IR IR given by f (x) = x 2 + 1 (x IR)
has domain IR, codomain IR and range {y | y 1}. The mapping f : IN O given by Q f (x) = 1 n (n IN)
1 3 has domain IN, codomain O and range { , 1, , 2, ...}. Q 2 2

Mappings
continue...
Denition Given a mapping f : S T and a subset A T , we may want to look at B = {s S | f (s) A}, we use the notation f 1 (A) for this set B, and call f 1 (A) the inverse image of A under f . Consider the subset {t} in T , if the inverse image of {t} consists of only one element, say s S, we could try to dene f 1 (t) by dening f 1 (t) = s.
NGUYEN CANH Nam
Injective mapping Surjective mapping Bijective mapping
Agenda
NGUYEN CANH Nam
Injective mapping
Denition
Denition A mapping f : S T is said to be one-to-one (written 1-1) or injective if for s1 = s2 in S, f (s1 ) = f (s2 ) in T . Equivalently, f is 1-1 iff (s1 ) = f (s2 ) implies that s1 = s2 . A mapping is 1-1 if it takes distinct objects into distinct images. In the examples we gave earlier, The rst mapping of is not 1-1(two brothers could have the same mother). The second mapping is 1-1 (distinct vietnamese citizens have distinct ID card number).
NGUYEN CANH Nam
Injective mapping
Examples
Example
Figure: A injective function
NGUYEN CANH Nam
Injective mapping
Examples
Example The function f : IR IR dened by f (x) = 2x + 1 is injective, Given arbitrary real numbers x and x , if 2x + 1 = 2x + 1, then 2x = 2x , so x = x . The function g : IR IR dened by g(x) = x 2 is not injective, g(1) = 1 = g(1). The function h : [0, ) IR with the same formula as g is injective. Given arbitrary nonnegative real numbers x and x , if x 2 = x 2 , then |x| = |x |, so x = x .
Agenda
NGUYEN CANH Nam
Surjective mapping
Denition
Denition The mapping f : S T is onto or surjective if every t T is the image under f of some s S; that is, if and only if, given t T , there exists an s S such that t = f (s). The mapping f : S T is onto by saying that f (S) = T . In the examples we gave earlier, the rst mapping is not onto, since not every woman that ever lived was the mother of a male child.
NGUYEN CANH Nam
Surjective mapping
Examples
Example
Figure: A surjective function
NGUYEN CANH Nam
Surjective mapping
Examples
Example The function g : IR IR dened by g(x) = x 2 is not surjective, There is no real number x such that x 2 = 1.
The function h : IR [0, ) with the same formula as g is surjective. Given an arbitrary nonnegative real number y, we can solve y = x 2 to get solutions x = y and x = y.
NGUYEN CANH Nam
Agenda
NGUYEN CANH Nam
Bijective mapping
Denition
Denition The mapping f : S T is said to be 1-1 correspondence or bijective f is both 1-1 and onto.
NGUYEN CANH Nam
Bijective mapping
Examples
Example
Figure: A bijective function
NGUYEN CANH Nam
Bijective mapping
Example
Example The function f : IR IR dened by f (x) = 2x + 1 is bijective. Given an arbitrary real number y, we can solve y = 2x + 1 to get exactly one real solution x = (y 1)/2.
The function g : IR IR dened by g(x) = x 2 is not bijective, for two essentially different reasons. g is not injective and g is not surjective either. Either one of these facts is enough to show that g is not bijective. The function h : [0, ) [0, ) with the same formula as g is bijective. Given an arbitrary nonnegative number y, we can solve y = x 2 to get exactly one nonnegative solution x = y .
Remark
Remark Suppose S and T be nite sets. We have ii) If f : S T is surjective then N(S) N(T ) i) If f : S T is injective then N(S) N(T )
iii) If f : S T is bijective then N(S) = N(T )
NGUYEN CANH Nam
Composition of maps Inverse maps
Agenda
NGUYEN CANH Nam
Composition of maps
Introduction
Now that we have the notion of a mapping and have singled out various type of mappings, we might very well ask : "Good and well. But what can we do with them?". Consider the situation g : S T and f : T U. Given an element s S, then g sends it into the element g(s) in T ; so g(s) is ripe for being acted on by f . Thus we get an element f (g(s)) in U. We claim that this procedure provides us with a mapping from S to U (Verify!).
NGUYEN CANH Nam
Composition of maps
Denition
Denition If g : S T and f : T U, then the composition (or product), denoted by f g, is the mapping f g : S U dened by (f g)(s) = f (g(s)) for every s S.
NGUYEN CANH Nam
Composition of maps
Examples
Example Let mappings f and g be dened by f (x) = sin x (x IR), g(x) = x 2 (x IR)
Then we may form f g and also g f : IR IR IR IR IR IR

g f f g
NGUYEN CANH Nam
Composition of maps
Examples
Example (continue...) Now (g f )(x) = g(f (x)) = g(sin x) = (sin x)2 = sin2 x (f g)(x) = f (g(x)) = f (x 2 ) = sin x 2 We remark that f g and g f have the same domain but are different mappings since it is not true that sin2 x = sin x 2 for all x IR.
NGUYEN CANH Nam
Composition of maps
Properties
Theorem Let S, T and U be sets and let g : S T and f : T U be mappings. ii) If f and g are injective then f g is injective i) If f and g are surjective then f g is surjective
iii) If f and g are bijective then f g is bijective
NGUYEN CANH Nam
Composition of maps
Properties
Proof. We prove i) and leave ii) to be proved in Exercise. i) and ii) imply iii). Let u U. Then since f is surjective we have t T such that f (t) = u. Since g is surjective we have s S such that f (s) = t. Then (f g)(s) = f (g(s)) = f (t) = u and so f g is surjective.
NGUYEN CANH Nam
Composition of maps
Properties
Lemma If f : S T and iT is the identity mapping of T onto itself and iS is the identity mapping of S onto itself, then iT f = f and f iS = f .
NGUYEN CANH Nam
Composition of maps
Consider the case of four sets S, T , U, V and three mappings f , g, h where f : S T , g : T U and h : U V . We may construct the mapping g f and h g and then the further compositions h (g f ) and (h g) f
The h (g f ) and (h g) f are both mappings from S V but they have been constructed differently. Could they be equal?
Composition of maps
Example Let f , g, h be the mappings given by f (x) = x 2 + 1 (x Z Z), 2 g(n) = n (n IN), 3 h(t) = t 2 + 1 (t O ), Q and so, Z IN O IR Z Q
f g h
NGUYEN CANH Nam
Composition of maps
Example (continue...) (g f )(x) = g(f (x)) = g(x 2 + 1) = 2 [h (g f )](x) = h( (x 2 + 1)) = 3 2 (h g)(n) = h(g(n)) = h( n) = 3 2 2 (x + 1) (x Z Z) 3 2 ( (x 2 + 1))2 + 1 3 2 ( n)2 + 1 3 (n IN)
[(hg)f ](x) = (hg)(f (x)) = (hg)(x 2 +1) =
2 ( (x 2 + 1))2 + 1 3
NGUYEN CANH Nam
Composition of maps
Example (continue...) Thus [h (g f )](x) = [(h g) f ](x) from which h (g f ) = (h g) f Lemma If h : S T , g : T U and h : U V , then f (g h) = (f g) h. (x Z Z)
NGUYEN CANH Nam
Proof. Let a S, then [f (g h)](a) = f ((g h)(a)) = f (g(h(a))) and [(f g) h](a) = (f g)(h(a)) = f (g(h(a))). Thus [f (g h)](a) = [(f g) h](a) and since a is arbitrary f (g h) = (f g) h There is really no need for parentheses, so we write f (g h) as f g h.
Agenda
NGUYEN CANH Nam
Inverse maps
Introduction
Given a mapping f : S T , the f 1 does not in general denes a mapping from T to S for several reasons. If f is not onto, so there is some t in T which is not the image of any element s in S, so f 1 (t) = .
If f is not 1-1, then for some t T there are at least two distinct s1 = s2 in S such that f (s1 ) = t = f (s2 ). So f 1 (t) is not a unique element of S (something we require in our denition of a mapping).
However, if f is both onto T and 1-1, i.e. f is bijective, then f 1 indeed denes a mapping of T onto S.
NGUYEN CANH Nam
Inverse maps
Theorem Bijective mapping f : S T denes a mapping from T onto S. This mapping is called the inverse mapping of f and denoted by f 1 . Example y 1 2 x then x = f 1 (y) = ln y b) f : IR (0, +), y = f (x) = e a) f : IR IR, y = f (x) = 2x + 1 then x = f 1 (y) =
NGUYEN CANH Nam
Inverse maps
Properties
Lemma If f : S T is a bijection, then (f 1 )1 = f and f f 1 = iT , f 1 f = iS , where iS and iT are the identity mappings of S and T , respectively. Lemma (Inverse of composition) Let f : S T and g : T U be bijective mappings. Then (g f )1 = f 1 g 1
NGUYEN CANH Nam
An interesting subject (?!)
Mappings may appear to be necessary but somewhat humdrum objects of study(!). However particular mapping give rise to curious problems. Consider the mapping f : IN IN given by f (n) =
1 2n 1 2 (3n
(n even) + 1) (n odd)
Thus f (26) = 13, f (25) = 1 (75 + 1) = 38. 2
NGUYEN CANH Nam
An interesting subject (?!)
Suppose we iterate this mapping several times and, by way of illustration, we follow the effect of the iterations on the number 10. Then f (10) = 5,
After ve iterations on 10 the number 1 appears.
NGUYEN CANH Nam
The reader may care to verify that commencing with 65 there are 19 iterations before 1 rst appears. Other integers may be tired at random as test cases, but the reader is advised to cultivate patience as the number of iterations before 1 rst appears may be quite large. The conjecture, that for any n IN and for sufciently many iterations the number 1 always appears, remain to be proved or disproved.
NGUYEN CANH Nam

Chapter III - Mapping I

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter III - Mapping I

Uploaded by

Copyright:

Available Formats

Basic concepts Injective, surjective, bijective mappings Composition of maps, inverse maps

NGUYEN CANH Nam

NGUYEN CANH Nam

NGUYEN CANH Nam

Example Denote IN the set of strictly positive integers, IN = IN \ {0}

The mapping f : IN {1, 1} given by f (n) = (1)n (n IN )

has domain IN , codomain and range {1, 1}

NGUYEN CANH Nam

The mapping f : IR IR given by f (x) = x 2 + 1 (x IR)

1 3 has domain IN, codomain O and range { , 1, , 2, ...}. Q 2 2

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

Figure: A injective function

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

Injective mapping Surjective mapping Bijective mapping

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

Figure: A surjective function

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

Figure: A bijective function

NGUYEN CANH Nam

Injective mapping Surjective mapping Bijective mapping

Injective mapping Surjective mapping Bijective mapping

iii) If f : S T is bijective then N(S) = N(T )

NGUYEN CANH Nam

Composition of maps Inverse maps

NGUYEN CANH Nam

Composition of maps Inverse maps

NGUYEN CANH Nam

Composition of maps Inverse maps

NGUYEN CANH Nam

Composition of maps Inverse maps

Then we may form f g and also g f : IR IR IR IR IR IR

NGUYEN CANH Nam

Composition of maps Inverse maps

NGUYEN CANH Nam

Composition of maps Inverse maps

iii) If f and g are bijective then f g is bijective

NGUYEN CANH Nam

Composition of maps Inverse maps

NGUYEN CANH Nam

Composition of maps Inverse maps

NGUYEN CANH Nam

Composition of maps Inverse maps

Composition of maps Inverse maps

NGUYEN CANH Nam

Composition of maps Inverse maps

[(hg)f ](x) = (hg)(f (x)) = (hg)(x 2 +1) =

NGUYEN CANH Nam