The Camtasia Studio video content presented here requires JavaScript to be enabled and the latest version of the Macromedia Flash Player. If you are you using a browser with JavaScript disabled please enable it now. Otherwise, please update your version of the free Flash Player by downloading here.
The first number set we learned as children was the set of
natural or
counting numbers. This is
also true in the history of humans; early humans first counted the
objects around them.
A
small child would point at each insect and count them.
Definition.
If each element of a set A
can be paired with exactly one element of a set
B and if each element of
B can be paired with exactly
one element of A, then there
is a one-to-one correspondence
between A and
B. The sets
A and
B are said to be
equivalent, denoted as
A ~ B.
Show set A = {a,
b, c} and set B = {●,♦,
♥}
are equivalent, i.e., show A ~ B.
a
b
c
|
|
|
●
♦
♥ |
The two sets are
equivalent since a one-to-one
correspondence can be made between the
two sets. |
a
b
c
|
|
|
●
♥
♦
|
a
b
c
|
|
|
♦
●
♥ |
a
b
c
|
|
|
♦
♥
●
|
How many other distinct one-to-one correspondences
could be made where a, b, c
are kept in the same order? What are they? That is, how many different
one-to-one correspondences could be made?
Important Note.
Equal
sets are equivalent, but equivalent sets may
not be equal. This was
illustrated in the above example where
A ~ B, but
A
≠
B.
Two sets are equal when they have exactly the same elements, and sets
are equivalent when a one-to-one correspondence can be set up between
the two sets.