Hahn decomposition theorem
Encyclopedia : H : HA : HAH : Hahn decomposition theorem
The Hahn decomposition theorem, named after the Austrian mathematician Hans Hahn, states that given a measurable space (X,Σ) and a signed measure μ defined on the σ-algebra Σ, there exist two sets P and N in Σ such that:
- P∪N = X and P∩N = ∅.
- For each E in Σ such that E ⊆ P one has μ(E) ≥ 0; that is, P is a positive set for μ.
- For each E in Σ such that E ⊆ N one has μ(E) ≤ 0; that is, N is a negative set for μ.
Hahn–Jordan decomposition
A consequence of this theorem is the Jordan decomposition theorem, which states that every signed measure μ can be expressed as a difference of two positive measures μ+ and μ-, at least one of which is finite; μ+ and μ- are called the positive and negative part of μ, respectively. The two measures can be defined as
- [\mu^+(E):=\mu(E\cap P)\,]
- [\mu^-(E):=-\mu(E\cap N)\,]
Proof
Since the signed measure μ cannot include both +∞ and −∞ amongst its values, it will be assumed, for the sake of definiteness, that −∞ is not included. Let F be the set , which is not empty since ∅ is a negative set for μ. Let I be the infimum of that set, and let B1, B2, ..., Bn, ... be a sequence of negative sets for which I is the limit of the sequence μ(Bn).
Let N be the union of the sets Bn. Notice that every measurable subset A of N can be written as the union of a sequence of disjoint measurable sets, every one of which is contained in some Bn; we can see this by taking [A = \bigcup_n \left(A \cap B_n - \bigcup_ B_m \right) ]. Therefore A has negative measure, and thus N is a negative set. Hence I ≤ μ(N) ≤ μ(Bn) holds for each positive integer n, and therefore I = μ(N). Furthermore, since μ does not take the value −∞, μ(N) must be finite.
Let P = NC. To check that P is a positive set, suppose there is a measurable A ⊆ P such that μ(A) < 0. Let
- [\varepsilon_1:=\sup\\quad E\subseteq A\}.]
- [\mu(A_1)\geq.]
- [\varepsilon_n:=\sup\left\\quad E\subseteq A-\bigcup_^A_i\right.\right\},]
- [A_n\subseteq A-\bigcup_^ A_i]
- [\mu(A_n)\geq.]
- [0>\mu(A)=\mu(A_\infty)+\mu(B)\geq\mu(B).]
- [\sum_^\infty\varepsilon_n=2\sum_^\infty\leq 2\sum_^\infty\mu(A_n)=2\mu(A_\infty)<\infty,]
- [\lim_ \varepsilon_n=0.]
- [\mu(N\cup B)=\mu(N)+\mu(B)<\mu(N)=I,]
The only remaining task is to show the essential uniqueness of P and N. Let (P
- [(P\Delta P^\prime)\cup(N\Delta N^\prime)=(P\cap N^\prime)\cup(N\cap P^\prime).]
External links
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
