Jump to content

Sigma-additive set function: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No information was added, removed, or changed. Only copy editing to make this article more compliant with MOS:MATH and WP:ACCESSIBILITY. Minor rewording/rearranging/fixes. Spell out abbreviations s.t./iff/i.e./can't/... and symbols ∀∃⇔⇒∨∧¬ (exceptions for e.g. formal logic). Try to write complete sentences. Avoid we/one/us/clearly/note/... Avoid symbols that might not render correctly in some browsers like Unicode ∪∩≠≤→∈∑⊕√∞ or σℱ𝔉𝔽ℝℂℕ by e.g. replacing them with LaTeX.
Line 1: Line 1:
In [[mathematics]], additivity (specifically finite additivity) and sigma additivity (also called countable additivity) of a [[function (mathematics)|function]] (often a [[Measure (mathematics)|measure]]) defined on [[subset]]s of a given [[Set (mathematics)|set]] 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.
In [[mathematics]], additivity (specifically finite additivity) and sigma additivity (also called countable additivity) of a [[Function (mathematics)|function]] (often a [[Measure (mathematics)|measure]]) defined on [[subset]]s of a given [[Set (mathematics)|set]] 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.


== Additive (or finitely additive) set functions ==
== Additive (or finitely additive) set functions ==
Let ''<math>\mu</math>'' be a function defined on an [[field of sets|algebra of sets]] <math>\scriptstyle\mathcal{A}</math> with values in [&minus;&infin;, +&infin;] (see the [[extended real number line]]). The function <math>\mu</math> is called additive, or finitely additive, if, whenever ''A'' and ''B'' are [[disjoint set]]s in <math>\scriptstyle\mathcal{A}</math>, one has


Let <math>\mu</math> be a 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 additive, or finitely additive, if, whenever <math>A</math> and <math>B</math> are [[disjoint set]]s in <math>\scriptstyle\mathcal{A},</math> one has
:<math> \mu(A \cup B) = \mu(A) + \mu(B). \, </math>
<math display="block">\mu(A \cup B) = \mu(A) + \mu(B).</math>

(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.
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
One can prove by [[mathematical induction]] that an additive function satisfies
<math display="block">\mu\left(\bigcup_{n=1}^N A_n\right)=\sum_{n=1}^N \mu(A_n)</math>
for any <math>A_1,A_2,\dots,A_N</math> disjoint sets in <math>\scriptstyle\mathcal{A}.</math>


== &sigma;-additive set functions ==
: <math>\mu\left(\bigcup_{n=1}^N A_n\right)=\sum_{n=1}^N \mu(A_n)</math>


for any <math>A_1,A_2,\dots,A_N</math> disjoint sets in <math>\scriptstyle\mathcal{A}</math>.
Suppose that <math>\scriptstyle\mathcal{A}</math> is a [[Sigma algebra|&sigma;-algebra]]. If for any [[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}}.
Any {{sigma}}-additive function is additive but not vice versa, as shown below.


==&sigma;-additive set functions==
== &tau;-additive set functions ==
Suppose that <math>\scriptstyle\mathcal{A}</math> is a [[sigma algebra|&sigma;-algebra]]. If for any [[sequence]] <math>A_1,A_2,\dots,A_n,\dots </math> of pairwise disjoint sets in <math>\scriptstyle\mathcal{A}</math>, one has
:<math> \mu\left(\bigcup_{n=1}^\infty A_n\right) = \sum_{n=1}^\infty \mu(A_n)</math>{{math|,}}
we say that &mu; is countably additive or &sigma;-additive. <br />
Any &sigma;-additive function is additive but not vice versa, as shown below.


Suppose that in addition to a sigma algebra <math>\scriptstyle\mathcal{A},</math> we have a [[Topological space|topology]] <math>\tau</math>. If for any [[Directed set|directed]] family of measurable [[open set]]s <math>\scriptstyle\mathcal{G} \subseteq \scriptstyle\mathcal{A} \cap \tau,</math>
==&tau;-additive set functions==
<math display="block">\mu\left(\bigcup \mathcal{G} \right) = \sup_{G\in\mathcal{G}} \mu(G),</math>
Suppose that in addition to a sigma algebra <math>\scriptstyle\mathcal{A}</math>, we have a [[Topological space|topology]] &tau;. If for any [[Directed set|directed]] family of measurable [[open set]]s <math>\scriptstyle\mathcal{G}</math> &sube; <math>\scriptstyle\mathcal{A}</math> &cap; &tau;,
we say that <math>\mu</math> is {{tau}}-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>
:<math> \mu\left(\bigcup \mathcal{G} \right) = \sup_{G\in\mathcal{G}} \mu(G)</math>{{math|,}}
we say that &mu; is &tau;-additive. In particular, if &mu; 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 ==
== Properties ==


=== Basic properties ===
=== Basic properties ===
Useful properties of an additive function &mu; include the following:
# Either &mu;(&empty;) = 0, or &mu; assigns to all sets in its domain, or &mu; assigns &minus;∞ to all sets in its domain.
# If &mu; is non-negative and ''A'' &sube; ''B'', then &mu;(''A'') &le; &mu;(''B'').
# If ''A'' &sube; ''B'' and &mu;(''B'') &minus; &mu;(''A'') is defined, then &mu;(''B'' \ ''A'') = &mu;(''B'') &minus; &mu;(''A'').
# Given ''A'' and ''B'', &mu;(''A'' &cup; ''B'') - &mu;(''A'' &cap; ''B'') = &mu;(''A'') + &mu;(''B'').


Useful properties of an additive function <math>\mu</math> include the following:
==Examples==
# 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.
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 \\
# If <math>\mu</math> is non-negative and <math>A \subseteq B</math> then <math>\mu(A) \leq \mu(B).</math>
# 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>
# Given <math>A</math> and <math>B,</math> <math>\mu(A \cup B) - \mu(A \cap B) = \mu(A) + \mu(B).</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.
0 & \mbox{ if } 0 \notin A.
\end{cases}</math>
\end{cases}</math>


If <math>A_1,A_2,\dots,A_n,\dots</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
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
:<math> \mu\left(\bigcup_{n=1}^\infty A_n\right) = \sum_{n=1}^\infty \mu(A_n)</math>
<math display="block">\mu\left(\bigcup_{n=1}^\infty A_n\right) = \sum_{n=1}^\infty \mu(A_n)</math>
holds.
holds.


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


===An additive function which is not &sigma;-additive===
=== An additive function which is not &sigma;-additive ===
An example of an additive function which is not &sigma;-additive is obtained by considering &mu;, defined over the Lebesgue sets of the [[real number]]s by the formula


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 by the formula
:<math> \mu(A)=\lim_{k\to\infty} \frac{1}{k} \cdot \lambda\left(A \cap \left(0,k\right)\right),</math>
<math display="block">\mu(A) = \lim_{k\to\infty} \frac{1}{k} \cdot \lambda\left(A \cap \left(0,k\right)\right),</math>
where ''λ'' denotes the [[Lebesgue measure]] and ''lim'' the [[Banach limit]].
where <math>\lambda</math> denotes the [[Lebesgue measure]] and ''lim'' the [[Banach limit]].


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
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>A_n=\left[n,n+1\right)</math>
<math display="block">A_n = \left[n,n+1\right)</math>
for ''n''=0, 1, 2, ... The union of these sets is the [[positive reals]], and &mu; applied to the union is then one, 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.
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\left(A_n\right)</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]]
* {{annotated link|signed measure}}
* [[measure (mathematics)]]
* {{annotated link|measure (mathematics)}}
* [[additive map]]
* {{annotated link|additive map}}
* [[subadditive function]]
* {{annotated link|subadditive function}}
* [[σ-finite measure]]
* {{annotated link|σ-finite measure}}
* [[Hahn–Kolmogorov theorem]]
* {{annotated link|Hahn–Kolmogorov theorem}}
* [[τ-additivity]]
* {{annotated link|τ-additivity}}


{{PlanetMath attribution|id=3400|title=additive}}
{{PlanetMath attribution|id=3400|title=additive}}


==References==
== References ==

{{Reflist}}
{{reflist|group=note}}
{{reflist}}


[[Category:Measure theory]]
[[Category:Measure theory]]

Revision as of 21:48, 9 July 2021

In mathematics, additivity (specifically finite additivity) and sigma additivity (also called countable additivity) of a function (often a measure) defined on subsets of a given set 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.

Additive (or finitely additive) set functions

Let be a 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 one has 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

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

τ-additive set functions

Suppose that in addition to a sigma algebra we have a topology . If for any 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

Basic properties

Useful properties of an additive function include the following:

  1. Either or assigns to all sets in its domain, or assigns to all sets in its domain.
  2. If is non-negative and then
  3. If and is defined, then
  4. Given and

Examples

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.

An additive function which is not σ-additive

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 lim the Banach limit.

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

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

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

References

  1. ^ D.H. Fremlin Measure Theory, Volume 4, Torres Fremlin, 2003.