Can Taking Infinite Power Sets Lead to Cardinality of \aleph_0?

cragar
Messages
2,546
Reaction score
3
If I started with a one element set and took its power set. And then I just kept taking the power set forever, would I eventually end up
with a set that had cardinality of \aleph_0 ?
 
Mathematics news on Phys.org
cragar said:
If I started with a one element set and took its power set. And then I just kept taking the power set forever, would I eventually end up
with a set that had cardinality of \aleph_0 ?

Depends what you mean by "eventually end up."

You would have a sequence of sets of cardinalities 1, 2, 4, 16, 2^16, ...

So what you would "end up" with is no more than a sequence of sets. You would have \aleph_0 many sets all together, but each one would have finite cardinality.

The sequence of cardinalities would be unbounded, meaning that there is no finite limit to how large the cardinalities get. But each cardinality would be a finite number.
 
cragar said:
If I started with a one element set and took its power set. And then I just kept taking the power set forever, would I eventually end up
with a set that had cardinality of \aleph_0 ?

because just taking power sets doesn't give us anything else from finite sets, except MORE finite sets, one cannot PROVE the existence of an infinite set. but we "intuitively feel" that the natural numbers ought to be a set, so an axiom is added to set theory that guarantees the existence of at least one infinite set (this is called, oddly enough, the axiom of infinity).

this allows us to show that there is at least (and therefore several) one set with cardinality aleph-null. in other words, we feel like any worth-while system of mathematics ought to come with induction "built-in" as a standard feature. if math (in this case, "set theory") doesn't formally include arithmetic (at least), one feels that a wrong turn has been taken somewhere (sort of like, if you can't say "hello" and "good-bye" in a language, perhaps you're not using a very good language).

of course, no one has ever checked that "+1" always gives you bigger and bigger numbers (who has that kind of patience?), but it seems illogical that it would not. this is what people mean when they say "the successor function is injective", that n+1 is always something not in the set {0,1,2,...,n}.

to answer your original question:

the set of cardinalities would have cardinality aleph-null, but none of the elements of that set would.
 
interesting, thanks for the responses
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top