Alphabeta Math
LemmaStatement: 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.

Expected extreme eigenvalues from finite Gaussian comparison

Statement

Assume the Axiom of Choice. Fix an integer r≥1, put N=r(r+1)/2, and let Z=(Zij)1≤i≤j≤r have mutually independent standard normal coordinates on a common probability space. Set T(z)ij=T(z)ji=zij, Y=T(Z), and S={v∈Rr:∥v∥2=1}. Use the operator norm on the vertex Hilbert space C{1,…,r}. Define λ+(Y)=sup⁡v∈SvTYv and λ−(Y)=sup⁡v∈S(−vTYv). These measurable integrable random variables have the same distribution and satisfy 0≤m:=Eλ+(Y)=Eλ−(Y)≤2r. Moreover ∥Y∥=max⁡(λ+(Y),λ−(Y)).

Facts & Assumptions

[F1]

The quadratic and linear comparison processes are centered Gaussian, continuous, and have the required increment ordering. Quadratic Gaussian process and its increment metric.

[F2]

The sphere comparison applies to continuous Gaussian processes with measurable integrable suprema under Choice. From finite Gaussian comparisons to a sphere supremum, The Axiom of Choice.

[F3]

The operator norm of a real symmetric matrix is characterized by its two-sided quadratic-form order bounds in the vertex Hilbert space; real vectors satisfy Euclidean Cauchy–Schwarz and the Euclidean norm triangle inequality. Self-adjoint order, norm bounds and diagonal tests, Finite vertex Hilbert space in the article convention, Cauchy-Schwarz |⟨ x,y⟩| ≤ ‖ x‖₂‖ y‖₂ with its equality case, the triangle inequality for ‖·‖₂, the parallelogram law and polarisation.

[F4]

The triangular map satisfies ∥T(z)−T(w)∥≤2∥z−w∥2, its Gaussian matrix has measurable norm and every even norm moment, and Cauchy–Schwarz for random variables bounds a first absolute moment by the square root of the second moment. Triangular Gaussian coordinates: metric and moment control, Cauchy-Schwarz for random variables.

[F5]

Under Choice, independent normal coordinates stack to a multivariate normal vector with the specified scalar projection laws. Cramér–Wold says that all scalar projection laws determine a Borel probability law in positive finite dimension. A finite stack of independent Gaussian vectors is jointly Gaussian, Multivariate normal law, including singular covariance, Cramer wold device.

[F6]

A finite positive-dimensional real vector is Borel measurable exactly when its coordinates are measurable. Under Countable Choice, continuous maps between positive-dimensional Euclidean spaces are Borel measurable, and composition of measurable maps preserves measurability. A map into ℝⁿ is measurable exactly when its coordinates are measurable, Continuous functions on Euclidean spaces are Borel measurable, Composition with a Borel measurable outer map preserves measurability.

[F7]

A standard real Gaussian coordinate has finite absolute moments, mean zero and second moment one. Gaussian entry moments and triangular independence.

[F8]

Finite integrable sums have linear expectation, and the nonnegative integral is monotone and homogeneous. The Lebesgue integral is linear on L¹(μ), Monotonicity and nonnegative homogeneity of the nonnegative integral.

[F9]

A random element’s law assigns to each measurable target set the probability of its inverse image. Integration against that law gives the expectation of every nonnegative or integrable measurable function of the random element. Law or distribution of a random element, Change of variables for expectation.

Proof

Given: The objects and hypotheses in the Statement.

Goal: Establish all the stated estimates.

1.1F3F4algebra

For a real symmetric matrix A, [F3] applied with b=∥A∥ gives ∣vTAv∣≤∥A∥ for every real unit v. Thus the two signed suprema are finite, since S is nonempty. Put f±(z)=sup⁡v∈S(±vTT(z)v). For each v∈S, [F3] and [F4] give ∣vT(T(z)−T(w))v∣≤2∥z−w∥2. Bounding each signed quadratic value at z by its value at w plus this constant, and taking suprema, gives f±(z)≤f±(w)+2∥z−w∥2. Interchanging z,w proves ∣f±(z)−f±(w)∣≤2∥z−w∥2. In particular both functions are continuous.

1.2F1F3F4F6F7F8algebra

For the comparison vector g in [F1], Cauchy–Schwarz gives sup⁡v∈S2vTg=2∥g∥2: if g≠0 take v=g/∥g∥2, and if g=0 every value is zero. The triangle inequality in [F3] gives ∣2∥a∥2−2∥b∥2∣≤2∥a−b∥2, so [F6] makes this supremum and its square measurable as functions of the Borel vector g. By [F7], each gi2 is integrable with expectation one. Applying [F8] to the finite sum gives E(2∥g∥2)2=4∑i=1rEgi2=4r. Cauchy–Schwarz in [F4], with the constant one, now gives E(2∥g∥2)≤2r, establishing integrability of the comparison supremum.

2.1F4F6F8step 1.1algebra

Choice implies Countable Choice by restricting to countable families. The measurable Gaussian coordinates and [F6] therefore make Z a Borel random vector, f± Borel functions, and λ±(Y)=f±(Z) measurable real random variables. The absolute-value and squaring functions on R are continuous (use ∣∣s∣−∣t∣∣≤∣s−t∣ and ∣s2−t2∣=∣s−t∣∣s+t∣), so [F6] also makes their compositions measurable. By [F4], Cauchy–Schwarz applied to ∥Y∥ and the constant one gives E∥Y∥≤(E∥Y∥2)1/2<∞. Since ∣λ±(Y)∣≤∥Y∥ by step 1.1, monotonicity in [F8] proves integrability of both extreme values.

2.2F3step 1.1algebra

Fix a realization of Y and put M=max⁡(λ+(Y),λ−(Y)). For any unit v, M≥max⁡(vTYv,−vTYv)=∣vTYv∣≥0. Scaling real vectors gives ∣xTYx∣≤M∥x∥22, also when x=0. For u=x+iy, real symmetry cancels the imaginary cross terms, so u∗Yu=xTYx+yTYy and ∣u∗Yu∣≤M(∥x∥22+∥y∥22)=M∥u∥22. Thus −MI⪯Y⪯MI in [F3], which gives ∥Y∥≤M. Step 1.1 gives M≤∥Y∥, proving equality.

3.1F1F2F7F8step 2.1step 1.2algebra

Apply [F2] with its larger-increment process equal to Hv=2vTg and its smaller-increment process equal to Qv=vTYv. The common index sphere has dimension r≥1, centering, continuity and increment ordering hold by [F1], and measurable integrable suprema were verified in steps 2.1 and 1.2. Hence Eλ+(Y)≤E(2∥g∥2)≤2r. Also λ+(Y)≥e1TYe1=Y11, whose mean is zero by [F7]. Their difference is an integrable nonnegative random variable by step 2.1 and [F8], so [F8] gives Eλ+(Y)≥0.

4.1F5F6F9step 2.1step 2.2step 3.1algebra∎

By [F5], Z∼NN(0,I) and for every u∈RN the scalar uTZ has law N(0,∥u∥22). The vector −Z is Borel measurable by [F6], since negation is continuous. Its projection uT(−Z)=(−u)TZ has that same scalar law, including u=0. Since N=r(r+1)/2≥1 and Choice is assumed, Cramér–Wold in [F5] identifies the Borel laws of Z and −Z. For every Borel B⊆R, the set f+−1(B) is Borel by step 2.1; [F9] therefore gives P(f+(Z)∈B)=P(f+(−Z)∈B). Linearity of T yields f+(−z)=f−(z) pointwise. Consequently λ+(Y) and λ−(Y) have the same law. Their integrability from step 2.1 and the expectation formula in [F9], applied to the identity function on R, give equality of their expectations. Together with steps 2.2 and 3.1 this proves every assertion.

Depends on

Used by · 3

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.