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.

Trace powers, closed walks and independent edge moments

Statement

Let n≥1 and ℓ≥1 be integers, and let W=(Wij)1≤i,j≤n be a real symmetric random matrix: its entries are real random variables on one probability space and Wij=Wji pointwise. Write Tr⁡A=∑iAii and let ∥W∥ be the operator norm induced by the Euclidean norm on Rn (equivalently, by the standard norm on Cn). Then, pointwise,

Tr⁡W2ℓ=∑i0,…,i2ℓ−1=1n∏j=02ℓ−1Wijij+1,i2ℓ=i0,

and ∥W∥2ℓ≤Tr⁡W2ℓ≤n∥W∥2ℓ.

Suppose additionally that the family (Wab)1≤a≤b≤n is mutually independent and E∣Wab∣2ℓ<∞ for every a≤b. A closed walk here is an ordered sequence (i0,…,i2ℓ) with i2ℓ=i0; loops and repeated vertices and edges are allowed. For each unordered pair e={a,b}, including a=b, let me be the number of steps whose unordered endpoint pair is e. Then

E ⁣[∏j=02ℓ−1Wijij+1]=∏e:me>0E[Weme],

where W{a,b}=Wmin⁡(a,b),max⁡(a,b). If each We has a law symmetric about zero, meaning that We and −We have the same distribution, every factor with odd me is zero. Consequently only walks with every multiplicity even can contribute to the expected trace. Comparing these surviving terms with those of another such matrix requires, in addition, the relevant entry-moment inequalities; the walk expansion alone supplies no Gaussian comparison.

Facts & Assumptions

[F1]

Matrix multiplication gives (AB)ij=∑kAikBkj, and trace is the sum of diagonal entries (Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes, The trace tr(A) as the sum of the diagonal entries).

[F2]

A self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis). The vertex-space convention supplies the standard matrix action and Euclidean norm (Finite vertex Hilbert space in the article convention); the induced operator norm is the supremum of the output norm over the closed unit ball (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F3]

A real random variable is a measurable map into R with its Borel sigma-algebra (Random elements and real random variables). Independence is independence of the coordinate-generated sigma-algebras (Independent random elements). For independent real random variables, integrable Borel functions of the individual variables have an integrable product whose expectation is the product of their expectations (Expectations factor over finite products of independent random variables).

[F4]

Expectation of an integrable random variable is its integral over the underlying probability space (Expectation of a nonnegative or integrable random variable). The Lebesgue integral is linear on L1 of that space, so expectation is linear on integrable random variables (The Lebesgue integral is linear on L¹(μ)). Expectation of an integrable function of a random variable is also its integral against that variable's law (Change of variables for expectation).

[F5]

Similar square matrices have equal trace (Similar matrices have the same trace).

[F6]

The law of a real random variable X is PX(B)=P(X−1(B)) for Borel B⊆R; equality in distribution means equality of these laws (Law or distribution of a random element).

[F7]

Arithmetic and lattice operations preserve measurability: in particular, finite products, real scalar multiples and absolute values of measurable real functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined). Applied to the identity function on R with its Borel sigma-algebra, this gives Borel measurability of x↦xk, x↦∣x∣k for positive integers k, and x↦−x. Composition of measurable maps is measurable (Composition with a Borel measurable outer map preserves measurability).

[F8]

A measurable real function f is integrable exactly when ∫∣f∣ dμ<∞ (Integrable real and complex functions, and their integrals). For nonnegative measurable f≤g, ∫f dμ≤∫g dμ on any measure space (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F9]

A probability space has P(Ω)=1 (Probability measures and probability spaces). The simple integral of 1=χΩ is therefore 1 (The integral of a nonnegative simple function), and its nonnegative Lebesgue integral has the same value (The nonnegative integral agrees with the simple integral on simple functions).

Proof

Given: The matrix and integer hypotheses in the Statement; assume the additional independence and moment hypotheses for the expectation assertions.

Goal: Establish the displayed identities, cancellation, and norm bounds.

1.1F1giveninduction

Repeatedly applying the matrix-product formula in [F1] gives (Wk)ab=∑i1,…,ik−1Wai1Wi1i2⋯Wik−1b for k≥2. Taking k=2ℓ, setting a=b=i0, and summing the diagonal entries yields the stated closed-walk expansion. The argument is pointwise and permits loops and repeated edges.

1.2F7F8F9F4givenalgebra

For a fixed walk, symmetry of W groups its factors as ∏e:me>0Weme. Each me lies between 1 and 2ℓ. By [F7], all powers and absolute powers used here are measurable. By [F9] and [F8], the constant function 1 is integrable. The moment hypothesis and [F4], [F8] imply that ∣We∣2ℓ is integrable. Thus [F4] makes 1+∣We∣2ℓ integrable, with integral 1+E∣We∣2ℓ<∞. For 1≤m≤2ℓ, the bound ∣x∣m≤1+∣x∣2ℓ follows by considering ∣x∣≤1 and ∣x∣>1. Monotonicity in [F8] therefore gives ∫Ω∣We∣m dP≤1+E∣We∣2ℓ<∞, so [F8] proves integrability of Wem, in particular of Weme.

2.1F3F4F7step 1.2step 1.1given

Apply [F3] to the distinct independent entries and the Borel functions x↦xme from [F7] to obtain the product formula and integrability of each walk product, using step 1.2. By [F4], integrate the finite sum of these integrable walk products over the underlying probability space; repeated L1 linearity permits expectation to pass through the finite expansion in step 1.1.

3.1F6F7F4step 1.2step 2.1algebra

If We and −We have the same law in the sense of [F6] and me is odd, both are random variables by [F7], and both meth powers are integrable by step 1.2 because their absolute values agree. The change-of-variables formula in [F4] evaluates both expectations as the integral of the same Borel function x↦xme against their common law. Since (−We)me=−Weme, linearity in [F4] gives E[Weme]=E[(−We)me]=−E[Weme]. Thus that moment is zero. The product formula in step 2.1 then eliminates every walk with an odd multiplicity. For a comparison, the formula identifies precisely the moments to be compared; inequalities for those moments are additional hypotheses.

4.1F2F1F5givenalgebra∎

Fix an outcome. A real symmetric matrix is self-adjoint for the Euclidean inner product. By [F2] it has an orthonormal eigenbasis with real eigenvalues λ1,…,λn. Let Q have those eigenvectors as columns. Then Q−1=QT and Q−1W2ℓQ=diag⁡(λ12ℓ,…,λn2ℓ), since both sides act on each coordinate vector by the same scalar. Thus [F5] and [F1] give Tr⁡W2ℓ=∑rλr2ℓ in the original coordinates. For x=∑rcrvr in the orthonormal eigenbasis, ∥Wx∥22=∑r∣λr∣2∣cr∣2≤(max⁡r∣λr∣)2∥x∥22. This proves boundedness and the upper bound for the unit-ball supremum in [F2]; a unit eigenvector for a maximal absolute eigenvalue attains it. Hence the operator norm is max⁡r∣λr∣. The same calculation in the complexified basis gives the identical complex operator norm. Every summand is nonnegative and at most the largest, while one attains it. Therefore ∥W∥2ℓ≤Tr⁡W2ℓ≤n∥W∥2ℓ. The preceding steps prove all assertions.

Depends on

Used by · 4

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.