HOME

TheInfoList



OR:

In measure theory, Carathéodory's extension theorem (named after the
mathematician A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, structure, space, models, and change. History On ...
Constantin Carathéodory Constantin Carathéodory ( el, Κωνσταντίνος Καραθεοδωρή, Konstantinos Karatheodori; 13 September 1873 – 2 February 1950) was a Greek mathematician who spent most of his professional career in Germany. He made significant ...
) states that any pre-measure defined on a given ring of subsets ''R'' of a given set ''Ω'' can be extended to a measure on the
σ-algebra In mathematical analysis and in probability theory, a σ-algebra (also σ-field) on a set ''X'' is a collection Σ of subsets of ''X'' that includes the empty subset, is closed under complement, and is closed under countable unions and countabl ...
generated by ''R'', and this extension is unique if the pre-measure is σ-finite. Consequently, any pre-measure on a ring containing all intervals of
real number In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every ...
s can be extended to the
Borel algebra In mathematics, a Borel set is any set in a topological space that can be formed from open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are nam ...
of the set of real numbers. This is an extremely powerful result of measure theory, and leads, for example, to the Lebesgue measure. The theorem is also sometimes known as the Carathéodory– Fréchet extension theorem, the Carathéodory– Hopf extension theorem, the Hopf extension theorem and the Hahn
Kolmogorov Andrey Nikolaevich Kolmogorov ( rus, Андре́й Никола́евич Колмого́ров, p=ɐnˈdrʲej nʲɪkɐˈlajɪvʲɪtɕ kəlmɐˈɡorəf, a=Ru-Andrey Nikolaevich Kolmogorov.ogg, 25 April 1903 – 20 October 1987) was a Sovi ...
extension theorem.


Introductory statement

Several very similar statements of the theorem can be given. A slightly more involved one, based on semi-rings of sets, is given further down below. A shorter, simpler statement is as follows. In this form, it is often called the Hahn–Kolmogorov theorem. Let \Sigma_0 be an algebra of subsets of a set X. Consider a
set function In mathematics, especially measure theory, a set function is a function whose domain is a family of subsets of some given set and that (usually) takes its values in the extended real number line \R \cup \, which consists of the real numbers \R an ...
\mu_0 : \Sigma_0 \to , \infty/math> which is ''finitely additive'', meaning that \mu_0\left(\bigcup_^N A_n\right) = \sum_^N \mu_0(A_n) for any positive
integer An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign ( −1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the languag ...
N and A_1, A_2, \ldots, A_N
disjoint set In mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set.. For example, and are ''disjoint sets,'' while and are not disjoint. A c ...
s in \Sigma_0. Assume that this function satisfies the stronger ''sigma additivity'' assumption \mu_0\left(\bigcup_^\infty A_n\right) = \sum_^\infty \mu_0(A_n) for any disjoint family \ of elements of \Sigma_0 such that \cup_^\infty A_n \in \Sigma_0. (Functions \mu_0 obeying these two properties are known as pre-measures.) Then, \mu_0 extends to a measure defined on the \sigma-algebra \Sigma generated by \Sigma_0; that is, there exists a measure \mu : \Sigma \to , \infty/math> such that its
restriction Restriction, restrict or restrictor may refer to: Science and technology * restrict, a keyword in the C programming language used in pointer declarations * Restriction enzyme, a type of enzyme that cleaves genetic material Mathematics and logi ...
to \Sigma_0 coincides with \mu_0. If \mu_0 is \sigma-finite, then the extension is unique.


Comments

This theorem is remarkable for it allows one to construct a measure by first defining it on a small algebra of sets, where its sigma additivity could be easy to verify, and then this theorem guarantees its extension to a sigma-algebra. The proof of this theorem is not trivial, since it requires extending \mu_0 from an algebra of sets to a potentially much bigger sigma-algebra, guaranteeing that the extension is unique (if \mu_0 is \sigma-finite), and moreover that it does not fail to satisfy the sigma-additivity of the original function.


Semi-ring and ring


Definitions

For a given set \Omega, we call a family \mathcal of subsets of \Omega a if it has the following properties: * \varnothing \in \mathcal * For all A, B \in \mathcal, we have A \cap B \in \mathcal (closed under pairwise intersections) * For all A, B \in \mathcal, there exist disjoint sets K_i \in \mathcal, i = 1, 2, \ldots, n, such that A \setminus B = \bigcup_^n K_i ( relative complements can be written as finite
disjoint union In mathematics, a disjoint union (or discriminated union) of a family of sets (A_i : i\in I) is a set A, often denoted by \bigsqcup_ A_i, with an injection of each A_i into A, such that the images of these injections form a partition of A ( ...
s). The first property can be replaced with \mathcal \neq \varnothing since A \in \mathcal \implies A \setminus A = \varnothing \in \mathcal. With the same notation, we call a family \mathcal of subsets of \Omega a if it has the following properties: * \varnothing \in \mathcal * For all A, B \in \mathcal, we have A \cup B \in \mathcal (closed under pairwise unions) * For all A, B \in \mathcal, we have A \setminus B \in \mathcal (closed under relative complements). Thus, any ring on \Omega is also a semi-ring. Sometimes, the following constraint is added in the measure theory context: * \Omega is the disjoint union of a
countable In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function from it into the natural numbers ...
family of sets in \mathcal. A
field of sets In mathematics, a field of sets is a mathematical structure consisting of a pair ( X, \mathcal ) consisting of a set X and a family \mathcal of subsets of X called an algebra over X that contains the empty set as an element, and is closed un ...
(respectively, a semi-field) is a ring (respectively, a semi-ring) that also contains \Omega as one of its elements.


Properties

* Arbitrary (possibly
uncountable In mathematics, an uncountable set (or uncountably infinite set) is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal num ...
) intersections of rings on \Omega are still rings on \Omega. * If A is a non-empty subset of the powerset \mathcal(\Omega) of \Omega, then we define the ring generated by A (noted R(A)) as the intersection of all rings containing A. It is straightforward to see that the ring generated by A is the smallest ring containing A. * For a semi-ring S, the set of all finite unions of sets in S is the ring generated by S: R(S) = \left\ (One can show that R(S) is equal to the set of all finite disjoint unions of sets in S). * A
content Content or contents may refer to: Media * Content (media), information or experience provided to audience or end-users by publishers or media producers ** Content industry, an umbrella term that encompasses companies owning and providing mas ...
\mu defined on a semi-ring S can be extended on the ring generated by S. Such an extension is unique. The extended content can be written: \mu(A) = \sum_^n \mu(A_i) for A = \bigcup_^n A_i, with the A_i \in S disjoint. In addition, it can be proved that \mu is a pre-measure if and only if the extended content is also a pre-measure, and that any pre-measure on R(S) that extends the pre-measure on S is necessarily of this form.


Motivation

In measure theory, we are not interested in semi-rings and rings themselves, but rather in σ-algebras generated by them. The idea is that it is possible to build a pre-measure on a semi-ring S (for example Stieltjes measures), which can then be extended to a pre-measure on R(S), which can finally be extended to a measure on a σ-algebra through Caratheodory's extension theorem. As σ-algebras generated by semi-rings and rings are the same, the difference does not really matter (in the measure theory context at least). Actually, Carathéodory's extension theorem can be slightly generalized by replacing ring by semi-field. The definition of semi-ring may seem a bit convoluted, but the following example shows why it is useful (moreover it allows us to give an explicit representation of the smallest ring containing some semi-ring).


Example

Think about the subset of \mathcal(\R) defined by the set of all half-open intervals
Stieltjes_measures_are_defined_on_intervals;_the_countable_additivity_on_the_semi-ring_is_not_too_difficult_to_prove_because_we_only_consider_countable_unions_of_intervals_which_are_intervals_themselves._Proving_it_for_arbitrary_countable_unions_of_intervals_is_accomplished_using_Caratheodory's_theorem.


_Statement_of_the_theorem

Let_R_be_a_#ring_of_sets.html" "title=", b) for a and b reals. This is a semi-ring, but not a ring. Stieltjes measures are defined on intervals; the countable additivity on the semi-ring is not too difficult to prove because we only consider countable unions of intervals which are intervals themselves. Proving it for arbitrary countable unions of intervals is accomplished using Caratheodory's theorem.


Statement of the theorem

Let R be a #ring of sets">ring of sets In mathematics, there are two different notions of a ring of sets, both referring to certain Family of sets, families of sets. In order theory, a nonempty family of sets \mathcal is called a ring (of sets) if it is closure (mathematics), closed u ...
on X and let \mu : R \to , +\infty/math> be a pre-measure on R, meaning that for all sets A \in R for which there exists a countable decomposition A = \bigcup_^\infty A_i in disjoint sets A_1, A_2, \ldots \in R, we have \mu(A) = \sum_^\infty \mu(A_i). Let \sigma(R) be the \sigma-algebra generated by R. The pre-measure condition is a necessary condition for \mu to be the restriction to R of a measure on \sigma(R). The Carathéodory's extension theorem states that it is also sufficient, that is, there exists a measure \mu^\prime : \sigma(R) \to , +\infty/math> such that \mu^\prime is an extension of \mu; that is, \mu^\prime\big\vert_R = \mu. Moreover, if \mu is \sigma-finite then the extension \mu^\prime is unique (and also \sigma-finite).


Proof sketch

First extend \mu to an
outer measure In the mathematical field of measure theory, an outer measure or exterior measure is a function defined on all subsets of a given set with values in the extended real numbers satisfying some additional technical conditions. The theory of outer mea ...
\mu^* on the
power set In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is post ...
2^X of X by \mu^*(T) = \inf \left\ and then restrict it to the set \mathcal of \mu^*-measurable sets (that is, Carathéodory-measurable sets), which is the set of all M \subseteq X such that \mu^*(S) = \mu^*(S \cap M) + \mu^*(S \cap M^) for every S \subseteq X. It is a \sigma-algebra, and \mu^* is \sigma-additive on it, by the Caratheodory lemma. It remains to check that \mathcal contains R. That is, to verify that every set in R is \mu^*-measurable. This is done by basic measure theory techniques of dividing and adding up sets. For uniqueness, take any other extension \nu so it remains to show that \nu = \mu^*. By \sigma-additivity, uniqueness can be reduced to the case where \mu(X) is finite, which will now be assumed. Now we could concretely prove \nu = \mu^* on \sigma(R) by using the
Borel hierarchy In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number called ...
of R, and since \nu = \mu^* at the base level, we can use well-ordered induction to reach the level of \omega_1, the level of \sigma(R).


Examples of non-uniqueness of extension

There can be more than one extension of a pre-measure to the generated σ-algebra, if the pre-measure is not sigma-finite.


Via the counting measure

Take the algebra generated by all half-open intervals [''a'',''b'') on the real line, and give such intervals measure infinity if they are non-empty. The Carathéodory extension gives all non-empty sets measure infinity. Another extension is given by the counting measure.


Via rationals

This example is a more detailed variation of the above. The ''rational closed-open interval'' is any subset of \mathbb of the form [a,b), where a, b \in \mathbb. Let X be \mathbb\cap[0,1) and let \Sigma_0 be the algebra of all finite unions of rational closed-open intervals contained in \mathbb\cap[0,1). It is easy to prove that \Sigma_0 is, in fact, an algebra. It is also easy to see that the cardinal of every non-empty set in \Sigma_0 is \aleph_0. Let \mu_0 be the counting set function (\#) defined in \Sigma_0. It is clear that \mu_0 is finitely additive and \sigma-additive in \Sigma_0. Since every non-empty set in \Sigma_0 is infinite, then, for every non-empty set A\in\Sigma_0, \mu_0(A)=+\infty Now, let \Sigma be the \sigma-algebra generated by \Sigma_0. It is easy to see that \Sigma is the \sigma-algebra of all subsets of X, and both \# and 2\# are measures defined on \Sigma and both are extensions of \mu_0. Note that, in this case, the two extensions are \sigma-finite, because X is countable.


Via Fubini's theorem

Another example is closely related to the failure of some forms of Fubini's theorem for spaces that are not σ-finite. Suppose that X is the unit interval with Lebesgue measure and Y is the unit interval with the discrete counting measure. Let the ring R be generated by products A\times B where A is Lebesgue measurable and B is any subset, and give this set the measure \mu(A)\text(B). This has a very large number of different extensions to a measure; for example: *The measure of a subset is the sum of the measures of its horizontal sections. This is the smallest possible extension. Here the diagonal has measure 0. *The measure of a subset is \int_0^1n(x)dx where n(x) is the number of points of the subset with given x-coordinate. The diagonal has measure 1. *The Carathéodory extension, which is the largest possible extension. Any subset of finite measure is contained in some union of a countable number of horizontal lines. In particular the diagonal has measure infinity.


See also

*
Outer measure In the mathematical field of measure theory, an outer measure or exterior measure is a function defined on all subsets of a given set with values in the extended real numbers satisfying some additional technical conditions. The theory of outer mea ...
: the proof of Carathéodory's extension theorem is based upon the outer measure concept. * Loeb measures, constructed using Carathéodory's extension theorem.


References

{{DEFAULTSORT:Caratheodory's Extension Theorem Theorems in measure theory