Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Matrix multiplicative-weights regret bound

Statement

Let n≥1, T≥1, 0<η≤1, and let M1,…,MT be Hermitian with −I⪯Mt⪯I. For the update of Matrix multiplicative-weights game and update, ∑t=1Ttr⁡(Mtρt)≤λmin⁡ ⁣(∑t=1TMt)+ηT+ln⁡nη.

Facts & Assumptions

Given: The MMW update, Golden–Thompson for finite Hermitian matrices, and the local exponential and positive-trace lemmas.

[F1]

Matrix multiplicative-weights game and update: St=∑s≤tMs, ρt=e−ηSt−1/tr⁡(e−ηSt−1), and its verification proves each ρt is positive with trace one.

[F2]

Scalar exponential bound for bounded losses: e−ηMt⪯I−ηMt+η2I.

[F3]

Finite-dimensional Golden–Thompson trace inequality: for Hermitian H,K, tr⁡(eH+K)≤tr⁡(eHeK).

[F4]

Trace of a product of positive semidefinite matrices is nonnegative: the trace of a product of positive semidefinite matrices is nonnegative.

[F5]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: the eigenvalues of a Hermitian matrix are real, and its trace and exponential are the corresponding eigenvalue sums.

[F6]

Trace of a product of Hermitian matrices is real: the trace of two Hermitian matrices product is real.

[F7]

For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA): trace is invariant under unitary conjugation and cyclic for compatible products.

[F8]

The real exponential function and the number e by a power series defines the scalar exponential by its factorial series, The exponential series converges absolutely for every real argument gives absolute convergence, and The factorial n! and the falling factorial nk‾, defined by recursion in N gives the factorial recursion used to group its tail under the canonical real embedding.

[F9]

Trace is a linear functional on Mn(F): trace distributes over finite sums and scalar multiples.

[F10]

The natural logarithm as the inverse of the exponential function defines ln⁡x as the inverse of exp⁡ for x>0.

[F11]

The exponential function is strictly increasing makes this inverse strictly increasing, and exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential supplies exp⁡(x+y)=exp⁡(x)exp⁡(y) for real inputs.

Proof

technique · direct
1.1givenF1F2F3F4F5F6F7F8F9algebra

Put Zt=tr⁡(e−ηSt) and mt=tr⁡(Mtρt). By [F5], write Mt=Udiag⁡(λ1,…,λn)U∗; the loss bounds imply λk∈[−1,1]. The matrix σ=U∗ρtU is positive with trace one by [F1] and [F7]. Thus qk=σkk≥0 and ∑kqk=1. Trace cyclicity and the diagonal-sum formula give mt=∑kλkqk∈[−1,1], consistently with [F6]. Hence 1−ηmt+η2≥1−η+η2=(η−1/2)2+3/4>0. Since St is Hermitian, Golden–Thompson [F3] gives Zt≤tr⁡(e−ηSt−1e−ηMt). By [F2], (I−ηMt+η2I)−e−ηMt⪰0; [F4] compares its trace product with the positive matrix e−ηSt−1, and [F9] expands the result as Zt≤Zt−1(1−ηmt+η2). Put s=−ηmt+η2, so s≥η2−η≥−1/4. If s≥0, the series [F8] gives exp⁡(s)≥1+s. If s=−v with 0<v≤1/4, absolute convergence [F8] permits pairing the tail after its linear term as ∑j≥0v2j+2(2j+2)!(1−v2j+3)≥0, so again exp⁡(s)≥1+s. Therefore Zt≤Zt−1exp⁡(−ηmt+η2).

2.1givenF5F10F11step 1.1algebra∎

Iterating step 1.1 from Z0=n gives ZT≤nexp⁡(−η∑tmt+η2T). If ST has eigenvalues λ1,…,λn, [F5] gives ZT=∑ke−ηλk≥exp⁡(−ηλmin⁡(ST)). Since n>0, [F10]–[F11] give nexp⁡(−η∑tmt+η2T)=exp⁡(ln⁡n−η∑tmt+η2T). Strict increase of exp⁡ and the inverse relation in [F10] therefore imply −ηλmin⁡(ST)≤ln⁡n−η∑tmt+η2T. Rearranging and dividing by η>0 proves the inequality.

Depends on

Used by

Dependency tree · two levels

74 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