Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

The exponential series of a bounded operator

Statement

Let X be a real or complex Banach space and let A∈B(X) (A bounded linear operator between normed spaces). For t∈R define E(t):=∑n=0∞tnn!An. Then the series converges absolutely in the operator norm ∥⋅∥ of B(X), uniformly for t in compact subsets of R; E(t)∈B(X) with ∥E(t)∥≤e∣t∣∥A∥; E(0)=I and E(t+s)=E(t)E(s) for all s,t∈R; t↦E(t) is of class C∞ in the operator norm with E′(t)=AE(t)=E(t)A, and ∥E(t)−I−tA∥≤t22∥A∥2e∣t∣∥A∥, so that E(t)−It→A in operator norm as t→0. In particular E is a uniformly continuous (hence strongly continuous) group of bounded operators on X whose generator is the bounded operator A.

Facts & Assumptions

Given: A real or complex Banach space X, an operator A∈B(X), and for t∈R and N∈N the partial sums sN(t):=∑n=0Ntnn!An and the series E(t):=∑n=0∞tnn!An.

[F2]

Composition in B(X) is associative and bilinear, I is its identity, and ∥ST∥≤∥S∥ ∥T∥ for all S,T∈B(X) (Composition satisfies |ST|\le|S|,|T|); consequently ∥An∥≤∥A∥n for every n≥0. Completeness of B(X) for the operator norm [F1] together with these facts is all the structure used below; no separate Banach-algebra packaging is needed, and the estimates are identical over R and C.

[F3]

In a Banach space a series converges whenever it converges absolutely, i.e. whenever the series of norms converges; its partial sums are then Cauchy (Series criterion for Banach spaces, An absolutely convergent series has Cauchy partial sums, Series and absolute convergence in a normed space).

[F4]

For real u≥0 the exponential series satisfies ∑n≥0un/n!=eu<∞, and eu>0 (The real exponential function and the number e by a power series, The exponential is a continuous bijection from R onto (0,∞)); by n!≥2 (n−2)! for n≥2, its tail obeys ∑n≥2un/n!≤u22eu.

Proof

technique · direct, by norm estimates on the exponential series and an elementary Cauchy-product lemma
1.1F2F4

The series converges absolutely for every real t: by [F2] the general term obeys ∥tnAn/n!∥≤∣t∣n∥A∥n/n!, so with u:=∣t∣ ∥A∥ the comparison series ∑nun/n! is the scalar exponential of [F4] and converges.

1.2F1F2F3

Cauchy-product step. If ∑kxk and ∑jyj converge absolutely in B(X) and zn:=∑k+j=nxkyj, then ∑nzn converges absolutely with sum (∑kxk)(∑jyj). Indeed ∑n∥zn∥≤∑n∑k+j=n∥xk∥ ∥yj∥=(∑k∥xk∥)(∑j∥yj∥)<∞ by [F2], so ∑nzn converges by [F3]. Writing PN:=∑k≤Nxk, QN:=∑j≤Nyj, TN:=∑n≤Nzn, the product PNQN=∑n≤2N∑k+j=n, k,j≤Nxkyj differs from T2N only by the terms with k>N or j>N, so ∥PNQN−T2N∥≤(∑k>N∥xk∥)(∑j∥yj∥)+(∑k∥xk∥)(∑j>N∥yj∥)→0 by [F2] and absolute convergence; since PNQN→(∑xk)(∑yj) by continuity of the product, the subsequence T2N converges to that product, and a subsequence of a convergent sequence has the same limit, so ∑nzn=(∑kxk)(∑jyj).

2.1F3F4step 1.1

Hence E(t):=∑n≥0tnAn/n!∈B(X) is defined for every t by [F3], the family of series is dominated by the convergent scalar series ∑nRn∥A∥n/n! on every compact interval ∣t∣≤R, so the convergence is uniform there and in particular t↦E(t) is continuous in operator norm; and ∥E(t)∥≤∑n∣t∣n∥A∥n/n!=e∣t∣ ∥A∥<∞.

2.2step 1.2step 1.1algebra

Applying [step 1.2] to xk=tkk!Ak and yj=sjj!Aj, whose series converge absolutely by [step 1.1], gives E(t)E(s)=∑n(∑k+j=ntksjk!j!)An=∑n(t+s)nn!An=E(t+s), where AkAj=Ak+j and the binomial theorem in the commutative subalgebra generated by A were used.

2.3F2F4step 1.1algebra

For h≠0 and n≥1, the binomial expansion gives (t+h)n−tnh−ntn−1=∑j=2n(nj)hj−1tn−j; subtracting the two absolutely convergent series and using ∑n≥1ntn−1n!An=AE(t), the difference quotient obeys ∥E(t+h)−E(t)h−AE(t)∥≤∑n≥2∑j=2n(nj)∣h∣j−1∣t∣n−j∥A∥nn!=(∑j≥2∣h∣j−1∥A∥jj!)(∑m≥0∣t∣m∥A∥mm!)≤∣h∣ ∥A∥22e∣h∣ ∥A∥e∣t∣ ∥A∥, which tends to 0 as h→0; the rearrangement of the nonnegative double series is legitimate and the tail estimate is [F4].

3.1F1F2step 2.1

At t=0 all terms with n≥1 vanish, so E(0)=I; and since multiplication is continuous in the operator norm by [F1] and [F2], the product of the partial sums converges, which is what the next steps quantify.

3.2F2F4step 2.1

The quadratic remainder is ∥E(t)−I−tA∥=∥∑n≥2tnn!An∥≤∑n≥2∣t∣n∥A∥nn!≤t2∥A∥22e∣t∣ ∥A∥ by [F2] and the tail bound of [F4], since n!≥2(n−2)! for n≥2.

3.3step 2.3F2algebra

Therefore E is differentiable on R with E′(t)=AE(t); since A commutes with every power An, continuity of multiplication and [step 2.1] give AE(t)=lim⁡NA sN(t)=lim⁡NsN(t)A=E(t)A as well. Iterating, if E is m times differentiable with E(m)=AmE, then t↦AmE(t) is differentiable with derivative AmE′(t)=Am+1E(t) because Am is bounded; hence E(m)=AmE for all m, that is E is C∞ with E(m)(t)=AmE(t).

4.1step 2.1step 2.2step 3.2step 3.3∎

Taking t→0 in [step 3.2] gives ∥E(t)−It−A∥≤∣t∣ ∥A∥22e∣t∣ ∥A∥→0, so the difference quotients of E at 0 converge to A in operator norm; consequently E is a uniformly continuous group: by [step 2.2] E(0)=I and E(t)E(−t)=E(0)=I=E(−t)E(t), so each E(t) is invertible with inverse E(−t), and t↦E(t) is norm continuous on R by [step 2.1], hence strongly continuous, and the difference-quotient limit at 0 identifies its generator with the bounded operator A.

Notes. The same estimates give ∥E(t)∥≤e∣t∣ ∥A∥ and show the series converges in operator norm uniformly on compact t-intervals; nothing here uses a choice principle, and the zero space X={0} is included through the estimates ∥A∥=0, E(t)=I=0.

Depends on

Used by

Dependency tree · two levels

29 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