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

Differentiation of sigma-finite Borel measures finite on compact sets

Statement

Assume the Axiom of Choice (The Axiom of Choice), hence also countable choice (The Axiom of Countable Choice (ACω)).

Let ν be a sigma-finite Borel measure on Rn that is finite on compact sets. Write ν=νa+νs,νa≪λ,νs⊥λ, for its Lebesgue decomposition on the Borel sigma-algebra relative to the restriction of Lebesgue measure, and choose a Borel measurable representative f of the Radon-Nikodym class dνa/dλ. Then for Lebesgue-almost every x∈Rn, lim⁡r→0+ν(B(x,r))λ(B(x,r))=f(x). More generally, let A⊆Rn, and suppose that for each x∈A a family (Er(x))r>0 of Borel sets shrinking nicely to x is specified. Then for Lebesgue-almost every x∈A, lim⁡r→0+ν(Er(x))λ(Er(x))=f(x).

Facts & Assumptions

Given: The Axiom of Choice and a sigma-finite Borel measure ν on Rn that is finite on compact sets. All measure decompositions are on the common Borel sigma-algebra; the resulting Borel density is also Lebesgue measurable.

[L2]

If (Er) shrinks nicely to x, then 1λ(Er)∫Erf dλ→f(x) for almost every x. (Differentiation holds along families shrinking nicely)

[L4]

Assuming the Axiom of Countable Choice, Lebesgue measure is inner regular by compact subsets on measurable sets in Rn. (Assuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets)

[L5]

Increasing measurable unions pass through positive measures. (Continuity from below for measures)

[L7]

Borel sets form the sigma-algebra generated by open sets. (The Borel sigma-algebra of a topological space)

Proof

technique · direct
1.1L1L3givenchoosealgebra

The closed balls Xj=B(0,j)‾, j≥1, give a common finite-measure Borel exhaustion for ν and λ by [L3]. Under the given AC, [L1] therefore gives ν=νa+νs and a finite real Borel density f of νa. Choose a Borel null set N carrying νs. For every Borel E, absolute continuity and concentration give νs(E)=ν(E∩N)≥0,νa(E)=ν(E∖N)≥0. Both components are positive and dominated by ν. On each finite exhaustion piece, the set where f≤−1/k has measure zero: its density integral is at most −λ(E)/k but equals νa(E)≥0. Taking the countable union over j,k and replacing negative values by zero yields f≥0 without changing its class. For every ball, ∫B(x,R)∣f∣ dλ=νa(B(x,R))≤ν(B(x,R)‾)<∞. Thus f∈Lloc1.

1.2L3L5L7givenconstructalgebra

We prove locally the outer approximation needed below. Let η be any Borel measure finite on compact sets and V=B(0,j) for j≥1; then η(V)<∞. Every open W⊆V is an increasing union of compact sets: use the sets of points of W with norm at most m and distance at least 1/m from its complement, m≥1. These are closed and bounded, so [L3] and [L5] approximate W from inside by compact sets in η-measure. Let C be the Borel E⊆V such that for every δ>0 there are relatively closed F and relatively open O with F⊆E⊆O⊆V and η(O∖F)<δ. All relatively open sets are in C by the compact approximation just proved. Relative complements preserve C by interchanging F and O. Countable unions preserve outer approximation by choosing open supersets with summable errors; they preserve inner approximation by first taking a finite partial union with small remaining measure (using η(V)<∞ and [L5]) and then taking a finite union of relatively closed approximants. Thus C is a sigma-algebra, and [L7] implies that it contains every Borel subset of V. In particular each such set has arbitrarily accurate relatively open outer approximations. The countable selections are covered by AC.

2.1step 1.2givenchoosealgebra

If H is a Borel η-null set, put V0=∅, Vj=B(0,j) and Hj=H∩(Vj∖Vj−1) for j≥1. Step 1.2 gives relatively open Oj⊆Vj containing Hj with η(Oj)<ε2−j. As Vj is open, each Oj is open in Rn. Their union is an open set containing H with measure less than ε. This proves the required null-set outer approximation without importing a later regularity theorem.

2.2L1L2step 1.1givenalgebra

Let (Er(x))r>0 be a family of Borel sets shrinking nicely to x with constant αx>0. Then ν(Er(x))λ(Er(x))=1λ(Er(x))∫Er(x)f dλ+νs(Er(x))λ(Er(x)), while positivity and the defining comparison give 0≤νs(Er(x))λ(Er(x))≤1αxνs(B(x,r))λ(B(x,r)). Consequently [L2] and step 1.1 reduce both conclusions to proving νs(B(x,r))λ(B(x,r))⟶0 for almost every x.

2.3step 1.1L5givenconstructalgebra

Put G:=Rn∖N, so G is Borel, λ(Rn∖G)=0, and νs(G)=0. For each m≥1, define Dm(x):=sup⁡0<r<1/mνs(B(x,r))λ(B(x,r)). For fixed r>0, if 0<δ<r and ∥x−y∥2<δ, then B(x,r−δ)⊆B(y,r). By [L5], νs(B(x,r−δ))↑νs(B(x,r)) as δ↓0, so x↦νs(B(x,r)) is lower semicontinuous. Translation invariance gives the fixed positive denominator λ(B(x,r))=λ(B(0,r)), so each Dm is lower semicontinuous and each set {x∈Rn:Dm(x)>1k} is open. For k≥1, put Fk:=G∩⋂m≥1{x∈Rn:Dm(x)>1k}. Then Fk is Borel. If x∈G and L(x):=lim sup⁡r→0+νs(B(x,r))λ(B(x,r))>0, choose k with 1/k<L(x). Since Dm(x)≥L(x)>1/k for every m, one has x∈Fk. Thus {x∈G:L(x)>0}⊆⋃k≥1Fk, and it is enough to prove λ(Fk)=0 for every k.

3.1step 1.1step 2.1step 2.3L6givenconstructalgebra

Fix k≥1 and ε>0. By steps 1.1 and 2.1, there is an open Uε⊇G with νs(Uε)<ε. Let K⊆Fk be nonempty and compact (the empty case has measure zero). Consider all balls B(x,r)⊆Uε with x∈K and νs(B(x,r))>λ(B(x,r))/k. They cover K: for each x, choose m with B(x,1/m)⊆Uε, and use Dm(x)>1/k. Compactness gives a finite subcover. Greedily retain a largest-radius ball and discard all balls meeting it, repeating on the remaining finite family. The retained balls B1,…,Bq are disjoint. Any discarded ball of radius r meets a retained one of radius R≥r; their centres are less than r+R apart, so every point of the discarded ball is less than 2r+R≤3R<5R from the retained centre. Hence K⊆⋃j5Bj. By [L6] and disjointness, λ(K)≤5n∑jλ(Bj)<5nk∑jνs(Bj)≤5nkνs(Uε)<5nkε.

4.1step 2.3step 3.1L4algebra

Since ε>0 was arbitrary, step 3.1 gives λ(K)=0 for every compact K⊆Fk. Because Fk is Borel by step 2.3, [L4] implies λ(Fk)=sup⁡{λ(K):K⊆Fk, K compact}=0. Step 2.3 now shows that the set where L(x)>0 is contained in the null set (Rn∖G)∪⋃k≥1Fk. The ratios defining L are nonnegative, so lim⁡r→0+νs(B(x,r))λ(B(x,r))=0 for almost every x.

5.1L2step 1.1step 2.2step 4.1∎

Combine step 4.1 with the comparison in step 2.2 and the differentiation theorem [L2] for the locally integrable representative f. For any specified Borel families (Er(x))r>0 shrinking nicely to the points of A, this gives ν(Er(x))λ(Er(x))→f(x) for almost every x∈A. Taking A=Rn and Er(x)=B(x,r) gives the ball conclusion.

Depends on

Used by

Dependency tree · two levels

102 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