Open subset of R written as a countable union of pairwise disjoint open intervals?

In summary, the theorem states that every non-empty open set in ℝ can be uniquely expressed as a finite or countably infinite union of pairwise disjoint open intervals. I have a very difficult time understanding the proof even though it apparently seems pretty obvious, and the theorem doesn't even make intuitive sense to me.
  • #1
dumbQuestion
125
0
I wasn't sure if I should post this in the analysis or topology forum, but this seems to be closely related to compactness so I thought I'd post it here. When dealing with ℝ, the following theorem seems to be really important:"Every non-empty open set G in ℝ can be uniquely expressed as a finite or countably infinite union of pairwise disjoint open intervals in ℝ"Unfortunately, I have a very difficult time figuring out this proof even though apparently it seems like it's supposed to be pretty obvious. Sadly, the theorem doesn't even make intuitive sense to me. The proofs I see all start at like this:

(I'm just copying from this example document http://www.math.louisville.edu/~lee/RealAnalysis/IntroRealAnal-ch05.pdf , the proof on the top of page 5-7, because this seems to be a common way to tackle this proof)

"Let G be open in R. For x ∈ G let αx = inf {y | (y, x] ⊂ G} and βx =
sup {y| [x, y) ⊂ G}. The fact that G is open implies αx < x < βx. Define Ix = (αx, βx). Then Ix ⊂ G"

Here is where my confusion begins: isn't Ix G itself? We know G is an open interval on ℝ, so G = (a,b) for some a < b. So isn't αx = a and βx =
sup {y| [x, y) ⊂ G} = b? I mean just by def of sup and inf? I feel this is where all my confusion stems from and if I could clear up my faulty logic at this step I could digest the remainder of the proof.
 
Physics news on Phys.org
  • #2


Not all open sets are intervals in [itex]\mathbb{R}[/itex]. Take the set [itex](-1,0) \cup (0,1)[/itex] for example.
 
  • #3


Why do you think G is an open interval?? The theorem merely says that G is an open set. Not all open sets are open intervals! An easy example is [itex](0,1)\cup (2,3)[/itex].
 
  • #4


aaaaah, thanks guys! I'm facepalming at the moment...
 
  • #5


I can understand your confusion with this theorem. It may seem counterintuitive at first, but it is actually a fundamental result in topology. Let me try to explain it in a different way that might help you understand it better.

First, let's define what an open subset of ℝ is. An open subset of ℝ is a set G such that for any point x in G, there exists an open interval (α, β) containing x that is completely contained within G. In other words, every point in G has a neighborhood that is also contained in G.

Now, let's consider an open subset G of ℝ. For any point x in G, we can define αx and βx as the infimum and supremum, respectively, of all the numbers y such that (y, x] and [x, y) are both contained in G. This means that αx is the largest number that is less than x and is still in G, and βx is the smallest number that is greater than x and is still in G.

Next, we define Ix as the open interval (αx, βx). This interval is also contained in G, because αx and βx are the largest and smallest numbers in G that are less than x and greater than x, respectively.

Now, let's consider all the points x in G and the corresponding intervals Ix. We can see that these intervals are pairwise disjoint, meaning that no two of them overlap. This is because if two intervals Ix and Iy overlap, then there would be a point z in both intervals, but this is impossible since z would have to be both less than x and greater than y, which is a contradiction.

Finally, we can express G as a union of all these intervals Ix. This is because every point in G is also in one of the intervals Ix, and no two intervals overlap. So we can say that G is a countable union of pairwise disjoint open intervals.

I hope this explanation helps you understand the theorem better. It may still seem counterintuitive, but it is a result that has been proven and used in many areas of mathematics. As a scientist, it is important to accept and understand results like this, even if they may seem confusing at first.
 

FAQ: Open subset of R written as a countable union of pairwise disjoint open intervals?

1. What does it mean for a subset of R to be open?

An open subset of R is a set that contains all of its interior points, meaning that for any point in the set, there is a small enough open interval around that point that is also contained within the set.

2. How is a countable union of open intervals related to an open subset of R?

An open subset of R can be written as a countable union of pairwise disjoint open intervals, meaning that it can be expressed as a collection of open intervals that do not overlap with each other and when combined, they make up the entire open subset.

3. Why is it important to write an open subset of R as a countable union of pairwise disjoint open intervals?

Expressing an open subset of R in this way allows us to better understand and analyze its properties, such as its connectedness and compactness. It also helps us prove theorems and make generalizations about open subsets of R.

4. Can any open subset of R be written as a countable union of pairwise disjoint open intervals?

Yes, every open subset of R can be written in this form. This is known as the Vitali Covering Theorem.

5. How can the idea of an open subset of R written as a countable union of pairwise disjoint open intervals be applied in real-world situations?

This concept can be applied in various fields of science and mathematics, such as topology, analysis, and geometry. It also has practical applications in engineering, economics, and physics, where open subsets of R are used to model continuous systems and phenomena.

Back
Top