Jump to content

Hahn decomposition theorem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by OdedSchramm (talk | contribs) at 16:40, 10 June 2008 (clarified null sets - the appropriate notion here is different than the standard, since usually the context is unsigned measures). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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:

  1. PN = X and PN = ∅.
  2. For each E in Σ such that EP one has μ(E) ≥ 0; that is, P is a positive set for μ.
  3. For each E in Σ such that EN one has μ(E) ≤ 0; that is, N is a negative set for μ.

Moreover, this decomposition is essentially unique, in the sense that for any other pair (P', N') of measurable sets fulfilling the above three conditions, the symmetric differences PΔP' and NΔN' are μ-null sets in the strong sense that every measurable subset of them has zero measure. The pair (P,N) is called a Hahn decomposition of the signed measure μ.

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

and

for every E in Σ, and it is an easy task to verify that both μ+ and μ- are positive measures on the space (X,Σ), at least one of them is finite (since μ cannot take both +∞ and −∞ as values), and satisfy μ = μ+ − μ-. The pair (μ+, μ-) is called the Jordan decomposition (or sometimes Hahn–Jordan decomposition) of μ.

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 {μ(B)|B is a negative set for μ}, 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

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 AP such that μ(A) < 0. Let

By construction, ε1 ≥ μ(∅) = 0. Also, ε1 is finite since 0 > μ(A) > −∞. Let A1 be a measurable subset of A that satisfies

Then, construct inductively a sequence ε2, ε3, ..., εn, ... of nonnegative finite reals, and another A2, A3, ..., An, ... of measurable sets, defining

and then choosing a measurable set An such that

and

Now let A be the union of the sets An, and B:=A-A. Since the sets An are disjoint and satisfy μ(An) ≥ 0, then μ(A) ≥ 0, and therefore,

From the construction of εn, every measurable subset E of B must satisfy μ(E) ≤ εn for every positive integer n. But, since the An are disjoint sets,

and therefore,

Then, every measurable subset E of B must satisfy μ(E) ≤ 0, which proves that B is a negative set, and therefore NB is. But then, since N and B are disjoint,

contradicting the definition of I. This is impossible, so P must be a positive set.

The only remaining task is to show the essential uniqueness of P and N. Let (P', N') be another Hahn decomposition of μ. Then, since both are partitions of X,

Since P is a positive set, PN' must be, too; but since N' is a negative set, PN' must also be a negative set, and therefore, a μ-null set. The same reasoning applies to NP'. Therefore, both PΔP' and NΔN' are null sets.

Q.E.D.