Functions

Functions and Subsets

one-to-one, onto, Bijection
Exercises

Chapter 4:Functions

Djohra MEGUEDMI

Algebra 1.

November 2025

Dr. Djohra MEGUEDMI Chapter 4:Functions 1 / 42

 Functions
Functions and Subsets
one-to-one, onto, Bijection
Exercises

Outlines of this talk

■ Functions
■ Exercises

Dr. Djohra MEGUEDMI Chapter 4:Functions 2 / 42

 Functions
Functions and Subsets Definitions
one-to-one, onto, Bijection Examples
Exercises

Definition

Let X and Y be non empty sets and let f be a relation from X to Y

■ Let X and Y be sets. A function f from X to Y is an object that, for each
element x ∈ X , assigns an element y ∈ Y .

■ We use the notation f : X → Y to denote a function as described. We write

f (x ) = y or f : x 7→ y to denote that the element in Y assigned to x is y .

■ We call X the domain of f , and we call Y the codomain of f .

■ If f (x ) = y , we say that x maps to y under f .
■ If f (x ) = y , we say that y is the image of x and x is a preimage of y .
■ Functions are sometimes also called mappings or transformations.

Dr. Djohra MEGUEDMI Chapter 4:Functions 3 / 42

 Functions
Functions and Subsets Definitions
one-to-one, onto, Bijection Examples
Exercises

■ f is a function because

∀x ∈ A, f ({x })is a singleton

■ We have f (a) = 3, f (b) = f (c) = 5, f (d) = 4 then a is the image of 3 and 3 is

the pre-image of a.

Figure: exemple 1

Dr. Djohra MEGUEDMI Chapter 4:Functions 4 / 42

 Functions
Functions and Subsets Definitions
one-to-one, onto, Bijection Examples
Exercises

Example 2

Figure: exemple 2

Dr. Djohra MEGUEDMI Chapter 4:Functions 5 / 42

 Functions
Functions and Subsets Definitions
one-to-one, onto, Bijection Examples
Exercises

Example 2

■ (P), (R), (S) are a functions

■ In Q we have f ({1}) = {1, −1} then f is not a function.

Dr. Djohra MEGUEDMI Chapter 4:Functions 6 / 42

 Functions
Functions and Subsets Definitions
one-to-one, onto, Bijection Examples
Exercises

Examples

Example
The function
IdE : E → E
x 7→ y = x
is called identity function.

Example
■ Suppose A ⊆ E . The characteristic function of A , χA : E → {0, 1}, is defined by
(
0 if x ∈
/A
χA =
1 if x ∈ A

Dr. Djohra MEGUEDMI Chapter 4:Functions 7 / 42

 Functions
Functions and Subsets Definitions
one-to-one, onto, Bijection Examples
Exercises

equality of functions

Definition
Let X , Y , A, B be sets, and let f : X → Y and g : A → B be functions. We say that f
is identically equal to g, denoted by f ≡ g, if the following conditions are met:
X =A
Y =B
∀x ∈ X , f (x ) = g(x ).

Remark f , g and h are differente because they havent the same starting or arrival set.

f:R→R , g : R+ → R and h : R → R+
2 2
x 7→ x , x 7→ x , x 7→ x 2 ,

Dr. Djohra MEGUEDMI Chapter 4:Functions 8 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Domaine of function

Definition
For a function f : X −→ Y the domain of f is the set X .
the domain is taken to be the set of all real x for which the function is defined.
Example
■
f :R→R
1
x 7→
x
Df = R∗

exercise
Find the domain of each function using interval notation
s
1 1− | x | 1
f (x ) = √ √ , h(x ) = , g(x ) = ln ln ln(x ) , t(x ) = (1 + ln x ) x )
x− 2−x 2− | x |

Dr. Djohra MEGUEDMI Chapter 4:Functions 9 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Definition
Let E , F be sets, and let f : E → F be a function. Given a set A ⊆ E , we define the
image of A in F , denoted f (A), to be the subset of F given by

f (A) = {y ∈ F | ∃x ∈ A with f (x ) = y }.

If A = E , the image of A in F is also called the range of f .

Figure: Image of a subset A by f

Dr. Djohra MEGUEDMI Chapter 4:Functions 10 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Example
Define f : Z → N by f (x ) = |x | + 1. To illustrate the concept of image, let’s consider
a few subsets of Z here.
■ If U = {0, 1, 2}, then the image of U is whatever function values are assigned to
these 3 numbers. As

f (0) = 1, f (1) = 2, f (2) = 3,

we have that f (U) = {1, 2, 3}.

Notice that as U has 3 elements in it, we cannot have more than 3 elements in
f (U).

■ If U = {−2, −1, 0, 1, 2}, then the image of U is whatever function values are
assigned to these five numbers. Since

f (−2) = 3, f (−1) = 2, f (0) = 1, f (1) = 2, f (2) = 3,

we have that f (U) = {1, 2, 3}.

Notice that despite the fact that U has 5 elements in it, we still only have 3
elements in f (U). This is due to the fact that some elements of f (U) are assigned
to more than one member of U.
Dr. Djohra MEGUEDMI Chapter 4:Functions 11 / 42
 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Example
■ If we wish to consider the range of f , we think about U = Z. In this case, we
have that every element of N is a member of the range; if n ∈ N, then by taking
z = n − 1, we have f (z) = n. Hence, for every n ∈ N, ∃z ∈ Z such that f (z) = n,
so every n ∈ N is a member of the range of f .

■ If U = {0}, then the image of U is just f (U) = {1}. In general, this is true: for
any function f : X → Y , we have that f ({x }) = {f (x )} for any x ∈ X ; that is,
the image of the set containing only one element x is the set containing only one
element, f (x ).

Dr. Djohra MEGUEDMI Chapter 4:Functions 12 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Example
We consider the function
f :R→R
x 7→ 2 − x
f ([0, 12 ]) = {f (x ) ∈ R, x ∈ [0, 12 ]}. We have

1
0≤x ≤ 2 =⇒ − 21 ≤ −x ≤ 0
=⇒ 23 ≤ 2 − x ≤ 2.
Then
1 3
f ([0, ]) = [ , 2]
2 2

Dr. Djohra MEGUEDMI Chapter 4:Functions 13 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Restriction of f to a subset

Definition
Let E , F be sets, and let f : E → F be a function. Given a set U ⊆ E , the restriction
of f to U, denoted as f |U , is the function f |U : U → F defined by f |U (x ) = f (x ) for
all x ∈ U.
The restriction of f to a subset will occasionally appear as a useful tool.

Dr. Djohra MEGUEDMI Chapter 4:Functions 14 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Definition
Let E , F be sets, and let f : E → F be a function. Given a subset B ⊆ F , we define
the preimage of B under f , denoted by f −1 (B), to be the subset of E given by

f −1 (B) = {x ∈ E | f (x ) ∈ B}.

Formally we have,
∀x ∈ E , x ∈ f −1 (B) ⇐⇒ f (x ) ∈ B

This is to say, the preimage of B is the set of all elements in E whose image is a
member of B. To ensure we understand the concept, let’s consider an example.

Dr. Djohra MEGUEDMI Chapter 4:Functions 15 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Example
We consider the function
f :R→R
x 7→ (x − 1)2
f −1 (0) = {x ∈ R | f (x ) = 0} = {1}

1 1
f −1 (]0, [) = {x ∈ R | f (x ) ∈]0, [}
2 2
To find f −1 (]0, 12 [) you must solve the inequality 0 < (x − 1)2 < 12 , it gives:
√ √
−1 1 2−1 2+1
f (]0, [) =] √ , 1[∪]1, √ [
2 2 2

Dr. Djohra MEGUEDMI Chapter 4:Functions 16 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Example

Let f : Z → Z with f (z) = |2z| for all z ∈ Z. Let’s consider the preimage of a few sets
B.
■ If V = {2}, then the preimage of V is all those elements in Z that map to 2; that
is, it is all choices of z for which f (z) = |2z| = 2. There are two such elements,
namely ±1. Hence f −1 (B) = {−1, 1}.

■ If B = {1}, then the preimage of V is all those elements in Z that map to 1; that
is, it is all choices of z for which f (z) = |2z| = 1. There are no such elements!
Hence, f −1 (V ) = ∅.

■ If B = {0}, then the preimage of B is all those elements of Z that map to 0,

which is clearly just z = 0. Hence f −1 (B) = {0}.

■ If B = {0, 1, 2, 3, 4}, then by repeating above ideas, we have that the elements in
Z for which f (z) ∈ B are exactly f −1 (B) = {−2, −1, 0, 1, 2}.

■ If we take B = {x ∈ Z | x ≥ 0 and x is even}, then every element of Z has its

image in B. Hence, we have f −1 (B) = Z.

Dr. Djohra MEGUEDMI Chapter 4:Functions 17 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Properties of Image and preimage of a subs

Proposition
Let f : E → F a function, A, B ⊂ E and M, N ⊂ F . We have
1- A ⊂ B =⇒ f (A) ⊂ f (B)
2- f (A ∪ B) = f (A) ∪ f (B)
3- f (A ∩ B) ⊂ f (A) ∩ f (B)
4- M ⊂ N =⇒ f −1 (M) ⊂ f −1 (N)
5- f −1 (M ∪ N) = f −1 (M) ∪ f −1 (N)
6- f −1 (M ∩ N) = f −1 (M) ∩ f −1 (N)

Dr. Djohra MEGUEDMI Chapter 4:Functions 18 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

We shall not prove all these properties here; those that we do not prove will be left as
an exercise. In particular, we shall prove items 3 and 5.
Partial Proof.
Let X , Y , f be as in the statement of Proposition
3. Let A, B ⊆ E . Suppose that y ∈ f (A ∩ B). Then by definition, there exists
x ∈ A ∩ B having f (x ) = y . Since x ∈ A ∩ B, we thus have that x ∈ A and
x ∈ B, so y ∈ f (A) and y ∈ f (B). But then y ∈ f (A) ∩ f (B), and thus
f (A ∩ B) ⊆ f (A) ∩ f (B).

5. We prove the set equality by double containment.

First, suppose that x ∈ f −1 (M ∪ N). Then by definition, f (x ) ∈ M ∪ N, so either
f (x ) ∈ M or f (x ) ∈ N. Suppose that f (x ) ∈ M, then we have x ∈ f −1 (M), and
hence x ∈ f −1 (M) ∪ f −1 (N).
For the other direction, suppose that x ∈ f −1 (M) ∪ f −1 (N). Then we have
x ∈ f −1 (M) or x ∈ f −1 (N); suppose that x ∈ f −1 (M). Then by definition, we
have f (x ) ∈ M, and thus f (x ) ∈ M ∪ N. But then x ∈ f −1 (M ∪ N).
Therefore, we have that f −1 (M ∪ N) = f −1 (M) ∪ f −1 (N) by double containment.

Dr. Djohra MEGUEDMI Chapter 4:Functions 19 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Remark
Counter example why you haven’t f (A ∩ B) = f (A) ∩ f (B)

Dr. Djohra MEGUEDMI Chapter 4:Functions 20 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Composite Functions

Definition
Let f : G → E and g : F → G two functions. We call the composite of the functions g
and f , the function denoted f ◦ g defined from F in E by

∀x ∈ F , f ◦ g(x ) = f (g(x ))

Dr. Djohra MEGUEDMI Chapter 4:Functions 21 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Composite Functions

We can have gof , fof , gog

Dr. Djohra MEGUEDMI Chapter 4:Functions 22 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Composite Functions

Example
Let f , g : R → R where f (x ) = x 2 and g(x ) = x + 1. Then

(g ◦ f )(x ) = g(x 2 ) = x 2 + 1,

while
(f ◦ g)(x ) = f (x + 1) = (x + 1)2 = x 2 + 2x + 1,
Therefore, in general,
g ◦ f ̸= f ◦ g

Dr. Djohra MEGUEDMI Chapter 4:Functions 23 / 42

 Functions
Functions and Subsets Domaine of function
one-to-one, onto, Bijection Operations
Exercises

Composite Functions

Proposition
LetE , F , G and H be four sets. For all functions f : E → F , g : F → G and
h : G → H, we have:
(h ◦ g) ◦ f = h ◦ (g ◦ f )

Remark We say ◦ is an associative operation on set of functions

Dr. Djohra MEGUEDMI Chapter 4:Functions 24 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

One-to-One Function or Injection function

Definition
A function f : E → F is one-to-one (or injective) if we have

∀x , x ′ ∈ E ; f (x ) = f (x ′ ) =⇒ x = x ′

or by taking the contrapositive of the implication,

∀x , x ′ ∈ E ; x ̸= x ′ =⇒ f (x ) ̸= f (x ′ )

Dr. Djohra MEGUEDMI Chapter 4:Functions 25 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Example
Show that the function g : R −→ R defined by g(x ) = x 3 − x is not injective.

Proof.
Notice that when x = 0, we obtain g(x ) = 03 − 0 = 0, and when x = 1, we have
g(x ) = 13 − 1 = 0. Therefore, as g(0) = g(1), and 0 ̸= 1, we have that g is not
injective.

Dr. Djohra MEGUEDMI Chapter 4:Functions 26 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

One-to-One
The functions f represented are one-to-one or injective:

Here are two non-injective functions:

Dr. Djohra MEGUEDMI Chapter 4:Functions 27 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

In general, when considering proving if a function is injective or not, the following

procedures can be employed:
Remark
To prove a function f : X → Y is injective:
■ Let x1 , x2 ∈ X be such that f (x1 ) = f (x2 ).
■ Follow any proof technique to conclude that x1 = x2 .
■ Conclude that f is injective.
To prove a function f : X → Y is NOT injective:
■ Find a specific choice of x1 , x2 ∈ X , such that x1 ̸= x2 , and f (x1 ) = f (x2 ).
■ Conclude that f is not injective.
Lets consider how injectivity plays with function composition.

Dr. Djohra MEGUEDMI Chapter 4:Functions 28 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Theorem
Let X , Y , Z be sets, and let f : X → Y and g : Y → Z be functions. If g and f are
both injective, then g ◦ f is injective.

Example

Let f : N → N be defined by f (x ) = 2x , and let g : N → N be defined by g(x ) = ⌈ x2 ⌉.

Notice that g is not injective, since g(1) = ⌈ 12 ⌉ = 1 = ⌈ 22 ⌉ = g(2). However, if we
consider the composition g ◦ f , we have g ◦ f (x ) = g(2x ) = ⌈ 2x 2 ⌉ = x , which is
certainly injective. Thus, even though g ◦ f is injective, we do not have to have that g
and f are both injective.
Remark
the ceiling function maps x to the least integer greater than or equal to x , denoted ⌈x ⌉
or ceil(x )
⌈2.4⌉ = 3, and⌈−2.4⌉ = −2.

Dr. Djohra MEGUEDMI Chapter 4:Functions 29 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Dr. Djohra MEGUEDMI Chapter 4:Functions 30 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Proof of Theorem .
Let f , g be as in the statement of the theorem, and suppose that both f and g are
injective. We wish to prove that g ◦ f is also injective.
Let x1 , x2 ∈ X , having g ◦ f (x1 ) = g ◦ f (x2 ).
By definition, then g(f (x1 )) = g(f (x2 )). Since g is injective, this implies that
f (x1 ) = f (x2 ).
Since f is injective, this implies that x1 = x2 . Therefore, by definition, g ◦ f is
injective.

In general, however, we do have a partial converse, the proof of which is left as an

exercise:
Proposition
Let X , Y , Z be sets, and let f : X → Y and g : Y → Z be functions. If g ◦ f is
injective, then f is injective.

Dr. Djohra MEGUEDMI Chapter 4:Functions 31 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Onto function or Surjection function

Definition
A function f : E → F is onto or surjective if we have

∀y ∈ F , ∃x ∈ E , y = f (x )

A surjection is also known as an onto function. From the definition, f is surjective if,
and only, if f (E ) = F .
Example
■ Show that the function f : R −→ R given by f (x ) = 2x + 1 is one-to-one and
onto.
■ Show that the function f : Z −→ Z given by f (n) = 2n + 1 is one-to-one but not
onto.
The function f is surjective if and only if the equation y = f (x ) admits at least one
solution x of E for any element y of F .

Dr. Djohra MEGUEDMI Chapter 4:Functions 32 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Example
Let f : Z → N be defined by f (z) = |z| + 2. Prove that f is not surjective.
Proof.
Notice that for any z ∈ Z, we have that f (z) ≥ 2. Therefore, if y = 1, there is no
z ∈ Z such that f (z) = y . Hence, f is not surjective.

Dr. Djohra MEGUEDMI Chapter 4:Functions 33 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Onto function or Surjection function

The function f represented are surjective: Here are two non-surjective functions:

Dr. Djohra MEGUEDMI Chapter 4:Functions 34 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

In general, when considering proving if a function is surjective or not, the following

procedures can be employed:

To prove a function f : X → Y is surjective:

Let y ∈ Y be an arbitrary element of the codomain.
Give an example of x ∈ X having f (x ) = y . Usually the choice of x will
depend on y in some meaningful way.
Conclude that f is surjective.
To prove a function f : X → Y is NOT surjective:
Find a specific choice of y ∈ Y for which there is no x ∈ X having f (x ) = y .
Conclude that f is not surjective.

Dr. Djohra MEGUEDMI Chapter 4:Functions 35 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

As with injectivity, we have a theorem about surjectivity and composition.

Theorem
Let X , Y , Z be sets, and let f : X → Y and g : Y → Z be functions. If f and g are
surjective, then g ◦ f is also surjective.

The converse here is false, and the example can prove it.
Example

Let f : N → N be defined by f (x ) = 2x , and let g : N → N be defined by g(x ) = x2 .

 

Then g ◦ f is surjective, but f is not surjective.

Notice that f is not surjective, since there is no x ∈ N having f (x ) = 1. But as noted
in Example , g ◦ f (x ) = x for all x ∈ N, which is clearly surjective.

Dr. Djohra MEGUEDMI Chapter 4:Functions 36 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Now, let us prove Theorem .

Proof of Theorem .
Let f , g be as in the statement of the theorem, and suppose that f and g are surjective.
Given z ∈ Z , there exists some y ∈ Y such that g(y ) = z, since g is surjective.
Moreover, since f is surjective, there exists some x ∈ X such that f (x ) = y . We
therefore have that g ◦ f (x ) = g(f (x )) = g(y ) = z, and hence, for any z ∈ Z , there
exists some x ∈ X such that g ◦ f (x ) = z. Therefore, g ◦ f is surjective.

Dr. Djohra MEGUEDMI Chapter 4:Functions 37 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Bijection

Definition
A function that is both injective and surjective is said to be bijective.

Proposition
The function f is bijective if and only if

∀y ∈ F , ∃! x ∈ E , y = f (x )

Dr. Djohra MEGUEDMI Chapter 4:Functions 38 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Inverse function

When a function is bijective, it is possible to introduce the notion of inverse function.

Definition
Let f : E → F a bijective map from E to F . We then define a function from F to E by

∀x ∈ E , y ∈ F , y = f (x ) ⇐⇒ x = f −1 (y )

Proposition
Let f : E → F be a bijective map, then f ◦ f −1 = IdF and f −1 ◦ f = IdE

Dr. Djohra MEGUEDMI Chapter 4:Functions 39 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Inverse function
Remark :
1- f ◦ f −1 = IdF is reformulated as follows: ∀y ∈ F , f (f −1 (y )) = y .
While f −1 ◦ f = IdE is written ∀x ∈ E , f −1 (f (x )) = x .
2- If f is bijective, we have (f −1 )−1 = f .

Examples
1- If E is a set, IdE is bijective and IdE−1 = IdE
2- Let f : R → R∗+ defined by: f (x ) = exp(x ) is bijective and its inverse bijection is
f −1 : R∗+ → R defined by f −1 (y ) = ln(y ). We have exp(ln(y )) = y for all y ∈ R∗+
and ln(exp(x )) = x for all x ∈ R.
3- we take the previous example. We had previously shown that it is injective and
surjective so it is a bijection. its inverse map is:

f −1 : R → R
x −1
x 7→ f −1 (x ) =
2

Dr. Djohra MEGUEDMI Chapter 4:Functions 40 / 42

 Functions One-to-One Function
Functions and Subsets Onto function
one-to-one, onto, Bijection Bijection function
Exercises Proprieties of Composition functions , Inverses

Composite functions

Proposition 1
Let E , F , G be three sets, f : E → F and g : F → G two functions.
1- If f and g are both one-to-one then g ◦ f is one-to-one.
2- If f and g are both onto then g ◦ f is onto.
3- If g ◦ f is one-to-one then f is one-to-one.
4- If g ◦ f is onto then g is onto.

Proof: Exercise 11 from Worksheet 3 .

Proposition 2
Let f : E → F and g : F → G be a bijective functions, then g ◦ f is bijective and its
inverse bijection is (g ◦ f )−1 = f −1 ◦ g −1 .

Dr. Djohra MEGUEDMI Chapter 4:Functions 41 / 42

 Functions
Functions and Subsets
one-to-one, onto, Bijection
Exercises

f : P(E ) → P(A) × P(B)

■ Let A, B ∈ P(E ), we consider the function
X 7→ (X ∩ A, X ∩ B)
Show that
f is injective ⇔ A ∪ B = E
f is surjective ⇔ A ∩ B = ∅
■ Let f : N −→ N defined by
(
f (n) = n if n is even
.
f (n) = n+1
2 if n is odd

Determine whether or not the following function is a surjection or an injection

Dr. Djohra MEGUEDMI Chapter 4:Functions 42 / 42