Difference between revisions of "Additive function"
(Refactored page and cleaned up into standard definition form. Definition is more concrete.) |
(→Finitely additive: still less grandiose) |
||
(3 intermediate revisions by one other user not shown) | |||
Line 3: | Line 3: | ||
{{Stub page|Needs to include everything the old page did, link to propositions and lead to measures}} | {{Stub page|Needs to include everything the old page did, link to propositions and lead to measures}} | ||
==Definition== | ==Definition== | ||
− | {{Extra Maths}}A ''[[real valued function|real valued]]'' [[set function]] on a class of [[set|sets]], {{M|\mathcal{A} }}, {{M|f:\mathcal{A}\rightarrow\mathbb{R} }} is called ''additive'' or ''finitely additive'' if{{rMT1VIB}}: | + | <!-- |
+ | |||
+ | NOTE TO FUTURE EDITORS--------------------------------------------------- | ||
+ | Right now this defines an additive SET function, if you add an additive function (which way have meaning in say algebra), be sure to update the SET FUNCTION redirects that point into this page | ||
+ | ------------------------------------------------------------------------- | ||
+ | |||
+ | |||
+ | -->{{Extra Maths}}A ''[[real valued function|real valued]]'' [[set function]] on a class of [[set|sets]], {{M|\mathcal{A} }}, {{M|f:\mathcal{A}\rightarrow\mathbb{R} }} is called ''additive'' or ''finitely additive'' if{{rMT1VIB}}: | ||
* For {{M|A,B\in\mathcal{A} }} with {{M|1=A\cap B=\emptyset}} ([[pairwise disjoint]]) and {{M|A\udot B\in\mathcal{A} }} we have: | * For {{M|A,B\in\mathcal{A} }} with {{M|1=A\cap B=\emptyset}} ([[pairwise disjoint]]) and {{M|A\udot B\in\mathcal{A} }} we have: | ||
** {{M|1=f(A\udot B)=f(A)+f(B)}} | ** {{M|1=f(A\udot B)=f(A)+f(B)}} | ||
Line 9: | Line 16: | ||
With the same definition of {{M|f}}, we say that {{M|f}} is ''finitely additive'' if for a [[pairwise disjoint]] family of sets {{M|1=\{A_i\}_{i=1}^n\subseteq\mathcal{A} }} with {{M|1=\bigudot_{i=1}^nA_i\in\mathcal{A} }} we have<ref name="MT1VIB"/>: | With the same definition of {{M|f}}, we say that {{M|f}} is ''finitely additive'' if for a [[pairwise disjoint]] family of sets {{M|1=\{A_i\}_{i=1}^n\subseteq\mathcal{A} }} with {{M|1=\bigudot_{i=1}^nA_i\in\mathcal{A} }} we have<ref name="MT1VIB"/>: | ||
* {{MM|1=f\left(\mathop{\bigudot}_{i=1}^nA_i\right)=\sum^n_{i=1}f(A_i)}}. | * {{MM|1=f\left(\mathop{\bigudot}_{i=1}^nA_i\right)=\sum^n_{i=1}f(A_i)}}. | ||
− | '''Claim 1: ''' {{M|f}} is finitely additive {{M|\ | + | '''Claim 1: ''' {{M|f}} is finitely additive {{M|\implies}} {{M|f}} is additive<ref name="NoStrongerClaim1" group="Note">{{Todo|Example on [[Talk:Additive function|talk page]]}}</ref> |
+ | |||
===Countably additive=== | ===Countably additive=== | ||
With the same definition of {{M|f}}, we say that {{M|f}} is ''countably additive'' if for a [[pairwise disjoint]] family of sets {{M|1=\{A_n\}_{n=1}^\infty\subseteq\mathcal{A} }} with {{M|1=\bigudot_{n=1}^\infty A_n\in\mathcal{A} }} we have<ref name="MT1VIB"/>: | With the same definition of {{M|f}}, we say that {{M|f}} is ''countably additive'' if for a [[pairwise disjoint]] family of sets {{M|1=\{A_n\}_{n=1}^\infty\subseteq\mathcal{A} }} with {{M|1=\bigudot_{n=1}^\infty A_n\in\mathcal{A} }} we have<ref name="MT1VIB"/>: | ||
Line 19: | Line 27: | ||
Let {{M|\emptyset,A\in\mathcal{A} }}, then: | Let {{M|\emptyset,A\in\mathcal{A} }}, then: | ||
* {{M|1=f(A)=f(A\udot\emptyset)=f(A)+f(\emptyset)}} by hypothesis. | * {{M|1=f(A)=f(A\udot\emptyset)=f(A)+f(\emptyset)}} by hypothesis. | ||
− | * Thus {{M|1=f(A)=f(A)+f(\emptyset)} | + | * Thus {{M|1=f(A)=f(A)+f(\emptyset)}} |
* This means {{M|1=f(A)-f(A)=f(\emptyset)}} | * This means {{M|1=f(A)-f(A)=f(\emptyset)}} | ||
We see {{M|1=f(\emptyset)=0}}, as required | We see {{M|1=f(\emptyset)=0}}, as required | ||
Line 25: | Line 33: | ||
==Proof of claims== | ==Proof of claims== | ||
{{Begin Inline Theorem}} | {{Begin Inline Theorem}} | ||
− | '''[[Additive function/Claim 1 - additive | + | '''[[Additive function/Claim 1 - additive implies finitely additive|Claim 1]]: ''' {{M|f}} is ''additive'' {{M|\implies}} {{M|f}} is ''finitely additive''<ref group="Note" name="NoStrongerClaim1"/> |
{{Begin Inline Proof}} | {{Begin Inline Proof}} | ||
− | {{:Additive function/Claim 1 - additive | + | {{:Additive function/Claim 1 - additive implies finitely additive}} |
{{End Proof}}{{End Theorem}} | {{End Proof}}{{End Theorem}} | ||
+ | |||
==See also== | ==See also== | ||
* [[Subadditive function]] | * [[Subadditive function]] |
Latest revision as of 18:16, 20 March 2016
The message provided is:
Contents
[hide]Definition
\newcommand{\bigudot}{ \mathchoice{\mathop{\bigcup\mkern-15mu\cdot\mkern8mu}}{\mathop{\bigcup\mkern-13mu\cdot\mkern5mu}}{\mathop{\bigcup\mkern-13mu\cdot\mkern5mu}}{\mathop{\bigcup\mkern-13mu\cdot\mkern5mu}} }\newcommand{\udot}{\cup\mkern-12.5mu\cdot\mkern6.25mu\!}\require{AMScd}\newcommand{\d}[1][]{\mathrm{d}^{#1} }A real valued set function on a class of sets, \mathcal{A} , f:\mathcal{A}\rightarrow\mathbb{R} is called additive or finitely additive if[1]:
- For A,B\in\mathcal{A} with A\cap B=\emptyset (pairwise disjoint) and A\udot B\in\mathcal{A} we have:
- f(A\udot B)=f(A)+f(B)
Finitely additive
With the same definition of f, we say that f is finitely additive if for a pairwise disjoint family of sets \{A_i\}_{i=1}^n\subseteq\mathcal{A} with \bigudot_{i=1}^nA_i\in\mathcal{A} we have[1]:
- f\left(\mathop{\bigudot}_{i=1}^nA_i\right)=\sum^n_{i=1}f(A_i).
Claim 1: f is finitely additive \implies f is additive[Note 1]
Countably additive
With the same definition of f, we say that f is countably additive if for a pairwise disjoint family of sets \{A_n\}_{n=1}^\infty\subseteq\mathcal{A} with \bigudot_{n=1}^\infty A_n\in\mathcal{A} we have[1]:
- f\left(\mathop{\bigudot}_{n=1}^\infty A_n\right)=\sum^\infty_{n=1}f(A_n).
Immediate properties
Claim: if \emptyset\in\mathcal{A} then f(\emptyset)=0
Proof of claims
See also
Notes
- ↑ Jump up to: 1.0 1.1
TODO: Example on talk page
References
|
TODO: Check algebra books for definition of additive, perhaps split into two cases, additive set function and additive function
OLD PAGE
An additive function is a homomorphism that preserves the operation of addition in place on the structure in question.
In group theory (because there's only one operation) it is usually just called a "group homomorphism"
Definition
Here (X,+_X:X\times X\rightarrow X) (which we'll denote X and +_X) denotes a set endowed with a binary operation called addition.
The same goes for (Y,+_Y:Y\times Y\rightarrow Y).
A function f is additive[1] if for a,b\in X
f(a+_Xb)=f(a)+_Yf(b)
Warning about structure
If the spaces X and Y have some sort of structure (example: Group) then some required properties follow, for example:
x=x+0\implies f(x)+0=f(x)=f(x+0)=f(x)+f(0)\implies f(0)=0 so one must be careful!
On set functions
A set function, \mu, is called additive if[2] whenever:
- A\in X
- B\in X
- A\cap B=\emptyset
We have:
\mu(A\cup B)=\mu(A)+\mu(B) for valued set functions (set functions that map to values)
A shorter notation: \mu(A\uplus B)=\mu(A)+\mu(B), where \uplus denotes "disjoint union" -- just the union when the sets are disjoint, otherwise undefined.
An example would be a measure.
Variations
Finitely additive
This follows by induction on the additive property above. It states that:
- f\Big(\sum^n_{i=1}A_i\Big)=\sum^n_{i=1}f(A_i) for additive functions
- \mu\Big(\biguplus^n_{i=1}A_i\Big)=\sum^n_{i=1}\mu(A_i) for valued set functions
Countably additive
This is a separate property, while given additivity we can get finite additivity, but we cannot get countable additivity from just additivity.
- f\Big(\sum^\infty_{n=1}A_n\Big)=\sum^\infty_{n=1}f(A_n) for additive functions
- \mu\Big(\biguplus^\infty_{n=1}A_n\Big)=\sum^\infty_{n=1}\mu(A_n) for valued set functions
Countable additivity can imply additivity
If f(0)=0 or \mu(\emptyset)=0 then given a finite set \{a_i\}_{i=1}^n we can define an infinite set \{b_n\}_{n=1}^\infty by:
b_i=\left\{\begin{array}a_i&\text{if }i\le n\\ 0\text{ or }\emptyset & \text{otherwise}\end{array}\right.
Thus:
- f(\sum^\infty_{n=1}b_n)= \begin{array}{lr} f(\sum^n_{i=1}a_i) \\ \sum^\infty_{n=1}f(b_n)=\sum^n_{i=1}f(a_i)+f(0)=\sum^n_{i=1}f(a_i) \end{array}
- Or indeed \mu(\sum^\infty_{n=1}b_n)= \begin{array}{lr} \mu(\sum^n_{i=1}a_i) \\ \sum^\infty_{n=1}\mu(b_n)=\sum^n_{i=1}\mu(a_i)+\mu(0)=\sum^n_{i=1}\mu(a_i) \end{array}
References
- Jump up ↑ http://en.wikipedia.org/w/index.php?title=Additive_function&oldid=630245379
- Jump up ↑ Halmos - p30 - Measure Theory - Springer - Graduate Texts in Mathematics (18)