- Source: 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
∪
{
±
∞
}
,
{\displaystyle \mathbb {R} \cup \{\pm \infty \},}
which consists of the real numbers
R
{\displaystyle \mathbb {R} }
and
±
∞
.
{\displaystyle \pm \infty .}
A set function generally aims to measure subsets in some way. Measures are typical examples of "measuring" set functions. Therefore, the term "set function" is often used for avoiding confusion between the mathematical meaning of "measure" and its common language meaning.
Definitions
If
F
{\displaystyle {\mathcal {F}}}
is a family of sets over
Ω
{\displaystyle \Omega }
(meaning that
F
⊆
℘
(
Ω
)
{\displaystyle {\mathcal {F}}\subseteq \wp (\Omega )}
where
℘
(
Ω
)
{\displaystyle \wp (\Omega )}
denotes the powerset) then a set function on
F
{\displaystyle {\mathcal {F}}}
is a function
μ
{\displaystyle \mu }
with domain
F
{\displaystyle {\mathcal {F}}}
and codomain
[
−
∞
,
∞
]
{\displaystyle [-\infty ,\infty ]}
or, sometimes, the codomain is instead some vector space, as with vector measures, complex measures, and projection-valued measures.
The domain of a set function may have any number properties; the commonly encountered properties and categories of families are listed in the table below.
In general, it is typically assumed that
μ
(
E
)
+
μ
(
F
)
{\displaystyle \mu (E)+\mu (F)}
is always well-defined for all
E
,
F
∈
F
,
{\displaystyle E,F\in {\mathcal {F}},}
or equivalently, that
μ
{\displaystyle \mu }
does not take on both
−
∞
{\displaystyle -\infty }
and
+
∞
{\displaystyle +\infty }
as values. This article will henceforth assume this; although alternatively, all definitions below could instead be qualified by statements such as "whenever the sum/series is defined". This is sometimes done with subtraction, such as with the following result, which holds whenever
μ
{\displaystyle \mu }
is finitely additive:
Set difference formula:
μ
(
F
)
−
μ
(
E
)
=
μ
(
F
∖
E
)
whenever
μ
(
F
)
−
μ
(
E
)
{\displaystyle \mu (F)-\mu (E)=\mu (F\setminus E){\text{ whenever }}\mu (F)-\mu (E)}
is defined with
E
,
F
∈
F
{\displaystyle E,F\in {\mathcal {F}}}
satisfying
E
⊆
F
{\displaystyle E\subseteq F}
and
F
∖
E
∈
F
.
{\displaystyle F\setminus E\in {\mathcal {F}}.}
Null sets
A set
F
∈
F
{\displaystyle F\in {\mathcal {F}}}
is called a null set (with respect to
μ
{\displaystyle \mu }
) or simply null if
μ
(
F
)
=
0.
{\displaystyle \mu (F)=0.}
Whenever
μ
{\displaystyle \mu }
is not identically equal to either
−
∞
{\displaystyle -\infty }
or
+
∞
{\displaystyle +\infty }
then it is typically also assumed that:
null empty set:
μ
(
∅
)
=
0
{\displaystyle \mu (\varnothing )=0}
if
∅
∈
F
.
{\displaystyle \varnothing \in {\mathcal {F}}.}
Variation and mass
The total variation of a set
S
{\displaystyle S}
is
|
μ
|
(
S
)
=
def
sup
{
|
μ
(
F
)
|
:
F
∈
F
and
F
⊆
S
}
{\displaystyle |\mu |(S)~{\stackrel {\scriptscriptstyle {\text{def}}}{=}}~\sup\{|\mu (F)|:F\in {\mathcal {F}}{\text{ and }}F\subseteq S\}}
where
|
⋅
|
{\displaystyle |\,\cdot \,|}
denotes the absolute value (or more generally, it denotes the norm or seminorm if
μ
{\displaystyle \mu }
is vector-valued in a (semi)normed space).
Assuming that
∪
F
=
def
⋃
F
∈
F
F
∈
F
,
{\displaystyle \cup {\mathcal {F}}~{\stackrel {\scriptscriptstyle {\text{def}}}{=}}~\textstyle \bigcup \limits _{F\in {\mathcal {F}}}F\in {\mathcal {F}},}
then
|
μ
|
(
∪
F
)
{\displaystyle |\mu |\left(\cup {\mathcal {F}}\right)}
is called the total variation of
μ
{\displaystyle \mu }
and
μ
(
∪
F
)
{\displaystyle \mu \left(\cup {\mathcal {F}}\right)}
is called the mass of
μ
.
{\displaystyle \mu .}
A set function is called finite if for every
F
∈
F
,
{\displaystyle F\in {\mathcal {F}},}
the value
μ
(
F
)
{\displaystyle \mu (F)}
is finite (which by definition means that
μ
(
F
)
≠
∞
{\displaystyle \mu (F)\neq \infty }
and
μ
(
F
)
≠
−
∞
{\displaystyle \mu (F)\neq -\infty }
; an infinite value is one that is equal to
∞
{\displaystyle \infty }
or
−
∞
{\displaystyle -\infty }
).
Every finite set function must have a finite mass.
= Common properties of set functions
=A set function
μ
{\displaystyle \mu }
on
F
{\displaystyle {\mathcal {F}}}
is said to be
non-negative if it is valued in
[
0
,
∞
]
.
{\displaystyle [0,\infty ].}
finitely additive if
∑
i
=
1
n
μ
(
F
i
)
=
μ
(
⋃
i
=
1
n
F
i
)
{\displaystyle \textstyle \sum \limits _{i=1}^{n}\mu \left(F_{i}\right)=\mu \left(\textstyle \bigcup \limits _{i=1}^{n}F_{i}\right)}
for all pairwise disjoint finite sequences
F
1
,
…
,
F
n
∈
F
{\displaystyle F_{1},\ldots ,F_{n}\in {\mathcal {F}}}
such that
⋃
i
=
1
n
F
i
∈
F
.
{\displaystyle \textstyle \bigcup \limits _{i=1}^{n}F_{i}\in {\mathcal {F}}.}
If
F
{\displaystyle {\mathcal {F}}}
is closed under binary unions then
μ
{\displaystyle \mu }
is finitely additive if and only if
μ
(
E
∪
F
)
=
μ
(
E
)
+
μ
(
F
)
{\displaystyle \mu (E\cup F)=\mu (E)+\mu (F)}
for all disjoint pairs
E
,
F
∈
F
.
{\displaystyle E,F\in {\mathcal {F}}.}
If
μ
{\displaystyle \mu }
is finitely additive and if
∅
∈
F
{\displaystyle \varnothing \in {\mathcal {F}}}
then taking
E
:=
F
:=
∅
{\displaystyle E:=F:=\varnothing }
shows that
μ
(
∅
)
=
μ
(
∅
)
+
μ
(
∅
)
{\displaystyle \mu (\varnothing )=\mu (\varnothing )+\mu (\varnothing )}
which is only possible if
μ
(
∅
)
=
0
{\displaystyle \mu (\varnothing )=0}
or
μ
(
∅
)
=
±
∞
,
{\displaystyle \mu (\varnothing )=\pm \infty ,}
where in the latter case,
μ
(
E
)
=
μ
(
E
∪
∅
)
=
μ
(
E
)
+
μ
(
∅
)
=
μ
(
E
)
+
(
±
∞
)
=
±
∞
{\displaystyle \mu (E)=\mu (E\cup \varnothing )=\mu (E)+\mu (\varnothing )=\mu (E)+(\pm \infty )=\pm \infty }
for every
E
∈
F
{\displaystyle E\in {\mathcal {F}}}
(so only the case
μ
(
∅
)
=
0
{\displaystyle \mu (\varnothing )=0}
is useful).
countably additive or σ-additive if in addition to being finitely additive, for all pairwise disjoint sequences
F
1
,
F
2
,
…
{\displaystyle F_{1},F_{2},\ldots \,}
in
F
{\displaystyle {\mathcal {F}}}
such that
⋃
i
=
1
∞
F
i
∈
F
,
{\displaystyle \textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\in {\mathcal {F}},}
all of the following hold:
∑
i
=
1
∞
μ
(
F
i
)
=
μ
(
⋃
i
=
1
∞
F
i
)
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)=\mu \left(\textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\right)}
The series on the left hand side is defined in the usual way as the limit
∑
i
=
1
∞
μ
(
F
i
)
=
def
lim
n
→
∞
μ
(
F
1
)
+
⋯
+
μ
(
F
n
)
.
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)~{\stackrel {\scriptscriptstyle {\text{def}}}{=}}~{\displaystyle \lim _{n\to \infty }}\mu \left(F_{1}\right)+\cdots +\mu \left(F_{n}\right).}
As a consequence, if
ρ
:
N
→
N
{\displaystyle \rho :\mathbb {N} \to \mathbb {N} }
is any permutation/bijection then
∑
i
=
1
∞
μ
(
F
i
)
=
∑
i
=
1
∞
μ
(
F
ρ
(
i
)
)
;
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)=\textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{\rho (i)}\right);}
this is because
⋃
i
=
1
∞
F
i
=
⋃
i
=
1
∞
F
ρ
(
i
)
{\displaystyle \textstyle \bigcup \limits _{i=1}^{\infty }F_{i}=\textstyle \bigcup \limits _{i=1}^{\infty }F_{\rho (i)}}
and applying this condition (a) twice guarantees that both
∑
i
=
1
∞
μ
(
F
i
)
=
μ
(
⋃
i
=
1
∞
F
i
)
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)=\mu \left(\textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\right)}
and
μ
(
⋃
i
=
1
∞
F
ρ
(
i
)
)
=
∑
i
=
1
∞
μ
(
F
ρ
(
i
)
)
{\displaystyle \mu \left(\textstyle \bigcup \limits _{i=1}^{\infty }F_{\rho (i)}\right)=\textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{\rho (i)}\right)}
hold. By definition, a convergent series with this property is said to be unconditionally convergent. Stated in plain English, this means that rearranging/relabeling the sets
F
1
,
F
2
,
…
{\displaystyle F_{1},F_{2},\ldots }
to the new order
F
ρ
(
1
)
,
F
ρ
(
2
)
,
…
{\displaystyle F_{\rho (1)},F_{\rho (2)},\ldots }
does not affect the sum of their measures. This is desirable since just as the union
F
=
def
⋃
i
∈
N
F
i
{\displaystyle F~{\stackrel {\scriptscriptstyle {\text{def}}}{=}}~\textstyle \bigcup \limits _{i\in \mathbb {N} }F_{i}}
does not depend on the order of these sets, the same should be true of the sums
μ
(
F
)
=
μ
(
F
1
)
+
μ
(
F
2
)
+
⋯
{\displaystyle \mu (F)=\mu \left(F_{1}\right)+\mu \left(F_{2}\right)+\cdots }
and
μ
(
F
)
=
μ
(
F
ρ
(
1
)
)
+
μ
(
F
ρ
(
2
)
)
+
⋯
.
{\displaystyle \mu (F)=\mu \left(F_{\rho (1)}\right)+\mu \left(F_{\rho (2)}\right)+\cdots \,.}
if
μ
(
⋃
i
=
1
∞
F
i
)
{\displaystyle \mu \left(\textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\right)}
is not infinite then this series
∑
i
=
1
∞
μ
(
F
i
)
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)}
must also converge absolutely, which by definition means that
∑
i
=
1
∞
|
μ
(
F
i
)
|
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\left|\mu \left(F_{i}\right)\right|}
must be finite. This is automatically true if
μ
{\displaystyle \mu }
is non-negative (or even just valued in the extended real numbers).
As with any convergent series of real numbers, by the Riemann series theorem, the series
∑
i
=
1
∞
μ
(
F
i
)
=
lim
N
→
∞
μ
(
F
1
)
+
μ
(
F
2
)
+
⋯
+
μ
(
F
N
)
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)={\displaystyle \lim _{N\to \infty }}\mu \left(F_{1}\right)+\mu \left(F_{2}\right)+\cdots +\mu \left(F_{N}\right)}
converges absolutely if and only if its sum does not depend on the order of its terms (a property known as unconditional convergence). Since unconditional convergence is guaranteed by (a) above, this condition is automatically true if
μ
{\displaystyle \mu }
is valued in
[
−
∞
,
∞
]
.
{\displaystyle [-\infty ,\infty ].}
if
μ
(
⋃
i
=
1
∞
F
i
)
=
∑
i
=
1
∞
μ
(
F
i
)
{\displaystyle \mu \left(\textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\right)=\textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)}
is infinite then it is also required that the value of at least one of the series
∑
μ
(
F
i
)
>
0
i
∈
N
μ
(
F
i
)
and
∑
μ
(
F
i
)
<
0
i
∈
N
μ
(
F
i
)
{\displaystyle \textstyle \sum \limits _{\stackrel {i\in \mathbb {N} }{\mu \left(F_{i}\right)>0}}\mu \left(F_{i}\right)\;{\text{ and }}\;\textstyle \sum \limits _{\stackrel {i\in \mathbb {N} }{\mu \left(F_{i}\right)<0}}\mu \left(F_{i}\right)\;}
be finite (so that the sum of their values is well-defined). This is automatically true if
μ
{\displaystyle \mu }
is non-negative.
a pre-measure if it is non-negative, countably additive (including finitely additive), and has a null empty set.
a measure if it is a pre-measure whose domain is a σ-algebra. That is to say, a measure is a non-negative countably additive set function on a σ-algebra that has a null empty set.
a probability measure if it is a measure that has a mass of
1.
{\displaystyle 1.}
an outer measure if it is non-negative, countably subadditive, has a null empty set, and has the power set
℘
(
Ω
)
{\displaystyle \wp (\Omega )}
as its domain.
Outer measures appear in the Carathéodory's extension theorem and they are often restricted to Carathéodory measurable subsets
a signed measure if it is countably additive, has a null empty set, and
μ
{\displaystyle \mu }
does not take on both
−
∞
{\displaystyle -\infty }
and
+
∞
{\displaystyle +\infty }
as values.
complete if every subset of every null set is null; explicitly, this means: whenever
F
∈
F
satisfies
μ
(
F
)
=
0
{\displaystyle F\in {\mathcal {F}}{\text{ satisfies }}\mu (F)=0}
and
N
⊆
F
{\displaystyle N\subseteq F}
is any subset of
F
{\displaystyle F}
then
N
∈
F
{\displaystyle N\in {\mathcal {F}}}
and
μ
(
N
)
=
0.
{\displaystyle \mu (N)=0.}
Unlike many other properties, completeness places requirements on the set
domain
μ
=
F
{\displaystyle \operatorname {domain} \mu ={\mathcal {F}}}
(and not just on
μ
{\displaystyle \mu }
's values).
𝜎-finite if there exists a sequence
F
1
,
F
2
,
F
3
,
…
{\displaystyle F_{1},F_{2},F_{3},\ldots \,}
in
F
{\displaystyle {\mathcal {F}}}
such that
μ
(
F
i
)
{\displaystyle \mu \left(F_{i}\right)}
is finite for every index
i
,
{\displaystyle i,}
and also
⋃
n
=
1
∞
F
n
=
⋃
F
∈
F
F
.
{\displaystyle \textstyle \bigcup \limits _{n=1}^{\infty }F_{n}=\textstyle \bigcup \limits _{F\in {\mathcal {F}}}F.}
decomposable if there exists a subfamily
P
⊆
F
{\displaystyle {\mathcal {P}}\subseteq {\mathcal {F}}}
of pairwise disjoint sets such that
μ
(
P
)
{\displaystyle \mu (P)}
is finite for every
P
∈
P
{\displaystyle P\in {\mathcal {P}}}
and also
⋃
P
∈
P
P
=
⋃
F
∈
F
F
{\displaystyle \textstyle \bigcup \limits _{P\in {\mathcal {P}}}\,P=\textstyle \bigcup \limits _{F\in {\mathcal {F}}}F}
(where
F
=
domain
μ
{\displaystyle {\mathcal {F}}=\operatorname {domain} \mu }
).
Every 𝜎-finite set function is decomposable although not conversely. For example, the counting measure on
R
{\displaystyle \mathbb {R} }
(whose domain is
℘
(
R
)
{\displaystyle \wp (\mathbb {R} )}
) is decomposable but not 𝜎-finite.
a vector measure if it is a countably additive set function
μ
:
F
→
X
{\displaystyle \mu :{\mathcal {F}}\to X}
valued in a topological vector space
X
{\displaystyle X}
(such as a normed space) whose domain is a σ-algebra.
If
μ
{\displaystyle \mu }
is valued in a normed space
(
X
,
‖
⋅
‖
)
{\displaystyle (X,\|\cdot \|)}
then it is countably additive if and only if for any pairwise disjoint sequence
F
1
,
F
2
,
…
{\displaystyle F_{1},F_{2},\ldots \,}
in
F
,
{\displaystyle {\mathcal {F}},}
lim
n
→
∞
‖
μ
(
F
1
)
+
⋯
+
μ
(
F
n
)
−
μ
(
⋃
i
=
1
∞
F
i
)
‖
=
0.
{\displaystyle \lim _{n\to \infty }\left\|\mu \left(F_{1}\right)+\cdots +\mu \left(F_{n}\right)-\mu \left(\textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\right)\right\|=0.}
If
μ
{\displaystyle \mu }
is finitely additive and valued in a Banach space then it is countably additive if and only if for any pairwise disjoint sequence
F
1
,
F
2
,
…
{\displaystyle F_{1},F_{2},\ldots \,}
in
F
,
{\displaystyle {\mathcal {F}},}
lim
n
→
∞
‖
μ
(
F
n
∪
F
n
+
1
∪
F
n
+
2
∪
⋯
)
‖
=
0.
{\displaystyle \lim _{n\to \infty }\left\|\mu \left(F_{n}\cup F_{n+1}\cup F_{n+2}\cup \cdots \right)\right\|=0.}
a complex measure if it is a countably additive complex-valued set function
μ
:
F
→
C
{\displaystyle \mu :{\mathcal {F}}\to \mathbb {C} }
whose domain is a σ-algebra.
By definition, a complex measure never takes
±
∞
{\displaystyle \pm \infty }
as a value and so has a null empty set.
a random measure if it is a measure-valued random element.
Arbitrary sums
As described in this article's section on generalized series, for any family
(
r
i
)
i
∈
I
{\displaystyle \left(r_{i}\right)_{i\in I}}
of real numbers indexed by an arbitrary indexing set
I
,
{\displaystyle I,}
it is possible to define their sum
∑
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}}
as the limit of the net of finite partial sums
F
∈
FiniteSubsets
(
I
)
↦
∑
i
∈
F
r
i
{\displaystyle F\in \operatorname {FiniteSubsets} (I)\mapsto \textstyle \sum \limits _{i\in F}r_{i}}
where the domain
FiniteSubsets
(
I
)
{\displaystyle \operatorname {FiniteSubsets} (I)}
is directed by
⊆
.
{\displaystyle \,\subseteq .\,}
Whenever this net converges then its limit is denoted by the symbols
∑
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}}
while if this net instead diverges to
±
∞
{\displaystyle \pm \infty }
then this may be indicated by writing
∑
i
∈
I
r
i
=
±
∞
.
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}=\pm \infty .}
Any sum over the empty set is defined to be zero; that is, if
I
=
∅
{\displaystyle I=\varnothing }
then
∑
i
∈
∅
r
i
=
0
{\displaystyle \textstyle \sum \limits _{i\in \varnothing }r_{i}=0}
by definition.
For example, if
z
i
=
0
{\displaystyle z_{i}=0}
for every
i
∈
I
{\displaystyle i\in I}
then
∑
i
∈
I
z
i
=
0.
{\displaystyle \textstyle \sum \limits _{i\in I}z_{i}=0.}
And it can be shown that
∑
i
∈
I
r
i
=
∑
r
i
=
0
i
∈
I
,
r
i
+
∑
r
i
≠
0
i
∈
I
,
r
i
=
0
+
∑
r
i
≠
0
i
∈
I
,
r
i
=
∑
r
i
≠
0
i
∈
I
,
r
i
.
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}=\textstyle \sum \limits _{\stackrel {i\in I,}{r_{i}=0}}r_{i}+\textstyle \sum \limits _{\stackrel {i\in I,}{r_{i}\neq 0}}r_{i}=0+\textstyle \sum \limits _{\stackrel {i\in I,}{r_{i}\neq 0}}r_{i}=\textstyle \sum \limits _{\stackrel {i\in I,}{r_{i}\neq 0}}r_{i}.}
If
I
=
N
{\displaystyle I=\mathbb {N} }
then the generalized series
∑
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}}
converges in
R
{\displaystyle \mathbb {R} }
if and only if
∑
i
=
1
∞
r
i
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }r_{i}}
converges unconditionally (or equivalently, converges absolutely) in the usual sense.
If a generalized series
∑
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}}
converges in
R
{\displaystyle \mathbb {R} }
then both
∑
r
i
>
0
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{\stackrel {i\in I}{r_{i}>0}}r_{i}}
and
∑
r
i
<
0
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{\stackrel {i\in I}{r_{i}<0}}r_{i}}
also converge to elements of
R
{\displaystyle \mathbb {R} }
and the set
{
i
∈
I
:
r
i
≠
0
}
{\displaystyle \left\{i\in I:r_{i}\neq 0\right\}}
is necessarily countable (that is, either finite or countably infinite); this remains true if
R
{\displaystyle \mathbb {R} }
is replaced with any normed space.
It follows that in order for a generalized series
∑
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}}
to converge in
R
{\displaystyle \mathbb {R} }
or
C
,
{\displaystyle \mathbb {C} ,}
it is necessary that all but at most countably many
r
i
{\displaystyle r_{i}}
will be equal to
0
,
{\displaystyle 0,}
which means that
∑
i
∈
I
r
i
=
∑
r
i
≠
0
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}~=~\textstyle \sum \limits _{\stackrel {i\in I}{r_{i}\neq 0}}r_{i}}
is a sum of at most countably many non-zero terms.
Said differently, if
{
i
∈
I
:
r
i
≠
0
}
{\displaystyle \left\{i\in I:r_{i}\neq 0\right\}}
is uncountable then the generalized series
∑
i
∈
I
r
i
{\displaystyle \textstyle \sum \limits _{i\in I}r_{i}}
does not converge.
In summary, due to the nature of the real numbers and its topology, every generalized series of real numbers (indexed by an arbitrary set) that converges can be reduced to an ordinary absolutely convergent series of countably many real numbers. So in the context of measure theory, there is little benefit gained by considering uncountably many sets and generalized series. In particular, this is why the definition of "countably additive" is rarely extended from countably many sets
F
1
,
F
2
,
…
{\displaystyle F_{1},F_{2},\ldots \,}
in
F
{\displaystyle {\mathcal {F}}}
(and the usual countable series
∑
i
=
1
∞
μ
(
F
i
)
{\displaystyle \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)}
) to arbitrarily many sets
(
F
i
)
i
∈
I
{\displaystyle \left(F_{i}\right)_{i\in I}}
(and the generalized series
∑
i
∈
I
μ
(
F
i
)
{\displaystyle \textstyle \sum \limits _{i\in I}\mu \left(F_{i}\right)}
).
= Inner measures, outer measures, and other properties
=A set function
μ
{\displaystyle \mu }
is said to be/satisfies
monotone if
μ
(
E
)
≤
μ
(
F
)
{\displaystyle \mu (E)\leq \mu (F)}
whenever
E
,
F
∈
F
{\displaystyle E,F\in {\mathcal {F}}}
satisfy
E
⊆
F
.
{\displaystyle E\subseteq F.}
modular if it satisfies the following condition, known as modularity:
μ
(
E
∪
F
)
+
μ
(
E
∩
F
)
=
μ
(
E
)
+
μ
(
F
)
{\displaystyle \mu (E\cup F)+\mu (E\cap F)=\mu (E)+\mu (F)}
for all
E
,
F
∈
F
{\displaystyle E,F\in {\mathcal {F}}}
such that
E
∪
F
,
E
∩
F
∈
F
.
{\displaystyle E\cup F,E\cap F\in {\mathcal {F}}.}
Every finitely additive function on a field of sets is modular.
In geometry, a set function valued in some abelian semigroup that possess this property is known as a valuation. This geometric definition of "valuation" should not be confused with the stronger non-equivalent measure theoretic definition of "valuation" that is given below.
submodular if
μ
(
E
∪
F
)
+
μ
(
E
∩
F
)
≤
μ
(
E
)
+
μ
(
F
)
{\displaystyle \mu (E\cup F)+\mu (E\cap F)\leq \mu (E)+\mu (F)}
for all
E
,
F
∈
F
{\displaystyle E,F\in {\mathcal {F}}}
such that
E
∪
F
,
E
∩
F
∈
F
.
{\displaystyle E\cup F,E\cap F\in {\mathcal {F}}.}
finitely subadditive if
|
μ
(
F
)
|
≤
∑
i
=
1
n
|
μ
(
F
i
)
|
{\displaystyle |\mu (F)|\leq \textstyle \sum \limits _{i=1}^{n}\left|\mu \left(F_{i}\right)\right|}
for all finite sequences
F
,
F
1
,
…
,
F
n
∈
F
{\displaystyle F,F_{1},\ldots ,F_{n}\in {\mathcal {F}}}
that satisfy
F
⊆
⋃
i
=
1
n
F
i
.
{\displaystyle F\;\subseteq \;\textstyle \bigcup \limits _{i=1}^{n}F_{i}.}
countably subadditive or σ-subadditive if
|
μ
(
F
)
|
≤
∑
i
=
1
∞
|
μ
(
F
i
)
|
{\displaystyle |\mu (F)|\leq \textstyle \sum \limits _{i=1}^{\infty }\left|\mu \left(F_{i}\right)\right|}
for all sequences
F
,
F
1
,
F
2
,
F
3
,
…
{\displaystyle F,F_{1},F_{2},F_{3},\ldots \,}
in
F
{\displaystyle {\mathcal {F}}}
that satisfy
F
⊆
⋃
i
=
1
∞
F
i
.
{\displaystyle F\;\subseteq \;\textstyle \bigcup \limits _{i=1}^{\infty }F_{i}.}
If
F
{\displaystyle {\mathcal {F}}}
is closed under finite unions then this condition holds if and only if
|
μ
(
F
∪
G
)
|
≤
|
μ
(
F
)
|
+
|
μ
(
G
)
|
{\displaystyle |\mu (F\cup G)|\leq |\mu (F)|+|\mu (G)|}
for all
F
,
G
∈
F
.
{\displaystyle F,G\in {\mathcal {F}}.}
If
μ
{\displaystyle \mu }
is non-negative then the absolute values may be removed.
If
μ
{\displaystyle \mu }
is a measure then this condition holds if and only if
μ
(
⋃
i
=
1
∞
F
i
)
≤
∑
i
=
1
∞
μ
(
F
i
)
{\displaystyle \mu \left(\textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\right)\leq \textstyle \sum \limits _{i=1}^{\infty }\mu \left(F_{i}\right)}
for all
F
1
,
F
2
,
F
3
,
…
{\displaystyle F_{1},F_{2},F_{3},\ldots \,}
in
F
.
{\displaystyle {\mathcal {F}}.}
If
μ
{\displaystyle \mu }
is a probability measure then this inequality is Boole's inequality.
If
μ
{\displaystyle \mu }
is countably subadditive and
∅
∈
F
{\displaystyle \varnothing \in {\mathcal {F}}}
with
μ
(
∅
)
=
0
{\displaystyle \mu (\varnothing )=0}
then
μ
{\displaystyle \mu }
is finitely subadditive.
superadditive if
μ
(
E
)
+
μ
(
F
)
≤
μ
(
E
∪
F
)
{\displaystyle \mu (E)+\mu (F)\leq \mu (E\cup F)}
whenever
E
,
F
∈
F
{\displaystyle E,F\in {\mathcal {F}}}
are disjoint with
E
∪
F
∈
F
.
{\displaystyle E\cup F\in {\mathcal {F}}.}
continuous from above if
lim
n
→
∞
μ
(
F
i
)
=
μ
(
⋂
i
=
1
∞
F
i
)
{\displaystyle \lim _{n\to \infty }\mu \left(F_{i}\right)=\mu \left(\textstyle \bigcap \limits _{i=1}^{\infty }F_{i}\right)}
for all non-increasing sequences of sets
F
1
⊇
F
2
⊇
F
3
⋯
{\displaystyle F_{1}\supseteq F_{2}\supseteq F_{3}\cdots \,}
in
F
{\displaystyle {\mathcal {F}}}
such that
⋂
i
=
1
∞
F
i
∈
F
{\displaystyle \textstyle \bigcap \limits _{i=1}^{\infty }F_{i}\in {\mathcal {F}}}
with
μ
(
⋂
i
=
1
∞
F
i
)
{\displaystyle \mu \left(\textstyle \bigcap \limits _{i=1}^{\infty }F_{i}\right)}
and all
μ
(
F
i
)
{\displaystyle \mu \left(F_{i}\right)}
finite.
Lebesgue measure
λ
{\displaystyle \lambda }
is continuous from above but it would not be if the assumption that all
μ
(
F
i
)
{\displaystyle \mu \left(F_{i}\right)}
are eventually finite was omitted from the definition, as this example shows: For every integer
i
,
{\displaystyle i,}
let
F
i
{\displaystyle F_{i}}
be the open interval
(
i
,
∞
)
{\displaystyle (i,\infty )}
so that
lim
n
→
∞
λ
(
F
i
)
=
lim
n
→
∞
∞
=
∞
≠
0
=
λ
(
∅
)
=
λ
(
⋂
i
=
1
∞
F
i
)
{\displaystyle \lim _{n\to \infty }\lambda \left(F_{i}\right)=\lim _{n\to \infty }\infty =\infty \neq 0=\lambda (\varnothing )=\lambda \left(\textstyle \bigcap \limits _{i=1}^{\infty }F_{i}\right)}
where
⋂
i
=
1
∞
F
i
=
∅
.
{\displaystyle \textstyle \bigcap \limits _{i=1}^{\infty }F_{i}=\varnothing .}
continuous from below if
lim
n
→
∞
μ
(
F
i
)
=
μ
(
⋃
i
=
1
∞
F
i
)
{\displaystyle \lim _{n\to \infty }\mu \left(F_{i}\right)=\mu \left(\textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\right)}
for all non-decreasing sequences of sets
F
1
⊆
F
2
⊆
F
3
⋯
{\displaystyle F_{1}\subseteq F_{2}\subseteq F_{3}\cdots \,}
in
F
{\displaystyle {\mathcal {F}}}
such that
⋃
i
=
1
∞
F
i
∈
F
.
{\displaystyle \textstyle \bigcup \limits _{i=1}^{\infty }F_{i}\in {\mathcal {F}}.}
infinity is approached from below if whenever
F
∈
F
{\displaystyle F\in {\mathcal {F}}}
satisfies
μ
(
F
)
=
∞
{\displaystyle \mu (F)=\infty }
then for every real
r
>
0
,
{\displaystyle r>0,}
there exists some
F
r
∈
F
{\displaystyle F_{r}\in {\mathcal {F}}}
such that
F
r
⊆
F
{\displaystyle F_{r}\subseteq F}
and
r
≤
μ
(
F
r
)
<
∞
.
{\displaystyle r\leq \mu \left(F_{r}\right)<\infty .}
an outer measure if
μ
{\displaystyle \mu }
is non-negative, countably subadditive, has a null empty set, and has the power set
℘
(
Ω
)
{\displaystyle \wp (\Omega )}
as its domain.
an inner measure if
μ
{\displaystyle \mu }
is non-negative, superadditive, continuous from above, has a null empty set, has the power set
℘
(
Ω
)
{\displaystyle \wp (\Omega )}
as its domain, and
+
∞
{\displaystyle +\infty }
is approached from below.
atomic if every measurable set of positive measure contains an atom.
If a binary operation
+
{\displaystyle \,+\,}
is defined, then a set function
μ
{\displaystyle \mu }
is said to be
translation invariant if
μ
(
ω
+
F
)
=
μ
(
F
)
{\displaystyle \mu (\omega +F)=\mu (F)}
for all
ω
∈
Ω
{\displaystyle \omega \in \Omega }
and
F
∈
F
{\displaystyle F\in {\mathcal {F}}}
such that
ω
+
F
∈
F
.
{\displaystyle \omega +F\in {\mathcal {F}}.}
= Topology related definitions
=If
τ
{\displaystyle \tau }
is a topology on
Ω
{\displaystyle \Omega }
then a set function
μ
{\displaystyle \mu }
is said to be:
a Borel measure if it is a measure defined on the σ-algebra of all Borel sets, which is the smallest σ-algebra containing all open subsets (that is, containing
τ
{\displaystyle \tau }
).
a Baire measure if it is a measure defined on the σ-algebra of all Baire sets.
locally finite if for every point
ω
∈
Ω
{\displaystyle \omega \in \Omega }
there exists some neighborhood
U
∈
F
∩
τ
{\displaystyle U\in {\mathcal {F}}\cap \tau }
of this point such that
μ
(
U
)
{\displaystyle \mu (U)}
is finite.
If
μ
{\displaystyle \mu }
is a finitely additive, monotone, and locally finite then
μ
(
K
)
{\displaystyle \mu (K)}
is necessarily finite for every compact measurable subset
K
.
{\displaystyle K.}
τ
{\displaystyle \tau }
-additive if
μ
(
⋃
D
)
=
sup
D
∈
D
μ
(
D
)
{\displaystyle \mu \left({\textstyle \bigcup }\,{\mathcal {D}}\right)=\sup _{D\in {\mathcal {D}}}\mu (D)}
whenever
D
⊆
τ
∩
F
{\displaystyle {\mathcal {D}}\subseteq \tau \cap {\mathcal {F}}}
is directed with respect to
⊆
{\displaystyle \,\subseteq \,}
and satisfies
⋃
D
=
def
⋃
D
∈
D
D
∈
F
.
{\displaystyle {\textstyle \bigcup }\,{\mathcal {D}}~{\stackrel {\scriptscriptstyle {\text{def}}}{=}}~\textstyle \bigcup \limits _{D\in {\mathcal {D}}}D\in {\mathcal {F}}.}
D
{\displaystyle {\mathcal {D}}}
is directed with respect to
⊆
{\displaystyle \,\subseteq \,}
if and only if it is not empty and for all
A
,
B
∈
D
{\displaystyle A,B\in {\mathcal {D}}}
there exists some
C
∈
D
{\displaystyle C\in {\mathcal {D}}}
such that
A
⊆
C
{\displaystyle A\subseteq C}
and
B
⊆
C
.
{\displaystyle B\subseteq C.}
inner regular or tight if for every
F
∈
F
,
{\displaystyle F\in {\mathcal {F}},}
μ
(
F
)
=
sup
{
μ
(
K
)
:
F
⊇
K
with
K
∈
F
a compact subset of
(
Ω
,
τ
)
}
.
{\displaystyle \mu (F)=\sup\{\mu (K):F\supseteq K{\text{ with }}K\in {\mathcal {F}}{\text{ a compact subset of }}(\Omega ,\tau )\}.}
outer regular if for every
F
∈
F
,
{\displaystyle F\in {\mathcal {F}},}
μ
(
F
)
=
inf
{
μ
(
U
)
:
F
⊆
U
and
U
∈
F
∩
τ
}
.
{\displaystyle \mu (F)=\inf\{\mu (U):F\subseteq U{\text{ and }}U\in {\mathcal {F}}\cap \tau \}.}
regular if it is both inner regular and outer regular.
a Borel regular measure if it is a Borel measure that is also regular.
a Radon measure if it is a regular and locally finite measure.
strictly positive if every non-empty open subset has (strictly) positive measure.
a valuation if it is non-negative, monotone, modular, has a null empty set, and has domain
τ
.
{\displaystyle \tau .}
= Relationships between set functions
=If
μ
{\displaystyle \mu }
and
ν
{\displaystyle \nu }
are two set functions over
Ω
,
{\displaystyle \Omega ,}
then:
μ
{\displaystyle \mu }
is said to be absolutely continuous with respect to
ν
{\displaystyle \nu }
or dominated by
ν
{\displaystyle \nu }
, written
μ
≪
ν
,
{\displaystyle \mu \ll \nu ,}
if for every set
F
{\displaystyle F}
that belongs to the domain of both
μ
{\displaystyle \mu }
and
ν
,
{\displaystyle \nu ,}
if
ν
(
F
)
=
0
{\displaystyle \nu (F)=0}
then
μ
(
F
)
=
0.
{\displaystyle \mu (F)=0.}
If
μ
{\displaystyle \mu }
and
ν
{\displaystyle \nu }
are
σ
{\displaystyle \sigma }
-finite measures on the same measurable space and if
μ
≪
ν
,
{\displaystyle \mu \ll \nu ,}
then the Radon–Nikodym derivative
d
μ
d
ν
{\displaystyle {\frac {d\mu }{d\nu }}}
exists and for every measurable
F
,
{\displaystyle F,}
μ
(
F
)
=
∫
F
d
μ
d
ν
d
ν
.
{\displaystyle \mu (F)=\int _{F}{\frac {d\mu }{d\nu }}d\nu .}
μ
{\displaystyle \mu }
and
ν
{\displaystyle \nu }
are called equivalent if each one is absolutely continuous with respect to the other.
μ
{\displaystyle \mu }
is called a supporting measure of a measure
ν
{\displaystyle \nu }
if
μ
{\displaystyle \mu }
is
σ
{\displaystyle \sigma }
-finite and they are equivalent.
μ
{\displaystyle \mu }
and
ν
{\displaystyle \nu }
are singular, written
μ
⊥
ν
,
{\displaystyle \mu \perp \nu ,}
if there exist disjoint sets
M
{\displaystyle M}
and
N
{\displaystyle N}
in the domains of
μ
{\displaystyle \mu }
and
ν
{\displaystyle \nu }
such that
M
∪
N
=
Ω
,
{\displaystyle M\cup N=\Omega ,}
μ
(
F
)
=
0
{\displaystyle \mu (F)=0}
for all
F
⊆
M
{\displaystyle F\subseteq M}
in the domain of
μ
,
{\displaystyle \mu ,}
and
ν
(
F
)
=
0
{\displaystyle \nu (F)=0}
for all
F
⊆
N
{\displaystyle F\subseteq N}
in the domain of
ν
.
{\displaystyle \nu .}
Examples
Examples of set functions include:
The function
d
(
A
)
=
lim
n
→
∞
|
A
∩
{
1
,
…
,
n
}
|
n
,
{\displaystyle d(A)=\lim _{n\to \infty }{\frac {|A\cap \{1,\ldots ,n\}|}{n}},}
assigning densities to sufficiently well-behaved subsets
A
⊆
{
1
,
2
,
3
,
…
}
,
{\displaystyle A\subseteq \{1,2,3,\ldots \},}
is a set function.
A probability measure assigns a probability to each set in a σ-algebra. Specifically, the probability of the empty set is zero and the probability of the sample space is
1
,
{\displaystyle 1,}
with other sets given probabilities between
0
{\displaystyle 0}
and
1.
{\displaystyle 1.}
A possibility measure assigns a number between zero and one to each set in the powerset of some given set. See possibility theory.
A random set is a set-valued random variable. See the article random compact set.
The Jordan measure on
R
n
{\displaystyle \mathbb {R} ^{n}}
is a set function defined on the set of all Jordan measurable subsets of
R
n
;
{\displaystyle \mathbb {R} ^{n};}
it sends a Jordan measurable set to its Jordan measure.
= Lebesgue measure
=The Lebesgue measure on
R
{\displaystyle \mathbb {R} }
is a set function that assigns a non-negative real number to every set of real numbers that belongs to the Lebesgue
σ
{\displaystyle \sigma }
-algebra.
Its definition begins with the set
Intervals
(
R
)
{\displaystyle \operatorname {Intervals} (\mathbb {R} )}
of all intervals of real numbers, which is a semialgebra on
R
.
{\displaystyle \mathbb {R} .}
The function that assigns to every interval
I
{\displaystyle I}
its
length
(
I
)
{\displaystyle \operatorname {length} (I)}
is a finitely additive set function (explicitly, if
I
{\displaystyle I}
has endpoints
a
≤
b
{\displaystyle a\leq b}
then
length
(
I
)
=
b
−
a
{\displaystyle \operatorname {length} (I)=b-a}
).
This set function can be extended to the Lebesgue outer measure on
R
,
{\displaystyle \mathbb {R} ,}
which is the translation-invariant set function
λ
∗
:
℘
(
R
)
→
[
0
,
∞
]
{\displaystyle \lambda ^{\!*\!}:\wp (\mathbb {R} )\to [0,\infty ]}
that sends a subset
E
⊆
R
{\displaystyle E\subseteq \mathbb {R} }
to the infimum
λ
∗
(
E
)
=
inf
{
∑
k
=
1
∞
length
(
I
k
)
:
(
I
k
)
k
∈
N
is a sequence of open intervals with
E
⊆
⋃
k
=
1
∞
I
k
}
.
{\displaystyle \lambda ^{\!*\!}(E)=\inf \left\{\sum _{k=1}^{\infty }\operatorname {length} (I_{k}):{(I_{k})_{k\in \mathbb {N} }}{\text{ is a sequence of open intervals with }}E\subseteq \bigcup _{k=1}^{\infty }I_{k}\right\}.}
Lebesgue outer measure is not countably additive (and so is not a measure) although its restriction to the 𝜎-algebra of all subsets
M
⊆
R
{\displaystyle M\subseteq \mathbb {R} }
that satisfy the Carathéodory criterion:
λ
∗
(
M
)
=
λ
∗
(
M
∩
E
)
+
λ
∗
(
M
∩
E
c
)
for every
S
⊆
R
{\displaystyle \lambda ^{\!*\!}(M)=\lambda ^{\!*\!}(M\cap E)+\lambda ^{\!*\!}(M\cap E^{c})\quad {\text{ for every }}S\subseteq \mathbb {R} }
is a measure that called Lebesgue measure.
Vitali sets are examples of non-measurable sets of real numbers.
Infinite-dimensional space
As detailed in the article on infinite-dimensional Lebesgue measure, the only locally finite and translation-invariant Borel measure on an infinite-dimensional separable normed space is the trivial measure. However, it is possible to define Gaussian measures on infinite-dimensional topological vector spaces. The structure theorem for Gaussian measures shows that the abstract Wiener space construction is essentially the only way to obtain a strictly positive Gaussian measure on a separable Banach space.
= Finitely additive translation-invariant set functions
=The only translation-invariant measure on
Ω
=
R
{\displaystyle \Omega =\mathbb {R} }
with domain
℘
(
R
)
{\displaystyle \wp (\mathbb {R} )}
that is finite on every compact subset of
R
{\displaystyle \mathbb {R} }
is the trivial set function
℘
(
R
)
→
[
0
,
∞
]
{\displaystyle \wp (\mathbb {R} )\to [0,\infty ]}
that is identically equal to
0
{\displaystyle 0}
(that is, it sends every
S
⊆
R
{\displaystyle S\subseteq \mathbb {R} }
to
0
{\displaystyle 0}
)
However, if countable additivity is weakened to finite additivity then a non-trivial set function with these properties does exist and moreover, some are even valued in
[
0
,
1
]
.
{\displaystyle [0,1].}
In fact, such non-trivial set functions will exist even if
R
{\displaystyle \mathbb {R} }
is replaced by any other abelian group
G
.
{\displaystyle G.}
Extending set functions
= Extending from semialgebras to algebras
=Suppose that
μ
{\displaystyle \mu }
is a set function on a semialgebra
F
{\displaystyle {\mathcal {F}}}
over
Ω
{\displaystyle \Omega }
and let
algebra
(
F
)
:=
{
F
1
⊔
⋯
⊔
F
n
:
n
∈
N
and
F
1
,
…
,
F
n
∈
F
are pairwise disjoint
}
,
{\displaystyle \operatorname {algebra} ({\mathcal {F}}):=\left\{F_{1}\sqcup \cdots \sqcup F_{n}:n\in \mathbb {N} {\text{ and }}F_{1},\ldots ,F_{n}\in {\mathcal {F}}{\text{ are pairwise disjoint }}\right\},}
which is the algebra on
Ω
{\displaystyle \Omega }
generated by
F
.
{\displaystyle {\mathcal {F}}.}
The archetypal example of a semialgebra that is not also an algebra is the family
S
d
:=
{
∅
}
∪
{
(
a
1
,
b
1
]
×
⋯
×
(
a
1
,
b
1
]
:
−
∞
≤
a
i
<
b
i
≤
∞
for all
i
=
1
,
…
,
d
}
{\displaystyle {\mathcal {S}}_{d}:=\{\varnothing \}\cup \left\{\left(a_{1},b_{1}\right]\times \cdots \times \left(a_{1},b_{1}\right]~:~-\infty \leq a_{i}
on
Ω
:=
R
d
{\displaystyle \Omega :=\mathbb {R} ^{d}}
where
(
a
,
b
]
:=
{
x
∈
R
:
a
<
x
≤
b
}
{\displaystyle (a,b]:=\{x\in \mathbb {R} :a
for all
−
∞
≤
a
<
b
≤
∞
.
{\displaystyle -\infty \leq a
Importantly, the two non-strict inequalities
≤
{\displaystyle \,\leq \,}
in
−
∞
≤
a
i
<
b
i
≤
∞
{\displaystyle -\infty \leq a_{i}
cannot be replaced with strict inequalities
<
{\displaystyle \,<\,}
since semialgebras must contain the whole underlying set
R
d
;
{\displaystyle \mathbb {R} ^{d};}
that is,
R
d
∈
S
d
{\displaystyle \mathbb {R} ^{d}\in {\mathcal {S}}_{d}}
is a requirement of semialgebras (as is
∅
∈
S
d
{\displaystyle \varnothing \in {\mathcal {S}}_{d}}
).
If
μ
{\displaystyle \mu }
is finitely additive then it has a unique extension to a set function
μ
¯
{\displaystyle {\overline {\mu }}}
on
algebra
(
F
)
{\displaystyle \operatorname {algebra} ({\mathcal {F}})}
defined by sending
F
1
⊔
⋯
⊔
F
n
∈
algebra
(
F
)
{\displaystyle F_{1}\sqcup \cdots \sqcup F_{n}\in \operatorname {algebra} ({\mathcal {F}})}
(where
⊔
{\displaystyle \,\sqcup \,}
indicates that these
F
i
∈
F
{\displaystyle F_{i}\in {\mathcal {F}}}
are pairwise disjoint) to:
μ
¯
(
F
1
⊔
⋯
⊔
F
n
)
:=
μ
(
F
1
)
+
⋯
+
μ
(
F
n
)
.
{\displaystyle {\overline {\mu }}\left(F_{1}\sqcup \cdots \sqcup F_{n}\right):=\mu \left(F_{1}\right)+\cdots +\mu \left(F_{n}\right).}
This extension
μ
¯
{\displaystyle {\overline {\mu }}}
will also be finitely additive: for any pairwise disjoint
A
1
,
…
,
A
n
∈
algebra
(
F
)
,
{\displaystyle A_{1},\ldots ,A_{n}\in \operatorname {algebra} ({\mathcal {F}}),}
μ
¯
(
A
1
∪
⋯
∪
A
n
)
=
μ
¯
(
A
1
)
+
⋯
+
μ
¯
(
A
n
)
.
{\displaystyle {\overline {\mu }}\left(A_{1}\cup \cdots \cup A_{n}\right)={\overline {\mu }}\left(A_{1}\right)+\cdots +{\overline {\mu }}\left(A_{n}\right).}
If in addition
μ
{\displaystyle \mu }
is extended real-valued and monotone (which, in particular, will be the case if
μ
{\displaystyle \mu }
is non-negative) then
μ
¯
{\displaystyle {\overline {\mu }}}
will be monotone and finitely subadditive: for any
A
,
A
1
,
…
,
A
n
∈
algebra
(
F
)
{\displaystyle A,A_{1},\ldots ,A_{n}\in \operatorname {algebra} ({\mathcal {F}})}
such that
A
⊆
A
1
∪
⋯
∪
A
n
,
{\displaystyle A\subseteq A_{1}\cup \cdots \cup A_{n},}
μ
¯
(
A
)
≤
μ
¯
(
A
1
)
+
⋯
+
μ
¯
(
A
n
)
.
{\displaystyle {\overline {\mu }}\left(A\right)\leq {\overline {\mu }}\left(A_{1}\right)+\cdots +{\overline {\mu }}\left(A_{n}\right).}
= Extending from rings to σ-algebras
=If
μ
:
F
→
[
0
,
∞
]
{\displaystyle \mu :{\mathcal {F}}\to [0,\infty ]}
is a pre-measure on a ring of sets (such as an algebra of sets)
F
{\displaystyle {\mathcal {F}}}
over
Ω
{\displaystyle \Omega }
then
μ
{\displaystyle \mu }
has an extension to a measure
μ
¯
:
σ
(
F
)
→
[
0
,
∞
]
{\displaystyle {\overline {\mu }}:\sigma ({\mathcal {F}})\to [0,\infty ]}
on the σ-algebra
σ
(
F
)
{\displaystyle \sigma ({\mathcal {F}})}
generated by
F
.
{\displaystyle {\mathcal {F}}.}
If
μ
{\displaystyle \mu }
is σ-finite then this extension is unique.
To define this extension, first extend
μ
{\displaystyle \mu }
to an outer measure
μ
∗
{\displaystyle \mu ^{*}}
on
2
Ω
=
℘
(
Ω
)
{\displaystyle 2^{\Omega }=\wp (\Omega )}
by
μ
∗
(
T
)
=
inf
{
∑
n
μ
(
S
n
)
:
T
⊆
∪
n
S
n
with
S
1
,
S
2
,
…
∈
F
}
{\displaystyle \mu ^{*}(T)=\inf \left\{\sum _{n}\mu \left(S_{n}\right):T\subseteq \cup _{n}S_{n}{\text{ with }}S_{1},S_{2},\ldots \in {\mathcal {F}}\right\}}
and then restrict it to the set
F
M
{\displaystyle {\mathcal {F}}_{M}}
of
μ
∗
{\displaystyle \mu ^{*}}
-measurable sets (that is, Carathéodory-measurable sets), which is the set of all
M
⊆
Ω
{\displaystyle M\subseteq \Omega }
such that
μ
∗
(
S
)
=
μ
∗
(
S
∩
M
)
+
μ
∗
(
S
∩
M
c
)
for every subset
S
⊆
Ω
.
{\displaystyle \mu ^{*}(S)=\mu ^{*}(S\cap M)+\mu ^{*}(S\cap M^{\mathrm {c} })\quad {\text{ for every subset }}S\subseteq \Omega .}
It is a
σ
{\displaystyle \sigma }
-algebra and
μ
∗
{\displaystyle \mu ^{*}}
is sigma-additive on it, by Caratheodory lemma.
= Restricting outer measures
=If
μ
∗
:
℘
(
Ω
)
→
[
0
,
∞
]
{\displaystyle \mu ^{*}:\wp (\Omega )\to [0,\infty ]}
is an outer measure on a set
Ω
,
{\displaystyle \Omega ,}
where (by definition) the domain is necessarily the power set
℘
(
Ω
)
{\displaystyle \wp (\Omega )}
of
Ω
,
{\displaystyle \Omega ,}
then a subset
M
⊆
Ω
{\displaystyle M\subseteq \Omega }
is called
μ
∗
{\displaystyle \mu ^{*}}
–measurable or Carathéodory-measurable if it satisfies the following Carathéodory's criterion:
μ
∗
(
S
)
=
μ
∗
(
S
∩
M
)
+
μ
∗
(
S
∩
M
c
)
for every subset
S
⊆
Ω
,
{\displaystyle \mu ^{*}(S)=\mu ^{*}(S\cap M)+\mu ^{*}(S\cap M^{\mathrm {c} })\quad {\text{ for every subset }}S\subseteq \Omega ,}
where
M
c
:=
Ω
∖
M
{\displaystyle M^{\mathrm {c} }:=\Omega \setminus M}
is the complement of
M
.
{\displaystyle M.}
The family of all
μ
∗
{\displaystyle \mu ^{*}}
–measurable subsets is a σ-algebra and the restriction of the outer measure
μ
∗
{\displaystyle \mu ^{*}}
to this family is a measure.
See also
Absolute continuity (measure theory) – Form of continuity for functionsPages displaying short descriptions of redirect targets
Boolean ring – Algebraic structure in mathematics
Cylinder set measure – way to generate a measure over product spacesPages displaying wikidata descriptions as a fallback
Field of sets – Algebraic concept in measure theory, also referred to as an algebra of sets
Hadwiger's theorem – Theorem in integral geometry
Hahn decomposition theorem – Measurability theorem
Invariant measure
Lebesgue's decomposition theorem
Positive and negative sets
Radon–Nikodym theorem – Expressing a measure as an integral of another
Riesz–Markov–Kakutani representation theorem – Statement about linear functionals and measures
Ring of sets – Family closed under unions and relative complements
σ-algebra – Algebraic structure of set algebra
Vitali–Hahn–Saks theorem
Notes
Proofs
References
Durrett, Richard (2019). Probability: Theory and Examples (PDF). Cambridge Series in Statistical and Probabilistic Mathematics. Vol. 49 (5th ed.). Cambridge New York, NY: Cambridge University Press. ISBN 978-1-108-47368-2. OCLC 1100115281. Retrieved November 5, 2020.
Kolmogorov, Andrey; Fomin, Sergei V. (1957). Elements of the Theory of Functions and Functional Analysis. Dover Books on Mathematics. New York: Dover Books. ISBN 978-1-61427-304-2. OCLC 912495626.
A. N. Kolmogorov and S. V. Fomin (1975), Introductory Real Analysis, Dover. ISBN 0-486-61226-0
Royden, Halsey; Fitzpatrick, Patrick (15 January 2010). Real Analysis (4 ed.). Boston: Prentice Hall. ISBN 978-0-13-143747-0. OCLC 456836719.
Rudin, Walter (1991). Functional Analysis. International Series in Pure and Applied Mathematics. Vol. 8 (Second ed.). New York, NY: McGraw-Hill Science/Engineering/Math. ISBN 978-0-07-054236-5. OCLC 21163277.
Further reading
Sobolev, V.I. (2001) [1994], "Set function", Encyclopedia of Mathematics, EMS Press
Regular set function at Encyclopedia of Mathematics
Kata Kunci Pencarian:
- JASS
- Fungsi injektif
- PlayStation 2
- Bahasa Inggris
- Ksi (huruf Yunani)
- PIC16F84
- Pohon biner
- Matematika diskrit
- Algoritma gabung
- W3C Geolocation API
- Set function
- Function (mathematics)
- Submodular set function
- Sigma-additive set function
- Domain of a function
- Monotonic function
- Image (mathematics)
- Subadditive set function
- Superadditive set function
- Set-valued function
