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.

Bounded symmetric matrix expectation at the variance scale

Statement

Let n≥2 and let X be a real symmetric random matrix with independent finite-valued lower-triangular entries, each symmetric in distribution about zero, and ∣Xij∣≤1. Put s=max⁡i(∑jEXij2)1/2. For the Euclidean operator norm, E∥X∥≤e2/3(2s+42log⁡n).

Facts & Assumptions

[F2]

The original sample space may be any probability space (Probability measures and probability spaces), with real random variables as in Random elements and real random variables and independence as in Independent random elements. Symmetry means equality of the laws of Z and −Z (Symmetric real random variables); for finite-valued Z this says P(Z=t)=P(Z=−t) for every real t.

[F3]

Finite probability spaces and their real variables and distributions are Finite probability spaces, outcome weights, events, and event probabilities and Real random variables on finite probability spaces and their finite distributions. On them, mutual independence is the product formula for joint value events (Pairwise and mutual independence of finite-valued random variables), and expectation is the weighted finite sum (Expectation of a real random variable on a finite probability space). On the original space expectation is Expectation of a nonnegative or integrable random variable. A nonnegative finite-valued variable has expectation equal to the sum of each value times its probability, by The integral of a nonnegative simple function and The nonnegative integral agrees with the simple integral on simple functions.

[F4]

The finite product is The finite product of finite probability spaces. Its weights normalize, and its coordinate events are mutually independent with their prescribed marginals, by Product weights normalize, and coordinate events are mutually independent.

[F5]

The external estimate below is Bandeira–van Handel, Corollary 3.6, specialized to u=3.

External input

For Xij=ξijbij, independent symmetric unit-variance ξij and deterministic real bij, set σ=max⁡i(∑jbij2)1/2. Corollary 3.6 gives E∥X∥≤e2/3(2σ+42max⁡ij∥Xij∥2⌈3log⁡n⌉log⁡n). Here ∥Z∥r=(E∣Z∣r)1/r. This established theorem is imported from the cited 2016 paper, not proved here.

Proof

Given: The matrix in the Statement, without a finiteness assumption on its underlying sample space.

Goal: Establish the displayed expectation bound.

1.1F2F3F4given

Let I={(i,j):1≤j≤i≤n}. For e∈I let Te be the finite set of values of Xe with positive probability, and put μe(t)=P(Xe=t). The value events form a finite partition up to events of probability zero, so the probability-measure axioms give ∑t∈Teμe(t)=1. Thus (Te,μe) is a finite probability space. On the product T=∏e∈ITe, let Ye(t)=te and fill the upper triangle by symmetry. By the product theorem these entries are mutually independent. Independence of the original entries gives P(Xe=te for all e∈I)=∏e∈Iμe(te), exactly the product weight of t. All other value arrays have probability zero. Hence Y has the same finite joint law as X, including each marginal's symmetry and bound.

2.1F1F2F3step 1.1

For every nonnegative real-valued function g of the finitely many possible matrix values, the simple-function expectation formula gives Eg(X)=∑t∈Tg(t)∏e∈Iμe(te)=Eg(Y). In particular E∥X∥=E∥Y∥, and all entry second moments are preserved. Here the finitely many value fibres are measurable intersections of entry value events, so g(X) is a nonnegative simple measurable function; this includes the operator norm. We may therefore prove the estimate on this finite product space without restricting the original sample space.

3.1F2F3F4step 1.1step 2.1

Set bij=(EYij2)1/2=bji and Z={(i,j)∈I:bij=0}. For bij>0 set ξij=Yij/bij. Symmetry pairs each value with its negative, so its finite mean is zero and Eξij2=1. If bij=0, the nonnegative weighted sum EYij2=0 forces Yij=0 at every outcome of positive weight. Enlarge T by one factor {−1,1} with weights 1/2,1/2 for each index in Z, using the product theorem; the empty Z requires no extra factor. For these indices take ξij to be the corresponding sign. The enlarged space has total weight one and preserves the law of Y; the signs are mutually independent and independent of all original coordinates. Every ξij depends on its own distinct product coordinate, so its value events are coordinate events and the whole lower-triangular family is independent. All ξij are symmetric with mean zero and unit variance, and Yij=bijξij almost surely, including the diagonal and zero-variance entries.

4.1F1F3F5step 2.1step 3.1∎

The external estimate applies to this factorization of Y. Its parameter is σ=max⁡i(∑jbij2)1/2=s, and ∣Yij∣≤1 gives ∥Yij∥2⌈3log⁡n⌉≤1 by summing the bounded nonnegative moments against normalized weights. Substitution yields E∥Y∥≤e2/3(2s+42log⁡n). Transfer back by step 2.1 proves the claim for the original X.

Source notes

Only the explicitly stated nonasymptotic external theorem is imported. The finite-law reduction, product construction and variance normalization are local. The article under study supplies no premise.

Depends on

Used by · 1

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.

External dependencies

A. S. Bandeira and R. van Handel, Sharp nonasymptotic bounds on the norm of random matrices with independent entries (2016) · Corollary 3.6, reprint PDF p. 15; sigma definition, p. 2; proof, p. 16

For a symmetric matrix X_ij=xi_ij b_ij with independent symmetric unit-variance xi_ij (i>=j) and deterministic coefficients b_ij, sigma=max_i(sqrt(sum_j b_ij^2)), Corollary 3.6 gives E||X|| <= exp(2/u)(2 sigma +14u max_ij ||xi_ij b_ij||_(2 ceil(u log n)) sqrt(log n)) for every u>=3.

Hypotheses: Real symmetric finite matrix; independent lower-triangular symmetric unit-variance scalar variables; deterministic coefficients; u>=3; indicated moments finite. Symmetric means distribution invariant under sign reversal.

Reading limits: Checked the reprint PDF text on p. 2 for the definition of sigma, p. 15 for the complete statement of Corollary 3.6, and p. 16 for its proof text; also inspected the rendered p. 15 formula. The theorem is imported, not reconstructed. Its proof dependencies and the rest of the paper were not audited. This independent 2016 source supplies the estimate; the article under study supplies no premise.

Sources