← 2013 Paper 2

UPSC 2013 Maths Optional Paper 2 Q2d — Step-by-Step Solution

14 marks · Section A

Real number system as ordered field with LUB property · Real Analysis · asked 2× in 13 yrs · Read the full method →

Question

Show that every open subset of R\mathbb R is a countable union of disjoint open intervals.

Technique

Connected-components construction via maximal open intervals; rationals provide the countability.

Solution

Let URU\subseteq\mathbb R be open. The proof proceeds in three steps: (1) construct the connected components of UU as a partition into maximal open intervals; (2) show distinct components are disjoint; (3) show there are countably many via the rationals.

Step 1 — Maximal open interval in UU through each point

Fix xUx\in U. Define

αx=inf{aR{}:(a,x]U},βx=sup{bR{}:[x,b)U}.\alpha_x=\inf\{a\in\mathbb R\cup\{-\infty\}:\,(a,x]\subset U\},\qquad\beta_x=\sup\{b\in\mathbb R\cup\{\infty\}:\,[x,b)\subset U\}.

(If the set has no lower bound, αx=\alpha_x=-\infty; similarly βx=\beta_x=\infty is allowed.)

Then αx<x<βx\alpha_x<x<\beta_x (because UU is open: a neighbourhood (xϵ,x+ϵ)U(x-\epsilon,x+\epsilon)\subset U exists, so αxxϵ<x<x+ϵβx\alpha_x\le x-\epsilon<x<x+\epsilon\le\beta_x).

Set Ix=(αx,βx)I_x=(\alpha_x,\beta_x) — open interval (possibly unbounded).

Claim: IxUI_x\subset U, and IxI_x is the largest open interval in UU containing xx.

Proof. For any yIxy\in I_x, WLOG y>xy>x. By definition of βx\beta_x as a sup, for ϵ=βxy>0\epsilon=\beta_x-y>0 there exists bb with [x,b)U[x,b)\subset U and b>βxϵ=yb>\beta_x-\epsilon=y. So y[x,b)Uy\in[x,b)\subset U. Similarly for y<xy<x. Hence IxUI_x\subset U.

Conversely, if JUJ\subset U is any open interval containing xx, then JIxJ\subset I_x by definition (any open interval through xx contained in UU stays within the bounds αx,βx\alpha_x,\beta_x).

Step 2 — Distinct components are disjoint

Claim: For x,yUx,y\in U, either Ix=IyI_x=I_y or IxIy=I_x\cap I_y=\emptyset.

Proof. Suppose IxIyI_x\cap I_y\ne\emptyset. Pick zIxIyz\in I_x\cap I_y. Then IxIyI_x\cup I_y is an open interval containing zz (the union of two overlapping open intervals is an open interval) and contained in UU. So IxIyIzIxI_x\cup I_y\subset I_z\subset I_x (by maximality of IxI_x at zz, since IxI_x contains zz). Hence IyIxI_y\subset I_x, and similarly IxIyI_x\subset I_y, so Ix=IyI_x=I_y.

Step 3 — Countability

The components {Ix:xU}\{I_x:x\in U\} (collected with each distinct IxI_x taken once) partition UU into pairwise disjoint open intervals.

For each component II, II is a non-empty open interval, so IQI\cap\mathbb Q\ne\emptyset (rationals are dense in R\mathbb R). Pick qIIQq_I\in I\cap\mathbb Q.

Different components are disjoint, so different components contribute different rationals: IIqIqII\ne I'\Rightarrow q_I\ne q_{I'}.

The map {I}Q\{I\}\to\mathbb Q, IqII\mapsto q_I, is injective. Since Q\mathbb Q is countable, the set of components is countable.

Conclusion

Answer

  U=n1In,  \boxed{\;U=\bigsqcup_{n\ge 1}I_n,\;}
We post more of this — worked solutions, CSAT trap breakdowns, guide chapters — a few times a week on Telegram. Free, no sign-in. Join

This solution is part of the Maths Coverage Map — 13 years, mapped. Get the take-away PDF free.