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.
Uniqueness of finite Borel measures from their Fourier transforms
Statement
Assume AC. Finite complex Borel measures on with are equal. Here finite means finite total variation, and .
Facts & Assumptions
Given: The stated measures and The Axiom of Choice.
Gaussian smoothing has transform and converges against all compactly supported continuous tests (Gaussian smoothing of finite measures).
The integral Fourier transform is injective on (Uniqueness of the L1 Fourier transform).
A compact-finite Borel measure on a second-countable LCH space is regular (Locally finite Borel measures on second-countable LCH spaces are regular).
Positive Radon measures agreeing on every compactly supported continuous test are equal (Uniqueness of the RMK representing measure among Radon measures).
Real and imaginary parts are finite signed measures, and under AC they have Jordan decompositions (The real and imaginary parts of a complex measure are finite signed measures, and nu = Re nu + i Im nu, Jordan decomposition of a signed measure into unique mutually singular positive parts).
Closed bounded Euclidean sets are compact and the rationals are countable (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, is countably infinite).
Proof
Set . It is a complex measure and its partition sums are bounded by , so it has finite variation. Linearity of the bounded-test integrals gives . For every , F1 gives a density with zero transform; F2 gives almost everywhere. Passing to the F1 testing limit yields for every complex .
Euclidean space is Hausdorff (disjoint small balls separate points) and locally compact by compact closed balls from F6. Balls with rational centers and positive rational radii form a countable base: for an open neighborhood of x choose a sufficiently small contained ball, then a rational center sufficiently near x and rational radius between the resulting strict bounds. Thus F3 applies to the finite positive measure and makes it regular. Under AC, F5 gives Jordan parts of and of . On their respective Hahn sets, for example ; the same argument bounds each other part by v.
If is one of these parts and E is Borel, regularity of finite v gives compact and open with and . The corresponding rho errors are at most these, so rho is both inner and outer regular and finite on compact sets, hence Radon. For real , step 1.1 gives and the analogous equality for s. These component integral identities follow for simple tests and then by their bounded-test approximation. F4 gives and , so . AC is used in smoothing and the Hahn/Jordan decompositions, and covers the regularity construction.
Depends on
- Gaussian smoothing of finite measures
- Uniqueness of the L1 Fourier transform
- Locally finite Borel measures on second-countable LCH spaces are regular
- The Axiom of Choice
- Uniqueness of the RMK representing measure among Radon measures
- Jordan decomposition of a signed measure into unique mutually singular positive parts
- The real and imaginary parts of a complex measure are finite signed measures, and nu = Re nu + i Im nu
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- $\mathbb{Q}$ is countably infinite
Used by
Dependency tree · two levels
80 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
- Gerald Teschl, Topics in Real and Functional Analysis (2017) (standard reference, not scraped)