Stage One: Simple Functions
[9/100%]Let .
iff for every .
For any .
Let . Why can't we say that for every , as compared to saying that the result holds for every ? Also, why can't we necessarily write ?
Let be such that . Then iff -a. e. on E. In particular, iff -a. e. [on ].
Let and .
If , then , but the converse is not necessarily true.
If and , then , but the converse is not necessarily true.
Let . Then iff .
Suppose that is a nonincreasing sequence of -sets. Also, let .
It is not necessarily the case that .
If for some , then .
If is no longer nonincreasing but is still such that exists, state conditions under which .
Let and recall (S7), where is the measure on with for every . Then, for any and , we have .
Let be nonempty, and let . Let , and let denote the restriction of from to . Finally, let denote the restriction of from to .
is a measure space.
If denotes this section's functional relative to ( ), then we have for every .
Let , and suppose that is simple and -measurable. Let , where is defined in the previous exercise. Consider two programs:
Program 1 Extend from to as follows: Let be such that on and on .
Program 2 Do not extend from to as in Program 1, but instead view as a function defined everywhere relative to the measure space ( ), where the notation is as in the previous exercise.
These two programs are equivalent in the sense that , where is this section's functional relative to the measure space ( ), and is this section's functional relative to the measure space ( ).
Quickly prove the following "almost everywhere" modification of (S3) and (S4). As usual, and all sets are in .
[(S3): if on , then for every . (S4): [on ] implies ; more generally, if on , then for every .]
If -a.e. on , then for every .
If -a. e. on , then for every .