Jump to content

Sigma-additive set function: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
fix link to set (mathematics) using AWB
m fix spacing around math (via WP:JWB)
 
(100 intermediate revisions by 53 users not shown)
Line 1: Line 1:
{{Short description|Mapping function}}
In [[mathematics]], '''additivity''' and '''sigma additivity''' of a [[function (mathematics)|function]] defined on [[subset]]s of a given [[Set (mathematics)|set]] are abstractions of the intuitive properties of [[size]] ([[length]], [[area]], [[volume]]) of a set.
{{mcn|date=April 2024}}
In [[mathematics]], an '''additive set function''' is a [[function (mathematics)|function]] <math display=inline>\mu</math> mapping sets to numbers, with the property that its value on a [[Union (set theory)|union]] of two [[disjoint set|disjoint]] sets equals the sum of its values on these sets, namely, <math display=inline>\mu(A \cup B) = \mu(A) + \mu(B).</math> If this additivity property holds for any two sets, then it also holds for any finite number of sets, namely, the function value on the union of ''k'' disjoint sets (where ''k'' is a finite number) equals the sum of its values on the sets. Therefore, an additive [[set function]] is also called a '''finitely additive set function''' (the terms are equivalent). However, a finitely additive set function might not have the additivity property for a union of an ''infinite'' number of sets. A '''&sigma;-additive set function''' is a function that has the additivity property even for [[countably infinite]] many sets, that is, <math display=inline>\mu\left(\bigcup_{n=1}^\infty A_n\right) = \sum_{n=1}^\infty \mu(A_n).</math>


Additivity and sigma-additivity are particularly important properties of [[Measure (mathematics)|measures]]. They are abstractions of how intuitive properties of size ([[length]], [[area]], [[volume]]) of a set sum when considering multiple objects. Additivity is a weaker condition than &sigma;-additivity; that is, &sigma;-additivity implies additivity.
Formally, let &mu; be a function defined on an [[field of sets|algebra of sets]] <math>\mathcal{A}</math> with values in [&minus;&infin;, +&infin;] (see the [[extended real number line]]). The function &mu; is called '''additive''' if, whenever ''A'' and ''B'' are [[disjoint set]]s in <math>\mathcal{A},</math> one has


The term '''[[#modular set function|modular set function]]''' is equivalent to additive set function; see [[Sigma-additive set function#modularity|modularity]] below.
:<math> \mu(A \cup B) = \mu(A) + \mu(B) .</math>


==Additive (or finitely additive) set functions==
(A consequence of this is that an additive function cannot take both &minus;&infin; and +&infin; as values, for the expression &infin;&nbsp;&minus;&nbsp;&infin; is undefined.)


Let <math>\mu</math> be a [[set function]] defined on an [[Field of sets|algebra of sets]] <math>\scriptstyle\mathcal{A}</math> with values in <math>[-\infty, \infty]</math> (see the [[extended real number line]]). The function <math>\mu</math> is called '''{{visible anchor|additive|additive set function}}''' or '''{{visible anchor|finitely additive|finitely additive set function}}''', if whenever <math>A</math> and <math>B</math> are [[disjoint set]]s in <math>\scriptstyle\mathcal{A},</math> then
One can prove by [[mathematical induction]] that an additive function satisfies
<math display=block>\mu(A \cup B) = \mu(A) + \mu(B).</math>
A consequence of this is that an additive function cannot take both <math>- \infty</math> and <math>+ \infty</math> as values, for the expression <math>\infty - \infty</math> is undefined.


One can prove by [[mathematical induction]] that an additive function satisfies
: <math>\mu(\bigcup_{n=1}^N A_n)=\sum_{n=1}^N \mu(A_n)</math>
<math display=block>\mu\left(\bigcup_{n=1}^N A_n\right)=\sum_{n=1}^N \mu\left(A_n\right)</math>
for any <math>A_1, A_2, \ldots, A_N</math> disjoint sets in <math display=inline>\mathcal{A}.</math>


==&sigma;-additive set functions==
for any ''A''<sub>1</sub>, ''A''<sub>2</sub>, ..., ''A''<sub>''n''</sub> disjoint sets in <math>\mathcal{A}</math>.


Suppose <math>\mathcal{A}</math> is a [[sigma algebra|&sigma;-algebra]]. If for any [[sequence]] ''A''<sub>1</sub>, ''A''<sub>2</sub>, ..., ''A''<sub>''n''</sub>, ... of disjoint sets in <math>\mathcal{A}</math> one has
Suppose that <math>\scriptstyle\mathcal{A}</math> is a [[Sigma algebra|&sigma;-algebra]]. If for every [[sequence]] <math>A_1, A_2, \ldots, A_n, \ldots</math> of pairwise disjoint sets in <math>\scriptstyle\mathcal{A},</math>
<math display=block>\mu\left(\bigcup_{n=1}^\infty A_n\right) = \sum_{n=1}^\infty \mu(A_n),</math>
holds then <math>\mu</math> is said to be {{em|countably additive}} or {{em|{{sigma}}-additive}}.
Every {{sigma}}-additive function is additive but not vice versa, as shown below.


==&tau;-additive set functions==
:<math> \mu(\bigcup_{n=1}^\infty A_n) = \sum_{n=1}^\infty \mu(A_n),</math>


Suppose that in addition to a sigma algebra <math display=inline>\mathcal{A},</math> we have a [[Topological space|topology]] <math>\tau.</math> If for every [[Directed set|directed]] family of measurable [[open set]]s <math display=inline>\mathcal{G} \subseteq \mathcal{A} \cap \tau,</math>
we say that &mu; is '''countably additive''' or '''&sigma;-additive'''.
<math display=block>\mu\left(\bigcup \mathcal{G} \right) = \sup_{G\in\mathcal{G}} \mu(G),</math>
we say that <math>\mu</math> is <math>\tau</math>-additive. In particular, if <math>\mu</math> is [[Inner regular measure|inner regular]] (with respect to compact sets) then it is &tau;-additive.<ref name=Fremlin>D. H. Fremlin ''Measure Theory, Volume 4'', Torres Fremlin, 2003.</ref>


==Properties==
Any &sigma;-additive function is additive but not vice-versa, as shown below.
Useful properties of an additive function &mu; include the following:
# &mu;(&empty;) = 0.
# If &mu; is non-negative and ''A'' &sube; ''B'', then &mu;(''A'') &le; &mu;(''B'').
# If ''A'' &sube; ''B'', then &mu;(''B'' - ''A'') = &mu;(''B'') - &mu;(''A'').
# Given ''A'' and ''B'', &mu;(''A'' &cup; ''B'') + &mu;(''A'' &cap; ''B'') = &mu;(''A'') + &mu;(''B'').


Useful properties of an additive set function <math>\mu</math> include the following.
==Examples==


===Value of empty set===
An example of a &sigma;-additive function is the function &mu; defined over the [[power set]] of the [[real number]]s, such that
:<math> \mu (A)= \begin{cases} 1 & \mbox{ if } 0 \in A \\
0 & \mbox{ if } 0 \notin A.
\end{cases}</math>


Either <math>\mu(\varnothing) = 0,</math> or <math>\mu</math> assigns <math>\infty</math> to all sets in its domain, or <math>\mu</math> assigns <math>- \infty</math> to all sets in its domain. ''Proof'': additivity implies that for every set <math>A,</math> <math>\mu(A) = \mu(A \cup \varnothing) = \mu(A) + \mu( \varnothing).</math> If <math>\mu(\varnothing) \neq 0,</math> then this equality can be satisfied only by plus or minus infinity.
If ''A''<sub>1</sub>, ''A''<sub>2</sub>, ..., ''A''<sub>''n''</sub>, ... is a sequence of disjoint sets of real numbers, then either none of the sets contains 0, or precisely one of them does. In either case the equality
:<math> \mu(\bigcup_{n=1}^\infty A_n) = \sum_{n=1}^\infty \mu(A_n)</math>
holds.


===Monotonicity===
See [[measure (mathematics)|measure]] and [[signed measure]] for more examples of &sigma;-additive functions.


If <math>\mu</math> is non-negative and <math>A \subseteq B</math> then <math>\mu(A) \leq \mu(B).</math> That is, <math>\mu</math> is a '''{{visible anchor|monotone set function}}'''. Similarly, If <math>\mu</math> is non-positive and <math>A \subseteq B</math> then <math>\mu(A) \geq \mu(B).</math>
An example of an additive function which is not &sigma;-additive is obtained by considering &mu;, defined over the [[power set]] of the [[real number]]s by the slightly modified formula


===Modularity{{Anchor|modularity}}===
:<math> \mu (A)= \begin{cases} \infty & \mbox { if } 0 \in \bar A \\
{{See also|Valuation (geometry)}}
0 & \mbox { if } 0 \notin \bar A
{{See also|Valuation (measure theory)}}
\end{cases}</math>


A [[set function]] <math>\mu</math> on a [[family of sets]] <math>\mathcal{S}</math> is called a '''{{visible anchor|modular set function}}''' and a '''[[Valuation (geometry)|{{visible anchor|valuation}}]]''' if whenever <math>A,</math> <math>B,</math> <math>A\cup B,</math> and <math>A\cap B</math> are elements of <math>\mathcal{S},</math> then
where the bar denotes the [[closure (topology)|closure]] of a set.
<math display=block> \phi(A\cup B)+ \phi(A\cap B) = \phi(A) + \phi(B)</math>
The above property is called '''{{visible anchor|modularity}}''' and the argument below proves that additivity implies modularity.


Given <math>A</math> and <math>B,</math> <math>\mu(A \cup B) + \mu(A \cap B) = \mu(A) + \mu(B).</math> ''Proof'': write <math>A = (A \cap B) \cup (A \setminus B)</math> and <math>B = (A \cap B) \cup (B \setminus A)</math> and <math>A \cup B = (A \cap B) \cup (A \setminus B) \cup (B \setminus A),</math> where all sets in the union are disjoint. Additivity implies that both sides of the equality equal <math>\mu(A \setminus B) + \mu(B \setminus A) + 2\mu(A \cap B).</math>
One can check that this function is additive by using the property that the closure of a [[finite union]] of sets is the union of the closures of the sets, and looking at the cases when 0 is in the closure of any of those sets or not. That this function is not &sigma;-additive follows by considering the sequence of disjoint sets
:<math>A_n=\left[\frac {1}{n+1},\, \frac{1}{n}\right)</math>
for ''n''=1, 2, 3, ... The union of these sets is the interval (0, 1) whose closure is [0, 1] and &mu; applied to the union is then infinity, while &mu; applied to any of the individual sets is zero, so the sum of &mu;(''A''<sub>''n''</sub>) is also zero, which proves the counterexample.


However, the related properties of [[Submodular set function|''submodularity'']] and [[Subadditive set function|''subadditivity'']] are not equivalent to each other.
Another counterexample can be obtained similarly, defining &mu; again over the [[power set]] of the [[real number]]s by


Note that modularity has a different and unrelated meaning in the context of complex functions; see [[modular form]].
:<math> \mu (A)= \begin{cases} 1 & \mbox { if } \exist a>0 \ s.t.\ (0,a) \subset A \\

0 & \mbox { if } \not\exist a>0 \ s.t.\ (0,a) \subset A
===Set difference===

If <math>A \subseteq B</math> and <math>\mu(B) - \mu(A)</math> is defined, then <math>\mu(B \setminus A) = \mu(B) - \mu(A).</math>

==Examples==

An example of a {{sigma}}-additive function is the function <math>\mu</math> defined over the [[power set]] of the [[real number]]s, such that
<math display=block>\mu (A)= \begin{cases} 1 & \mbox{ if } 0 \in A \\
0 & \mbox{ if } 0 \notin A.
\end{cases}</math>
\end{cases}</math>


If <math>A_1, A_2, \ldots, A_n, \ldots</math> is a sequence of disjoint sets of real numbers, then either none of the sets contains 0, or precisely one of them does. In either case, the equality
At first sight, this is the same as the previous example, with the exception of negative sets. However rather than requiring the closure to include 0, it is required that the set include an interval next to 0. This will mean that any two sets that have measure 1 ''must'' overlap for some interval (0, ''a''), this makes the measure additive (easily) but not sigma additive, using the same example of sets as above.
<math display=block>\mu\left(\bigcup_{n=1}^\infty A_n\right) = \sum_{n=1}^\infty \mu(A_n)</math>
holds.


See [[Measure (mathematics)|measure]] and [[signed measure]] for more examples of {{sigma}}-additive functions.
One can prove that each set has measure 0 by taking a to be half of 1/(''n''+1), do the sum will still be 0, but the union will once again be (0, 1) which clearly satisfies the condition required to have measure 1.


A ''charge'' is defined to be a finitely additive set function that maps <math>\varnothing</math> to <math>0.</math><ref>{{Cite book|last=Bhaskara Rao|first=K. P. S.|first2=M. |last2=Bhaskara Rao|url=https://www.worldcat.org/oclc/21196971|title=Theory of charges: a study of finitely additive measures|date=1983|publisher=Academic Press|isbn=0-12-095780-9|location=London|pages=35|oclc=21196971}}</ref> (Cf. [[ba space]] for information about ''bounded'' charges, where we say a charge is ''bounded'' to mean its range is a bounded subset of ''R''.)
(A friend pointed out that this example does not work, since &mu; is not pairwise additive. Let S be the union of the intervals (1/2,1], (1/4,1/3], (1/6,1/5], (1/8,1/7], etc., and let S' be the union of the intervals (1/3,1/2], (1/5,1/4], (1/7,1/6], (1/9,1/8], etc. Neither S nor S' includes an interval of the form (0,a), so each has measure 0. Yet the union of S and S' contains (0,1), and hence has measure 1.


===An additive function which is not &sigma;-additive===
The example should be replaced with a correct one.)

An example of an additive function which is not &sigma;-additive is obtained by considering <math>\mu</math>, defined over the Lebesgue sets of the [[real number]]s <math>\R</math> by the formula
<math display=block>\mu(A) = \lim_{k\to\infty} \frac{1}{k} \cdot \lambda(A \cap (0,k)),</math>
where <math>\lambda</math> denotes the [[Lebesgue measure]] and <math>\lim</math> the [[Banach limit]]. It satisfies <math>0 \leq \mu(A) \leq 1</math> and if <math>\sup A < \infty</math> then <math>\mu(A) = 0.</math>

One can check that this function is additive by using the linearity of the limit. That this function is not &sigma;-additive follows by considering the sequence of disjoint sets
<math display=block>A_n = [n,n + 1)</math>
for <math>n = 0, 1, 2, \ldots</math> The union of these sets is the [[positive reals]], and <math>\mu</math> applied to the union is then one, while <math>\mu</math> applied to any of the individual sets is zero, so the sum of <math>\mu(A_n)</math> is also zero, which proves the counterexample.


==Generalizations==
==Generalizations==


One may define additive functions with values in any additive [[monoid]] (for example any [[group (mathematics)|group]] or more commonly a [[vector space]]). For sigma-additivity, one needs in addition that the concept of [[limit of a sequence]] be defined on that set. For example, [[spectral measure]]s are sigma-additive functions with values in a [[Banach algebra]]. Another example, also from quantum mechanics, is the [[positive operator-valued measure]].
One may define additive functions with values in any additive [[monoid]] (for example any [[Group (mathematics)|group]] or more commonly a [[vector space]]). For sigma-additivity, one needs in addition that the concept of [[limit of a sequence]] be defined on that set. For example, [[spectral measure]]s are sigma-additive functions with values in a [[Banach algebra]]. Another example, also from quantum mechanics, is the [[positive operator-valued measure]].


== See also ==
==See also==
* [[signed measure]]
* [[measure (mathematics)]]
* [[additive function]]
* [[subadditive function]]
* [[Hahn-Kolmogorov theorem]]


* {{annotated link|Additive map}}
{{planetmath|id=3400|title=additive}}
* {{annotated link|Hahn–Kolmogorov theorem}}
* {{annotated link|Measure (mathematics)}}
* {{annotated link|σ-finite measure}}
* {{annotated link|Signed measure}}
* {{annotated link|Submodular set function}}
* {{annotated link|Subadditive set function}}
* {{annotated link|τ-additivity}}
* [[ba space]] – The set of bounded charges on a given sigma-algebra


{{PlanetMath attribution|id=3400|title=additive}}
[[Category:Measure theory]]


==References==
[[he:סיגמא-אדיטיביות]]

[[it:Sigma additività]]
{{reflist|group=note}}
{{reflist}}

[[Category:Measure theory]]
[[Category:Additive functions]]

Latest revision as of 13:22, 4 October 2024

In mathematics, an additive set function is a function mapping sets to numbers, with the property that its value on a union of two disjoint sets equals the sum of its values on these sets, namely, If this additivity property holds for any two sets, then it also holds for any finite number of sets, namely, the function value on the union of k disjoint sets (where k is a finite number) equals the sum of its values on the sets. Therefore, an additive set function is also called a finitely additive set function (the terms are equivalent). However, a finitely additive set function might not have the additivity property for a union of an infinite number of sets. A σ-additive set function is a function that has the additivity property even for countably infinite many sets, that is,

Additivity and sigma-additivity are particularly important properties of measures. They are abstractions of how intuitive properties of size (length, area, volume) of a set sum when considering multiple objects. Additivity is a weaker condition than σ-additivity; that is, σ-additivity implies additivity.

The term modular set function is equivalent to additive set function; see modularity below.

Additive (or finitely additive) set functions

[edit]

Let be a set function defined on an algebra of sets with values in (see the extended real number line). The function is called additive or finitely additive, if whenever and are disjoint sets in then A consequence of this is that an additive function cannot take both and as values, for the expression is undefined.

One can prove by mathematical induction that an additive function satisfies for any disjoint sets in

σ-additive set functions

[edit]

Suppose that is a σ-algebra. If for every sequence of pairwise disjoint sets in holds then is said to be countably additive or 𝜎-additive. Every 𝜎-additive function is additive but not vice versa, as shown below.

τ-additive set functions

[edit]

Suppose that in addition to a sigma algebra we have a topology If for every directed family of measurable open sets we say that is -additive. In particular, if is inner regular (with respect to compact sets) then it is τ-additive.[1]

Properties

[edit]

Useful properties of an additive set function include the following.

Value of empty set

[edit]

Either or assigns to all sets in its domain, or assigns to all sets in its domain. Proof: additivity implies that for every set If then this equality can be satisfied only by plus or minus infinity.

Monotonicity

[edit]

If is non-negative and then That is, is a monotone set function. Similarly, If is non-positive and then

Modularity

[edit]

A set function on a family of sets is called a modular set function and a valuation if whenever and are elements of then The above property is called modularity and the argument below proves that additivity implies modularity.

Given and Proof: write and and where all sets in the union are disjoint. Additivity implies that both sides of the equality equal

However, the related properties of submodularity and subadditivity are not equivalent to each other.

Note that modularity has a different and unrelated meaning in the context of complex functions; see modular form.

Set difference

[edit]

If and is defined, then

Examples

[edit]

An example of a 𝜎-additive function is the function defined over the power set of the real numbers, such that

If is a sequence of disjoint sets of real numbers, then either none of the sets contains 0, or precisely one of them does. In either case, the equality holds.

See measure and signed measure for more examples of 𝜎-additive functions.

A charge is defined to be a finitely additive set function that maps to [2] (Cf. ba space for information about bounded charges, where we say a charge is bounded to mean its range is a bounded subset of R.)

An additive function which is not σ-additive

[edit]

An example of an additive function which is not σ-additive is obtained by considering , defined over the Lebesgue sets of the real numbers by the formula where denotes the Lebesgue measure and the Banach limit. It satisfies and if then

One can check that this function is additive by using the linearity of the limit. That this function is not σ-additive follows by considering the sequence of disjoint sets for The union of these sets is the positive reals, and applied to the union is then one, while applied to any of the individual sets is zero, so the sum of is also zero, which proves the counterexample.

Generalizations

[edit]

One may define additive functions with values in any additive monoid (for example any group or more commonly a vector space). For sigma-additivity, one needs in addition that the concept of limit of a sequence be defined on that set. For example, spectral measures are sigma-additive functions with values in a Banach algebra. Another example, also from quantum mechanics, is the positive operator-valued measure.

See also

[edit]

This article incorporates material from additive on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

References

[edit]
  1. ^ D. H. Fremlin Measure Theory, Volume 4, Torres Fremlin, 2003.
  2. ^ Bhaskara Rao, K. P. S.; Bhaskara Rao, M. (1983). Theory of charges: a study of finitely additive measures. London: Academic Press. p. 35. ISBN 0-12-095780-9. OCLC 21196971.