We prove that S=B(R), where B(R) is the
smallest σ−algebra on R containing all open subsets of R and it is called
the collection of Borel subsets of R.
Step 1. S⊂B(R).
Fix r,s∈Q. Observe that
(r,s]=k=1⋂∞(r,s+1/k). Each interval (r,s+1/k) is open, hence belongs to B(R).
Because B(R) is a σ−algebra, it follows that
(r,s]∈B(R).
Since S is the smallest σ−algebra containing all such intervals,
we conclude that
S⊂B(R).
Step 2. Rational approximation of real numbers.
Let x∈R+.
Define rn(x) as the truncation of x at n digits after the decimal point.
Then:
rn(x)∈Q,
rn(x) is increasing,
∣x−rn(x)∣≤10−n.
Define sn(x) as the truncation of x at n digits after the decimal point,
followed by adding 10−n. Then:
sn(x)∈Q,
sn(x) is decreasing,
∣x−sn(x)∣≤10−n.
Hence rn(x)↑x and sn(x)↓x.
If x<0, we use −rn(−x)↓x and −sn(−x)↑x.
Step 3. Representation of open intervals.
Let a<b.
If a,b>0, then
(a,b)=n=1⋃∞(sn(a),rn(b)]. If a<0<b, then
(a,b)=n=1⋃∞(−rn(−a),rn(b)]. The case a,b<0 follows by the same argument, using the sequences
−rn(−x) and −sn(−x).
We now treat an interval with an infinite endpoint.
Let a∈R.
If a>0, then
(a,+∞)=m=1⋃∞ n=1⋃∞(sn(a),m]. If a<0, a similar construction using −rn(−a) yields a representation of
(a,+∞) as a countable union of intervals (r,s] with rational endpoints.
Similarly, the case (−∞,a) follow by the same argument, using rn(x) for a>0 and −sn(−x) for a<0.
Thus every open interval of R is a countable union of elements of
{(r,s]:r,s∈Q}, and hence belongs to S.
Step 4. Conclusion.
Every open subset of R is a countable union of open intervals.
Therefore every open set belongs to S, which implies
B(R)⊂S. Combining this with Step 1 yields
S=B(R). ■