Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-30
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.

Finite-total-variation signed measures are complete

Statement

Fix a measurable space (X,A). The normed space M(X,A) of finite-total-variation signed measures is complete.

Facts & Assumptions

Given: A Cauchy sequence (νn) in M(X,A).

[L2]

If ∣ρ∣(X) is finite, then ∣ρ(E)∣≤∣ρ∣(E)≤∣ρ∣(X) for every measurable E. (Total variation is the supremum of simple integrals over unit-bounded test functions)

[L3]

Positive measures are continuous from above on decreasing measurable sets once one term has finite measure. (Continuity from above when one set has finite measure)

Proof

technique · direct
1.1L1L2

By [L1] and [L2], for every measurable E the scalar sequence (νn(E)) is Cauchy in R, because ∣νn(E)−νm(E)∣≤∣νn−νm∣(X)=∥νn−νm∥. Define ν(E):=lim⁡nνn(E).

2.1L1L2L3step 1.1

Let (Ek) be pairwise disjoint and put E=⋃kEk. Fix ε>0. Choose m so that ∥νn−νm∥<ε for all n≥m. Because ∣νm∣ is a finite positive measure, [L3] gives ∣νm∣(⋃k≥NEk)→0, so choose N with that tail below ε. Then for n≥m, ∣νn(E)−∑k=0N−1νn(Ek)∣=∣νn(⋃k≥NEk)∣≤∥νn−νm∥+∣νm∣(⋃k≥NEk)<2ε. Passing n→∞ gives ∣ν(E)−∑k=0N−1ν(Ek)∣≤2ε, so ν(E)=∑kν(Ek). Thus ν is a signed measure.

3.1L1step 1.1step 2.1

For any countable measurable partition (Aj) of a measurable set F, Fatou's lemma for nonnegative series gives ∑j∣ν(Aj)∣≤lim inf⁡n→∞∑j∣νn(Aj)∣≤sup⁡n∣νn∣(F), so ∣ν∣(F)<+∞ and therefore ν∈M(X,A). Likewise, for fixed n and any partition (Aj) of X, ∑j∣νn(Aj)−ν(Aj)∣≤lim inf⁡m→∞∑j∣νn(Aj)−νm(Aj)∣≤lim inf⁡m→∞∥νn−νm∥. Taking the supremum over partitions gives ∥νn−ν∥≤lim inf⁡m→∞∥νn−νm∥, and the right side tends to 0 because (νn) is Cauchy.

4.1step 3.1∎

Step 3.1 shows that νn→ν in norm, so every Cauchy sequence in M(X,A) converges there.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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