Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Finite Gaussian normalization and Wick moments

Statement

Assume the Axiom of Choice. Let N≥1 be finite, let C be a real symmetric positive-semidefinite N×N covariance matrix, and let Q∼γC=NN(0,C) be the law of Finite Euclidean quartic interacting measure. For k≥0 and vectors u1,…,uk∈RN, every product ∏j=1k(ujTQ) is integrable. For k=0 its expectation is 1. If k is odd, its expectation is 0; if k=2m, then

E ⁣[∏j=12mujTQ]=∑π∈Pair⁡(2m)∏{a,b}∈πuaTCub,

where Pair⁡(2m) is the finite set of partitions of {1,…,2m} into unordered two-element subsets. Thus every real polynomial P in Q satisfies E∣P(Q)∣<∞, and its expectation E[P(Q)] is computed by expanding P into monomials and applying finitely many covariance pairings.

Facts & Assumptions

Given: Assume the Axiom of Choice. Let N≥1, C be a real symmetric positive-semidefinite matrix, and Q∼γC.

[A1]

The Axiom of Choice is explicitly assumed; the normal-law suppliers below use it. The Axiom of Choice

[F1]

Finite Euclidean quartic interacting measure defines γC=NN(0,C) as a Borel probability law on RN. The supplied multivariate normal law exists under Choice and every linear projection uTQ has law N(0,uTCu). Multivariate normal law, including singular covariance

[F2]

The scalar standard normal has density e−x2/2/2π, and N(0,σ2) is its pushforward by x↦σx, including the point mass at zero when σ=0. Standard normal and normal laws

[F3]

For X∼NN(0,C), the characteristic function is φX(t)=e−tTCt/2 for t∈RN. Characteristic function of a multivariate normal law

[F4]

If E∣X∣k<∞, then φX(j)(t)=E[(iX)jeitX] for 0≤j≤k. Moments give derivatives of the characteristic function

[F5]

For k measurable factors in Lk, their product is integrable; this follows by iterating generalized H"older with exponents chosen so the reciprocal exponents sum to one. Generalized Holder inequality puts products into Lr

[F6]

∫Re−x2 dx=π and a positive scalar substitution gives the corresponding finite Gaussian integral with any positive quadratic scale. The Gaussian integral ∫−∞∞e−x2 dx=π, Change of variable in an improper integral

[F7]

For x≥0 and every integer r≥0, ex≥xr/r! by the nonnegative terms in the defining power series. The real exponential function and the number e by a power series

Proof

technique · direct, via scalar Gaussian moments and polarization
1.1F2F6F7F8algebra

Let Z∼N(0,1). For an integer k≥0, choose an integer r with 2r≥k. On ∣x∣≥1, [F7] gives ex2/4≥(x2/4)r/r!, so ∣x∣ke−x2/2≤4rr!e−x2/4. The right side is integrable by [F6], and the integrand is bounded on [−1,1]. Since [F2] represents any scalar N(0,v) as vZ with v supplied by [F8], every scalar normal has finite absolute moments of every integer order, including the degenerate v=0 case.

2.1A1F1F5step 1.1algebra

For fixed k≥1, define Tk(u1,…,uk):=E∏j=1k(ujTQ). Each projection has a finite kth absolute moment by step 1.1 and [F1]. Applying [F5] successively shows the product is integrable. Linearity of each scalar projection and of the integral makes Tk a symmetric k-linear form. The law exists under the stated Choice hypothesis [A1]. Since every polynomial is a finite linear combination of coordinate monomials, the triangle inequality also gives every polynomial a finite absolute moment.

3.1F1F3F4F7step 1.1step 2.1algebra

On the diagonal, Tk(u,…,u)=E[(uTQ)k]. Put v=uTCu≥0. By [F1], uTQ∼N(0,v), so [F3] gives its characteristic function e−vt2/2. At zero, [F4] gives φ(k)(0)=ikE[(uTQ)k]; extracting the tk coefficient of e−vt2/2 and dividing by ik yields zero for odd k, and for k=2m gives T2m(u,…,u)=(2m)!2mm!vm=(2m−1)!! (uTCu)m. The identity also holds for v=0, when the projected law is the point mass at zero.

4.1step 2.1step 3.1constructalgebra

For even k=2m, define W2m(u1,…,u2m) by the pairing sum in the Statement; for odd k, define Wk=0. This is a symmetric k-linear form. On the diagonal, every pairing contributes (uTCu)m, and there are (2m−1)!! pairings: pair index 1 with one of 2m−1 indices and repeat on the remaining 2m−2. Hence Wk(u,…,u)=Tk(u,…,u) by step 3.1, also for odd k.

5.1step 2.1step 4.1givenalgebra∎

For k≥1, two symmetric k-linear forms agreeing on every diagonal agree everywhere. Indeed, for their difference A, expand ∑ε∈{−1,1}k(∏j=1kεj)A ⁣(∑iεiui,…,∑iεiui). In the multilinear expansion, the sum over signs cancels every term unless each label 1,…,k occurs an odd number of times among the k slots. Thus every surviving term uses each label once; symmetry makes all k! such terms equal to A(u1,…,uk), and the sign sum is 2kk!A(u1,…,uk). Since the diagonal of A=Tk−Wk vanishes by step 4.1, this sum is zero and Tk=Wk. For k=0, the empty product has expectation one and Pair⁡(0) contains just the empty pairing, whose empty product is one, so the formula also holds.

Depends on

Dependency tree · 2 levels

Sources