Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-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 multivariate method of moments for a determinate limit

Statement

Assume AC. Let d≥1, let Xn be Rd-valued random vectors with laws μn, let μ be a Borel probability on Rd with all mixed moments finite, and suppose:

(i) for every multi-index α, E[∏ixiαi] evaluated at Xn converges to ∫∏ixiαi dμ;

(ii) μ is determined among Borel probabilities with finite moments by its mixed moments.

Then μn⇒μ weakly. In particular every multivariate Gaussian law Nd(m,Σ) is moment-determinate: a Borel probability with the same mixed moments as Nd(m,Σ) equals it.

Facts & Assumptions

Given: AC; a positive integer d; Rd-valued random vectors Xn, n≥1, with laws μn; a Borel probability μ on Rd with ∫∏i∣xi∣αi dμ<∞ for every multi-index α∈Nd, which satisfies (i) and (ii) of the Statement. For a multi-index α write ∣α∣=α1+⋯+αd and wα=∏iwiαi.

[F1]

μn⇒μ means ∫f dμn→∫f dμ for every bounded continuous real f; a family is tight when one compact set captures mass 1−ε from every member; a tight sequence of Borel probabilities on a Polish space has a weakly convergent subsequence, and a Polish space is a complete separable metric space (Weak convergence of borel probability measures, Tight family of probability measures, Prokhorov tightness theorem on polish spaces, Tightness extracts a weakly convergent subsequence).

[F2]

If Y≥0 and a>0 then P(Y≥a)≤E[Y]/a (Markov's inequality for random variables).

[F3]

If μk⇒μ on a Polish S, there are random elements on a common probability space with laws μk,μ and converging almost surely (Skorokhod representation on polish spaces).

[F4]

On a finite measure space, almost sure convergence implies convergence in measure (On a finite measure space, almost-everywhere convergence implies convergence in measure), and if fk→f in measure with {fk} uniformly integrable then fk→f in L1, so f is integrable and the expectations converge (Vitali convergence theorem on finite and sigma-finite measure spaces, A uniformly integrable family); moreover a family bounded in L2 is uniformly integrable according to that definition, because ∫{∣f∣>M}∣f∣≤M−1sup⁡kEfk2.

[F5]

If X,Y∈L2 then E∣XY∣≤(EX2)1/2(EY2)1/2 (Cauchy-Schwarz for random variables).

[F6]

For a multivariate normal Y∼Nd(m,Σ) and u∈Rd, the projection u⋅Y is normal with mean u⋅m and variance uTΣu, its characteristic function is exp⁡(i t u⋅m−12t2uTΣu), and two Borel probabilities on Rd whose one-dimensional projections all have the same laws are equal (Multivariate normal law, including singular covariance, Characteristic function of a multivariate normal law, Cramer wold device).

[F7]

If Z∼N(0,1) then E[Z2k]=(2k−1)!!<∞ for k≥1, so E∣Z∣k<∞ for every k (Gaussian even moments for Brownian increments; for odd k use ∣Z∣k≤1+Zk+1 and the even bound at k+1).

[F8]

If Y has all moments and E[Yk]=E[Zk] for all k with Z∼N(0,1), then Y∼N(0,1) (The standard Gaussian law is determined by its moments).

[F9]

Multinomial expansion: (∑i=1dui) ⁣k=∑∣α∣=k(kα)uα, with (kα)=k!α!, for all real ui (The multinomial coefficient equals n!/∏i<mki!, and (x0+⋯+xm−1)n=∑ι ⁣(nk)∏i<mxiki in R).

[F10]

Euclidean Rd is complete (R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R) and separable: the rational coordinates have an enumeration (Q is countably infinite), and their d-tuples can be enumerated by listing for each integer M the finitely many tuples of enumeration indices at most M. These vectors are dense: choose each rational coordinate within ε/d of the given coordinate using The rationals embed densely in the reals, giving Euclidean distance less than ε. Hence it is Polish (Polish spaces are separable completely metrizable spaces). Closed cubes are compact by Heine-Borel in Rn: with the Euclidean metric a subset of Rn 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, and finite probability union bounds are supplied by Basic identities for a probability measure.

[F11]

Expectations of integrable variables are linear, monotone for real variables, and satisfy ∣EU∣≤E∣U∣ (Linearity, monotonicity, and the modulus bound for expectation).

Proof

technique · direct
1.1givenF6F7F9algebraF11

Gaussian projections: let Y∼Nd(m,Σ), u∈Rd, c:=u⋅m and s:=uTΣu≥0. By [F6] the projection u⋅Y is normal with mean c and variance s, and by [F7] the standard normal has moments of every order; hence E∣u⋅Y∣k<∞ for every k, and by [F9] and linearity of expectation, E[(u⋅Y)k]=∑∣α∣=k(kα)uαE[Yα], a finite sum of finite mixed moments. Indeed each coordinate has all absolute moments by [F7]; for a multi-index of total degree q>0, ∏i∣Yi∣αi≤max⁡i∣Yi∣q≤∑i∣Yi∣q, proving mixed absolute integrability. The degree-zero product is 1.

1.2givenF2F10algebra

Tightness of the sequence: for each coordinate i, hypothesis (i) applied to the multi-index with a single 2 in place of i gives E[Xn,i2]→∫xi2 dμ, so C:=max⁡isup⁡nE[Xn,i2]<∞. Fix ε>0 and choose R>0 with dC/R2<ε; the cube K:=[−R,R]d is compact by [F10] and Rd∖K is contained in the union of the d coordinate slabs {∣xi∣>R}, so by [F2] and the union bound of [F10], μn(Rd∖K)≤∑i=1dμn({∣xi∣>R})≤∑i=1dE[Xn,i2]/R2≤dC/R2<ε for every n. Hence {μn} is tight.

2.1givenF5F9step 1.1algebraF11

Matching of projection moments: let ν be a Borel probability on Rd with the same mixed moments as Y, i.e. ∫wα dν=E[Yα] for every multi-index α, and let W∼ν. Then for every u∈Rd and every k≥0 the multinomial expansion [F9] gives E[(u⋅W)k]=∑∣α∣=k(kα)uα∫wα dν=∑∣α∣=k(kα)uαE[Yα]=E[(u⋅Y)k] by step 1.1; moreover E[(u⋅W)2k]=E[(u⋅Y)2k]<∞, so [F5] gives E∣u⋅W∣k≤(E[(u⋅W)2k])1/2<∞. Thus all moments of the projection u⋅W are finite and equal those of u⋅Y.

2.2givenF1F3F10step 1.2

Extraction along any subsequence: let (μnk) be an arbitrary subsequence of (μn). By step 1.2 the subfamily {μnk} is tight as well, so by [F1], applicable to the Polish space verified in [F10], it has a further subsequence μnkj converging weakly to some Borel probability μ′′ on Rd; by [F3] there are random elements Yj,Y on a common probability space with laws μnkj,μ′′ and Yj→Y almost surely.

3.1givenF6F8step 1.1step 2.1algebraF11F2F10

Projections determine the Gaussian: keep the notation of steps 1.1 and 2.1 with W∼ν and fix u∈Rd. If s=0 then, by step 2.1 with k=1,2, E[u⋅W]=c and E[(u⋅W)2]=E[(u⋅Y)2]=s+c2=c2, so Var⁡(u⋅W)=E[(u⋅W−c)2]=0 and u⋅W=c almost surely: by [F2], P(∣u⋅W−c∣>1/l)=0 for every integer l≥1, and their countable union is the event u⋅W≠c, of probability zero by [F10]. This is the law of u⋅Y. If s>0, put Z′:=(u⋅W−c)/s; by step 2.1 its moments satisfy E[(Z′)k]=s−k/2∑j=0k(kj)(−c)k−jE[(u⋅W)j]=s−k/2∑j=0k(kj)(−c)k−jE[(u⋅Y)j]=E[ζk] for ζ∼N(0,1), because (u⋅Y−c)/s∼N(0,1) by [F6]; and E∣Z′∣k<∞ by step 2.1. [F8] therefore gives Z′∼N(0,1), so u⋅W∼N(c,s), again the law of u⋅Y.

3.2givenF4step 2.2algebra

Uniform integrability along the coupling: fix a multi-index α and let fj:=∏iYj,iαi, so fj→∏iYiαi almost surely by step 2.2. By hypothesis (i) applied to the multi-index 2α, E[fj2]=E[∏iXnkj,i2αi]→∫∏ixi2αi dμ, so sup⁡jEfj2<∞; hence ∫{∣fj∣>M}∣fj∣≤M−1sup⁡jEfj2 tends to 0 uniformly in j as M→∞, and the family {fj} is uniformly integrable by [F4].

4.1givenF6step 3.1

Gaussian determinacy: if ν has the same mixed moments as Y∼Nd(m,Σ), then by step 3.1 every projection u⋅W of W∼ν has the law of the projection u⋅Y; by the Cramér-Wold clause of [F6] the laws of W and Y coincide, so ν=Nd(m,Σ).

4.2givenstep 2.2step 3.2algebra

Identification of the limit: with the notation of step 3.2, almost sure convergence implies convergence in measure on the finite measure space by [F4]; together with the uniform integrability of step 3.2, Vitali's theorem [F4] gives E[∏iYj,iαi]→E[∏iYiαi] and shows the limit is finite. The left-hand side equals E[∏iXnkj,iαi], which tends to ∫∏ixiαi dμ by hypothesis (i); hence ∫wα dμ′′=∫wα dμ for every multi-index α, μ′′ has finite mixed moments, and hypothesis (ii) gives μ′′=μ.

5.1givenF1step 4.2algebra

Convergence of the full sequence: let (μnk) be an arbitrary subsequence of (μn). Steps 2.2, 3.2 and 4.2 applied to it produce a further subsequence converging weakly to μ. Hence μn⇒μ: otherwise there are a bounded continuous real function f on Rd, a real ε>0 and a subsequence with ∣∫f dμnk−∫f dμ∣≥ε for all k (Weak convergence of borel probability measures), yet that subsequence has a further subsequence converging weakly to μ, along which ∫f dμnkj→∫f dμ, a contradiction.

6.1givenstep 4.1step 5.1∎

Conclusion: step 5.1 proves the convergence assertion from hypotheses (i) and (ii), and steps 1.1, 2.1, 3.1 and 4.1 prove that every multivariate Gaussian law is moment-determinate. AC was used exactly through the Polish-space existence theorems of [F1], [F3] and the determinacy lemma [F8].

Depends on

Used by

Dependency tree · two levels

173 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