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.

Extreme-value Lipschitz bounds and centered norm reduction

Statement

Assume the Axiom of Choice. For a real symmetric r×r matrix A, r≥1, define λ+(A)=sup⁡∥v∥2=1vTAv and λ−(A)=sup⁡∥v∥2=1(−vTAv) over real vectors. Use the operator norm on C{1,…,r} with its Euclidean norm. Put N=r(r+1)/2 and define T:RN→Rr×r by T(z)ij=T(z)ji=zij for 1≤i≤j≤r. Both functions z↦λ±(T(z)) are 2-Lipschitz, meaning that their absolute difference at z,w is at most 2∥z−w∥2.

Let Z=(Zij)i≤j have mutually independent standard normal coordinates on a common probability space (Ω,F,P), and put Y=T(Z). Set m=Eλ+(Y)=Eλ−(Y) and W=max⁡(∣λ+(Y)−m∣,∣λ−(Y)−m∣). Then m is finite and nonnegative, 0≤∥Y∥≤m+W, and W has every finite positive even moment.

Facts & Assumptions

[A1]

The Axiom of Choice is assumed, as required by both Gaussian suppliers in [F1] and [F2]. The Axiom of Choice.

[F1]

Under Choice, the triangular map satisfies ∥T(z)−T(w)∥≤2∥z−w∥2, and ∥Y∥ is measurable with E∥Y∥2k<∞ for every integer k≥1. Triangular Gaussian coordinates: metric and moment control.

[F2]

Under Choice, λ±(Y) are measurable integrable real random variables, their expectations have the common finite value m≥0, and ∥Y∥=max⁡(λ+(Y),λ−(Y)). Expected extreme eigenvalues from finite Gaussian comparison.

[F3]

Euclidean Cauchy–Schwarz gives ∣vTBv∣≤∥v∥2∥Bv∥2 for real v,B. The operator norm bounds ∥Bu∥2≤∥B∥∥u∥2, including real vectors viewed in the complex space. Cauchy-Schwarz |⟨ x,y⟩| ≤ ‖ x‖₂‖ y‖₂ with its equality case, the triangle inequality for ‖·‖₂, the parallelogram law and polarisation, The operator norm as the least bound and as the unit-sphere or unit-ball supremum.

[F4]

Finite sums, real scalar multiples and absolute values of measurable real-valued functions are measurable. Closure properties of measurable functions used by the integral.

[F5]

If h is a nonnegative finite-valued measurable function and q>0, then hq is measurable. Positive real powers preserve measurability.

[F6]

The nonnegative integral is monotone, homogeneous for positive scalars, and additive for two nonnegative measurable functions, even before their finiteness is known. Monotonicity and nonnegative homogeneity of the nonnegative integral, Additivity of the nonnegative Lebesgue integral.

[F7]

A probability measure satisfies P(Ω)=1. A constant c≥0 is the simple measurable function cχΩ; its simple integral is cP(Ω), and its nonnegative Lebesgue integral agrees with that simple integral. Probability measures and probability spaces, The integral of a nonnegative simple function, The nonnegative integral agrees with the simple integral on simple functions.

[F8]

Independence of the real coordinates means independence of their generated sigma-algebras. A standard real Gaussian scalar has Lebesgue density (2π)−1/2e−x2/2. The Countable Choice hypothesis of the Gaussian-law definition follows from [A1] by restriction to countable families. Independent random elements, Standard real and normalized complex Gaussian matrix laws, The Axiom of Choice.

[F9]

For a nonnegative measurable random variable X, EX=∫ΩX dP, with an extended value allowed; for an integrable real random variable the same integral is its finite expectation and mean. For p>0, its pth absolute moment is E∣X∣p when ∣X∣p is integrable. Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space.

Proof

Given: The objects and hypotheses in the Statement.

Goal: Establish all the stated estimates.

1.1A1F1F3algebra

For every real unit v and real symmetric B, [F3] gives ∣vTBv∣≤∥B∥. Thus the two signed suprema defining λ±(B) are finite and satisfy ∣λ±(B)∣≤∥B∥, because the real unit sphere is nonempty for r≥1. For symmetric A,B, each signed quadratic value for A is at most its value for B plus ∥A−B∥; taking suprema gives λ±(A)≤λ±(B)+∥A−B∥. Interchanging A,B gives ∣λ±(A)−λ±(B)∣≤∥A−B∥. Apply this with A=T(z) and B=T(w) and then use [F1], under [A1], to obtain the stated 2-Lipschitz bounds.

2.1A1F2step 1.1algebra

Under [A1], [F2] gives the common finite mean m≥0 and ∥Y∥=m+max⁡(λ+(Y)−m,λ−(Y)−m)≤m+W. Also ∥Y∥≥0. By step 1.1 and the scalar triangle inequality, ∣λ±(Y)−m∣≤∥Y∥+m, hence 0≤W≤∥Y∥+m.

3.1F1F2F4F5F7step 2.1algebra

By [F7], constants are simple measurable functions. With the measurability of λ±(Y) in [F2], [F4] therefore makes a=∣λ+(Y)−m∣ and b=∣λ−(Y)−m∣ measurable. The identity W=(a+b+∣a−b∣)/2 and [F4] prove that W is measurable. It is finite-valued by step 2.1. For each integer k≥1, [F5] applied with q=2k>0 to W and to the nonnegative measurable ∥Y∥ from [F1] proves measurability of W2k and ∥Y∥2k.

4.1F1F4F6F7F9step 1.1step 2.1step 3.1algebra∎

Fix an integer k≥1. By [F9], expectations of the nonnegative measurable functions below are their nonnegative Lebesgue integrals. The nonnegative constant C=m2k is finite; by [F7], EC=CP(Ω)=C. Step 2.1 gives W2k≤(∥Y∥+m)2k≤22k(∥Y∥2k+C): bound a sum of two nonnegative numbers by twice their maximum, raise to the positive integer power, and bound the maximum of the two powers by their sum. All functions here are measurable by step 3.1, [F4] and [F7]. Monotonicity, positive homogeneity and additivity in [F6] give EW2k≤22k(E∥Y∥2k+C)<∞ by [F1]. Since W≥0, this finite integral gives its finite 2kth absolute moment in [F9]. Together with steps 1.1 and 2.1 this proves every assertion.

Depends on

Used by · 2

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.