Scribd
Upload
38 views15 pages

Understanding Relations and Partitions

A relation is a set of ordered pairs connecting elements from two sets, with the first components forming the domain and the second forming the range. A partition is a collection of non-empty, mutually exclusive subsets of a set that collectively exhaust the original set. Understanding relations and partitions is crucial in mathematics for simplifying complex calculations and analyzing relationships between sets.

Uploaded by

Reymart
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
38 views15 pages

Understanding Relations and Partitions

A relation is a set of ordered pairs connecting elements from two sets, with the first components forming the domain and the second forming the range. A partition is a collection of non-empty, mutually exclusive subsets of a set that collectively exhaust the original set. Understanding relations and partitions is crucial in mathematics for simplifying complex calculations and analyzing relationships between sets.

Uploaded by

Reymart
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

Relation

and
Partition
Relation
A relation between two sets A and B is a set of ordered pairs
(a, b), where a is an element of A and B is an element of B.
Relation
In simpler terms, a relation describes how elements from
one set are connected to elements in another set.
Relation
A relation is any set of ordered pairs. The set of all first
components of the ordered pairs is called the domain. The
set of all second components is called the range.
Example
A1 = {1, 2, 3} A1 = {Anna, Bea}
A2 = {4, 5, 6} A2 = {Bea, Carlo}
R = {(1, 4), (2, 5), (3, 6)} R = {(Anna, Bea), (Bea, Carlo)}

A1 = {John, Peter}
A2 = {26,28}
R = {(John, 26), (Peter, 28)}
Activity
1. 2.
A1= {9,8,7,6,5} A1={Melinda,Melchor,Berting}
A2={0,1,2,3,4,} A2={60,58,59}
Partition
In discrete mathematics, a partition is a collection of non-empty
subsets of a set that are mutually exclusive and collectively
exhaustive. This means that every element in the original set is
in exactly one of the subsets.
Partition
If S is a nonempty set, then a partition of S is a collection
{Ai} of nonempty subset of S such that
(1)S=Ui Ai.

(2)If Ai and Aj are two cells,


then either Ai = Aj or Ai Ո Aj =Ø
Example

Cell

Cell

Cell

Cell
Example

Any two cells are disjoint

The union of all of the cells


is the set S.
S={a,b,c,d,e,f,g,h}
Partition Not Partition
A1 = {a,b,c,d} A1 = {a,b,c}
A2 = {e,f,g,h}
A2 = {e,f,g,h}

A1 = {a,b,c}
A1 = {a,c,g} A2 = {c,d,e,f,g,h}
A2 = {b}
A3 = {d,e,f,h}
S={a,b,c,d,e,f,g,h}
Partition Not Partition
S=Z S=Z
A1 = odd numbers A1 = positive numbers
A2 = even numbers A2 = negative numbers
Activity
Partition
S={1,2,3,4,5,6,7}
Conclusion
A relation conclusion is a summary of the relationship between two sets of
objects. It can also refer to the conclusion of a written work that discusses
relationships.

Partitioning is important in maths because it allows you to break down larger


numbers into smaller, more manageable parts, making complex calculations
easier to perform, especially when dealing with addition, subtraction, and
multiplication, and helps students understand the place value of each digit
within a number.

You might also like