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 have standard real Gaussian law , with density . Its moments exist absolutely, , for , and for , where . In particular every positive even moment is at least .
Let be an integer and put , with when . On a common probability space take mutually independent standard Gaussian variables for and set for . The real random matrix is interpreted pointwise: for each outcome , its realization is the function with entries . 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 be the number of occurrences of the unordered pair . The expectation of their product is , with unused coordinates contributing and empty products equal to . In particular, the actual multiplicity of each unordered pair must be retained in a trace-moment calculation.
Facts & Assumptions
A real random variable is a measurable map from a probability space to with its Borel sigma-algebra (Random elements and real random variables). Under Choice, is the probability law with density above; its total mass is one (The Axiom of Choice, Standard normal and normal laws).
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).
Finite-interval integration by parts applies to continuously differentiable functions. The derivative of is . The power rule and termwise differentiation of polynomials, the algebra of derivatives, and the chain rule apply on ; all real points of the inner and outer domains are limit points (If u,v are differentiable on [a,b] with u',v' integrable, then ∫ₐᵇ u v' = u(b)v(b)-u(a)v(a) - ∫ₐᵇ u'v, The exponential function is smooth and (exp)'=exp, For a natural n ≥ 1 the function x ↦ xⁿ is differentiable everywhere with derivative ι(n) x^ n-1; for n = 0 it is the constant 1, with derivative 0; for a natural n ≥ 1 the function x ↦ x⁻ⁿ is differentiable at every x ≠ 0 with derivative -ι(n) x⁻ⁿ⁻¹; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, Sums, scalar multiples, products and quotients: (f+g)'(c) = f'(c) + g'(c), (α f)'(c) = α f'(c), (fg)'(c) = f'(c)g(c) + f(c)g'(c), and (f/g)'(c) = (f'(c)g(c) - f(c)g'(c))/g(c)² when g(c) ≠ 0, The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f ∘ g is differentiable at c with (f ∘ g)'(c) = f'(g(c)) g'(c)).
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).
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).
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).
A finite matrix over is a function on a finite rectangular index set; relabeling the supplier's indices as 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).
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).
Polynomial functions and their absolute values are continuous, as are sums, scalar multiples, products and compositions of continuous real functions. Continuous real functions on 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).
If is a monotone surjection, differentiable with one-sided derivatives at the endpoints and with Riemann-integrable derivative, then for every bounded Riemann-integrable , (Monotone change of variable for Riemann-integrable functions).
Proof
Given: Choice, a standard Gaussian , 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.
Fix an integer . By [F4], is bounded for . Since for , there for some finite . The same bound holds with . On each interval , , monotonicity and the addition law bound by ; the resulting geometric series converges. The integrand is continuous, hence bounded and Riemann integrable on every compact interval, including , by [F3] and [F9]. Applying [F5] to the successive compact intervals shows that . The nonnegative case of [F2] therefore makes integrable. The same tail estimate also gives as .
Put . By [F2] and step 1.1, . For odd and , is continuous, hence bounded and Riemann integrable on , by [F3] and [F9]. The reflection , , is a decreasing surjection. Its difference quotient is , including in the one-sided endpoint limits, so its derivative is the Riemann-integrable constant and . Applying [F10] and using gives . 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 . Also by [F1].
For and , the polynomial rule in [F3] gives for and for . The chain and scalar-multiple rules in [F3], on the full real inner and outer domains, give . Thus has . These derivatives are continuous by [F3] and [F9], so [F3] applies on . This gives . Both boundary terms vanish as 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 . The base case is . For , the recurrence gives , so [F8], applied to the property at for , gives for every . Each factor is a positive integer, so this moment is at least .
Using the pointwise finite matrix convention [F7], group a finite product of entries by its unordered index pairs. The result is . Each power is integrable by step 1.1. The functions are continuous polynomials, hence Borel measurable by [F9]; applying [F6] to them gives the stated factorization, including exponent zero. If , the only list of entries is empty and the identity reads ; an empty list for any gives the same identity. For , 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
- Standard normal and normal laws
- Independent random elements
- The Axiom of Choice
- Expectation of a nonnegative or integrable random variable
- Change of variables for expectation
- Integrating against a density agrees with integrating the product
- If u,v are differentiable on [a,b] with u',v' integrable, then ∫ₐᵇ u v' = u(b)v(b)-u(a)v(a) - ∫ₐᵇ u'v
- The exponential function is smooth and (exp)'=exp
- 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
- Monotone convergence for the integral
- A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral
- Expectations factor over finite products of independent random variables
- Finite rectangular matrices over a commutative ring, their entries, rows and columns
- The principle of mathematical induction
- The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f ∘ g is differentiable at c with (f ∘ g)'(c) = f'(g(c)) g'(c)
- For a natural n ≥ 1 the function x ↦ xⁿ is differentiable everywhere with derivative ι(n) x^ n-1; for n = 0 it is the constant 1, with derivative 0; for a natural n ≥ 1 the function x ↦ x⁻ⁿ is differentiable at every x ≠ 0 with derivative -ι(n) x⁻ⁿ⁻¹; consequently every polynomial function is differentiable at every real, with the derivative computed term by term
- Sums, scalar multiples, products and quotients: (f+g)'(c) = f'(c) + g'(c), (α f)'(c) = α f'(c), (fg)'(c) = f'(c)g(c) + f(c)g'(c), and (f/g)'(c) = (f'(c)g(c) - f(c)g'(c))/g(c)² when g(c) ≠ 0
- 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
- Random elements and real random variables
- Monotone change of variable for Riemann-integrable functions
Used by · 6
- An independent symmetric-Gaussian norm moment input
- Gaussian comparison matrix in the moment argument
- Trace-moment comparison with Gaussian matrices
- Triangular Gaussian coordinates: metric and moment control
- Quadratic Gaussian process and its increment metric
- Expected extreme eigenvalues from finite Gaussian comparison
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.