Scribd
Upload
17 views

Discrete Structure 3

The document discusses different types of functions including one-to-one, onto, bijective, and inverse functions. It also covers floor and ceiling functions. Key aspects covered include the definitions of a function, domain, codomain, and range. Properties like injective, surjective, increasing, and decreasing functions are defined. Composition of functions is also discussed.

Uploaded by

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

Discrete Structure 3

The document discusses different types of functions including one-to-one, onto, bijective, and inverse functions. It also covers floor and ceiling functions. Key aspects covered include the definitions of a function, domain, codomain, and range. Properties like injective, surjective, increasing, and decreasing functions are defined. Composition of functions is also discussed.

Uploaded by

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

Discrete Structure

Functions
The notion of functions, Types of functions
(one-to-one, onto, bijection, ceiling, and floor).
Function
• Let A and B be nonempty sets. A function f from A to B is an assignment
of exactly one element of B to each element of A. We write f (a) = b if b
is the unique element of B assigned by the function f to the element a of
A. If f is a function from A to B, we write f : A → B.
• A function is a mathematical relation such that each element of the do-
main of the function is associated with exactly one element of the range
of the function. In order for a relation to be a function no two ordered
pairs may have the same first element.
Functions
• A function, denoted by f, is a special type of binary relation.
• A function from set A to set B is a relation f ⊆ A × B that satisfies the following
two properties:
• Each element a ∈ A is mapped to some element b ∈ B.
• Each element a ∈ A is mapped to exactly one element b ∈ B.

E.g., consider a relation R that contains pairs (1, 1), (1, 2). The relation R is not a function,
because the element 1 is mapped to two elements, which violates the second require-
ment.

Functions are sometimes also called


mappings or transformations.

Let A and B be nonempty sets. A function f from A to B is an assignment of ex-


actly one element of B to each element of A. We write f (a) = b if b is the unique
element of B assigned by the function f to the element a of A. If f is a function
from A to B, we write f : A → B.
Functions

• If is a function from set to set , we write .


• The fact that a function maps an element to an element is usually written as .

• The set is called the domain of the function , and the set is the codomain. The
domain and codomain of are denoted, respectively, and .

• If , the element is the image of under . Respectively, the element is


the preimage of under .
• The element is also often called the argument or input of the function , and the
element is called the value of the function or its output.

Two functions are equal when they have the same domain, have the
same codomain, and map each element of their common domain to
the same element in their common codomain
Function
Let f1 and f2 be functions from A to R. Then f1 + f2 and f1f2 are also func-
tions from A to R defined for all x ∈ A by
• (f1 + f2)(x) = f1(x) + f2(x),
• (f1f2)(x) = f1(x)f2(x).

Let f be a function from A to B and let S be a subset of A. The image of S under the function f is
the subset of B that consists of the images of the elements of S. We denote the image of S by

f (S), so f (S) = {t | ∃s ∈S (t = f (s))}.


We also use the shorthand {f (s) | s ∈ S} to denote this set.

The notation f (S) for the image of the set S under the function f is potentially ambiguous. Here, f
(S) denotes a set, and not the value of the function f for the set S.

Let A = {a, b, c, d, e} and B = {1, 2, 3, 4} with f (a) = 2, f (b) = 1, f (c) = 4, f (d)


= 1, and f (e) = 1. The image of the subset S = {b, c, d} is the set f (S) = {1, 4}.
One-To-One, Injunction
Some functions never assign the same value to two different domain el-
ements. These functions are said to be one-to-one.

A function f is said to be one-to-one, or an injunction, if and only if f (a) = f (b)implies that


a = b for all a and b in the domain of f. A function is said to be injective if it is one-to-one.
Onto, Surjection
For some functions the range and the codomain are equal. That is, every member of
the codomain is the image of some element of the domain. Functions with this prop-
erty are called onto functions.

A function f from A to B is called onto, or a surjection, if


and only if for every element b ∈ B there is an element a
∈ A with f (a) = b. A function f is called surjective if it is
onto.
A function f is onto if ∀y∃x(f (x) = y), where the domain for x
is the domain of the function and the domain for y is the
codomain of the function.
Increasing and Decreasing

A function f whose domain and codomain are sub-


sets of the set of real numbers is called increasing if
f (x) ≤ f (y), and strictly increasing if f (x) < f (y),
whenever x f (y), whenever x

A function f is increasing if ∀x∀y(x < y → f (x) ≤ f (y)), strictly increasing if


∀x∀y(x < y → f (x) < f (y)), decreasing if ∀x∀y(x < y → f (x) ≥ f (y)), and strictly
decreasing if ∀x∀y(x < y → f (x) > f (y)), where the universe of discourse is the
domain of f.
Correspondence, Bijection
The function f is a one-to-one correspondence, or a bi-
jection, if it is both one-to-one and onto. We also say
that such a function is bijective.
Injective & Surjective
Inverse Function
Consider a one-to-one correspondence f from the set A to the set B. Because f is an onto function, every
element of B is the image of some element in A. Furthermore, because f is also a one-to-one function, ev-
ery element of B is the image of a unique element of A. Consequently, we can define a new function from
B to A that reverses the correspondence given by f .

Let f be a one-to-one correspondence from the set A to the set B. The inverse function of f is the
function that assigns to an element b belonging to B the unique element a in A such that f (a) = b.
The inverse function of f is denoted by f −1. Hence, f −1(b) = a when f (a) = b.

Be sure not to confuse the function f −1 with


the function 1/f , which is the function that
assigns to each x in the domain the value 1/f
(x). Notice that the latter makes sense only
when f (x) is a non-zero real number

A one-to-one correspondence is called invertible because we can


define an inverse of this function. A function is not invertible if it is
not a one-to-one correspondence, because the inverse of such a
function does not exist.
Compositions of Functions
Let g be a function from the set A to the set B and let f be a function from
the set B to the set C. The composition of the functions f and g, denoted for
all a ∈ A by f ◦ g, is defined by (f ◦ g)(a) = f (g(a)).
Floor and Ceiling Function
Floor and Ceiling Function
Floor and Ceiling Functions

You might also like