Westonci.ca offers quick and accurate answers to your questions. Join our community and get the insights you need today. Discover detailed solutions to your questions from a wide network of experts on our comprehensive Q&A platform. Connect with a community of professionals ready to provide precise solutions to your questions quickly and accurately.
Sagot :
George Canter showed that, for any set a, we have |a|<|p(a)|. This is a well-known theorem of canter, known as the 'Canter's Theorem'.
Proving this theorem:
Proof: At the first instance, we need to show that, A bar ≤P(A) bar, we will define the injection by f:A→P(A) by: f(a)={a}. Let g be the contradiction.
We need to prove that there is no bijection g:A→P(A).
Now, Let: S={a∈A:a∉g(a)}⊆A.}
In the present condition, there are two possibilities, first, x∈S and second, x∉S.
Therefore,
1. If x∈S, then x∉g(x)=S, i.e., x∉S, a contradiction.
2. If x∉S, then x∈g(x)=S, i.e., x∈S, a contradiction.
Thus, such a bijection, is not possible.
This theorem, coined by Canter, basically implies that there is no largest cardinal number present. There are 'n' number of cardinal numbers present, i.e., there are infinite number of cardinal numbers.
Now, suppose that, A is a set of all sets, this was proved by the continuum hypothesis. But, the continuum hypothesis can't be proved. It can't be disproved also.
To know more about the Cantor's Theorem:
https://brainly.com/question/29516991
#SPJ4
Thank you for trusting us with your questions. We're here to help you find accurate answers quickly and efficiently. Thanks for using our platform. We aim to provide accurate and up-to-date answers to all your queries. Come back soon. Thank you for choosing Westonci.ca as your information source. We look forward to your next visit.