Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-21
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.

Assuming countable choice, the semifinite part is a semifinite measure and equals the original measure exactly when it is semifinite

Statement

Assume the Axiom of Countable Choice. For every measure μ, its semifinite part μsf is a semifinite measure and μsf≤μ. Moreover,

μsf=μ⟺μ is semifinite.

Facts & Assumptions

Given: A measure μ on (X,A) and the Axiom of Countable Choice.

[L1]

The semifinite part is the supremum of the finite values μ(F) over measurable F⊆E (The semifinite part of a measure).

[L2]

Under countable choice, an infinite-measure set for a semifinite measure contains finite-measure subsets of arbitrarily large measure (Assuming countable choice, an infinite-measure set in a semifinite measure space has arbitrarily large finite-measure subsets).

[L3]

A measure is countably additive on disjoint measurable sequences (Measures on sigma-algebras), and measures are monotone (Measures are monotone).

[L4]

A natural-number-indexed finite family of nonempty sets has a choice function in ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

Proof

technique · direct
1.1givenL1L3

One has μsf(∅)=0 and μsf(E)≤μ(E) for every measurable E, since every finite-measure F⊆E satisfies μ(F)≤μ(E).

1.2givenL1L3

Let (Ek) be disjoint and E=⋃kEk. If F⊆E is measurable with μ(F)<+∞, then the F∩Ek are disjoint finite-measure subsets of Ek, so μ(F)=∑kμ(F∩Ek)≤∑kμsf(Ek). Taking the supremum over F gives μsf(E)≤∑kμsf(Ek).

1.3givenL1L3L4choose

Conversely, for each finite initial range, the supremum property and finite choice permit finite-measure Fk⊆Ek arbitrarily close to μsf(Ek); their finite disjoint union has finite measure and lies in E. If one of the finitely many suprema is +∞, use an arbitrarily large finite value instead. Hence every finite partial sum ∑k<nμsf(Ek) is at most μsf(E), and so is their supremum.

1.4givenL1L3

The set function μsf is semifinite: if μsf(E)>0, its defining supremum supplies a measurable F⊆E with 0<μ(F)<+∞, and then μsf(F)=μ(F).

1.5givenL1L2

For the reverse direction, suppose μ is semifinite. If μ(E)<+∞, the choice F=E gives μsf(E)=μ(E); if μ(E)=+∞, [L2] makes the defining finite values unbounded, so again μsf(E)=μ(E).

2.1step 1.1step 1.2step 1.3step 1.4L3

Steps 1.1, 1.2 and 1.3 give the empty-set condition and both countable-additivity inequalities, so μsf is a measure; step 1.4 makes it semifinite.

3.1step 2.1

For the forward direction of the displayed equivalence, if μsf=μ, then μ is semifinite because step 2.1 proves that μsf is semifinite.

4.1step 1.1step 3.1step 1.5∎

Steps 3.1 and 1.5 prove both directions of the equivalence, while step 1.1 records the pointwise inequality μsf≤μ.

Depends on

Used by

Cited to discharge well-definedness by The semifinite part of a measure.

Dependency tree · two levels

23 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