Hahn decomposition theorem

Hahn decomposition theorem

In mathematics, 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 "μ".

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:mu^+(E):=mu(Ecap P),and:mu^-(E):=-mu(Ecap N),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 of the Hahn decomposition theorem

Preparation: Assume that "μ" does not take the value −∞ (otherwise decompose according to −"μ"). As mentioned above, a negative set is a set "A" in Σ such that "μ"("B") ≤ 0 for every "B" in Σ which is a subset of "A".

Claim: Suppose that a set "D" in Σ satisfies "μ"("D") ≤ 0. Then there is a negative set "A" ⊆ "D" such that "μ"("A") ≤ "μ"("D").

Proof of the claim: Define "A"0 = "D". Inductively assume for a natural number "n" that "An" ⊆ "D" has been constructed. Let

:t_n=sup{mu(B): BinSigma,, Bsubset A_n}

denote the supremum of "μ"("B") for all the measurable subsets "B" of "An". This supremum might a priori be infinite. Since the empty set ∅ is a possible "B" in the definition of "tn" and "μ"(∅) = 0, we have "tn" ≥ 0. By definition of "tn" there exists a "Bn" ⊆ "An" in Σ satisfying

:mu(B_n)ge min{1,t_n/2}.

Set "A""n"+1 = "An" "Bn" to finish the induction step. Define

:A=Dsetminusigcup_{n=0}^infty B_n.

Since the sets ("Bn")"n"≥0 are disjoint subsets of "D", it follows from the sigma additivity of the signed measure "μ" that

:mu(A)=mu(D)-sum_{n=0}^inftymu(B_n)lemu(D)-sum_{n=0}^inftymin{1,t_n/2}.

This shows that "μ"("A") ≤ "μ"("D"). Assume "A" were not a negative set. That means there exists a "B" in Σ which is a subset of "A" and satisfies "μ"("B") > 0. Then "tn" ≥ "μ"("B") for every "n", hence the series on the right has to diverge to +∞, which means "μ"("A") = –∞, which is not allowed. Therefore, "A" must be a negative set.

Construction of the decomposition: Set "N"0 = ∅. Inductively, given "Nn", define

:s_n:=inf{mu(D):DinSigma,, Dsubset Xsetminus N_n}.

as the infimum of "μ"("D") for all the measurable subsets "D" of "X" "Nn". This infimum might a priori be –∞.Since the empty set is a possible "D" and "μ"(∅) = 0, we have "sn" ≤ 0. Hence there exists a "Dn" in Σ with "Dn" ⊆ "X" "Nn" and

:mu(D_n)le max{s_n/2, -1}le 0.

By the claim above, there is a negative set "An" ⊆ "Dn" such that "μ"("An") ≤ "μ"("Dn"). Define "N""n"+1 = "Nn" ∪ "An"to finish the induction step.

Define

:N=igcup_{n=0}^infty A_n.

Since the sets ("An")"n"≥0 are disjoint, we have for every "B" ⊆ "N" in Σ that

:mu(B)=sum_{n=0}^inftymu(Bcap A_n)

by the sigma additivity of "&mu;". In particular, this shows that "N" is a negative set. Define "P" = "X" "N". If "P" were not a positive set, there exists a "D" &sube; "P" in &Sigma; with "&mu;"("D") < 0. Then "sn" ≤ "&mu;"("D") for all "n" and

:mu(N)=sum_{n=0}^inftymu(A_n)lesum_{n=0}^inftymax{s_n/2, -1}=-infty,

which is not allowed for "&mu;". Therefore, "P" is a positive set.

Proof of the uniqueness statement:Suppose that (N',P') is another Hahn decomposition of X. Then Pcap N' is a positive set and also a negative set. Therefore, every measurable subset of it has measure zero. The same applies to Ncap P'. Since

:(P, riangle,P')cup (N, riangle,N')=(Pcap N')cup(Ncap P'),

this completes the proof. Q.E.D.

External links

* [http://planetmath.org/?op=getobj&from=objects&id=4014 Hahn decomposition theorem] at PlanetMath.


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Decomposition (disambiguation) — Decomposition may refer to the following: Decomposition, biological process through which organic material is reduced Chemical decomposition or analysis, in chemistry, is the fragmentation of a chemical compound into elements or smaller compounds …   Wikipedia

  • Decomposition of spectrum (functional analysis) — In mathematics, especially functional analysis, the spectrum of an operator generalizes the notion of eigenvalues. Given an operator, it is sometimes useful to break up the spectrum into various parts. This article discusses a few examples of… …   Wikipedia

  • Hans Hahn (mathématicien) — Pour les articles homonymes, voir Hahn.  Ne doit pas être confondu avec Hans Hahne. Hans Hahn (27 septembre 1879 à Vienne – 24 juillet 1934 à Vienne) est un mathématicien et philosophe autrichien qui a apporté de nombreuses contributions à l …   Wikipédia en Français

  • Hans Hahn — (September 27,1879 July 24,1934) was an Austrian mathematician who made contributions to functional analysis, topology, set theory, the calculus of variations, real analysis, and order theory. He was a student at the Technische Hochschule in… …   Wikipedia

  • Jordan decomposition — In mathematics, Jordan decomposition may refer to* Hahn decomposition theorem, and the Jordan decomposition of a measure * Jordan normal form of a matrix * Jordan–Chevalley decomposition of a matrix * Deligne Lusztig theory, and its Jordan… …   Wikipedia

  • Radon–Nikodym theorem — In mathematics, the Radon–Nikodym theorem is a result in functional analysis that states that, given a measurable space ( X , Sigma;), if a sigma finite measure nu; on ( X , Sigma;) is absolutely continuous with respect to a sigma finite measure… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • Signed measure — In mathematics, signed measure is a generalization of the concept of measure by allowing it to have negative values. Some authors may call it a charge,[1] by analogy with electric charge, which is a familiar distribution that takes on positive… …   Wikipedia

  • Liste de théorèmes — par ordre alphabétique. Pour l établissement de l ordre alphabétique, il a été convenu ce qui suit : Si le nom du théorème comprend des noms de mathématiciens ou de physiciens, on se base sur le premier nom propre cité. Si le nom du théorème …   Wikipédia en Français

  • Positive and negative sets — In measure theory, given a measurable space ( X , Sigma;) and a signed measure mu; on it, a set A isin; Sigma; is called a positive set for mu; if every Sigma; measurable subset of A has nonnegative measure; that is, for every E sube; A that… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”