You do not have permission to edit this page, for the following reasons:

This IP address has been blocked from editing Wikipedia.
This does not affect your ability to read Wikipedia pages.
Most people who see this message have done nothing wrong. Some kinds of blocks restrict editing from specific service providers or telecom companies in response to recent abuse or vandalism, and can sometimes affect other users who are unrelated to that abuse. Review the information below for assistance if you do not believe that you have done anything wrong.

The IP address or range 34.227.0.0/16 has been blocked by ‪Blablubbs‬ for the following reason(s):

The IP address that you are currently using has been blocked because it is believed to be a web host provider or colocation provider. To prevent abuse, web hosts and colocation providers may be blocked from editing Wikipedia.
You will not be able to edit Wikipedia using a web host or colocation provider because it hides your IP address, much like a proxy or VPN.
We recommend that you attempt to use another connection to edit. For example, if you use a proxy or VPN to connect to the internet, turn it off when editing Wikipedia. If you edit using a mobile connection, try using a Wi-Fi connection, and vice versa. If you are using a corporate internet connection, switch to a different Wi-Fi network. If you have a Wikipedia account, please log in.
If you do not have any other way to edit Wikipedia, you will need to request an IP block exemption.

How to appeal if you are confident that your connection does not use a colocation provider's IP address:
If you are confident that you are not using a web host, you may appeal this block by adding the following text on your talk page: ((unblock|reason=Caught by a colocation web host block but this host or IP is not a web host. My IP address is _______. Place any further information here. ~~~~)). You must fill in the blank with your IP address for this block to be investigated. Your IP address can be determined here. Alternatively, if you wish to keep your IP address private you can use the unblock ticket request system. There are several reasons you might be editing using the IP address of a web host or colocation provider (such as if you are using VPN software or a business network); please use this method of appeal only if you think your IP address is in fact not a web host or colocation provider.

Administrators: The IP block exemption user right should only be applied to allow users to edit using web host in exceptional circumstances, and requests should usually be directed to the functionaries team via email. If you intend to give the IPBE user right, a CheckUser needs to take a look at the account. This can be requested most easily at SPI Quick Checkuser Requests. Unblocking an IP or IP range with this template is highly discouraged without at least contacting the blocking administrator.

This block will expire on 11:46, 23 November 2025. Your current IP address is 34.227.114.28.

Even when blocked, you will usually still be able to edit your user talk page, as well as email administrators and other editors.

For information on how to proceed, please read the FAQ for blocked users and the guideline on block appeals. The guide to appealing blocks may also be helpful.

Other useful links: Blocking policy · Help:I have been blocked
This IP address range has been globally blocked.
This does not affect your ability to read Wikipedia pages.
Most people who see this message have done nothing wrong. Some kinds of blocks restrict editing from specific service providers or telecom companies in response to recent abuse or vandalism, and can sometimes affect other users who are unrelated to that abuse. Review the information below for assistance if you do not believe that you have done anything wrong.

This block affects editing on all Wikimedia wikis.
The IP address or range 34.227.0.0/16 has been globally blocked by ‪Jon Kolbert‬ for the following reason(s):

Open proxy/Webhost: See the help page if you are affected

This block will expire on 05:38, 21 February 2029. Your current IP address is 34.227.114.28.

Even while globally blocked, you will usually still be able to edit pages on Meta-Wiki.

If you believe you were blocked by mistake, you can find additional information and instructions in the No open proxies global policy. Otherwise, to discuss the block please post a request for review on Meta-Wiki. You could also send an email to the stewards VRT queue at stewards@wikimedia.org including all above details.

Other useful links: Global blocks · Help:I have been blocked

You can view and copy the source of this page:

((Short description|Mapping function))
((mcn|date=April 2024))
In [[mathematics]], an '''additive set function''' is a [[function (mathematics)|function]] 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.

The term '''[[#modular set function|modular set function]]''' is equivalent to additive set function; see [[Sigma-additive set function#modularity|modularity]] below.

==Additive (or finitely additive) set functions==

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
<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 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==

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==

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>
<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==

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

===Value of empty set===

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.

===Monotonicity===

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> 

===Modularity((Anchor|modularity))===
((See also|Valuation (geometry)))
((See also|Valuation (measure theory)))

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
<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>

However, the related properties of [[Submodular set function|''submodularity'']] and [[Subadditive set function|''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===

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>

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 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.

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''.)

===An additive function which is not &sigma;-additive===

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==

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==

* ((annotated link|Additive map))
* ((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))

==References==

((reflist|group=note))
((reflist))

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

Pages transcluded onto the current version of this page (help):

Additive map (edit)
Carathéodory's extension theorem (edit)
Hahn–Kolmogorov theorem (edit)
Measure (mathematics) (edit)
Sigma-additive set function (edit)
Signed measure (edit)
Subadditive set function (edit)
Submodular set function (edit)
Σ-finite measure (edit)
Τ-additivity (edit)
Template:Ambox (view source) (template editor protected)
Template:Anchor (view source) (template editor protected)
Template:Annotated link (view source) (template editor protected)
Template:Cite book (view source) (protected)
Template:Em (view source) (template editor protected)
Template:Find sources mainspace (view source) (template editor protected)
Template:Main other (view source) (protected)
Template:Mcn (view source) (semi-protected)
Template:More citations needed (view source) (template editor protected)
Template:Pagetype (view source) (protected)
Template:PlanetMath attribution (view source) (semi-protected)
Template:Reflist (view source) (protected)
Template:Reflist/styles.css (view source) (protected)
Template:SDcat (view source) (protected)
Template:See also (view source) (template editor protected)
Template:Short description (view source) (protected)
Template:Short description/lowercasecheck (view source) (protected)
Template:Sigma (edit)
Template:Visible anchor (view source) (template editor protected)
Template:Visible anchor/styles.css (view source) (template editor protected)
Module:Anchor (view source) (template editor protected)
Module:Annotated link (view source) (template editor protected)
Module:Arguments (view source) (protected)
Module:Category handler (view source) (protected)
Module:Category handler/blacklist (view source) (protected)
Module:Category handler/config (view source) (protected)
Module:Category handler/data (view source) (protected)
Module:Category handler/shared (view source) (protected)
Module:Check for unknown parameters (view source) (protected)
Module:Citation/CS1 (view source) (protected)
Module:Citation/CS1/COinS (view source) (protected)
Module:Citation/CS1/Configuration (view source) (protected)
Module:Citation/CS1/Date validation (view source) (protected)
Module:Citation/CS1/Identifiers (view source) (protected)
Module:Citation/CS1/Utilities (view source) (protected)
Module:Citation/CS1/Whitelist (view source) (protected)
Module:Citation/CS1/styles.css (view source) (protected)
Module:Disambiguation/templates (view source) (protected)
Module:Find sources (view source) (template editor protected)
Module:Find sources/config (view source) (template editor protected)
Module:Find sources/links (view source) (template editor protected)
Module:Find sources/templates/Find sources mainspace (view source) (template editor protected)
Module:Format link (view source) (template editor protected)
Module:GetShortDescription (view source) (template editor protected)
Module:Hatnote (view source) (template editor protected)
Module:Hatnote/styles.css (view source) (template editor protected)
Module:Hatnote list (view source) (template editor protected)
Module:Labelled list hatnote (view source) (template editor protected)
Module:Lang (view source) (template editor protected)
Module:Lang/ISO 639 synonyms (view source) (template editor protected)
Module:Lang/data (view source) (template editor protected)
Module:Language/data/iana languages (view source) (template editor protected)
Module:Language/data/iana regions (view source) (template editor protected)
Module:Language/data/iana scripts (view source) (template editor protected)
Module:Language/data/iana suppressed scripts (view source) (template editor protected)
Module:Language/data/iana variants (view source) (template editor protected)
Module:Message box (view source) (protected)
Module:Message box/ambox.css (view source) (protected)
Module:Message box/configuration (view source) (protected)
Module:Namespace detect/config (view source) (protected)
Module:Namespace detect/data (view source) (protected)
Module:Pagetype (view source) (protected)
Module:Pagetype/config (view source) (protected)
Module:Pagetype/disambiguation (view source) (protected)
Module:Pagetype/rfd (view source) (template editor protected)
Module:Pagetype/setindex (view source) (protected)
Module:Pagetype/softredirect (view source) (protected)
Module:SDcat (view source) (protected)
Module:String (view source) (protected)
Module:TableTools (view source) (protected)
Module:Unicode data (view source) (template editor protected)
Module:Unsubst (view source) (protected)
Module:Wikitext Parsing (view source) (protected)
Module:Yesno (view source) (protected)

Return to Sigma-additive set function.

Retrieved from "https://en.wikipedia.org/wiki/Sigma-additive_set_function"