Additive function
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→Y) (which we'll denote X and +X) denotes a space with an additive function assigned.
The same goes for (Y,+Y:Y×Y→Y).
A function 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)=f(x+0)=f(x)+f(0)⟹f(x)=f(x)+0⟹f(0)=0
On set functions
A set function, μ, is called additive if[2] whenever:
- A∈X
- B∈X
- A∩B=∅
We have:
μ(A∪B)=μ(A)+μ(B)
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
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)
Note that a Mathjax bug was found here.
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)