Alphabeta Math
LemmaStatement: 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.

Scalar exponential bound for bounded losses

Statement

For 0<η≤1 and x∈[−1,1], exp⁡(−ηx)≤1−ηx+η2. Consequently, if M=M∗ and −I⪯M⪯I, then exp⁡(−ηM)⪯I−ηM+η2I.

Facts & Assumptions

Given: 0<η≤1, x∈[−1,1], and a Hermitian matrix M with −I⪯M⪯I. The order inequalities mean that I−M and I+M have nonnegative quadratic forms.

[F3]

The spectral functional calculus f(T) for a normal endomorphism: if M=∑jλjPj, then f(M)=∑jf(λj)Pj for f on its spectrum.

[F4]

The real exponential function and the number e by a power series and The exponential series converges absolutely for every real argument: exp⁡(u)=∑k≥0uk/k!, and this series converges absolutely for every real input, so consecutive tails may be grouped.

[F5]

The factorial n! and the falling factorial nk‾, defined by recursion in N, Integer powers am, and Monotonicity of x↦xn and of n↦an: (k+1)!=(k+1)k!, powers satisfy an+1=ana, and 0≤u≤1 implies un≤1.

[F7]

Non-negative and positive operators and Finite semidefinite primal-dual pair: nonnegative and positive-semidefinite operators have the stated quadratic-form meanings.

Proof

technique · direct
1.1givenF4F5F6algebra

Put u=−ηx, so ∣u∣≤1. From [F5] and 2!=2, induction gives k!≥2k−1 for k≥2: if it holds at k≥2, then (k+1)!=(k+1)k!≥3⋅2k−1>2k, so the bound is strict for k≥3. Thus [F6] gives ∑k≥21/k!≤1/2+1/6+∑k≥42−(k−1)=1/2+1/6+(1/8)∑j≥02−j=11/12<1. If u=0, [F4] gives exp⁡(u)=1=1+u+u2. If 0<u≤1, then uk=u2uk−2≤u2 for k≥2 by [F5], so [F4] gives exp⁡(u)=1+u+∑k≥2uk/k!≤1+u+u2∑k≥21/k!<1+u+u2. If u=−v≤0 with 0≤v≤1, the absolute convergence in [F4] allows consecutive grouping because the partial sums after each pair are a subsequence of the ordinary partial sums and hence have the same limit; each pair after the quadratic term is −v2j+3/(2j+3)!+v2j+4/(2j+4)!=−v2j+3(2j+3)!(1−v2j+4)≤0 for j≥0. Hence exp⁡(−v)≤1−v+v2/2≤1−v+v2. In every case, exp⁡(u)≤1+u+u2.

2.1givenF1F2F3F7step 1.1algebra∎

The scalar bound in step 1.1 gives exp⁡(−ηx)≤1−ηx+η2x2≤1−ηx+η2. Since M=M∗, it is normal, so [F1] gives an orthonormal eigenbasis Mek=λkek. For each unit ek, [F2] gives λk=⟨Mek,ek⟩=⟨ek,Mek⟩=λk‾, hence λk is real; testing the order bounds on ek gives 1−λk≥0 and 1+λk≥0, so λk∈[−1,1]. By [F3], exp⁡(−ηM) and I−ηM+η2I are diagonal in this basis, and applying the scalar bound to each eigenvalue shows their difference is positive semidefinite by [F7].

Depends on

Used by

Dependency tree · two levels

72 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