INTRODUCTION
SET
Set theory is the mathematical theory of well-determined collections, called
sets, of objects that are called members, or elements, of the set.
For example, the set of all prime numbers, or A = {2, 3, 5, 7, 11, 13, 17, 19…}
Set theory can be broadly classified into two main aspects; study of finite sets,
the elements of which are also finite, is formally equivalent to arithmetic. The
essence of set theory is in the study of infinite sets, therefore defined as the
mathematical theory of the actual infinity.
CARTESIAN PRODUCT
Cartesian product is the product of any two sets. Given two sets A and B, the
Cartesian product A × B is the set of all possible ordered pairs (a, b) where a is
an element of A and b is an element of B. In other words, each element of A is
paired with every element of B. For example, if A = {1, 2} and B = {x, y}, then
their Cartesian product A × B is {(1, x), (1, y), (2, x), (2, y)}.
In mathematics, specifically set theory, the Cartesian product of two sets A and
B, denoted A × B, is the set of all ordered pairs (a, b) where a is in A and b is in
B.[1] In terms of set-builder notation, that is
SUBSETS
Definition:
A set (say A) which contains no other elements than that of a given set (say B)
is a subset of B. Hence all elements of set A are present in B. The formula for
finding the number of subsets is 2 n, where n is the cardinal number of a given
set.
“A is a subset of B” can be denoted as A ⊆ B
If A ⊆ B, then for all a ∈ A, a ∈ B
PROPER SUBSET
A proper subset is similar to a subset, but it doesn’t include the parent set
itself. For example, set A is a subset of itself but not a proper subset of itself.
It is denoted by ‘⊂’.
CARDINAL NUMBER
In set theory, the cardinal number of a set is a measure of the "size" or
"number of elements" in the set. For finite sets, the cardinal number is simply
the count of elements in the set.
It is denoted by n(name)
For example,
A = {1,2,3,4,5} then n(A) = 5
RELATION
In mathematics, a relation is a set of ordered pairs. It establishes a connection
or association between elements of two or more sets. A relation can be
represented using various notations, such as tables, graphs, or mappings. For
example, consider two sets A = {1, 2, 3} and B = {4, 5, 6}. A relation from set A
to set B can be defined as {(1, 4), (2, 5), (3, 6)}, indicating that 1 is related to 4,
2 is related to 5, and 3 is related to 6.
PRESENTATION
Case 1
Constraints:
n(A) = 1, n(B) = 3
Let's assume A = {1} and B = {a, b, c}.
Cartesian product:
A × B = {(1, a), (1, b), (1, c)}.
Subsets with zero elements: ∅ (Empty set)
Subsets of A × B (Relations from A to B):
Subsets with one element: {(a, x)}, {(a, y)}, {(a, z)}
Subsets with two elements: {(a, x), (a, y)}, {(a, x), (a, z)}, {(a, y), (a, z)}
Subsets with three elements: {(a, x), (a, y), (a, z)}
Number of subsets = 8
ANALYSIS
DATA - No. of relations from one set to another
From subsets of 2(n(A) * n(B))
CASE
cartesian product formula
Case 1 8 2(1 x 3) = 8
Case 2 8 2(3 x 1) = 8
Case 3 16 2(2 x 2) = 16
As seen by the table above, the number of relations from one set to another
found from subsets of cartesian product and by the formula 2 (n(A) * n(B)) are equal.
Therefore, the formula holds true for these cases.
CONCLUSION
ACKNOWLEDGEMENT
I would like to express my special thanks and gratitude to my mathematics
teacher, Mr. P. K. Dey, for his guidance and support in finishing my
mathematics project.
I extend my gratitude to my school, La Martiniere for Boys, for giving me the
opportunity to do this project, which greatly expanded my knowledge
regarding sets.
I am also thankful to my parents and friends, who have supported me in
completing this project.
