Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Jordan decomposition of a signed measure into unique mutually singular positive parts

Statement

Assume the Axiom of Choice. Let ν be a signed measure on (X,A). Then there exist positive measures ν+,ν−:(X,A)→[0,+∞], at least one finite on X, such that ν=ν+−ν−, and ν+⊥ν−.

These measures are unique: if ν=μ−η with positive measures μ⊥η, then μ=ν+ and η=ν−.

The following conditional assertion is choice-free: if a Hahn partition X=P⊔N is supplied, the formulas ν+(E)=ν(E∩P) and ν−(E)=−ν(E∩N) construct these unique measures. Comparing two supplied mutually singular positive decompositions also requires no AC.

Facts & Assumptions

Given: A signed measure ν on (X,A) (A signed measure is countably additive and takes at most one infinite value). Assume AC for the general existence assertion (The Axiom of Choice); for the conditional assertion a Hahn partition is supplied.

[L1]

Under AC, Hahn decomposition gives measurable sets P,N with P⊔N=X, P positive, and N negative, unique up to null sets. (Hahn decomposition for signed measures, unique up to total-variation-null sets)

[L2]

Mutual singularity means that the two set functions vanish on measurable subsets of complementary measurable pieces. (Mutual singularity for signed or complex measures)

[L3]

A measure is a nonnegative countably additive set function on a sigma-algebra. (Measures on sigma-algebras)

Proof

technique · direct
1.1givenL1L3

For the general existence assertion, obtain a Hahn partition from [L1]; this invokes AC through the Hahn theorem's optimizing choices and its positive-subset lemma. For the conditional assertion start with the supplied partition instead. Define ν+(E)=ν(E∩P) and ν−(E)=−ν(E∩N). The signs follow from Positive, negative, and null sets for a signed measure, and countable additivity and the empty-set value follow from those of ν, so these are positive measures by [L3].

2.1step 1.1L2algebra

At least one of ν+(X)=ν(P) and ν−(X)=−ν(N) is finite, since otherwise ν would take both infinite signs. By positivity the same side is finite on every measurable E. Thus the difference is always defined, and finite additivity gives ν(E)=ν+(E)−ν−(E). The defining formulas give ν+(N)=ν−(P)=0, hence mutual singularity by [L2].

3.1step 2.1L2algebra

Suppose ν=μ−η with positive mutually singular measures, with the displayed difference defined on every measurable set. Take one witnessing partition P′,N′ from [L2]. On subsets of P′ one has ν=μ≥0, and on subsets of N′ one has ν=−η≤0. Thus this is another Hahn partition. A measurable subset of P∖P′ lies in positive P and negative N′, so has value zero; the same holds on P′∖P. Splitting between these differences shows they are null sets. This comparison uses only the supplied partitions, not Hahn existence or further AC.

4.1step 1.1step 3.1algebra∎

For every measurable E, μ(E)=μ(E∩P′)=ν(E∩P′)=ν(E∩P)=ν+(E): the first equality uses vanishing on N′, and the middle change of sets discards only the null differences from step 3.1. Similarly η(E)=−ν(E∩N)=ν−(E). There is no subtraction of two infinite quantities. Hence the parts are unique; steps 1.1–4.1 also prove the choice-free conditional assertion because AC was used only to obtain the initial arbitrary Hahn partition.

Depends on

Used by

Dependency tree · two levels

14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources