Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 independent matrix Bernstein bound from the trace exponential

Statement

Let B1,…,Bm be independent centered random Hermitian q×q matrices, q,m≥1. Suppose R>0, v≥0, and ∥Bi∥op≤Ralmost surely,∥EBi2∥op≤v(1≤i≤m). Writing Y=∑i=1mBi, for 0<s<3/R one has Etr⁡exp⁡(sY)≤qexp⁡(ms2v2(1−sR/3)). Consequently, for u>0 when v>0, P{λmax⁡(Y)≥u}≤qexp⁡(−u22(mv+Ru/3)). For every b>0, the following convenient forms also hold: P{λmax⁡(Y)>2mvb+2Rb3}≤qe−b,P{∥Y∥op>2mvb+2Rb3}≤2qe−b. If v=0, all Bi and Y vanish almost surely, so the displayed positive-threshold conclusions remain valid.

Facts & Assumptions

Given: The matrices, constants and independent laws of the statement, with expectation as in Expectation of a nonnegative or integrable random variable. Matrix expectation is taken entrywise. The uniform bound makes all entries and all exponential series integrable.

[F1]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely supplies the Hermitian spectral calculus. The semidefinite order A⪯C means x∗(C−A)x≥0 for every vector x. Expectation preserves this order, by taking the expectation of each quadratic form.

[F2]

Finite-dimensional Golden–Thompson trace inequality gives tr⁡exp⁡(H+K)≤tr⁡(exp⁡(H)exp⁡(K)) for Hermitian matrices. Trace is as in The trace tr⁡(A) as the sum of the diagonal entries.

[F3]

Independence is in the sense of Independent random elements. By Independent random elements have product joint law, integration of a bounded measurable function of these matrices can be performed successively over their product law.

[F4]

The scalar Markov bound for a nonnegative random variable is Markov's inequality for random variables.

Proof

technique · direct
1.1givenF1algebra

Fix 0<s<3/R. If ∣x∣≤R and k≥2 is an integer, then xk≤Rk−2x2, including odd k and negative x. Applying the spectral calculus and taking expectations gives EBik⪯Rk−2EBi2. Since k!≥2⋅3k−2 for every k≥2 (start at k=2 and multiply by k+1≥3), the exponential series and EBi=0 yield Eexp⁡(sBi)⪯I+g(s)EBi2⪯eg(s)vI, where g(s)=s2/[2(1−sR/3)]. The first inequality is the sum of the convergent geometric majorant ∑k≥2skRk−2/k!≤g(s), and the second uses 0⪯EBi2⪯vI and the scalar inequality 1+a≤ea. Termwise expectation is justified by the uniform norm majorant ∑k(sR)k/k!.

2.1F1F2F3step 1.1algebra

Let Yj=∑i=1jBi, with Y0=0. For each fixed value of Yj−1, [F2] and integration over the independent Bj give EBjtr⁡exp⁡(sYj−1+sBj)≤tr⁡(exp⁡(sYj−1)Eexp⁡(sBj))≤eg(s)vtr⁡exp⁡(sYj−1). The last implication follows because P⪰0 and Q⪯cI imply tr⁡(PQ)≤ctr⁡P: diagonalize P and sum its nonnegative eigenvalues times the bounded diagonal quadratic forms of Q. Successive integration using [F3] and iteration from tr⁡I=q prove Etr⁡exp⁡(sY)≤qemg(s)v.

3.1F1F4step 2.1choosealgebra

By [F1], tr⁡exp⁡(sY)≥exp⁡(sλmax⁡(Y)). Markov's inequality [F4] and step 2.1 therefore give P{λmax⁡(Y)≥u}≤qexp⁡(−su+mg(s)v) for every u>0 and 0<s<3/R. If v>0, choose s=u/(mv+Ru/3), which belongs to that interval. Substitution gives −su+mg(s)v=−u2/[2(mv+Ru/3)], proving the stated tail bound. The same fixed-parameter bound with > in place of ≥ will also be used below.

4.1F1step 3.1algebra

For b>0 set u=2mvb+2Rb/3. Expanding its square shows u2≥2b(mv+Ru/3): with a=2mvb and c=2Rb/3, the two sides are respectively a2+2ac+c2 and a2+ac+c2. Thus step 3.1 bounds the one-sided failure by qe−b. Applying the same argument to −Bi and taking the union of the two failures bounds the norm failure by 2qe−b, since the norm of a Hermitian matrix is the larger of its maximum eigenvalue and the maximum eigenvalue of its negative.

5.1givenF1step 2.1step 4.1algebra∎

Finally, if v=0, then for each coordinate vector ej, E∥Biej∥22=ej∗(EBi2)ej=0. A nonnegative random variable with zero expectation vanishes almost surely: otherwise one of the events where it exceeds 1/n would have positive probability and positive contribution to the expectation. Intersecting the finitely many full-probability coordinate events gives Bi=0 almost surely; a further finite intersection covers all i. The trace mgf is then q and both strict positive-threshold events are empty. This covers the remaining case and completes all conclusions.

Depends on

Used by

Dependency tree · two levels

28 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources