Homepage Solution manuals Terence Tao An Introduction to Measure Theory Exercise 1.4.33 (Basic properties of the simple integral)

Exercise 1.4.33 (Basic properties of the simple integral)

Let (X,,μ) be a measure space, and let f,g : X [0,+] be simple unsigned functions.

(i)
(Monotonicity) If f g then Simp Xfdμ SimpXgdμ.
(ii)
(Compatibility with measure) For every -measurable set E we have Simp X1Edμ = μ(E).
(iii)
(Homogeneity) For every c [0,+] one has Simp Xcfdμ = cSimpXfdμ.
(iv)
(Finite additivity) We have Simp Xf + gdμ = SimpXfdμ + SimpXgdμ.
(v)
(Insensitivity to refinement) Let (X,,μ) be a measure space, and let (X,,μ) be its refinement. Then Simp Xfdμ = SimpXfdμ.
(vi)
(Almost everywhere equivalence) If μ-almost everywhere f = g, then Simp Xfdμ = SimpXgdμ
(vii)
(Finiteness) Simp Xfdμ < if and only if f is finite μ-almost everywhere and is supported on a set of finite measure.
(viii)
(Vanishing) Simp Xfdμ = 0 if and only if f = 0 μ-almost everywhere.

Answers

(i)
Monotonicity
Let a 1 , , a k be the finite values that f takes on, and let b 1 , , b k be the finite values that g takes on. (Using a rather non-rigorous notation identifying elements and singleton sets) Consider the common refinement { f 1 ( a i ) f 1 ( b j ) : 1 i k , 1 j k }

Since the unions [ 0 , + ] = i = 1 k f 1 ( a i ) = j = 1 k f 1 ( b j ) are disjoint, we have

Simp X f d μ = i = 1 k a i μ ( f 1 ( a i ) ) = i = 1 k a i μ ( j = 1 k f 1 ( a i ) f 1 ( b j ) ) = i = 1 k j = 1 k a i μ ( f 1 ( a i ) f 1 ( b j ) )

Similarly, we have

Simp X g d μ = j = 1 k b j μ ( f 1 ( b j ) ) = j = 1 k b j μ ( i = 1 k f 1 ( b j ) f 1 ( a i ) ) = j = 1 k i = 1 k b j μ ( f 1 ( b j ) f 1 ( a i ) )

Both sums are finite, and we now can easily compare them by the monotonicity of series.

Simp X f d μ = i = 1 k j = 1 k a i μ ( f 1 ( a i ) f 1 ( b j ) ) i = 1 k j = 1 k b j μ ( f 1 ( a i ) f 1 ( b j ) ) = Simp X g d μ
(ii)
Compatibility with measure
The indicator function is supported on E , and equals 1 on it. By Exercise 1.4.32 we have Simp X 1 E d μ = 1 μ ( E ) .
(iii)
Homogeneity
Suppose that f takes on finitely many values a 1 , , a k , with the corresponding sets f 1 ( a 1 ) , , f 1 ( a k ) . Then it is easy to verify that cf also takes on finitely many values b 1 , , b k , and these are exactly c a 1 , , c a k on the sets f 1 ( a 1 ) , , f 1 ( a k ) . (If a i is a value in the image of f , then f ( x ) = a i , and ( cf ) ( x ) = cf ( x ) = c a i . Conversely, if b i is some value in the image of f , then b i = ( cf ) ( x ) = cf ( x ) , i.e, there is some a j such that a j = b i c .) In other words, the image of cf is { c a 1 , , c a k } , and for any 1 i k we have ( cf ) 1 ( c a i ) = f 1 ( a i ) . This implies Simp X cf d μ = i = 1 k c a i μ ( ( cf ) 1 ( c a i ) ) = c i = 1 k a i μ ( f 1 ( a i ) ) = c Simp X f d μ

(iv)
Finite additivity
Again, we use the common refinement for both f and g as in part (i): Simp X f d μ = i = 1 k j = 1 k a i μ ( f 1 ( a i ) f 1 ( b j ) ) Simp X g d μ = i = 1 k j = 1 k b j μ ( f 1 ( a i ) f 1 ( b j ) )

We then have

Simp X f d μ + Simp X g d μ = i = 1 k j = 1 k a i μ ( f 1 ( a i ) f 1 ( b j ) ) + i = 1 k j = 1 k b j μ ( f 1 ( a i ) f 1 ( b j ) ) = i = 1 k j = 1 k ( a i + b j ) μ ( f 1 ( a i ) f 1 ( b j ) )

We argue that the last term is exactly Simp d x ( f + g ) . First of all f + g is simple, since { ( f + g ) ( x ) : x X } = { a i + b j : 1 i k , 1 j k } , and the latter has cardinality k ′′ of at most k ′′ k k . Denote the elements of { a i + b j : 1 i k , 1 j k } by ( d l ) l = 1 k ′′ . We then have

Simp d x ( f + g ) = l = 1 k ′′ d l μ ( ( f + g ) 1 ( d l ) ) = l = 1 k ′′ d l μ ( { x X : f ( x ) + g ( x ) = d l } ) = l = 1 k ′′ d l ( i , j ) : a i + b j = d l μ ( { x X : f ( x ) = a i , g ( x ) = b j } ) = l = 1 k ′′ ( i , j ) : a i + b j = d l ( a i + b j ) μ ( f 1 ( a i ) g 1 ( b j ) ) = ( i , j ) ( a i + b j ) μ ( f 1 ( a i ) g 1 ( b j ) ) = i = 1 k j = 1 k ( a i + b j ) μ ( f 1 ( a i + b j ) )
(v)
Insensitivity to refinement
Since taking simple integrals both w.r.t. B and B implies that f is both B -measurable and B -measurable, we see that for the finite values a 1 , , a k of f we have f 1 ( a i ) B . Simp X f d μ = i = 1 n a i μ ( f 1 ( a i ) ) = i = 1 n a i μ B ( f 1 ( a i ) ) = i = 1 n a i μ ( f 1 ( a i ) ) = Simp X f d μ
(vi)
Almost everywhere equivalence
Let E be the null set on which f ( x ) g ( x ) . Let a 1 , , a k be the finite values of f and g on X E . Let a k + 1 , , a k + k be the values of f on X , and let b k + 1 , , b k + k ′′ be the values of g on X . We then have for Simp X f d μ = i = 1 k + k a i μ ( f 1 ( a i ) ) = i = 1 k a i μ ( f 1 ( a i ) ) = i = 1 k a i μ ( g 1 ( a i ) ) + i = k + 1 k + k ′′ b i μ ( g 1 ( b i ) ) = Simp X g d μ
(vii)
Finiteness
Suppose that Simp X f d μ = i = 1 k a i μ ( f 1 ( a i ) ) is finite. Then, each element a i μ ( f 1 ( a i ) ) is finite. By the laws of multiplication for measure spaces, this implies that for all 1 i k we have one of the following
  • i < and μ ( f 1 ( a i ) ) < or
  • a i = 0 and μ ( f 1 ( a i ) ) = or
  • a i = and μ ( f 1 ( a i ) ) = 0

The second case is impossible by definition since we always trivially exclude the case where one of the simple values is zero. Thus, the components of the simple sum are either finite (like in the first case) or zero (like in the last case). Thus f is finite almost everywhere and has finite measure support.
Conversely, finite almost everywhere and finite measure support assumption implies that the components of the sum are finite or zero, and thus the integral itself is finite.

(viii)
Vanishing
Suppose that i = 1 k a i μ ( f 1 ( a i ) ) . Since every term in summation is non-negative, every term must itself be zero. This is only possible when the measures f 1 ( a i ) , 1 i k are all zero.
Conversely, suppose that f is zero almost everywhere. Then the inverse image of every non-zero simple value a i returns a null set f 1 ( a i ) resulting in a zero integral.
User profile picture
2020-08-12 00:00
Comments