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.

Cramer wold device

Statement

Assume AC. Let d1 be a finite integer and pθ(x)=θx for θRd. Borel probability laws on Rd are determined by all the laws (pθ)μ. Moreover, if (pθ)μn(pθ)μ for every θ and a specified Borel probability law μ, then μnμ. If dimension zero is admitted, interpret R0 as the singleton empty tuple; both conclusions then hold as well.

Facts & Assumptions

Given: The hypotheses and conventions in the statement.

[F1]

Characteristic functions are expectations of the complex exponential. Characteristic function of a real random variable.

[F2]

AC gives uniqueness of finite-variation Borel measures in every positive finite dimension. Uniqueness of finite Borel measures from their Fourier transforms.

[F3]

The Fourier convention in dimension d is exp(-2 pi i x dot xi). Fourier transform of a finite complex Borel measure.

[F4]

A continuous map carries weak convergence to weak convergence. Continuous mapping theorem.

[F5]

Under AC a weakly convergent sequence on a Polish space is tight. Weakly convergent sequences are tight.

[F6]

Under AC tight sequences on Polish spaces have weakly convergent subsequences. Prokhorov tightness theorem on polish spaces.

[F7]

Weak convergence is tested by bounded continuous real functions. Weak convergence of borel probability measures.

[F8]

AC covers Prokhorov and the finite-dimensional Fourier uniqueness proof. The Axiom of Choice.

[F9]

A finite union has measure at most the sum of its measures. Finite and countable subadditivity of measures.

[F11]

Separable completely metrizable spaces are Polish. Polish spaces are separable completely metrizable spaces.

[F12]

The rationals are countable. Q is countably infinite.

[F13]

Rationals approximate every real coordinate. The rationals embed densely in the reals.

[F14]

Finite products of countable sets remain countable by iteration. A product of two at most countable sets is at most countable.

[F16]

One-dimensional weak convergence yields pointwise convergence of characteristic functions. Levy continuity theorem forward direction.

Proof

technique · direct
1.1

Write Φρ(θ)=eiθxρ(dx). The map pθ is continuous: pθ(x)pθ(y)(j=1dθj)xy2. Hence its pushforward is a Borel probability, and Φρ(θ)=φ(pθ)ρ(1). In particular ρ^(ξ)=Φρ(2πξ). Positive probability measures have total variation one, since the absolute masses of any measurable partition sum to one. Thus if all projection laws of ρ and τ agree, their finite-dimensional Fourier transforms agree at every ξ; the finite-measure uniqueness theorem gives ρ=τ. The zero projection has the law of the constant zero and introduces no exception.

F1F2F3
1.2

Euclidean space is complete. The set Qd is countable by induction using the product theorem, and dense: approximate each of the finitely many coordinates of x within η/(2d) by a rational to get a vector within Euclidean distance η. Thus Rd, and in particular R, is Polish. For each coordinate vector ej, the assumed convergence and the tightness corollary give a compact real set with uniform complement mass below ε/(2d) for all projected laws. Enlarge each such bounded compact set to [Rj,Rj]. For the compact box K=j=1d[Rj,Rj], finite subadditivity yields μn(Kc)j=1dμn{xj>Rj}<ε/2<ε. This proves tightness of the original laws, not just of their projections.

F5F9F10F11F12F13F14F15
2.1

Prokhorov gives a weakly convergent further subsequence from every subsequence; write one such limit as ν. For fixed θ, continuous mapping gives convergence of its projected laws to (pθ)ν, whereas the hypothesis gives convergence to (pθ)μ. Apply the one-dimensional forward theorem to these two convergences at frequency one: the same numerical sequence has limits Φν(θ) and Φμ(θ), so they are equal. This is true for every θ. The Fourier identity and uniqueness argument of step 1.1 give ν=μ.

step 1.1step 1.2F4F6F16
3.1

If convergence failed for a bounded continuous real test f, some positive error threshold would be exceeded at infinitely many indices. List those indices increasingly using the least next one. Step 2.1 supplies a further weakly convergent subsequence with limit μ, contradicting that fixed error bound. Hence all such tests converge, which is μnμ. AC is inherited from tightness/Prokhorov and finite-dimensional Fourier uniqueness, including its countable-choice transform and smoothing prerequisites; only finitely many coordinate choices are made locally. For d=1 the argument is unchanged. For d=0 the space is one point with zero metric and its only probability is unit mass there, so equality and convergence are immediate without a maximum over an empty coordinate set. Point masses in positive dimension are also covered.

step 2.1F7F8

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

110 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