![Page 1: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/1.jpg)
1
2.1 Sets2.2 Set Operations2.3 Functions
‒ Functions‒ Injections, Surjections and Bijections‒ Inverse Functions‒ Composition
2.4 Sequences and Summations
P. 1
![Page 2: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/2.jpg)
2
• Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A→ B, is a subset of A×B such that
and
P. 1
Functions
]],[[ fyxByyAxx
2121 ],,[ yyfyxfyx
![Page 3: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/3.jpg)
3
• Note: f associates with each x in A one and only one y in B. – A is called the domain – B is called the codomain.
• If f(x) = y– y is called the image of x under f– x is called a preimage of y
• (note there may be more than one preimage of y but there is only one image of x).
P. 1
Functions
![Page 4: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/4.jpg)
4
• The range of f is the set of all images of points in A under f. We denote it by f(A).
• If S is a subset of A then f(S) = {f(s) | s in S}.
• Q: What is the difference between range and codomain?
P. 1
Functions
![Page 5: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/5.jpg)
5
• Example:1. f(a) =2. the image of d is 3. the domain of f is 4. the codomain is 5. f(A) =6. the preimage of Y is7. the preimages of Z
are 8. f({c,d}) =
P. 1
Functions
ZZA = {a, b, c, d}B = {X, Y, Z}{Y, Z}ba, c ,d
{Z}
![Page 6: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/6.jpg)
6
• Let f be a function from A to B.• Definition: f is one-to-one (denoted 1-1) or
injective if preimages are unique.Note: this means that if a b then f(a) f(b).
• Definition: f is onto or surjective if every y in B has a preimage.Note: this means that for every y in B there must be an x in A such that f(x) = y.
• Definition: f is bijective if it is surjective and injective (one-to-one and onto).
P. 1
Injections, Surjections and Bijections
![Page 7: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/7.jpg)
7
• Examples: The previous Example function is neither an injection nor a surjection. Hence it is not a bijection.
P. 1
Injections, Surjections and Bijections
![Page 8: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/8.jpg)
8
• Note: Whenever there is a bijection from A to B, the two sets must have the same number of elements or the same cardinality.
• That will become our definition, especially for infinite sets.
P. 1
Injections, Surjections and Bijections
![Page 9: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/9.jpg)
9
• Examples: Let A = B = R, the reals. Determine which
are injections, surjections, bijections:1. f(x) = x,2. f(x) = x2,3. f(x) = x3,4. f(x) = | x |,5. f(x) = x + sin(x)
P. 1
Injections, Surjections and Bijections
![Page 10: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/10.jpg)
10
• Let E be the set of even integers {0, 2, 4, 6, . . . .}.• Then there is a bijection f from N to E , the even
nonnegative integers, defined by f(x) = 2x.• Hence, the set of even integers has the same
cardinality as the set of natural numbers.• OH, NO! IT CAN’T BE....E IS ONLY HALF AS BIG!!!• Sorry! It gets worse before it gets better.(見山是山,見水是水前,會先見山不是山,見水不是水)
P. 1
Injections, Surjections and Bijections
![Page 11: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/11.jpg)
11
• Definition: Let f be a bijection from A to B. Then the inverse of f, denoted f-1, is the function from B to A defined as
f-1(y) = x iff f(x) = y
P. 1
Inverse Functions
![Page 12: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/12.jpg)
12
Inverse Functions
• Example: Let f be defined by the diagram:
• Note: No inverse exists unless f is a bijection.
P. 1
![Page 13: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/13.jpg)
13
• Definition: Let S be a subset of B. Then f-1(S) = {x | f(x) S}• Note: f need not be a bijection for this
definition to hold.
P. 1
Inverse Functions
![Page 14: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/14.jpg)
14
• Example: Let f be the following function:
f-1({Z}) =f-1({X, Y}) =
P. 1
Inverse Functions
{c, d}{a, b}
![Page 15: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/15.jpg)
15
• Definition: Let f: B→C, g: A → B. The composition of f with g, denoted f g, is the function from A to C defined by
f g(x) = f(g(x))
P. 1
Composition
![Page 16: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/16.jpg)
16
• Examples:
• If f(x) = and g(x) = 2x + 1, then f(g(x)) = and g(f(x)) = 2 + 1
P. 1
Composition
2x2)12( x 2x
![Page 17: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/17.jpg)
17
• Definition: The floor function, denoted f (x) = x or f(x) = floor(x), is the largest integer less than or equal to x.
• The ceiling function, denoted f (x) = x or f(x) = ceiling(x), is the smallest integer greater than or equal to x.
• Examples: 3.5 = 3, 3.5 = 4.• Note: the floor function is equivalent to
truncation for positive numbers.
P. 1
Floor and Ceiling
![Page 18: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/18.jpg)
18
• Example: Suppose f: B→C, g: A→B and fg is injective.• What can we say about f and g?– We know that if a b then f(g(a)) f(g(b)) since the
composition is injective.– Since f is a function, it cannot be the case that g(a)=
g(b) since then f would have two different images for the same point.
– Hence, g(a) g(b)– It follows that g must be an injection.– However, f need not be an injection (you show).
P. 1
Composition
![Page 19: 2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations](https://reader038.vdocuments.us/reader038/viewer/2022100509/56649e3f5503460f94b2fc70/html5/thumbnails/19.jpg)
19
• Function• Image• Preimage• Range• Injective (one-to-
one)• Surjective• Bijective
P. 1
Terms
• Cardinality• Inverse function• Composition• Floor function• Ceiling function