Alphabeta Math
PropositionStatement: AI-generatedProof: AI-generated
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.

Gaussian entry moments and triangular independence

Statement

Assume the Axiom of Choice, as in the adopted normal-law construction. Let Z have standard real Gaussian law N(0,1), with density ϕ(x)=(2π)−1/2e−x2/2. Its moments exist absolutely, EZ0=1, EZ2j+1=0 for j≥0, and EZ2j=(2j−1)!! for j≥1, where (2j−1)!!=1⋅3⋯(2j−1). In particular every positive even moment is at least 1.

Let n≥0 be an integer and put I={1,…,n}, with I=∅ when n=0. On a common probability space take mutually independent standard Gaussian variables Gij for 1≤i≤j≤n and set Gji=Gij for i<j. The real random matrix G is interpreted pointwise: for each outcome ω, its realization is the function G(ω):I×I→R with entries Gij(ω). Its realizations are finite square symmetric matrices. Thus the independent coordinates are those in the chosen triangular half; the two mirrored entries are the same nonconstant variable and are not independent. For any finite list of matrix entries, let mij be the number of occurrences of the unordered pair {i,j}. The expectation of their product is ∏i≤jEZmij, with unused coordinates contributing 1 and empty products equal to 1. In particular, the actual multiplicity of each unordered pair must be retained in a trace-moment calculation.

Facts & Assumptions

[F1]

A real random variable is a measurable map from a probability space to R with its Borel sigma-algebra (Random elements and real random variables). Under Choice, N(0,1) is the probability law with density ϕ above; its total mass is one (The Axiom of Choice, Standard normal and normal laws).

[F2]

Expectation is integration against the probability measure; change of variables to a random variable's law and integration against a density give the corresponding density integrals for nonnegative functions and, by positive and negative parts, for integrable functions (Expectation of a nonnegative or integrable random variable, Change of variables for expectation, Integrating against a density agrees with integrating the product).

[F4]

Exponential decay dominates every fixed polynomial; the exponential is increasing and obeys its addition law. A geometric series with ratio strictly between zero and one converges (The exponential dominates every fixed nonnegative integer power at +∞, The exponential function is strictly increasing, The exponential addition formula exp(x+y)=exp(x)exp(y), For |r| < 1, ∑_k ≥ 0 rᵏ = 1/(1-r), and for |r| ≥ 1 the series diverges).

[F5]

Monotone convergence applies to nonnegative integrands, and a bounded Riemann-integrable function on a compact interval has the same Lebesgue integral there; the countable-choice hypothesis of the latter supplier follows from the assumed Axiom of Choice (Monotone convergence for the integral, A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral).

[F6]

Independence means independence of the coordinate-generated sigma-algebras. For a finite independent family, integrable Borel functions of the individual coordinates have an integrable product whose expectation factors (Independent random elements, Expectations factor over finite products of independent random variables).

[F7]

A finite matrix over R is a function on a finite rectangular index set; relabeling the supplier's indices 0,…,n−1 as 1,…,n gives the pointwise matrix convention in the Statement. For the empty index set there is exactly one such function (Finite rectangular matrices over a commutative ring, their entries, rows and columns).

[F8]

A property of natural numbers holds for every natural number if it holds at zero and passes from each natural number to its successor (The principle of mathematical induction).

[F9]

Polynomial functions and their absolute values are continuous, as are sums, scalar multiples, products and compositions of continuous real functions. Continuous real functions on R are Borel measurable, under countable choice, which follows from the assumed Axiom of Choice. On a compact interval a continuous real function is bounded and Riemann integrable (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, A composite of continuous functions is continuous, with no side hypothesis of the kind the composition of limits needs, Continuous functions on Euclidean spaces are Borel measurable, A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion).

[F10]

If ψ:[c,d]→[a,b] is a monotone surjection, differentiable with one-sided derivatives at the endpoints and with Riemann-integrable derivative, then for every bounded Riemann-integrable f:[a,b]→R, ∫abf(x) dx=∫cdf(ψ(t))∣ψ′(t)∣ dt (Monotone change of variable for Riemann-integrable functions).

Proof

Given: Choice, a standard Gaussian Z, and a finite symmetric matrix constructed from independent triangular standard Gaussian entries as in the statement.

Goal: Prove the moment formulas, absolute integrability, and the multiplicity-preserving factorization.

1.1F2F3F4F5F9

Fix an integer k≥0. By [F4], tke−t/2 is bounded for t≥1. Since t2≥2t for t≥2, tke−t2/2≤(tke−t/2)e−t/2≤Cke−t/2 there for some finite Ck. The same bound holds with t=∣x∣. On each interval [n,n+1], n≥2, monotonicity and the addition law bound e−x/2 by e−n/2; the resulting geometric series converges. The integrand is continuous, hence bounded and Riemann integrable on every compact interval, including [−2,2], by [F3] and [F9]. Applying [F5] to the successive compact intervals shows that ∫R∣x∣kϕ(x) dx<∞. The nonnegative case of [F2] therefore makes Zk integrable. The same tail estimate also gives Rkϕ(R)→0 as R→∞.

2.1F1F2F3F5F9F10step 1.1

Put Ik=∫Rxkϕ(x) dx. By [F2] and step 1.1, Ik=EZk. For odd k and R>0, f(x)=xkϕ(x) is continuous, hence bounded and Riemann integrable on [−R,0], by [F3] and [F9]. The reflection r:[0,R]→[−R,0], r(t)=−t, is a decreasing surjection. Its difference quotient is −1, including in the one-sided endpoint limits, so its derivative is the Riemann-integrable constant −1 and ∣r′(t)∣=1. Applying [F10] and using ϕ(−t)=ϕ(t) gives ∫−R0xkϕ(x) dx=∫0R(−t)kϕ(−t) dt=−∫0Rtkϕ(t) dt. Thus the two half-interval integrals cancel. By [F5] the compact-interval Riemann and Lebesgue integrals agree; monotone convergence for the positive and negative parts, together with absolute integrability from step 1.1, gives Ik=0. Also I0=1 by [F1].

3.1F3F5F8F9step 1.1step 2.1

For k≥2 and R>0, the polynomial rule in [F3] gives h′(x)=−x for h(x)=−x2/2 and u′(x)=(k−1)xk−2 for u(x)=xk−1. The chain and scalar-multiple rules in [F3], on the full real inner and outer domains, give ϕ′(x)=−xϕ(x). Thus v(x)=−ϕ(x) has v′(x)=xϕ(x). These derivatives are continuous by [F3] and [F9], so [F3] applies on [−R,R]. This gives ∫−RRxkϕ(x) dx=[−xk−1ϕ(x)]−RR+(k−1)∫−RRxk−2ϕ(x) dx. Both boundary terms vanish as R→∞ by step 1.1. The compact-interval integrals equal their Lebesgue counterparts by [F5], and absolute integrability permits passage to the whole line, separately for positive and negative parts. Hence Ik=(k−1)Ik−2. The base case is I2=I0=1. For j≥1, the recurrence gives I2j+2=(2j+1)I2j, so [F8], applied to the property at j=m+1 for m≥0, gives I2j=(2j−1)!! for every j≥1. Each factor is a positive integer, so this moment is at least 1.

4.1F6F7F9step 1.1step 2.1step 3.1algebra∎

Using the pointwise finite matrix convention [F7], group a finite product of entries by its unordered index pairs. The result is ∏i≤jGijmij. Each power is integrable by step 1.1. The functions x↦xmij are continuous polynomials, hence Borel measurable by [F9]; applying [F6] to them gives the stated factorization, including exponent zero. If n=0, the only list of entries is empty and the identity reads E1=1; an empty list for any n gives the same identity. For i<j, Gij=Gji and this variable has mean zero and second moment one by steps 2.1 and 3.1. If the two copies were independent, [F6] would give their product expectation as zero, contradicting the second moment. This proves the statement.

Depends on

Used by · 6

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.