Scribd
Upload
26 views2 pages

AA.L2 Preliminary Concepts Functions

This document defines key concepts in abstract algebra related to functions, including: - One-to-one, onto, and bijective (one-to-one correspondence) functions - Identity functions that map elements to themselves - Composition of functions by applying one function to the output of another - Inverse functions that undo the mapping of another function It provides examples to illustrate these concepts for different types of functions between sets.

Uploaded by

quarre.francis1
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
26 views2 pages

AA.L2 Preliminary Concepts Functions

This document defines key concepts in abstract algebra related to functions, including: - One-to-one, onto, and bijective (one-to-one correspondence) functions - Identity functions that map elements to themselves - Composition of functions by applying one function to the output of another - Inverse functions that undo the mapping of another function It provides examples to illustrate these concepts for different types of functions between sets.

Uploaded by

quarre.francis1
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/ 2

ABSTRACT ALGEBRA: PRELIMINARY CONCEPTS

Def. One to one function. Let 𝑓 ∶ 𝐴 → 𝐵 . We say that 𝑓 is one to


FUNCTIONS one if 𝑓(𝑥1 ) = 𝑓(𝑥2 ) implies 𝑥1 = 𝑥2 . One to one function is also
called injective functions.
Def. A function 𝑓 mapping 𝑋 into 𝑌 denoted by 𝑓 ∶ 𝐴 → 𝐵 is a
relation between 𝐴 and 𝐵 with the property that each 𝑥 ∈ 𝐴 appears Def. Onto function. A function 𝑓: 𝐴 → 𝐵 is said to be onto function
as the first member of exactly one ordered pair (𝑥, 𝑦) in 𝑓. The domain if for every 𝑦 ∈ 𝐵 there is an 𝑥 ∈ 𝐴 such that 𝑓(𝑥) = 𝑦 . Onto
of 𝑓 ∶ 𝐴 and the co-domain of 𝑓 ∶ 𝐵 . function are also called surjective functions.

For 𝑓 (𝑥) = 𝑦, 𝑥 is the pre-image of 𝑦 under 𝑓 and 𝑦 is the image of Def. One to one correspondence. Let 𝑓: 𝐴 → 𝐵. We say that 𝑓 is one to
𝑥 under 𝑓 one correspondence if 𝑓 is both one to one and onto. These functions
are also called bijective function.
To show that a relation σ is a well-defined function from 𝑋 into 𝑌:
• Show that the domain of 𝑓 is 𝐴, that is every element in 𝐴 is EXAMPLES:
mapped to an element in 𝐵. 1. Show that 𝑓(𝑥) = 3𝑥 − 2 is one to one.
• Show that if 𝑥1 = 𝑥2 in 𝐴, then 𝑓(𝑥1 ) = 𝑓(𝑥2 ) in 𝐵 for all 2−𝑥
2. If 𝑓(𝑥) = where 𝑓: ℤ → ℤ. Is 𝑓 an onto function?
𝑥1 , 𝑥2 ∈ 𝐴. 1+𝑥
3. Show that if 𝑓(𝑥) = 5𝑥 + 2 is surjective for 𝑓: ℝ → ℝ and
𝑓: ℤ → ℤ.
Examples:
4. If 𝑓(𝑥) = 𝑥 2 , where 𝑓: ℤ → ℤ . Tell whether 𝑓 is injective,
1. The relation defined by 𝑓: 𝑋 → 𝑌, as given the sets 𝑋 = {1,2,3}
surjective, bijective or not.
and 𝑌 = {𝑎, 𝑏} where 𝑓 = {(1, 𝑎), (2, 𝑎), (3, 𝑏)} is a function, since
no two images in 𝑌 have the same pre-image in 𝑋.
2. The relation defined by 𝑓: 𝑋 → 𝑌, as given the sets 𝑋 = {1,2}
and 𝑌 = {𝑎, 𝑏, 𝑐} where 𝑓 = {(1, 𝑎), (1, 𝑏), (2, 𝑐)} is not a function,
since 𝑓(1) = 𝑎 and 𝑓(1) = 𝑏, two images 𝑎 and 𝑏 have the same
pre-image 1.
Def. Identity Functions. Let 𝐴 be any set. Let the functions 𝑓: 𝐴 →
𝐴 be defined the formula 𝑓(𝑥) = 𝑥, that is, let 𝑓 assign to each
element in 𝐴 the element itself. Then 𝑓 is called identity function
or the identity transformation on 𝐴.

Def. Composition of Function. If 𝑓: 𝐴 → 𝐵 and 𝑔: 𝐵 → 𝐶 , then the


composite function of 𝑔 ∘ 𝑓: 𝐴 → 𝐶 is defined by (𝑔 ∘ 𝑓)(𝑥) = 𝑔(𝑓(𝑥))
for all 𝑥 ∈ 𝐴.

Example:
Let 𝑓: ℝ → ℝ be given by 𝑓(𝑥) = 5𝑥 + 1
Let 𝑔: ℝ → ℝ be given by 𝑔(𝑥) = 𝑥 2 − 2

Def. Inverse Functions. Let 𝑓: 𝐴 → 𝐵. Then 𝑓 −1 : 𝐵 → 𝐴 is said to be


an inverse of 𝑓 if, for any 𝑦 ∈ 𝐵, 𝑓 −1 (𝑦) = 𝑥 if and only if 𝑓(𝑥) = 𝑦.

Theorems. A function 𝑓: 𝐴 → 𝐵 is said to be invertible if there exist


a function 𝑓 −1 : 𝐵 → 𝐴 such that 𝑓 −1 ∘ 𝑓 is the identity map on 𝐴 and
𝑓 ∘ 𝑓 −1 is the identity map on 𝐵.

Example:
Let 𝑓: ℤ → 5ℤ be given by 𝑓(𝑥) = 𝑓𝑥.
𝑥
Let 𝑔: 5ℤ → ℤ be given by 𝑔(𝑥) = .
5

You might also like