Scribd
Upload
68 views

Rinciple F Ounting: BBA-103 Unit - 1

The document provides an overview of key concepts related to functions including: 1) Definitions of functions, domain, codomain, range, and graphical representations. 2) Function terminology like images, pre-images, and properties like one-to-one, onto, and bijective. 3) Examples of floor and ceiling functions that are used frequently in discrete math.

Uploaded by

Rishab Jain 2027203
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
68 views

Rinciple F Ounting: BBA-103 Unit - 1

The document provides an overview of key concepts related to functions including: 1) Definitions of functions, domain, codomain, range, and graphical representations. 2) Function terminology like images, pre-images, and properties like one-to-one, onto, and bijective. 3) Examples of floor and ceiling functions that are used frequently in discrete math.

Uploaded by

Rishab Jain 2027203
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 23

BBA-103 PRINCIPLE OF COUNTING

UNIT - 1  Factorial Notation

 The Fundamental Counting Principle


1  Mathematical Induction

 Sequence and Series

 Concept of Function
CONCEPT OF FUNCTION

2
DEFINITION OF FUNCTIONS

 Given any sets A, B, a function f from (or


“mapping”) A to B (f : A  B) is an assignment of
exactly one element f(x)B

to each element x  A.

3
GRAPHICAL REPRESENTATIONS

 Functions can be represented graphically in


several ways:

f A B
• •
f • •
a• • • y
b •
•
•
•
A x
B Graph Plot
Like Venn diagrams 4
DEFINITION OF FUNCTIONS (CONT’D)

Formally: given f:AB


“x is a function” : (x,y: x=y  f(x)  f(y)) or

“x is a function” : ( x,y: (x=y)  (f(x)  f(y))) or

“x is a function” : ( x,y: (x=y)  (f(x) = f(y))) or

“x is a function” : ( x,y: (x=y)  (f(x) = f(y))) or

“x is a function” : ( x,y: (f(x)  f(y))  (x  y))


5
SOME FUNCTION TERMINOLOGY

 If f:AB, and f(a)=b (where aA & bB), then:


◦ A is the domain of f.

◦ B is the codomain of f.

◦ b is the image of a under f.

◦ a is a pre-image of b under f.
 In general, b may have more than one pre-image.

◦ The range RB of f is {b | a f(a)=b }.

6
RANGE VS. CODOMAIN - EXAMPLE

 Suppose that: “f is a function mapping students


in this class to the set of grades {A,B,C,D,E}.”

 At this point, you know f’s codomain is:


unknown!
__________, and its range is ________.
{A,B,C,D,E}

 Suppose the grades turn out all A’s and B’s.

 Then the range of f is ______,


{A,B} but its codomain is
_______________.
still {A,B,C,D,E}!
7
FUNCTION ADDITION/MULTIPLICATION

 We can add and multiply functions

f,g:RR:

 (f  g):RR, where (f  g)(x) = f(x)  g(x)

 (f × g):RR, where (f × g)(x) = f(x) × g(x)

8
FUNCTION COMPOSITION

 For functions g:AB and f:BC, there is a


special operator called compose (“○”).
◦ It composes (i.e., creates) a new function out of f,g
by applying f to the result of g.
(f○g):AC, where (f○g)(a) = f(g(a)).
◦ Note g(a)B, so f(g(a)) is defined and C.
◦ The range of g must be a subset of f’s domain!!
◦ Note that ○ (like Cartesian , but unlike +,,) is
9
non-commuting. (In general, f○g  g○f.)
IMAGES OF SETS UNDER FUNCTIONS

Given f:AB, and SA,

The image of S under f is simply the set of all images (under f) of

the elements of S.

f(S):{f(s)|sS}

: {b |  sS: f(s)=b}

Note, the range of f can be defined as simply the image (under f)

of f’s domain! 10
ONE-TO-ONE FUNCTIONS

 A function is one-to-one (1-1), or injective, or an


injection, if every element of its range has only
one pre-image.

 Only one element of the domain is mapped to


any given one element of the range.
◦ Domain & range have same cardinality. What about
codomain?

11
ONE-TO-ONE FUNCTIONS (CONT’D)
 Formally: given f:AB

“x is injective” : (x,y: xy  f(x)f(y)) or

“x is injective” : ( x,y: (xy)  (f(x)f(y))) or

“x is injective” : ( x,y: (xy)  (f(x)  f(y))) or

“x is injective” : ( x,y: (xy)  (f(x)  f(y))) or

“x is injective” : ( x,y: (f(x)=f(y))  (x =y))

12
ONE-TO-ONE ILLUSTRATION
 Graph representations of functions that are (or
not) one-to-one:

• • • •
• • • • •
• •
• • •
• • •
• • •
• • • •
• • •
Not one-to-one Not even a
One-to-one function!
13
SUFFICIENT CONDITIONS FOR 1-1NESS

 Definitions (for functions f over numbers):


◦ f is strictly (or monotonically) increasing if x>y 
f(x)>f(y) for all x, y in domain;

◦ f is strictly (or monotonically) decreasing if x>y 


f(x)<f(y) for all x, y in domain;

 If f is either strictly increasing or strictly


decreasing, then f is one-to-one.
◦ e.g. f(x)=x3
14
ONTO (SUBJECTIVE) FUNCTIONS

 A function f:AB is onto or surjective or a


surjection iff its range is equal to its
codomain (bB, aA: f(a)=b).

 An onto function maps the set A onto (over,


covering) the entirety of the set B, not just over a
piece of it.
◦ e.g., for domain & codomain R, x3 is onto, whereas x2
isn’t. (Why not?) 15
ILLUSTRATION OF ONTO

 Some functions that are or are not onto their


codomains:
• • • • • • • •
• • • • • •
• •
• • • • • •
• •
• • • •
• • • •
• •
Onto Not Onto Both 1-1 1-1 but
(but not 1-1) (or 1-1) and onto not onto

16
BIJECTIONS

 A function f is a one-to-one correspondence, or a


bijection, or reversible, or invertible, iff it is both
one-to-one and onto.

17
INVERSE OF A FUNCTION

 For bijections f:AB, there exists an inverse of f,


written f 1:BA, which is the unique function
such that:

1
f  f I

18
THE IDENTITY FUNCTION

 For any domain A, the identity function I:AA


(variously written, IA, 1, 1A) is the unique
function such that aA: I(a)=a.

 Some identity functions you’ve seen:


◦ ing with T, ing with F, ing with , ing with U.

 Note that the identity function is both one-to-one


and onto (bijective).
19
GRAPHS OF FUNCTIONS

 We can represent a function f:AB as a set of


ordered pairs {(a,f(a)) | aA}.

 Note that a, there is only one pair (a, f(a)).

 For functions over numbers, we can represent an


ordered pair (x,y) as a point on a plane. A
function is then drawn as a curve (set of points)
with only one y for each x.
20
A COUPLE OF KEY FUNCTIONS

 In discrete math, we frequently use the following


functions over real numbers:
 x (“floor of x”) is the largest integer  x.

 x (“ceiling of x”) is the smallest integer  x.

21
VISUALIZING FLOOR & CEILING

 Real numbers “fall to their floor” or “rise to their


ceiling.”
3
 Note that if xZ, 2 .1.6=2
1.6 .
1 .
x   x & 1.6=1

0
x   x 1
1.4= 1
.
1.4 .
 Note that if xZ, 2 .
1.4= 2

3 3. . .
3=3= 3
x = x = x. 22
PLOTS WITH FLOOR/CEILING: EXAMPLE

 Plot of graph of function f(x) = x/3:

f(x)

Set of points (x, f(x)) +2

3 +3 x

2

23

You might also like