Fall 2017 - Problem 1

measure theory, monotone functions

Suppose f ⁣:RR\func{f}{\R}{\R} is non-decreasing; specifically, for x,yRx, y \in \R we have the implication

xy    f(x)f(y).x \leq y \implies f\p{x} \leq f\p{y}.

Show that if ARA \subseteq \R is a Borel set, then so is f(A)={f(x)xA}f\p{A} = \set{f\p{x} \mid x \in A}.

Solution.

Since ff is monotone, it is continuous except at countably many points DD, hence Borel. For each xDx \in D, define f+(x)=limyx+f(y)f_+\p{x} = \lim_{y \to x^+} f\p{y} and f(x)=limyxf(y)f_-\p{x} = \lim_{y \to x^-} f\p{y}. By modifying ff on a countable set, we may assume without loss of generality that f(x)=f(x)f_-\p{x} = f\p{x}, i.e., ff is left continuous. Then given xDx \in D, let

Ix=(f(x),f+(x)]Ux,I_x = \poc{f_-\p{x}, f_+\p{x}} \setminus U_x,

where Ux={f+(x)}U_x = \set{f_+\p{x}} if f+(x)f(R)f_+\p{x} \in f\p{\R} and \emptyset otherwise.

We claim that f(R)c=xDIxf\p{\R}^\comp = \bigcup_{x \in D} I_x. It's clear that "\supseteq", since ff is monotone and UxU_x handles the upper endpoint. Conversely, suppose yf(R)y \notin f\p{\R}. Let x=sup{xf(x)<y}x_- = \sup\,\set{x \mid f\p{x} < y} and x+=inf{xf(x)>y}x_+ = \inf\,\set{x \mid f\p{x} > y}. We claim that x=x+x_- = x_+: otherwise, x<x+x_- < x_+, so let x(x,x+)x \in \p{x_-, x_+}. Since x>xx > x_-, this means f(x)yf\p{x} \geq y, and because x<x+x < x_+, f(x)yf\p{x} \leq y, so f(x)=yf\p{x} = y, which is a contradiction. Thus, x=x=x+x = x_- = x_+, which means f(x)yf+(x)f_-\p{x} \leq y \leq f_+\p{x}.

Since yf(R)y \notin f\p{\R}, this means that f(x)<yf_-\p{x} < y. On the other hand, if y=f+(x)y = f_+\p{x}, then f+(x)f(R)    Ix=(f(x),f+(x)]f_+\p{x} \notin f\p{\R} \implies I_x = \poc{f_-\p{x}, f_+\p{x}}. If yf+(x)y \neq f_+\p{x}, then y(f(x),f+(x))Ixy \in \p{f_-\p{x}, f_+\p{x}} \subseteq I_x. Hence, f(R)c=xDIxf\p{\R}^\comp = \bigcup_{x \in D} I_x. Thus, f(R)cf\p{\R}^\comp is a countable union of Borel sets (intervals) hence Borel, which means that f(R)f\p{\R} is also Borel.

Another important property is that ff is injective after removing a countable set. Indeed, by monotonicity, f1({y})f^{-1}\p{\set{y}} is either empty, a singleton, or a non-trivial interval. Let CC be the set of yy where f1({y})f^{-1}\p{\set{y}} is an interval. By density, this contains a rational number r(y)r\p{y}, and if yzy \neq z, then f1({y})f1({z})=f^{-1}\p{\set{y}} \cap f^{-1}\p{\set{z}} = \emptyset, so r(y)r(z)r\p{y} \neq r\p{z}, i.e., yr(y)y \mapsto r\p{y} is an injection, so CC is countable.

Let F={Af(A) is Borel}\mathcal{F} = \set{A \mid f\p{A} \text{ is Borel}}. We will show that F\mathcal{F} is a σ\sigma-algebra containing the closed intervals.

Given [a,b]\br{a, b}, monotonicity of ff implies

f([a,b])=[f(a),f(b)]f(R),f\p{\br{a, b}} = \br{f\p{a}, f\p{b}} \cap f\p{\R},

which is an intersection of Borel sets, so F\mathcal{F} contains closed intervals.

First, it's clear that F\emptyset \in \mathcal{F}. We also know that n=1f(An)=f(n=1An)\bigcup_{n=1}^\infty f\p{A_n} = f\p{\bigcup_{n=1}^\infty A_n} for any collection of sets. Thus, to show that F\mathcal{F} is a σ\sigma-algebra, we just need to show that it is closed under complements. Let AFA \in \mathcal{F} so that

f(R)=f(A)f(Ac).f\p{\R} = f\p{A} \cup f\p{A^\comp}.

Notice that if yf(A)f(Ac)y \in f\p{A} \cap f\p{A^\comp}, then there exist xxx \neq x' so that f(x)=f(x)f\p{x} = f\p{x'}, so f=yf = y on an interval containing xx and xx'. Thus, yCy \in C, so f(A)f(Ac)f\p{A} \cap f\p{A^\comp} is at most countable which means

f(Ac)=f(A)c(f(A)f(Ac))f\p{A^\comp} = f\p{A}^\comp \cup \p{f\p{A} \cap f\p{A^\comp}}

is Borel, so AcFA^\comp \in \mathcal{F}. Thus, F\mathcal{F} is a σ\sigma-algebra containing closed intervals, so F\mathcal{F} contains all Borel sets.