Semiclosed Intervals

Before we go any further, let’s work towards an actual example of a measure. This one, in the long run, will be useful to us.

The underlying space we’re interested in is the real line. We need to start with a class of sets we’re interested in measuring. Specifically, we’re going to take to be the class of finite intervals, open on the right and closed on the left. That is, given finite real numbers we consider the interval

Such a bounded interval we’ll call “semiclosed”. We’ll also throw into and let this count as a degenerate sort of semiclosed interval.

Now, given two semiclosed intervals, their intersection is again a semiclosed interval. One possibility is that one interval contains the other, in which case the intersection is the smaller interval. Another possibility is that the intervals are disjoint, in which case their intersection is empty. The last possibility is that they overlap: we consider and with . Then their intersection is , which is a semiclosed interval.

The difference of two semiclosed intervals may or may not be a semiclosed interval. If intervals overlap, as above, then , and . If the intervals are disjoint, then the difference is just the original interval. But if contains , then the difference is . This isn’t a semiclosed interval, but it’s a finite disjoint union of semiclosed intervals.

But we know that these properties are exactly what we need to show that the collection of finite disjoint unions of intervals in is a ring. We could have started with open intervals or closed intervals, but then we wouldn’t have such a nice ring pop out.

We will define a finite set function . For an interval , we define . For the empty set, we define . This is the function that will be developed into our measure.