Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-23 (gpt-6-sol)
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.

The bounded complex dual of C_0(X) is regular complex measures

Statement

Assume Dependent Choice. For an LCH space X, every bounded complex linear functional L on C0(X;C) has a unique representation L(f)=∫Xf dμ by a finite regular complex Borel measure μ. Conversely each such μ defines a bounded functional and ∥L∥=∣μ∣(X).

Facts & Assumptions

Given: Dependent Choice and a bounded complex linear functional L on C0(X;C).

[L1]

Bounded real functionals split into differences of positive functionals. (A bounded real C_0(X) functional is a difference of positive functionals)

[L2]

Positive bounded functionals have finite regular representing measures. (Positive C_0(X) functionals have finite regular representing measures)

[L3]

For a finite complex measure, total variation is the supremum of integrals against simple functions bounded by 1 (Total variation is the supremum of simple integrals over unit-bounded test functions).

[L4]

Under Dependent Choice, a compact subset of an open set in an LCH space has a [0,1]-valued compactly supported cutoff equal to 1 on the compact set (LCH Urysohn cutoff, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[L5]

For a regular complex Borel measure, its total variation is finite and regular on every Borel set, so compact inner and open outer approximation apply (Regular complex Borel measures).

Proof

technique · direct
1.1L1L2

On the real vector space of real-valued functions put A(u)=Re⁡L(u) and B(u)=Im⁡L(u). Apply [L1], then [L2], to the positive decompositions of both A and B. This gives finite regular signed measures α and β representing A and B. Put μ=α+iβ. If f=u+iv, complex linearity gives L(f)=L(u)+iL(v), whose real and imaginary parts agree exactly with those of ∫f d(α+iβ); hence μ represents L.

2.1L2step 1.1

If two finite regular complex measures μ and ν represent L, then the real and imaginary signed parts of their difference μ−ν integrate every real Cc function to zero. For either signed part, move its negative Jordan component to the other side; the two resulting positive Radon measures have equal integrals on Cc. The positive-measure uniqueness in [L2] makes those positive measures equal, so both signed parts of μ−ν vanish and μ=ν.

3.1L3L4L5givenalgebra∎

Conversely, the total-variation integral bound gives ∣∫f dμ∣≤∥f∥∞∣μ∣(X), so integration is bounded with norm at most ∣μ∣(X). If ∣μ∣(X)=0, then μ=0 and equality is immediate. Otherwise fix 0<ε<∣μ∣(X). By [L3], choose a unit-bounded simple s=∑j=1mcj1Ej, with disjoint Borel Ej and ∣cj∣≤1, such that ∣∫s dμ∣>∣μ∣(X)−ε. By [L5], choose compact Kj⊆Ej and open Oj⊇Kj with ∣μ∣(Ej∖Kj)<ε/(8m) and ∣μ∣(Oj∖Kj)<ε/(8m). Replace Oj by Uj:=Oj∖⋃i≠jKi, still an open neighbourhood of Kj. By [L4], choose 0≤fj≤1Uj in Cc(X) with fj=1 on Kj. Put f:=∑jcjfjmax⁡(1,∑jfj). Then f∈Cc(X), ∣f∣≤1, and f=s on ⋃jKj, because on Kj only fj is nonzero. Outside that union, ∣s−f∣≤2 and its support lies in ⋃j(Ej∖Kj)∪⋃j(Uj∖Kj). Thus ∫∣s−f∣ d∣μ∣<ε, and the variation bound gives ∣∫f dμ∣>∣μ∣(X)−2ε. Since ε is arbitrary, ∥L∥≥∣μ∣(X), proving equality.

Depends on

Used by

Dependency tree · two levels

36 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