Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Levy continuity theorem converse

Statement

Assume AC. Let μn be Borel probability laws on R with characteristic functions φn. If φn(t)ψ(t) at every real t and ψ is continuous at zero, there is a unique Borel probability law μ with characteristic function ψ, and μnμ.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

The triangular weight has mass one and bounds each law tail. Tightness from characteristic function equicontinuity at zero.

[F2]

Characteristic functions are continuous, normalized at zero and bounded by one. Basic properties of characteristic functions.

[F3]

Weak limits have pointwise limiting characteristic functions. Levy continuity theorem forward direction.

[F4]

Under AC a characteristic function determines at most one Borel law. Uniqueness of a law from its characteristic function.

[F5]

Under AC tight families on Polish spaces are relatively sequentially weakly compact. Prokhorov tightness theorem on polish spaces.

[F6]

A fixed integrable majorant allows passage through the integral. Dominated convergence.

[F7]

AC covers Prokhorov, Fourier uniqueness and the triangular-kernel integration bridge. The Axiom of Choice.

[F8]

Weak convergence means convergence of every bounded continuous real test. Weak convergence of borel probability measures.

[F9]

An increasing exhaustion recovers the total mass. Continuity from below for measures.

[F11]

A separable completely metrizable space is Polish. Polish spaces are separable completely metrizable spaces.

[F12]

The rationals form a countable set. Q is countably infinite.

[F13]

The rationals are dense in the real line. The rationals embed densely in the reals.

Proof

technique · direct
1.1

Normalization and the pointwise limit give ψ(0)=1 and ψ1. Its real and imaginary parts are Borel as pointwise limits of continuous real functions. For a fixed δ>0, put In(δ)=wδ(1Reφn) and I(δ)=wδ(1Reψ). The integrands converge pointwise and lie between zero and 2wδ, an integrable majorant of integral two. Hence In(δ)I(δ). Given ε>0, continuity at zero permits δ>0 so small that 1ψ(t)<3ε/16 on [δ,δ]. Then I(δ)3ε/16, and for every sufficiently large n, In(δ)<3ε/8. The quantitative tail bound gives μn{x4/δ}<ε/2 for those n. No equicontinuity of the sequence has been assumed.

F1F2F6F15
2.1

For each of the finitely many earlier indices, μn([m,m])1 as m. Taking the maximum of 4/δ and finitely many radii therefore gives R with μn(R[R,R])<ε for every n. This interval is compact, so the whole sequence is tight. The argument also covers the case of no exceptional early indices. The real line is complete, and its countable dense rational subset makes it Polish. Prokhorov now provides a subsequence μnjμ, with μ a Borel probability law.

step 1.1F5F9F10F11F12F13F14
3.1

For each real t, forward continuity gives φμ(t)=limjφnj(t)=ψ(t). Uniqueness of laws with a given characteristic function shows that this μ is unique. Every subsequence of the original sequence is tight by the same compact bounds and hence has a further weakly convergent subsequence; its limit has characteristic function ψ by exactly the preceding equality and therefore equals μ.

step 2.1F3F4F5
4.1

Fix a bounded continuous real f. If fdμn failed to converge to fdμ, there would be a>0 and infinitely many indices whose errors are at least a. Enumerate them in increasing order, taking the least next index at every stage. Step 3.1 gives a further subsequence converging weakly to μ, contradicting this fixed error bound for f. Thus every such test converges and μnμ. At frequency zero all characteristic functions and ψ equal one, so a zero-mass limit is excluded. Constant sequences and point masses need no separate nondegeneracy condition. AC here is inherited from Prokhorov (compact selections and its subsequence supplier), Fourier uniqueness, and the integration bridge; the least-index test argument uses no additional choice.

step 3.1F7F8

Depends on

Used by

Dependency tree · two levels

116 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