Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 a law from its characteristic function

Statement

Assume AC. Two Borel probability laws on R with equal characteristic functions are equal. In particular a real random variable has a real-valued characteristic function if and only if its law is symmetric under x↦−x.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

For a Borel probability law μ, the characteristic function is φμ(t)=∫eitx dμ(x) (Characteristic function of a real random variable). The finite-measure Fourier convention is μ^(ξ)=∫e−2πixξ dμ(x) (Fourier transform of a finite complex Borel measure). These bounded integrands are integrable; the latter theorem's countable-choice premise is covered by the stated AC.

[F2]

Under AC finite complex Borel measures with equal transforms are equal. Uniqueness of finite Borel measures from their Fourier transforms.

[F3]

AC supplies the choices in the Fourier uniqueness proof. The Axiom of Choice.

[F4]

Reflection conjugates a characteristic function. Basic properties of characteristic functions.

[F5]

The reflected law has characteristic function phi(-t). Characteristic functions under affine maps and independent sums.

Proof

technique · direct
1.1F1F3givenalgebra

Let μ,ν be the two laws. Each positive probability law, regarded as a complex measure, has total variation one: every measurable partition has sum of absolute masses equal to its total mass. Thus [F1] applies in dimension one under the stated AC. For every real ξ and x, ei(−2πξ)x=e−2πixξ, so the defining bounded integrands are identical. Integrating this pointwise identity against either law gives μ^(ξ)=φμ(−2πξ) and ν^(ξ)=φν(−2πξ). Since the characteristic functions agree at every real argument, μ^(ξ)=ν^(ξ) for every ξ. This also verifies the finite-variation hypotheses of Fourier uniqueness.

2.1step 1.1F2F3

Apply F2 in dimension one to obtain μ=ν. AC is inherited from that proof: it supplies the Hahn/Jordan and Radon–Nikodym selections used in Gaussian smoothing and covers its regularity argument. No inversion result from this page is used.

3.1step 2.1F4F5∎

For the final equivalence, F5 with a=−1,b=0 and F4 give φ−X(t)=φX(−t)=φX(t)‾. If φX is real-valued, the two characteristic functions agree and step 2.1 proves symmetry of the law. Conversely, symmetry means the two laws, hence their defining integrals, agree; the displayed identity then forces φX(t)=φX(t)‾, so every value is real.

Depends on

Dependency tree · 2 levels

Sources