This document defines basic concepts related to relations and functions. It defines what a relation is between two sets and provides examples of different types of relations including reflexive, symmetric, transitive, and equivalence relations. It also defines one-to-one, onto, bijective, and invertible functions. Several short questions are provided as examples related to these concepts along with longer proof-based questions.
Functions Representations
CMSC 56 | Discrete Mathematical Structure for Computer Science
October 13, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
Functions Representations
CMSC 56 | Discrete Mathematical Structure for Computer Science
October 13, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
CMSC 56 | Lecture 12: Recursive Definition & Algorithms, and Program Correctnessallyn joy calcaben
Recursive Definition & Algorithms, and Program Correctness
CMSC 56 | Discrete Mathematical Structure for Computer Science
October 23, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
This an animated slides for students. Introduce basis concept of proofs to students. Direct proofs. Please search for slides Proof methods-teachers. If you want to teach using these slides.
Sets & Set Operation
CMSC 56 | Discrete Mathematical Structure for Computer Science
September 11, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
RELATIONS
A relation associates an element of one set with one or more elements of another set.
If ''a'' is an element from set A which associates another element ''b'' from set B, then the elements can be written in an ordered pairs as (a,b)Thus we can define a relation as a set of ordered pairs.Some relations are denoted by letter R; in set notation a relation can be written asR = {(a, b): a is an element of the first set, b is an element of the second set}
Example of a relation
1. 1. Mwajuma is a wife of Juma.
2. 2. Amina is a sister of Joyce.
3. 3. y = 2x + 3 4. Juma is tall, Anna is short. (Not a relation)
NOTE If the relation R defines the set of all ordered pairs (x,y) such that .
y = 2x + 3 this can be written symbolically as
R = {(x, y): y=2x +3}
PICTORIAL REPRESENTATION OF RELATIONS
Relation can be represented pictorially;
i) Arrow diagram.
ii) Cartesian graph.
CMSC 56 | Lecture 12: Recursive Definition & Algorithms, and Program Correctnessallyn joy calcaben
Recursive Definition & Algorithms, and Program Correctness
CMSC 56 | Discrete Mathematical Structure for Computer Science
October 23, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
This an animated slides for students. Introduce basis concept of proofs to students. Direct proofs. Please search for slides Proof methods-teachers. If you want to teach using these slides.
Sets & Set Operation
CMSC 56 | Discrete Mathematical Structure for Computer Science
September 11, 2018
Instructor: Allyn Joy D. Calcaben
College of Arts & Sciences
University of the Philippines Visayas
RELATIONS
A relation associates an element of one set with one or more elements of another set.
If ''a'' is an element from set A which associates another element ''b'' from set B, then the elements can be written in an ordered pairs as (a,b)Thus we can define a relation as a set of ordered pairs.Some relations are denoted by letter R; in set notation a relation can be written asR = {(a, b): a is an element of the first set, b is an element of the second set}
Example of a relation
1. 1. Mwajuma is a wife of Juma.
2. 2. Amina is a sister of Joyce.
3. 3. y = 2x + 3 4. Juma is tall, Anna is short. (Not a relation)
NOTE If the relation R defines the set of all ordered pairs (x,y) such that .
y = 2x + 3 this can be written symbolically as
R = {(x, y): y=2x +3}
PICTORIAL REPRESENTATION OF RELATIONS
Relation can be represented pictorially;
i) Arrow diagram.
ii) Cartesian graph.
Chapter wise important questions in Mathematics for Karnataka 2 year PU Science students. This is taken from the PU board website and compiled together.
(a) Natural Numbers : N = {1,2,3,4,...}
(b) Whole Numbers : W = {0,1,2,3,4, }
(c) Integer Numbers :
or Z = {...–3,–2,–1, 0,1,2,3, },
Z+ = {1,2,3,....}, Z– = {–1,–2,–3, }
Z0 = {± 1, ± 2, ± 3, }
(d) Rational Numbers :
p
Q = { q ; p, q z, q 0 }
(i) R0 : all real numbers except 0 (Zero).
(j) Imaginary Numbers : C = {i,, }
(k) Prime Numbers :
These are the natural numbers greater than 1 which is divisible by 1 and itself only, called prime numbers.
Ex. 2,3,5,7,11,13,17,19,23,29,31,37,41,...
(l) Even Numbers : E = {0,2,4,6, }
(m) Odd Numbers : O = {1,3,5,7, }
Ex. {1,
Note :
5
, –10, 105,
3
22 20
7 , 3
, 0 ....}
The set of the numbers between any two real numbers is called interval.
(a) Close Interval :
(i) In rational numbers the digits are repeated after decimal.
(ii) 0 (zero) is a rational number.
(e) Irrational numbers: The numbers which are not rational or which can not be written in the form of p/q ,called irrational numbers
Ex. { , ,21/3, 51/4, ,e, }
Note:
(i) In irrational numbers, digits are not repeated after decimal.
(ii) and e are called special irrational quantities.
(iii) is neither a rational number nor a irrational number.
(f) Real Numbers : {x, where x is rational and irrational number}
20
[a,b] = { x, a x b }
(b) Open Interval:
(a, b) or ]a, b[ = { x, a < x < b }
(c) Semi open or semi close interval:
[a,b[ or [a,b) = {x; a x < b}
]a,b] or (a,b] = {x ; a < x b}
Let A and B be two given sets and if each element a A is associated with a unique element b B under a rule f , then this relation is called function.
Here b, is called the image of a and a is called the pre- image of b under f.
Note :
(i) Every element of A should be associated with
Ex. R = { 1,1000, 20/6, ,
, –10, –
,.....}
3
B but vice-versa is not essential.
(g) Positive Real Numbers: R+ = (0,)
(h) Negative Real Numbers : R– = (– ,0)
(ii) Every element of A should be associated with a unique (one and only one) element of but
any element of B can have two or more rela- tions in A.
3.1 Representation of Function :
It can be done by three methods :
(a) By Mapping
(b) By Algebraic Method
(c) In the form of Ordered pairs
(A) Mapping :
It shows the graphical aspect of the relation of the elements of A with the elements of B .
Ex. f1:
f2 :
f3 :
f4 :
In the above given mappings rule f1 and f2
shows a function because each element of A is
associated with a unique element of B. Whereas
f3 and f4 are not function because in f 3, element c is associated with two elements of B, and in f4 , b is not associated with any element
of B, which do not follow the definition of function. In f2, c and d are associated with same element, still it obeys the rule of definition of function because it does not tell that every element of A should be associated with different elements of B.
(B) Algebraic Method :
It shows the relation between the elem
Similar to Relations and functions assignment (2019 20) (20)
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
Delivering Micro-Credentials in Technical and Vocational Education and TrainingAG2 Design
Explore how micro-credentials are transforming Technical and Vocational Education and Training (TVET) with this comprehensive slide deck. Discover what micro-credentials are, their importance in TVET, the advantages they offer, and the insights from industry experts. Additionally, learn about the top software applications available for creating and managing micro-credentials. This presentation also includes valuable resources and a discussion on the future of these specialised certifications.
For more detailed information on delivering micro-credentials in TVET, visit this https://tvettrainer.com/delivering-micro-credentials-in-tvet/
Delivering Micro-Credentials in Technical and Vocational Education and Training
Relations and functions assignment (2019 20)
1. RELATIONS& FUNCTIONS
Basic concepts and formulae
Relation : If A and B are two non- empty sets, then any subset R of A ×B is called relation from set A to set B.
i.e. R : A → 𝐵 ⇔ 𝑅 ⊆ A × B.
Some standard types of Relations : Let A be a non- empty set. Then, a relation R on set A is said to be.
Reflexive : If (x, x)∈ R for each element x∈ A, i.e., if x R x for each element x ∈ A.
Symmetric : If (x, y)∈ R ⇒ (y, x) ∈ R for all x, y∈ A, i.e., if x Ry ⇒ y Rx for all x, y ∈ A.
Transitive : If (x, y)∈ R and (y, z)∈ R ⇒ (x, z) ∈, for all x, y, z ∈ A, i.e., if xRy and yRz ⇒ xRz.
Equivalence relation : Any relation R on a set A is said to be an equivalence relation if R is reflexive,
symmetric and transitive.
A function F:X→Y is one -one or injective if f(x1)=f(x2) ⟹x1= x2 for all x1, x2∈ X
A function F:X→Y is onto or surjective if for every y∈ Y there exist x∈ X: f(x)=y
A function which is both one-one and onto is called bijective.
A function F:X→Y is invertible if and only if f is bijective.
The composition of functions f: A→B and g: B→C is the functiopn gof: A→C given by gof(x)= g(f(x))
A function F:X→Y is invertible if there exist g: Y→X such thast gof=Ix and fog= Iy.
Short Questions
1. What is the range of the function f(x) =
𝑥−1
𝑥−1
2. F: R→R f(x)= (3-x3
)1/3
, find (fof)(x)
3. If f(x) = x2
+ 2 and g(x) =
x
x+1
, find gof (5).
4. F : R→R is defined by f(x)= 3x+2. Find f(f(x))
5. A= {1,2,3} and B={4,5,6,7} and f={(1,4),(2,5),(3,6)} be a function from A to B. state whether f is one one or onto.
6. Given an example to show the relation R in the set of real nos. , defined by R = {( x, y); x≤ y2
} is not transitive.
7. Let f : R - {
−3
5
} → R be a function defined as f (x) =
2x
5x+3
, find f-1
.
8. If f(x) = 2x + 5 , g(x) = 2x – 5 , x∈ R find (fog) (9).
9. If R = {(x , y) : x2
+ y2
≤ 4 ; x , y∈Z } is a relation in Z , write the domain of R.
10. If f : R→R be a function defined by f(x) = 3x – 4 , then write f-1
(x).
11. f : R – (- 1) → R – (+ 1) be defined as f(x) =
x
x+1
, find f -1
(x).
12. Find the smallest equivalence Relation on the set A={1,2,3}
13. Show that modulus function F : R→R is not one –one and onto.
Long Questions
1. Prove that f: N→N defined by f(x)= x2
+x+1 is one- one but not onto.
2. Prove that the relation R in set A={5,6,7,8,9} given by R= {(a,b): |a-b| is divisible by 2} is an equivalence relation.
Find all the elements related to element 6.
3. Let T be the set of all triangles in a plane with R as a relation in T given by R = {(T1 , T2) : T1≅ T2}. Show that R
is an equivalence relation.
4. Show that the relation R on Z defined by R = {(a, b) : a – b is divisible by 5} is an equivalence relation.
5. Let N be the set of all natural numbers and R be the relation in N ×N defined by
(a , b) R (c , d) if ad = bc. Show that R is an equivalence relation.
6. Show that the function f : R → R defined by f(x) = 2x3
– 7 for x ∈ R is bijective.
2. 7. Let A={1,2,3......9} be the set of all natural numbers and R be the relation in A ×A defined by
(a , b) R (c , d) if a+d = b+c. Show that R is an equivalence relation. Also obtain the equivalence class [(2,5)]
8. Let N be the set of all natural numbers and R be the relation in N ×N defined by
(a , b) R (c , d) if ad(b+c) = bc(a+d). Show that R is an equivalence relation.
9. Show that the relation R in the set : A = { x : x ∈ Z, 0≤x ≤12} given by.
R = {( a, b): a − b is divisible by 4} is an equivalence Relation.
10. Show that the relation R in the set R of real no. defined as R = {( a, b) : a ≤ b2
} is neither reflexive nor symmetric
nor transitive.
11. Prove that the relation R in the set A = { 1, 2, 3, 4, 5} given by R = {(a, b) : a − b is even } is an equivalence
relation. Also obtain the equivalence class of {1}
12. Let A = R – { 3 } and B = R – { 1}, f : A → B defined by f (x) =
x−2
x−3
. Is f is one – one and onto ? Justify your
answer.
13. Consider f : R → R given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.
14. Let f : R →R be defined as f(x) = 10x + 7. Find the function g : R → R : gof = fog = IR.
15. Let L be the set of all lines in XY plane and R be the relation in L defined as R = {( L1 , L2 ) : L1 is parallel to L2 }.
Show that R is an equivalence relation.
16. Check whether the relation R in R defines by R = {(a, b) : a ≤ b3
} is reflexive, symmetric or transitive.
17. Show that the relation R in the set Z of integers given by R = {( a, b) : 2 divides a – b} is an equivalence relation.
18. State whether the function is one – one, onto f : R → R : f (x) = 1 + x2
. Justify your answer.
19. Show that f : [ -1 , 1 ] →R, given by f(x) =
x
x+2
is one – one. Also find f-1
.
20. Let f : N → R be a function defined as f (x) = 4x 2
+ 12x + 5. Show that f : N → S is invertible and find the inverse
of f , where S is the range of the function
21. Consider f : R+→ [ 4, ∞ ) given by f (x) = x2
+ 4. Show that f is invertible with f -1
(y) = y − 4.
22. Consider f : R+→ [ -5 , ∞ ) given by f (x) = 9x2
+ 6x - 5. Show that f is invertible with f -1
(y) =
y+6−1
3
.
23. Show that if f : R -
7
5
→ R -
3
5
is defined by f(x) =
3x+4
5x−7
and g : R -
3
5
→R -
7
5
is defined by
g(x) =
7x+4
5x−3
, then fog = IA and gof = I B where IA (x) = x, IB (x) = x.
24. Show that the relation R on the set A = {x ∈ Z : 0≤ 𝑥 ≤ 12}, given by
R = {(a, b): 𝑎 − 𝑏 𝑖𝑠 𝑎 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 of 4} is an equivalence relation.
25. Let A = R – {3} and B = R -
2
3
. If f : A → B: f(x) =
2x−4
3x−9
, then prove that f is a bijective function.
26. Consider f : R+→ [ -9 , ∞ ) given by f (x) = 5x2
+ 6x - 9. Show that f is invertible with f -1
(y) =
54+5y−3
5
.
27. Let A = R – { b } and B = R – { 1}, f : A → B defined by f (x) =
x−a
x−b
. show that f is bijective function