Proof about size of a union of sets.

In summary, the continuum hypothesis states that the cardinality of the real numbers is 2^{\aleph_0}.
  • #1
cragar
2,552
3
Lets say I have [itex] \aleph_1 [/itex] numbers of sets that each have [itex] \aleph_1 [/itex]
number of elements and I want to show that the union of all of these sets has
[itex] \aleph_1 [/itex] number of elements.
I start with the line segment [0,1] and shift this line segment up by all the reals from 0 to 1.
So now we have the unit square. Now we want to show that this unit square can be mapped to [0,1]. So can we use trick where you take the decimal form of a point and expand it to 2 dimensions. [itex] (.x_1x_2x_3x_4...)\rightarrow (.x_1x_3...),(x_2x_4...) [/itex]
or another thought I had was to take the cantor set and move it around with a set of reals and map each set to a cantor set that was shifted across the real line.
 
Physics news on Phys.org
  • #2
You seem under the impression that [itex]\aleph_1[/itex] is the cardinality of the real numbers. This is not the case. The cardinality of the real numbers is [itex]2^{\aleph_0}[/itex].
 
  • #3
I thought [itex] 2^{\aleph_0}=\aleph_1 [/itex]
if i replace those 2 quantities, is my idea on the right track.
 
  • #4
cragar said:
I thought [itex] 2^{\aleph_0}=\aleph_1 [/itex]

Nope. The statement [itex]2^{\aleph_0}=\aleph_1[/itex] is known as the continuum hypothesis. It can be proven nor disproven. So under the usual ZFC axioms, we can't say that these two cardinals are equal.
 
  • #5
But yes, your basic idea of doing

[tex]0.x_1x_2x_3x_4x_5x_6...\rightarrow (0.x_1x_3x_5...,0.x_2x_4x_6...)[/tex]

is a good one.
 
  • #6
thanks for the correction about the continuum
 
  • #7
This is, I think, an interesting thing to think about re CH:

What happens when you assume ~CH : then you will find sets in your theory with

cardinality intermediate between Aleph_0 and Aleph_1. You may cut down on the

number of functions, say . Of course, I'm being a bit loose here.
 
  • #8
Bacle2 said:
This is, I think, an interesting thing to think about re CH:

What happens when you assume ~CH : then you will find sets in your theory with

cardinality intermediate between Aleph_0 and Aleph_1. You may cut down on the

number of functions, say . Of course, I'm being a bit loose here.

You mean: between [itex]\aleph_0[/itex] and [itex]2^{\aleph_0}[/itex]?? There is nothing between [itex]\aleph_0[/itex] and [itex]\aleph_1[/itex], even without CH.
 
  • #9
micromass said:
You mean: between [itex]\aleph_0[/itex] and [itex]2^{\aleph_0}[/itex]?? There is nothing between [itex]\aleph_0[/itex] and [itex]\aleph_1[/itex], even without CH.
.

Yes, between [itex]\aleph_0[/itex] and [itex]2^{\aleph_0}[/itex].
 
  • #10
And I hope this does not distract too much from the OP , but, if you think about it,

in a sense , there are infinitely-many mathematics: for every undecidable statement,

mathematics branches out into one system in which the undecidable statement holds,

and another system in which the statement does not hold. Something similar

happens with models of different cardinalities, say, the reals: which model is the

real model? We may choose the standard, the non-standard, or models of any

infinite cardinality per the compactness theorem.
 

1. What is the "size" of a union of sets?

The "size" of a union of sets refers to the number of elements in the combined set, without counting any duplicate elements. For example, if set A has 5 elements and set B has 3 elements, their union would have a size of 8.

2. How is the size of a union of sets calculated?

The size of a union of sets can be calculated by adding the number of elements in each individual set, and then subtracting the number of elements that are common between the sets. This ensures that the duplicate elements are not counted twice.

3. Can the size of a union of sets be greater than the sum of the individual sets' sizes?

Yes, the size of a union of sets can be greater than the sum of the individual sets' sizes if there are elements that are common between the sets. These common elements will only be counted once in the union, but would be counted twice if we were to simply add the sizes of the individual sets.

4. Is there a mathematical formula for calculating the size of a union of sets?

Yes, the formula for calculating the size of a union of sets is |A∪B| = |A| + |B| - |A∩B|, where A and B are the two sets and | | denotes the number of elements in a set.

5. How can the proof about the size of a union of sets be applied in real life?

The proof about the size of a union of sets can be applied in various situations, such as in counting the number of unique visitors to a website or calculating the total number of products in a store that have been sold by multiple vendors. It can also be used in statistics to analyze data from different groups and understand the overall trends.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
10
Views
2K
  • Set Theory, Logic, Probability, Statistics
2
Replies
55
Views
4K
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
5K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Topology and Analysis
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
18
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
2K
Replies
2
Views
325
Back
Top