Reply to Thread New Thread |
![]() |
#23 |
|
The thing you're talking about is called the Cardinality of a set, and is a pretty important part of mathematics. In layman's terms, it's "How many elements does a set contain?" It's also as hard as hell. A member on another math-and-other-sciences-forum once said
It was only about a year ago that this was introduced to me in a formal setting, I remember the day before my lecturer advised us all to get a good nights sleep and make sure we'd had enough breakfast because understanding cardinalities is not easy. I also made up a metaphor that asks the same thing and is probably more understandable to most people: Say we have a house and in it an infinite amount of rooms. Each room takes up the same amount of space, and each room takes up the same amount of space as all the others put together. How can this be? As it turns out, real numbers don't follow the rules of common sense, which is why this is very much possible. Anyway, you have three types of sets: finite, countably infinite (isn't that just weird?) and uncountable. A finite set is any set who's cardinality can be expressed by a natural number, eg.: 308. The official definition is "If the cardinality of a set S (denoted |S|) is smaller than the cardinality of the set of Natural Numbers (denoted |N|) it is considered finite. Symbolically, if |S| < |N|, then it is finite". A countably infinite set is a set who's cardinality is equal to that of natural numbers, ie.: |S|=|N|. The cardinality of that set is denoted by the symbol ![]() ![]() How can you do this in math? Well with functions of course. If there exists a function that will "assign" an different element from B to every element in A, we can say that they have the same cardinality, right? The official way of saying this is "If there exists a bijection (bijective function) between A and B...". In this manner, we can prove that the set of Even Naturals is the same as the set of all Naturals, since there exists a bijection between them: the function f(x)=2x. In the same way we can say that the cardinality of the set of Prime numbers is Aleph Null, since we can index them. As for uncountable sets, this is a little beyond me. I know that the cardinality of the set of reals, denoted |R|, is equal to the power set of the Naturals, which is ![]() Anyway, I love infinity, and hope my post brings you closer to this state of utter speechlessness in the face of such beauty ![]() Cheers, Gabe |
![]() |
Reply to Thread New Thread |
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
|