Lebesgue Measure on R2
[101/17%]Let be rectangles and let . Prove that there exist open rectangles such that , for all , and such that .
Let be rectangles and let . Prove that there exist closed rectangles such that , for all , and such that .
Prove Theorem 4.1.5.
Theorem 4.1.5: Jordan content has the following properties: (i) Finite additivity: for any disjoint collection , . (ii) Subadditivity: for any collection , . (iii) Translation invariance: for any and any , and .
Prove that if then and .
Prove that for every set .
Prove that (int ) for every set .
Prove that .
Prove Theorem 4.1.8.
Theorem 4.1.8: Let (the collection of Jordan measurable sets). (a) . (b) If , then (monotonicity). (c) For any rectangle , .
Let and . Prove that and .
Prove that if then .
Prove that the outer content is subadditive and that the inner content is superadditive.
Prove that if and , then .
Prove that there are bounded sets such that and .
Let be a set of Jordan content 0 and . Prove that is Jordan measurable and .
Let be a map that is non-negative, finitely additive, and translation invariant. Show that there exists a constant such that for all Jordan measurable sets .
Let be a line segment in the -plane. Prove that has content 0 .
Let be a continuous function. Show that the graph is Jordan measurable in with Jordan content zero.
Let be a continuous function. Show that the set is Jordan measurable in .
Let be three points in . Show that the solid triangle with vertices is Jordan measurable.
Show that every compact polygon in is Jordan measurable.
Prove that .
Prove that .
Use Exercise 4.1.22 to prove that .
Let and be sets such that their closures are Jordan sets. Prove that is a Jordan set.
Give an example of a bounded open set in that is not a Jordan set.
Prove or disprove: Every closed and bounded set in is a Jordan set.
Prove or disprove: a Jordan set in has content 0 if and only if it is nowhere dense.
Let be a bounded function on a Jordan set , let be the set of all the points on which fails to be continuous, and suppose that has content 0 . Prove that is integrable on .
Prove that the set is a ring.
Prove that every ring contains the empty set and that it is closed under intersection.
Give an example to show that a collection of sets that is closed under union and intersection need not be a ring.
Let be a ring of subsets of and let be a ring of subsets of . Determine whether the set
is a ring.
Let and let be a ring of subsets of . Determine whether the set is a ring.
Let and let be a ring of subsets of . Determine whether the set is a ring.
Prove that the measure of an open set is independent of its representation as a disjoint union of rectangles.
Prove Proposition 4.2.3.
Proposition 4.2.3: If is an open set in then .
Prove Proposition 4.2.4.
Proposition 4.2.4: If are open sets in such that then .
Prove Proposition 4.2.5.
Proposition 4.2.5: If is a finite or a countable collection of open sets in and , then . If, in addition, the sets are disjoint then .
Prove that the measure of a closed set is independent of the choice of an open rectangle that contains it.
Let be a closed Jordan set. Using only Definition 4.2.6, prove that .
Definition 4.2.6: Let be a closed and bounded set in and an open rectangle such that . The measure of the closed set is defined by .
Prove Proposition 4.2.7.
Proposition 4.2.7: If is a finite collection of closed rectangles without common interior points and , then .
Prove Proposition 4.2.8.
Proposition 4.2.8: If is a closed set and an open bounded set such that , then .
Prove Theorem 4.2.10.
Theorem 4.2.10: The measure of a closed bounded set is the infimum of the measures of all open sets that contain .
Prove Proposition 4.2.12.
Proposition 4.2.12: Let . Then .
Prove that the empty set is measurable and that .
Let be an elementary set in . Prove or disprove: . What if is a Jordan measurable set?
Let be compact. Prove that .
Prove Proposition 4.2.16.
Proposition 4.2.16: Every countable set is measurable and it has measure .
Give an example of an unbounded set with Lebesgue outer measure 0 .
Prove Proposition 4.2.17.
Proposition 4.2.17: Let . (a) If is open then . (b) If is closed then . (c) Monotonicity: If then and .
Prove Theorem 4.2.19.
Theorem 4.2.19 (Superadditivity of inner measure): If a set is a finite or a countable disjoint union of the sets , , then .
An interval is unbounded if it is of the form , , or . A rectangle is unbounded if at least one of the intervals is unbounded. Prove that, if is an unbounded rectangle, then .
Prove that if , then .
Prove that for any , provided that at least one of the numbers is finite.
Let if and only if . Prove that:
is an equivalence relation;
Prove that defines a metric on the set of equivalence classes in .
Nikodym (1929). Prove that the metric space in Exercise 4.2.21 is complete.
Let be the set of points in with both coordinates irrational. Prove that .
Let and be bounded subsets of for which there is such that for all . Prove that .
Let be a countable union of rectangles with disjoint interiors. Prove that .
Prove Corollary 4.2.20.
Corollary 4.2.20: If a set is a finite or a countable disjoint union of measurable sets , , then is measurable and .
Let and let be disjoint open rectangles. Prove that:
.
.
Give examples to show that each of the inequalities and can be strict.
Prove Corollary 4.2.23.
Corollary 4.2.23: A set is measurable if and only if its complement is measurable.
Let and let . Prove that .
Let with the property that if is a closed measurable set of positive measure then . Prove that .
Let be the collection of all closed subsets of , and let consists of sets of positive measure. Prove that has the same cardinality as .
Let be a set in for which and let . Prove that there is a compact set such that .
Let be a subset of . Prove or disprove: if and only if .
Let intersect every compact set in . Prove that .
Let be a bounded set with the property that
Prove or disprove: is measurable.
Find the Lebesgue measure of a subset of consisting of points such that and .
Let , let , and suppose that . Prove that and .
Prove that a set is nonmeasurable if and only if there exists such that for every measurable set .
Prove Corollary 4.3.9.
Corollary 4.3.9: Let . There exists a set such that and .
Let be sets of finite outer measure such that is measurable and . Prove that are both measurable sets.
Prove that the Lebesgue outer measure on is translation invariant.
Let have a finite outer measure. Prove that .
The purpose of this exercise is to establish the following result: If is a Lebesgue measurable set of positive measures, then the set contains a neighborhood of the origin.
Prove that we may assume that the measure of is finite.
Prove that can be covered by a countable union of rectangles for which
Prove that there exists a rectangle for which
Prove that contains a point such that the sets and are not disjoint.
Prove that is a subset of .
Let be a -algebra of subsets of and let . Prove or disprove: is a -algebra.
Let be a -algebra of subsets of and let . Prove or disprove: is a -algebra.
Let and let be a -algebra of subsets of . Prove or disprove: is a -algebra.
Let and let be a -algebra on , for each . Prove that the set
is a -algebra on .
Let be an uncountable set and let
Prove that is a -algebra.
Let be -algebras on . Prove or disprove: is a algebra.
Let be -algebras on . Prove or disprove: is a algebra.
Let be an increasing sequence of -algebras. Prove or disprove: is a -algebra.
Let be a countable set and let
Prove that is the smallest -algebra that contains for each .
Let be the collection of distinct subsets of that are symmetric about the origin. (A set is symmetric if if and only if .) Prove that is a -algebra.
If is a collection of subsets of , we denote by the smallest -algebra that contains .
Prove that if then .
Prove that, if and are two collections of subsets of , then .
Give an example for which .
Let be a set and a subset of . Prove that there is a unique smallest -algebra of subsets of that contains .
Let be a set and a -algebra of subsets of . Suppose that is a bijection such that for all . Prove that is a -algebra.
Let be nonempty sets and let . Prove that is a -algebra on .
Let be a set and a -algebra of subsets of . Suppose that is a set that is not in . Prove that
Let be a set and a nonempty subset of . Prove that
Let be a set and a countable collection of disjoint subsets of such that their union covers . Describe .
Let , let be a collection of subsets of , and let . Prove that there is a countable subset of such that .
In Exercises 4.3.26-4.3.28, is a nonempty subset of and, for each .
Prove that if is a -algebra then is a -algebra on .
In Exercises 4.3.26-4.3.28, is a nonempty subset of and, for each .
Prove that is a -algebra.
In Exercises 4.3.26-4.3.28, is a nonempty subset of and, for each .
Prove that .
Prove that a finitely generated -algebra is a finite set.
Prove or disprove: if then is uncountable.