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 , let be -valued random vectors with laws , let be a Borel probability on with all mixed moments finite, and suppose:
(i) for every multi-index , evaluated at converges to ;
(ii) is determined among Borel probabilities with finite moments by its mixed moments.
Then weakly. In particular every multivariate Gaussian law is moment-determinate: a Borel probability with the same mixed moments as equals it.
Facts & Assumptions
Given: AC; a positive integer ; -valued random vectors , , with laws ; a Borel probability on with for every multi-index , which satisfies (i) and (ii) of the Statement. For a multi-index write and .
means for every bounded continuous real ; a family is tight when one compact set captures mass 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).
If and then (Markov's inequality for random variables).
If on a Polish , there are random elements on a common probability space with laws and converging almost surely (Skorokhod representation on polish spaces).
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 in measure with uniformly integrable then in , so 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 is uniformly integrable according to that definition, because .
If then (Cauchy-Schwarz for random variables).
For a multivariate normal and , the projection is normal with mean and variance , its characteristic function is , and two Borel probabilities on 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).
If then for , so for every (Gaussian even moments for Brownian increments; for odd use and the even bound at ).
If has all moments and for all with , then (The standard Gaussian law is determined by its moments).
Multinomial expansion: , with , for all real (The multinomial coefficient equals , and in ).
Euclidean is complete ( and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in ) and separable: the rational coordinates have an enumeration ( is countably infinite), and their -tuples can be enumerated by listing for each integer the finitely many tuples of enumeration indices at most . These vectors are dense: choose each rational coordinate within 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 : 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, and finite probability union bounds are supplied by Basic identities for a probability measure.
Expectations of integrable variables are linear, monotone for real variables, and satisfy (Linearity, monotonicity, and the modulus bound for expectation).
Proof
Gaussian projections: let , , and . By [F6] the projection is normal with mean and variance , and by [F7] the standard normal has moments of every order; hence for every , and by [F9] and linearity of expectation, , a finite sum of finite mixed moments. Indeed each coordinate has all absolute moments by [F7]; for a multi-index of total degree , , proving mixed absolute integrability. The degree-zero product is .
Tightness of the sequence: for each coordinate , hypothesis (i) applied to the multi-index with a single in place of gives , so . Fix and choose with ; the cube is compact by [F10] and is contained in the union of the coordinate slabs , so by [F2] and the union bound of [F10], for every . Hence is tight.
Matching of projection moments: let be a Borel probability on with the same mixed moments as , i.e. for every multi-index , and let . Then for every and every the multinomial expansion [F9] gives by step 1.1; moreover , so [F5] gives . Thus all moments of the projection are finite and equal those of .
Extraction along any subsequence: let be an arbitrary subsequence of . By step 1.2 the subfamily is tight as well, so by [F1], applicable to the Polish space verified in [F10], it has a further subsequence converging weakly to some Borel probability on ; by [F3] there are random elements on a common probability space with laws and almost surely.
Projections determine the Gaussian: keep the notation of steps 1.1 and 2.1 with and fix . If then, by step 2.1 with , and , so and almost surely: by [F2], for every integer , and their countable union is the event , of probability zero by [F10]. This is the law of . If , put ; by step 2.1 its moments satisfy for , because by [F6]; and by step 2.1. [F8] therefore gives , so , again the law of .
Uniform integrability along the coupling: fix a multi-index and let , so almost surely by step 2.2. By hypothesis (i) applied to the multi-index , , so ; hence tends to uniformly in as , and the family is uniformly integrable by [F4].
Gaussian determinacy: if has the same mixed moments as , then by step 3.1 every projection of has the law of the projection ; by the Cramér-Wold clause of [F6] the laws of and coincide, so .
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 and shows the limit is finite. The left-hand side equals , which tends to by hypothesis (i); hence for every multi-index , has finite mixed moments, and hypothesis (ii) gives .
Convergence of the full sequence: let be an arbitrary subsequence of . Steps 2.2, 3.2 and 4.2 applied to it produce a further subsequence converging weakly to . Hence : otherwise there are a bounded continuous real function on , a real and a subsequence with for all (Weak convergence of borel probability measures), yet that subsequence has a further subsequence converging weakly to , along which , a contradiction.
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
- Weak convergence of borel probability measures
- Tight family of probability measures
- Prokhorov tightness theorem on polish spaces
- Tightness extracts a weakly convergent subsequence
- Markov's inequality for random variables
- Skorokhod representation on polish spaces
- On a finite measure space, almost-everywhere convergence implies convergence in measure
- Vitali convergence theorem on finite and sigma-finite measure spaces
- A uniformly integrable family
- Cauchy-Schwarz for random variables
- Multivariate normal law, including singular covariance
- Characteristic function of a multivariate normal law
- Cramer wold device
- The multinomial coefficient equals $n!/\prod_{i<m} k_i!$, and $(x_0+\dots+x_{m-1})^{n} = \sum \iota\!\binom{n}{k}\prod_{i<m} x_i^{k_i}$ in $\mathbb{R}$
- Gaussian even moments for Brownian increments
- The standard Gaussian law is determined by its moments
- The Axiom of Choice
- $\mathbb{R}$ and $\mathbb{R}^n$ for $n \ge 1$ with the Euclidean metric are complete, componentwise from the Cauchy criterion in $\mathbb{R}$
- 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
- Polish spaces are separable completely metrizable spaces
- Basic identities for a probability measure
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- Linearity, monotonicity, and the modulus bound for expectation
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
- Vladimir Ivanov and Grigori Olshanski, Kerov's central limit theorem for the Plancherel measure on Young diagrams, arXiv:math/0304010; survey-paper version in Symmetric Functions 2001, NATO Science Series II 74 (2002), 93-151 (standard reference, not scraped)
- Dan Romik, The Surprising Mathematics of Longest Increasing Subsequences, Cambridge University Press 2015; author-hosted manuscript of 20 August 2014 (363 pp.) (standard reference, not scraped)