Simple partitioning of sequence in Proposition 1.15 in Folland's text

  • #1
psie
247
29
TL;DR Summary
I'm stuck at a simple idea in Proposition 1.15 in Folland's real analysis text, where he makes an assumption that I'm trying to grasp rigorously.
Below is Proposition 1.15 in Folland at the beginning of the section of Borel measures on ##\mathbb R## (he is trying to construct a measure from ##F##). Here the algebra ##\mathcal{A}## is the finite disjoint union of h-intervals, where h-interval is a set of the form ##(a,b]##, ##(a,\infty)## or ##\varnothing## for ##-\infty\leq a<b<\infty##.
yrRJGjv0.png

I assume the reader knows what a premeasure is (more or less a set function on an algebra that maps ##\varnothing## to ##0## and is countably additive for any sequence of disjoint sets in the algebra). First Folland shows that ##\mu_0## is well-defined. Then he goes on to show countable additivity, and in doing so, he makes a statement that I understand intuitively but that I don't understand how to write down rigorously.

Given a sequence of disjoint h-intervals ##\{I_j\}_1^\infty## such that ##\bigcup_1^\infty I_j\in\mathcal{A}##, he makes the following claim.

Since ##\bigcup_1^\infty I_j## is a finite disjoint union of h-intervals, the sequence ##\{I_j\}_1^\infty## can be partitioned into finitely many subsequences such that the union of the intervals in each subsequence is a single h-interval.

Again, intuitively this makes sense, but I'm looking for an explanation with symbols (e.g. where one proves that the union of the intervals in each subsequence is in fact a single h-interval). How would you do this?
 
Physics news on Phys.org
  • #2
psie said:
Again, intuitively this makes sense, but I'm looking for an explanation with symbols (e.g. where one proves that the union of the intervals in each subsequence is in fact a single h-interval).

Have you shown that [itex]\bigcup_{j=1}^\infty I_j[/itex] is indeed a finite disjoint union of h-intervals [itex]\bigsqcup_{n=1}^N H_n[/itex]? Without that you cannot proceed, since it is this which allows you to construct the subsequences.

For each [itex]H_n[/itex], define a subsequence consisting of those [itex]I_j[/itex] which intersect it. Each [itex]I_j[/itex] intersects exactly one [itex]H_n[/itex] or they would not be disjoint, so each [itex]I_j[/itex] appears in exactly one of those subsequences.

It is then straightforward that the union of the intervals in a subsequence is the corresponding [itex]H_n[/itex].
 
Last edited:
  • Like
Likes psie
  • #3
pasmith said:
It is then straightforward that the union of the intervals in a subsequence is the corresponding [itex]H_n[/itex].
Thank you. This is exactly the bit I'm struggling with. Here's my attempt:

There are two cases two consider regarding the sequence ##\{I_j\}_1^\infty##:
  1. For ##j>K##, the sequence equals ##\varnothing## and perhaps also before that. Then the statement of partitioning the sequence is trivially satisfied.
  2. If there isn't such ##K##, then we could simply consider ##\{I_j:j\in\mathbb N\}\setminus\{\varnothing\}## since ##\varnothing## doesn't contribute to the union. Let us proceed with this case.
We have $$\bigcup_{j=1}^\infty I_j = \bigcup_{i=1}^k J_i,$$ where ##J_i## are disjoint h-intervals. We can assume ##J_i## are maximal in the sense that for ##m\neq n##, the sets ##J_m,J_n## don't share endpoints and that none of them are the empty set; if e.g. ##J_m=(0,1]## and ##J_n=(1,2]## we could simply join them (likewise for the empty set). If we define the sets ##A_n = \{j\in\mathbb N : I_j\subset J_n\}## for ##n=1,\ldots,k##, then ##A_n##'s are disjoint and ##\bigcup_{j\in A_n} I_j=J_n##.

Showing that the ##A_n##'s are disjoint follows from the ##J_n##'s being disjoint, and showing ##\bigcup_{j\in A_n} I_j\subset J_n## is also straightforward from the definition of ##A_n##. But how do you show ##\bigcup_{j\in A_n} I_j\supset J_n##? Also, I'm a bit unsure where I'm using the assumption of maximality. I guess it is simply not possible to state ##\bigcup_{j\in A_n} I_j=J_n## without it.

EDIT: For ##\bigcup_{j\in A_n} I_j\supset J_n##, I guess one could simply argue like this. If ##x\in J_n## and ##x\notin \bigcup_{j\in A_n} I_j##, then ##\bigcup_{j=1}^\infty I_j\supset \bigcup_{i=1}^k J_i## would be false, a contradiction.
 
Last edited:
  • #4
Yes, the idea is that the [itex]H_n[/itex] are disjoint nonempty intervals and the union of any two or more distinct [itex]H_n[/itex] is disconnected. It follows by connectedness of intervals that if [itex]I_j[/itex] intersects more than one [itex]H_n[/itex] then the union of those [itex]H_n[/itex] is connected, which is a contradiction. Hence for every [itex]j \geq 1[/itex] either [itex]I_j = \varnothing[/itex] or else there exists a unique [itex]1 \leq n \leq N[/itex] such that [itex]I_j \subset H_n[/itex].

By definition, if [itex]I_j[/itex] is empty then it does not intersect any [itex]H_n[/itex] so it will not be included in any subsequence. "Partitioning" the sequence into subsequences does imply that every [itex]I_j[/itex] must be placed in some subsequence, so either the assumption is that none of the [itex]I_j[/itex] are empty, or else we can add a subsequence consisting of exactly those [itex]I_j[/itex] which are empty. Adding one to a finite number yields a finite number.

Let [itex](I_{j_k})_{k \geq 1}[/itex] be the subsequence of intervals which intersect the interval [itex]H_n[/itex].
  • By the above, each [itex]I_{j_k} \subset H_n[/itex] so [itex]\bigcup_{k=1}^\infty I_{j_k} \subset H_n[/itex] is immediate.
  • If [itex]x \in H_n \subset \bigcup_{j=1}^\infty I_j[/itex] then [itex]x \in I_j[/itex] for some [itex]j[/itex]. However, by construction the subsequence [itex](I_{j_k})_{k \geq 1}[/itex] contains all (and only) those [itex]I_j[/itex] which intersect [itex]H_n[/itex], so that [itex]x \in I_{j_k}[/itex] for some [itex]k[/itex]. Hence [itex]H_n \subset \bigcup_{k=1}^\infty I_{j_k}[/itex].
 
  • Like
Likes psie

Similar threads

Replies
1
Views
830
Replies
5
Views
294
Replies
1
Views
263
Replies
6
Views
995
Replies
2
Views
784
Replies
44
Views
5K
Replies
2
Views
2K
Back
Top