Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Sigma-additive set function
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==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>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)