Absolutely Continuous Functions Gsm-105-Prev
Absolutely Continuous Functions Gsm-105-Prev
Absolutely Continuous
Functions
Undergradese, III: “Hmmm, what do you mean by that?” Trans-
lation: “What’s the answer so we can all go home?”
— Jorge Cham, www.phdcomics.com
The Cantor function shows that for monotone functions the fundamental
theorem of calculus fails for Lebesgue integration. Indeed,
1
u (t) dt = 0 < u (1) − u (0) = 1.
0
73
74 3. Absolutely Continuous Functions
Remark 3.2. Note that since is arbitrary, we can also take = ∞, namely,
replace finite sums by series.
(ii) Assume that for every ε > 0 there exists δ > 0 such that
(u (bk ) − u (ak )) ≤ ε
k=1
Part (ii) of the previous exercise shows that in Definition 3.1 we cannot
remove the condition that the intervals (ak , bk ) are pairwise disjoint.
By taking = 1 in Definition 3.1, it follows that an absolutely continuous
function u : I → R is uniformly continuous. The next exercise shows that
the converse is false.
Exercise 3.4. Let u : (0, 1] → R be defined by
1
u (x) := xa sin b ,
x
where a, b ∈ R. Study to see for which a, b the function u is absolutely
continuous. Prove that there exist a, b for which u is uniformly continuous
but not absolutely continuous.
Exercise 3.5. Let I ⊂ R be an interval and let u : I → R be differentiable
with bounded derivative. Prove that u belongs to AC (I).
Exercise 3.6. Let u, v ∈ AC ([a, b]). Prove the following.
(i) u ± v ∈ AC ([a, b]).
(ii) uv ∈ AC ([a, b]).
(iii) If v (x) > 0 for all x ∈ [a, b], then u
v ∈ AC ([a, b]).
(iv) What happens if the interval [a, b] is replaced by an arbitrary in-
terval I ⊂ R (possibly unbounded)?
Proof. Step 1: Assume that u ∈ ACloc (I) and let [a, b] ⊂ I. Take ε = 1,
and let δ > 0 be as in Definition 3.1. Let n be the integer part of 2(b−a)
δ and
b−a
partition [a, b] into n intervals [xi−1 , xi ] of equal length n ,
a = x0 < x1 < · · · < xn = b.
Then
L1o (u (E)) ≤ M L1o (E) .
|u (y) − u (x)| ≤ (M + ε) |y − x|
78 3. Absolutely Continuous Functions
and so
(n) (n)
L1o (u (En )) ≤ L1o u Jk ≤ L1o u Jk
k∈I k∈I
(n) (n)
≤ (M + ε) L 1
Jk ≤ (M + ε) L1o Jk
k∈I k
= (M + ε) L (Un ) ≤ (M + ε) L1o (En ) + ε ,
1
(n)
where we have used the fact that the intervals Jk are pairwise disjoint.
Hence, (3.4) holds.
Since L1o is a regular outer measure and {En } (and in turn {u (En )})
is an increasing sequence, by Proposition B.105 in Appendix B we may let
n → ∞ in the previous inequality to obtain
L1o (u (E)) ≤ (M + ε) L1o (E) + ε .
It now suffices to let ε → 0+ .
Proof. Assume that E has Lebesgue measure zero. For every n ∈ N write
En := {x ∈ E : |u (x)| ≤ n}. Since u is differentiable in E, it follows that
∞
E= En ,
n=1
k 1 k k − 1 1 k 1 1 k
∞ ∞ ∞
≤ L En = L E n + L En
2n 2n 2n
k=1 k=1 k=1
∞
u (x) dx + L (E) ≤ u (x) dx + L (E) ,
1 1
≤
Enk 2n E 2n
k=1
Ek := E ∩ [k, k + 1] .
so that u (Jk ) = [u (ak ) , u (bk )]. Using the fact that L1 (A) ≤ δ, we have
that
|bk − ak | ≤ δ,
k
and so, by the absolute continuity of u and Remark 3.2,
|u (bk ) − u (ak )| ≤ ε.
k
Hence,
L1 (u (E)) ≤ L1 (u (A ∩ [a, b]))
≤ L1 (u (Jk )) ≤ L1 u (Jk )
k k
= L ([u (ak ) , u (bk )]) =
1
|u (bk ) − u (ak )| ≤ ε.
k k
Remark 3.19. Note that the Cantor function does not satisfy the (N )
property since it sends a set of Lebesgue measure zero, the Cantor set D,
into the full interval [0, 1].
Exercise 3.20. Let u : [a, b] → R be continuous and strictly increasing.
Prove that u is absolutely continuous if and only if it maps the set
E := x ∈ [a, b] : u (x) = ∞
into a set of Lebesgue measure zero.
Exercise 3.21. Let u : [a, b] → R be continuous and strictly increasing.
Prove that its inverse u−1 : [u (a) , u (b)] → R is absolutely continuous if and
only if the set
E := x ∈ [a, b] : u (x) = 0
has Lebesgue measure zero.
Exercise 3.29 (The Cantor set and the (N ) property). Let D be the Cantor
set.
(i) Prove that every number x ∈ [0, 2] can be written as
∞
cn
x=2 ,
3n
n=1
where cn ∈ {0, 1, 2}, and deduce that every element in [0, 2] can be
written as the sum of two elements of D.
(ii) Prove that if v : D → R is continuous and L1 (v (D)) = 0, then v
can be extended to a continuous function on [0, 1] that has the (N )
property. Hint: Make v differentiable outside D.
(iii) For each x ∈ D write
∞
cn (x)
x=2 ,
3n
n=1
where cn ∈ {0, 1} and prove that there exist two continuous func-
tions u1 : [0, 1] → R and u2 : [0, 1] → R with the (N ) property and
such that for all x ∈ D,
∞
∞
c2n (x) c2n+1 (x)
u1 (x) = n
, u2 (x) = .
3 3n
n=1 n=1
(iv) Prove that u1 + u2 does not have the (N ) property.
3.1. AC (I) Versus BP V (I) 85
where in the fourth equality we have used the fact that the open interval of
endpoints x and x0 is contained in J.
Hence, in the interval J we may write u in terms of the telescopic series
∞
u = u1 + (un+1 − un ) .
n=1
and since χUn \Un+1 ≥ 0, the function un − un+1 is monotone in the intervals
(−∞, x0 )∩J and [x0 , ∞, )∩J. By Fubini’s theorem (applied in each interval)
we get that for L1 -a.e. x ∈ J,
∞
u (x) = u1 (x) + un+1 (x) − un (x) = lim un (x) .
n→∞
n=1
and so we may proceed as in the first step (using telescopic series) to show
that u (x) = v (x) for L1 -a.e. x ∈ I.
In the general case, it suffices to write v = v + − v − .
The next corollary follows from the previous theorem and Corollary 3.22.
Corollary 3.32. Let I ⊂ R be an interval and let u : I → R be everywhere
differentiable. If u ∈ L1loc (I), then for all x, x0 ∈ I,
x
u (x) = u (x0 ) + u (t) dt.
x0
Proof. Since u, v ∈ ACloc (I), by Exercise 3.6, uv ∈ ACloc (I), and thus, by
part (iii) of Theorem 3.30,
x
u (x) v (x) − u (x0 ) v (x0 ) = (uv) dt.
x0
convergence theorem and the fact that u is continuous and increasing gives
(3.10) u (x) dx = sup u − inf u.
I I I
Hence, if
b
u dx = Var[a,b] u,
a
then all the previous inequalities are equalities, and so
b
V dx = V (b) − V (a) .
a
Taking the supremum over every partition Pk of [ak , bk ] for each k, we have
that
Var[ak ,bk ] u ≤ ε.
k
Hence, by Tonelli’s theorem applied to each interval [ak , bk ],
u dx ≤ u dx = u dx = Var[ak ,bk ] u ≤ ε.
E A∩I k [ak ,bk ] k
In the proof we will show that (f ◦ u) (x) = 0 and u (x) = 0 for L1 -a.e.
x ∈ I such that f is not differentiable at u (x).
To prove Theorem 3.44, we need an auxiliary result, which is a converse
of Corollary 3.14.
Lemma 3.45. Let I ⊂ R be an interval and let u : I → R. Assume
that u has derivative (finite or infinite) on a set E ⊂ I (not necessarily
measurable), with L1 (u (E)) = 0. Then u (x) = 0 for L1 -a.e. x ∈ E.
where we have used the fact that En ⊂ J ∩ Ek∗ . Since u (En ) ⊂ Jn , we have
sup |u (x) − u (y)| ≤ L1 (Jn ) ,
x,y∈En
and so
∞
I≤k L1 (Jn ) < kε.
n=1
It now suffices to let ε → 0+ .
Corollary 3.46. Let I ⊂ R be an interval and let u : I → R, v : I → R.
Assume that there exists a set E ⊂ I such that u and v are differentiable for
all x ∈ E and u (x) = v (x) for all x ∈ E. Then u (x) = v (x) for L1 -a.e.
x ∈ E.
96 3. Absolutely Continuous Functions
Proof. In view of Theorem 3.12, all the hypotheses of Theorem 3.44 are
satisfied.
where ∂u∂f
i
(u (x)) ui (x) is interpreted to be zero whenever ui (x) = 0, may
fail. This is illustrated by the next example.
98 3. Absolutely Continuous Functions
We will discuss this problem in more detail at the end of Section 4.3.
As a corollary of Theorem 3.44 we have the following change of variables
formula.
Theorem 3.54 (Change of variables). Let g : [c, d] → R be an integrable
function and let u : [a, b] → [c, d] be differentiable L1 -a.e. in [a, b]. Then
(g ◦ u) u is integrable and the change of variables
u(β) β
(3.16) g (t) dt = g (u (x)) u (x) dx
u(α) α
holds for all α, β ∈ [a, b] if and only if the function f ◦u belongs to AC ([a, b]),
where z
f (z) := g (t) dt, z ∈ [c, d] .
c
Proof. Let ⎧
⎨ n if g (z) > n,
gn (z) := g (z) if − n ≤ g (z) ≤ n,
⎩
−n if g (z) < −n.
Applying the Lebesgue dominated convergence theorem and the previous
corollary, we obtain
u(β) u(β)
g (z) dz = lim gn (z) dz
u(α) n→∞ u(α)
β β
= lim gn (u (x)) u (x) dx = g (u (x)) u (x) dx.
n→∞ α α
such that u maps sets of Lebesgue measure zero into sets of Lebesgue measure
zero. Then
(3.20) ψ (t) dy = ψ (x) u (x) dx.
R I
t∈u−1 ({y})
Proof. Step 1: Assume first that I = (a, b) and that u ∈ Cc1 (I). Con-
sider the open set A := {x ∈ I : u (x) = 0} and let {(ak , bk )} be the count-
able family of connected components of A. If u > 0 in (ak , bk ) and ψ ∈
L∞ ((ak , bk )), then by Corollary 3.59 (applied in (ak , bk ) to the functions u
−1
and g := ψ ◦ v, where v := u|(ak ,bk ) ) we get
bk u(bk ) −1
(3.21) ψ (x) u (x) dx = ψ u|(ak ,bk ) (y) dy.
ak u(ak )
On the other hand, since u|(ak ,bk ) is strictly decreasing and continuous, for
every y ∈ (u (ak ) , u (bk )) there is one and only one t ∈ (ak , bk ) such that
u (t) = y, so that (ak , bk ) ∩ u−1 ({y}) = {t}, while, if y ∈ R \ (u (ak ) , u (bk )),
then (ak , bk ) ∩ u−1 ({y}) = ∅. This shows that
u(bk )
ψ (t) dy = ψ (t) dy
R u(ak )
t∈(ak ,bk )∩u−1 ({y}) t∈(ak ,bk )∩u−1 ({y})
u(bk ) −1
= ψ u|(ak ,bk ) (y) dy.
u(ak )
where in the last equality we have used the fact that L1 (u (I \ A)) = 0 once
more.
This shows that (3.20) holds.
Step 2: Assume next that I = (a, b), that there exists a compact set K ⊂ I
such that ψ = 0 on I \ K, that u is differentiable for all x in K, and that
u (y) − u (x)
lim = u (x) uniformly for x ∈ K.
y∈K, y→x y−x
Then by Exercise 3.66 below there exists a function v ∈ Cc1 (I) such that
v = u and v = u on K. Applying the previous step to v and with ψ
replaced by χK ψ, we obtain
ψ (x) u (x) dx = χK (x) ψ (x) v (x) dx
K
I
= χK (t) ψ (t) dy
R
t∈v −1 ({y})
= ψ (t) dy = ψ (t) dy.
R R
t∈K∩v −1 ({y}) t∈K∩u−1 ({y})
Since L1 I \ ∞ K
j=1 j = 0, by hypothesis we have that
⎛ ⎛ ⎞⎞
∞
L1 ⎝u ⎝I \ Kj ⎠⎠ = 0,
j=1
Proof. Step 1: Assume that f is locally Lipschitz and let u ∈ ACloc (I).
Fix an interval [a, b]. In particular, |u| is bounded in [a, b] by some constant
, and so there exists L > 0 such that
(3.23) |f (z1 ) − f (z2 )| ≤ L |z1 − z2 |
for all z1 , z2 ∈ [−, ]. We claim that f ◦ u is absolutely continuous in [a, b].
Indeed, since u ∈ AC ([a, b]), for every ε > 0 there exists δ > 0 such that
ε
|u (bk ) − u (ak )| ≤
L
k
3.2. Chain Rule and Change of Variables 105
for every finite number of nonoverlapping intervals (ak , bk ) ⊂ [a, b], with
(bk − ak ) ≤ δ.
k
Hence, by (3.23),
|(f ◦ u) (bk ) − (f ◦ u) (ak )| ≤ L |u (bk ) − u (ak )| ≤ ε,
k k
u (x) := z0 − 2
b−a
if x < a,
⎩ b−a
z0 + 2 if x > b.
Since u ∈ ACloc (I), by hypothesis (f ◦ u) ∈ AC ([a, b]). In particular, it is
bounded in [a, b]. Thus, there exists a constant Mz0 = Mz0 (a, b) > 0 such
that
f z0 + x − a + b ≤ Mt0
2
for all x ∈ [a, b], which implies that
|f (z)| ≤ My0
for all z ∈ z0 − b−a b−a
2 , z0 + 2 . A compactness argument shows that f is
bounded in [−r, r] by some constant Mr > 0.
Next we claim that f is Lipschitz in [−r, r]. Indeed, assume by con-
tradiction that this is not the case. Then we may find two sequences
{sn } , {tn } ⊂ [−r, r] such that sn = tn and
|f (sn ) − f (tn )|
(3.24) > 2 n2 + n
|sn − tn |
for all n ∈ N. Since {sn } is bounded, we may extract a subsequence (not
relabeled) such that sn → s∞ . Take a further subsequence (not relabeled)
such that (3.24) continues to hold and
1
(3.25) |sn − s∞ | < .
(n + 1)2
106 3. Absolutely Continuous Functions
Hence,
|sn − tn | (b − a) (b − a)
0 < δn := < → 0.
2Mr 2 (n2 + n)
$ %
For every n ∈ N, we divide the interval a + n+1
b−a
, a + b−a
n into subintervals
of length δn . Thus, let
n
(3.28) ≤ m n < n .
2
$ %
b−a b−a
Consider the partition Pn of a + n+1 , a + n given by
b−a 1 b−a
Pn := a + + jδn : j = 0, . . . , 2mn ∪ a +
n+1 2 n
(n) (n)
= : x0 , . . . , x2mn +1 .
(n) (n)
Note that δ2n ≤ x2mn +1 − x2mn −1 ≤ 2δn . We claim that u ∈ AC (I). Since
sn → s∞ and tn → s∞ , we have that u is continuous at x = a. Hence, the
function u is continuous and differentiable except for a countable number of
points, and so, in view of Exercise 3.23, to prove that it is locally absolutely
continuous in I, it remains to show that u is integrable. By (3.25), (3.26),
3.3. Singular Functions 107
f : dR → R;
Remark 3.70. Note that the previous proof continues to hold if d
Fix ε > 0 and let δ > 0 be as in Definition 3.1 for the absolutely continuous
function uAC . Using the definition of differentiability, for every x ∈ E
we may find an interval (ax , bx ) ⊂ [α, β] such that ax and bx are rational
numbers, and if ax < x1 < x < x2 < bx , then
ε
(3.39) |uC (x2 ) − uC (x1 )| ≤ |x2 − x1 | .
β−α
Since, L1 (E) = β −α, from the countable cover {(ax , bx )}x∈E we may choose
a finite subcollection such that
n
(3.40) L 1
(axi , bxi ) ≥ β − α − δ.
i=1
By relabeling the points, if necessary, we may assume that
x1 < x2 < · · · < xn ,
and, by shortening the intervals where necessary, that bxi−1 ≤ axi for all
i = 2, . . . , n. For simplicity of notation we write ai := axi , bi := bxi for all
i = 1, . . . , n , b0 := α, and an+1 := β. Consider now the partition
P = {b0 , a1 , b1 , . . . , an , bn , an+1 }
of [α, β]. By Remark 2.7,
n
n+1
(3.41) Var[α,β] u = Var[ai ,bi ] u + Var[bi−1 ,ai ] u.
i=1 i=1
By (3.40) we have
n+1
n
(ai − bi−1 ) = β − α − (bi − ai ) ≤ δ.
i=1 i=1
ε
n
(3.45) ≥ |uC (β) − uC (α)| − (bi − ai )
β−α
i=1
≥ |uC (β) − uC (α)| − ε.
Combining (3.43), (3.44), and (3.45) and using Remark 2.7 for uAC , we
obtain
Var[α,β] u ≥ Var[α,β] uAC + |uC (β) − uC (α)| − 3ε.
By letting ε → 0+ , we obtain (3.38).
Step 2: Fix an interval [a, b] ⊂ I and consider a partition P of [a, b], with
a = y0 < y1 < · · · < ym = b.
Applying (3.38) in each interval [yi−1 , yi ] and using Proposition 2.6 yields
m
Var[a,b] u = Var[yi−1 ,yi ] u
i=1
m
m
≥ Var[yi−1 ,yi ] uAC + |uC (yi ) − uC (yi−1 )|
i=1 i=1
m
= Var[a,b] uAC + |uC (yi ) − uC (yi−1 )| .
i=1
+1
+1
Var[a,b] u = Var[ti−1 +δ,ti −δ] u + Var[ti −δ,ti +δ]∩[a,b] u
i=1 i=0
+1
≥ Var[ti−1 +δ,ti −δ] u
i=1
+ (|u (ti + δ) − u (ti )| + |u (ti ) − u (ti − δ)|)
i=1
+ |u (a + δ) − u (a)| + |u (b) − u (b − δ)|
+1
≥ Var[ti−1 +δ,ti −δ] uAC + Var[ti−1 +δ,ti −δ] uC
i=1
+ (|u (ti + δ) − u (ti )| + |u (ti ) − u (ti − δ)|)
i=1
+ |u (a + δ) − u (a)| + |u (b) − u (b − δ)| ,
where we have used the previous step together with the fact that in each
interval [ti−1 + δ, ti − δ] the jump function uJ is constant, and so the varia-
tion of u in those intervals reduces to the one of uC + uAC . Letting δ → 0+
in the previous inequality and using Remark 2.7 and Exercise 2.8 yields
+1
Var[a,b] u ≥ Var[ti−1 ,ti ] uAC + Var[ti−1 ,ti ] uC
i=1
+ (|u+ (ti ) − u (ti )| + |u (ti ) − u− (ti )|)
i=1
+ |u+ (a) − u (a)| + |u (b) − u− (b)|
= Var[a,b] uAC + Var[a,b] uC + Var[a,b] uJ .