set function
{{Use American English|date = January 2019}}
{{Short description|Function from sets to numbers}}
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 which consists of the real numbers and
A set function generally aims to {{em|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 is a family of sets over (meaning that where denotes the powerset) then a {{em|set function on }} is a function with domain and codomain 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.
{{Families of sets}}
In general, it is typically assumed that is always well-defined for all or equivalently, that does not take on both and 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 is finitely additive:
:{{em|{{visible anchor|Set difference formula}}}}: is defined with satisfying and
Null sets
A set is called a {{em|{{visible anchor|null set}}}} (with respect to ) or simply {{em|{{visible anchor|null}}}} if
Whenever is not identically equal to either or then it is typically also assumed that:
- {{em|{{visible anchor|null empty set}}}}: if
Variation and mass
The Total variation (measure theory) is
where denotes the absolute value (or more generally, it denotes the norm or seminorm if is vector-valued in a (semi)normed space).
Assuming that then is called the {{em|{{visible anchor|total variation}}}} of and is called the {{em|{{visible anchor|mass}}}} of
A set function is called {{em|{{visible anchor|finite}}}} if for every the value is {{em|{{visible anchor|finite value|text=finite}}}} (which by definition means that and ; an {{em|{{visible anchor|infinite value}}}} is one that is equal to or ).
Every finite set function must have a finite mass.
=Common properties of set functions=
A set function on is said to be{{sfn|Durrett|2019|pp=1-37, 455-470}}
- {{em|{{visible anchor|non-negative}}}} if it is valued in
- Finitely additive set function if for all pairwise disjoint finite sequences such that
- If is closed under binary unions then is finitely additive if and only if for all disjoint pairs
- If is finitely additive and if then taking shows that which is only possible if or where in the latter case, for every (so only the case is useful).
- Sigma-additive set function or Sigma-additive set function{{sfn|Durrett|2019|pp=466-470}} if in addition to being finitely additive, for all pairwise disjoint sequences in such that all of the following hold:
-
- The series on the left hand side is defined in the usual way as the limit
- As a consequence, if is any permutation/bijection then this is because and applying this condition (a) twice guarantees that both and 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 to the new order does not affect the sum of their measures. This is desirable since just as the union does not depend on the order of these sets, the same should be true of the sums and
-
- As with any convergent series of real numbers, by the Riemann series theorem, the series 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 is valued in
- Outer measures appear in the Carathéodory's extension theorem and they are often restricted to Carathéodory measurable subsets
- Unlike many other properties, completeness places requirements on the set (and not just on 's values).
- Every {{sigma}}-finite set function is decomposable although not conversely. For example, the counting measure on (whose domain is ) is decomposable but not {{sigma}}-finite.
- If is valued in a normed space then it is countably additive if and only if for any pairwise disjoint sequence in If is finitely additive and valued in a Banach space then it is countably additive if and only if for any pairwise disjoint sequence in
- By definition, a complex measure never takes as a value and so has a null empty set.
Arbitrary sums
As described in this article's section on generalized series, for any family of real numbers indexed by an arbitrary indexing set it is possible to define their sum as the limit of the net of finite partial sums where the domain is directed by
Whenever this net converges then its limit is denoted by the symbols while if this net instead diverges to then this may be indicated by writing
Any sum over the empty set is defined to be zero; that is, if then by definition.
For example, if for every then
And it can be shown that
If then the generalized series converges in if and only if converges unconditionally (or equivalently, converges absolutely) in the usual sense.
If a generalized series converges in then both and also converge to elements of and the set is necessarily countable (that is, either finite or countably infinite); this remains true if is replaced with any normed space.
It follows that in order for a generalized series to converge in or it is necessary that all but at most countably many will be equal to which means that is a sum of at most countably many non-zero terms.
Said differently, if is uncountable then the generalized series 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 in (and the usual countable series ) to arbitrarily many sets (and the generalized series ).
=Inner measures, outer measures, and other properties=
A set function is said to be/satisfies{{sfn|Durrett|2019|pp=1-37, 455-470}}
- {{em|{{visible anchor|monotone}}}} if whenever satisfy
- Modular set function if it satisfies the following condition, known as {{em|modularity}}: for all such that
- 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 (geometry). This geometric definition of "valuation" should not be confused with the stronger non-equivalent measure theoretic definition of "valuation" that is given below.
- If is closed under finite unions then this condition holds if and only if for all If is non-negative then the absolute values may be removed.
- If is a measure then this condition holds if and only if for all in {{sfn|Royden|Fitzpatrick|2010|p=30}} If is a probability measure then this inequality is Boole's inequality.
- If is countably subadditive and with then is finitely subadditive.
- Lebesgue measure is continuous from above but it would not be if the assumption that all are eventually finite was omitted from the definition, as this example shows: For every integer let be the open interval so that where
If a binary operation is defined, then a set function is said to be
- {{em|Translation invariant}} if for all and such that
=Relationships between set functions=
{{See also|Radon–Nikodym theorem|Lebesgue's decomposition theorem}}
If and are two set functions over then:
- is said to be Absolute continuity (measure theory) or Domination (measure theory), written if for every set that belongs to the domain of both and if then
- If and are -finite measures on the same measurable space and if then the Radon–Nikodym derivative exists and for every measurable
- and are called Equivalence (measure theory) if each one is absolutely continuous with respect to the other. is called a Equivalence (measure theory)#Supporting measure of a measure if is -finite and they are equivalent.{{cite book |last1=Kallenberg |first1=Olav |author-link1=Olav Kallenberg |year=2017 |title=Random Measures, Theory and Applications|series=Probability Theory and Stochastic Modelling |volume=77 |location= Switzerland |publisher=Springer |doi= 10.1007/978-3-319-41598-7|isbn=978-3-319-41596-3|page=21}}
Examples
Examples of set functions include:
- The function assigning densities to sufficiently well-behaved subsets 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 with other sets given probabilities between and
- A possibility measure assigns a number between zero and one to each set in the powerset of some given set. See possibility theory.
- A {{em|random set}} is a set-valued random variable. See the article random compact set.
The Jordan measure on is a set function defined on the set of all Jordan measurable subsets of it sends a Jordan measurable set to its Jordan measure.
=Lebesgue measure=
The Lebesgue measure on is a set function that assigns a non-negative real number to every set of real numbers that belongs to the Lebesgue -algebra.Kolmogorov and Fomin 1975
Its definition begins with the set of all intervals of real numbers, which is a semialgebra on
The function that assigns to every interval its is a finitely additive set function (explicitly, if has endpoints then ).
This set function can be extended to the Lebesgue outer measure on which is the translation-invariant set function that sends a subset to the infimum
Lebesgue outer measure is not countably additive (and so is not a measure) although its restriction to the {{sigma}}-algebra of all subsets that satisfy the Carathéodory criterion:
is a measure that called Lebesgue measure.
Vitali sets are examples of non-measurable sets of real numbers.
==Infinite-dimensional space==
{{See also|Gaussian measure#Infinite-dimensional spaces|Abstract Wiener space|Feldman–Hájek theorem|Radonifying function}}
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 with domain that is finite on every compact subset of is the trivial set function that is identically equal to (that is, it sends every to ){{sfn|Rudin|1991|p=139}}
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 In fact, such non-trivial set functions will exist even if is replaced by any other abelian group {{sfn|Rudin|1991|pp=139-140}}
{{Math theorem
| name = Theorem{{sfn|Rudin|1991|pp=141-142}}
| math_statement =
If is any abelian group then there exists a finitely additive and translation-invariantThe function being translation-invariant means that for every and every subset set function of mass
}}
Extending set functions
{{See also|Carathéodory's extension theorem}}
=Extending from semialgebras to algebras=
Suppose that is a set function on a semialgebra over and let
which is the algebra on generated by
The archetypal example of a semialgebra that is not also an algebra is the family
on where for all {{sfn|Durrett|2019|pp=1-9}} Importantly, the two non-strict inequalities in cannot be replaced with strict inequalities since semialgebras must contain the whole underlying set that is, is a requirement of semialgebras (as is ).
If is finitely additive then it has a unique extension to a set function on defined by sending (where indicates that these are pairwise disjoint) to:{{sfn|Durrett|2019|pp=1-9}}
This extension will also be finitely additive: for any pairwise disjoint {{sfn|Durrett|2019|pp=1-9}}
If in addition is extended real-valued and monotone (which, in particular, will be the case if is non-negative) then will be monotone and finitely subadditive: for any such that {{sfn|Durrett|2019|pp=1-9}}
=Extending from rings to σ-algebras=
{{See also|Pre-measure|Hahn–Kolmogorov theorem}}
If is a pre-measure on a ring of sets (such as an algebra of sets) over then has an extension to a measure on the σ-algebra generated by If is σ-finite then this extension is unique.
To define this extension, first extend to an outer measure on by
and then restrict it to the set of -measurable sets (that is, Carathéodory-measurable sets), which is the set of all such that
It is a -algebra and is sigma-additive on it, by Caratheodory lemma.
=Restricting outer measures=
{{See also|Outer measure#Measurability of sets relative to an outer measure}}
If is an outer measure on a set where (by definition) the domain is necessarily the power set of then a subset is called {{em|–measurable}} or {{em|Carathéodory-measurable}} if it satisfies the following {{em|Carathéodory's criterion}}:
where is the complement of
The family of all –measurable subsets is a σ-algebra and the restriction of the outer measure to this family is a measure.
See also
- {{annotated link|Absolute continuity (measure theory)}}
- {{annotated link|Boolean ring}}
- {{annotated link|Cylinder set measure}}
- {{annotated link|Field of sets}}
- {{annotated link|Hadwiger's theorem}}
- {{annotated link|Hahn decomposition theorem}}
- {{annotated link|Invariant measure}}
- {{annotated link|Lebesgue's decomposition theorem}}
- {{annotated link|Positive and negative sets}}
- {{annotated link|Radon–Nikodym theorem}}
- {{annotated link|Riesz–Markov–Kakutani representation theorem}}
- {{annotated link|Ring of sets}}
- {{annotated link|σ-algebra}}
- {{annotated link|Vitali–Hahn–Saks theorem}}
Notes
{{reflist}}
{{reflist|group=note}}
Proofs
{{reflist|group=proof|refs=
Suppose the net converges to some point in a metrizable topological vector space (such as or a normed space), where recall that this net's domain is the directed set
Like every convergent net, this convergent net of partial sums is a {{em|Cauchy net}}, which for this particular net means (by definition) that for every neighborhood of the origin in there exists a finite subset of such that
for all finite supersets
this implies that for every (by taking and ).
Since is metrizable, it has a countable neighborhood basis at the origin, whose intersection is necessarily (since is a Hausdorff TVS).
For every positive integer pick a finite subset such that for every
If belongs to then belongs to
Thus for every index that does not belong to the countable set
}}
References
{{sfn whitelist|CITEREFDurrett2019|CITEREFRoydenFitzpatrick2010}}
- {{Durrett Probability Theory and Examples 5th Edition}}
- {{Kolmogorov Fomin Elements of the Theory of Functions and Functional Analysis}}
- A. N. Kolmogorov and S. V. Fomin (1975), Introductory Real Analysis, Dover. {{isbn|0-486-61226-0}}
- {{Royden Fitzpatrick Real Analysis 4th 2010}}
- {{Rudin Walter Functional Analysis|edition=2}}
Further reading
- {{springer|title=Set function|id=S/s084730|last=Sobolev|first=V.I.}}
- [http://www.encyclopediaofmath.org/index.php/Regular_set_function Regular set function] at [http://www.encyclopediaofmath.org/ Encyclopedia of Mathematics]
{{Measure theory}}
{{Analysis in topological vector spaces}}
Category:Basic concepts in set theory