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.
An independent symmetric-Gaussian norm moment input
Statement
Assume the Axiom of Choice. Let be a real symmetric matrix, , whose entries on one triangular half including the diagonal are independent variables. Mirrored entries coincide and the diagonal variance is one. With the vertex Hilbert-space operator norm, for every integer ,
Moreover,
Facts & Assumptions
The triangular realization has finite moments, the extreme values have common mean , and the centered reduction gives , where . Triangular Gaussian coordinates: metric and moment control, Expected extreme eigenvalues from finite Gaussian comparison, Extreme-value Lipschitz bounds and centered norm reduction.
Minkowski on a probability space gives the triangle inequality for the norm ; the nonnegative integral is monotone. Minkowski's inequality for integrals, including p = ∞, Monotonicity and nonnegative homogeneity of the nonnegative integral.
The even trace moment is bounded by the corresponding operator-norm moment times . Even trace moments transfer from the operator norm.
The specialized Gaussian concentration estimate in External input gives for this same triangular Gaussian matrix and every integer .
External input
For this same real symmetric variance-one triangular Gaussian matrix, set . With and , Bandeira and van Handel prove the following Gaussian-concentration estimate in the proof of Lemma 2.2 (printed/PDF p. 7): for every integer , . This specialized estimate is imported. No local proof of Gaussian concentration is asserted.
Proof
Given: The objects and hypotheses in the Statement.
Goal: Establish all the stated estimates.
The upper-triangular formulation is the same law as the source lower-triangular formulation: reflection merely relabels independent coordinates and leaves the diagonal standard normal. The five local preparatory lemmas fix this realization, the quadratic-process increment comparison and mean, the centered maximum reduction, and the trace transfer. By [F1], the two extreme means both equal . Consequently the imported estimate in External input applies with to precisely , and gives .
The pointwise bound , monotonicity, and Minkowski in [F2] give . All moments used are finite by [F1]. Applying [F3] gives the stated trace bound with the factor .
Source notes
The five intermediate items are local proofs, preceding this remaining external import. Their mean comparison follows the method of Lemma 2.2, using the already authored finite-net supplier; the concentration display is explicitly retained as an external premise. Read Lemma 2.2 and its complete two-page proof, checked its variance-one diagonal convention and the following trace use, and inspected the corresponding PDF images. The cited general concentration theorems were not read. No claim of a wholly local concentration proof or independent review is made.
Depends on
- Triangular Gaussian coordinates: metric and moment control
- Finite vertex Hilbert space in the article convention
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- Gaussian entry moments and triangular independence
- The Axiom of Choice
- Expected extreme eigenvalues from finite Gaussian comparison
- Extreme-value Lipschitz bounds and centered norm reduction
- Minkowski's inequality for integrals, including p = ∞
- Monotonicity and nonnegative homogeneity of the nonnegative integral
- Even trace moments transfer from the operator norm
- Random elements and real random variables
- Independent random elements
- Expectation of a nonnegative or integrable random variable
- Probability measures and probability spaces
- Afonso S. Bandeira and Ramon van Handel, Sharp nonasymptotic bounds on the norm of random matrices with independent entries · Lemma 2.2, printed/PDF pp. 6–7; Gaussian concentration display at top of p. 7; triangular matrix convention in Proposition 2.1 and Lemma 2.2 on p. 6
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
For a real symmetric r by r matrix with independent N(0,1) entries on and below the diagonal, write lambda_plus=sup_{||v||=1}v^TYv and lambda_minus=-inf_{||v||=1}v^TYv. For every integer p>=2, E max(|lambda_plus-E lambda_plus|^{2p},|lambda_minus-E lambda_minus|^{2p}) <= p! 4^{p+1} <= (2 sqrt(2p))^{2p}.
Hypotheses: Integer r>=1; real symmetric matrix; independent standard real Gaussian entries on one triangular half INCLUDING the diagonal; reflected entries identical; integer p>=2. Both extreme-value means are taken under this same matrix law.
Reading limits: Read the entire statement and proof of Lemma 2.2 on PDF/printed pp. 6–7, the adjacent Proposition 2.1 matrix convention, and the following trace application on p. 7; inspected rendered page images for formulas. The Ledoux–Talagrand Gaussian-concentration theorems cited there were not read or reconstructed. Only the displayed specialized fluctuation estimate is imported; the local five-helper chain supplies the coordinate setup, integrability, comparison mean and trace transfer.
Sources
- Afonso S. Bandeira and Ramon van Handel, Sharp nonasymptotic bounds on the norm of random matrices with independent entries · Lemma 2.2, printed/PDF pp. 6–7; Gaussian concentration display at top of p. 7; triangular matrix convention in Proposition 2.1 and Lemma 2.2 on p. 6