Difference between revisions of "Additive function"
(→Warning about structure: correct chain of implications) |
(→On set functions: disjoint union) |
||
Line 26: | Line 26: | ||
<math>\mu(A\cup B)=\mu(A)+\mu(B)</math> for valued set functions (set functions that map to values) | <math>\mu(A\cup B)=\mu(A)+\mu(B)</math> for valued set functions (set functions that map to values) | ||
− | An example would be a [[Measure|measure]] | + | A shorter notation: |
+ | <math>\mu(A\uplus B)=\mu(A)+\mu(B)</math>, where {{M|\uplus}} denotes "disjoint union" -- just the union when the sets are disjoint, otherwise undefined. | ||
+ | |||
+ | An example would be a [[Measure|measure]]. | ||
==Variations== | ==Variations== |
Revision as of 08:07, 19 March 2016
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"
Contents
[hide]Definition
Here (X,+X:X×X→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×Y→Y).
A function f is additive[1] if for a,b∈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⟹f(x)+0=f(x)=f(x+0)=f(x)+f(0)⟹f(0)=0 so one must be careful!
On set functions
A set function, μ, is called additive if[2] whenever:
- A∈X
- B∈X
- A∩B=∅
We have:
μ(A∪B)=μ(A)+μ(B) for valued set functions (set functions that map to values)
A shorter notation: μ(A⊎B)=μ(A)+μ(B), where ⊎ 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(n∑i=1Ai)=n∑i=1f(Ai) for additive functions
- μ(n⋃i=1Ai)=n∑i=1μ(Ai) for valued set functions
Countably additive
This is a separate property, while given additivity we can get finite additivity we cannot get additivity, we cannot get countable additivity from just additivity.
- f(∞∑n=1An)=∞∑n=1f(An) for additive functions
- μ(∞⋃n=1An)=∞∑n=1μ(An) for valued set functions
Countable additivity can imply additivity
If f(0)=0 or μ(∅)=0 then given a finite set {ai}ni=1 we can define an infinite set {bn}∞n=1 by:
bi={iif i≤n0 or ∅otherwise
Thus:
- f(∞∑n=1bn)=f(∑ni=1ai)∑∞n=1f(bn)=∑ni=1f(ai)+f(0)=∑ni=1f(ai)
- Or indeed μ(∞∑n=1bn)=μ(∑ni=1ai)∑∞n=1μ(bn)=∑ni=1μ(ai)+μ(0)=∑ni=1μ(ai)
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)