Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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 of a bounded operator is a uniformly continuous semigroup

Example

Let X be a Banach space and let A∈B(X). The exponential series of The exponential series of a bounded operator defines E(t)=etA for all real t, and T(t):=E(t)∣t≥0 is a strongly continuous semigroup on X with: (i) ∥T(t)∥≤et∥A∥ and T(0)=I; (ii) t↦T(t) is continuous for the operator norm, so T is uniformly continuous; (iii) the generator of T is A, with domain D(A)=X; (iv) E(t+s)=E(t)E(s) for all s,t∈R, so E is a group; and t↦T(t)x solves u′=Au, u(0)=x for every x∈X, in fact classically with u∈C1(R;X) and u′=Au everywhere.

Verification

Given: A Banach space X, an operator A∈B(X), the exponential series E(t)=∑n≥0tnn!An of The exponential series of a bounded operator, and T(t):=E(t) for t≥0.

[F1] For every real t the series E(t) converges absolutely in operator norm, ∥E(t)∥≤e∣t∣ ∥A∥, E(0)=I, E(t+s)=E(t)E(s) for all real s,t, E is C∞ with E′(t)=AE(t)=E(t)A, and ∥E(t)−It−A∥≤∣t∣2∥A∥2e∣t∣ ∥A∥→0 (The exponential series of a bounded operator).

[F2] The generator of a strongly continuous semigroup is defined by D(A)={x:lim⁡h↓0T(h)x−xh exists} and Ax equal to that limit (Infinitesimal generator of a C0-semigroup, Strongly continuous semigroup).

Proof technique: direct verification of the semigroup axioms and of the generator difference quotients from the exponential-series lemma.

1.1F1

T(0)=E(0)=I and T(t+s)=E(t+s)=E(t)E(s)=T(t)T(s) for s,t≥0; moreover ∥T(t)∥=∥E(t)∥≤et∥A∥ since t≥0, which is claim (i) and the group law restricted to [0,∞).

1.2F1F2

t↦T(t) is norm continuous on [0,∞), indeed C∞ there with derivative AE(t); since ∥(T(t)−T(t0))x∥≤∥T(t)−T(t0)∥ ∥x∥, the family is strongly continuous, so it is a C0-semigroup, and it is uniformly continuous as a norm-continuous family: claims (ii) and (iv) for real times follow from the same identities.

1.3F1F2

Generator: for x∈X and h>0, ∥T(h)x−xh−Ax∥≤∥E(h)−Ih−A∥ ∥x∥≤h2∥A∥2eh∥A∥∥x∥→0, so every x∈X lies in the generator domain D(A) of the semigroup and the generator acts by x↦Ax; hence the generator is the bounded operator A with D(A)=X, which is claim (iii).

2.1F1step 1.2

Classical orbits: for u(t):=E(t)x one has u′(t)=E′(t)x=AE(t)x=Au(t) for every real t, and u(0)=x, so u∈C1(R;X) solves u′=Au classically; u is unique among such solutions by the same argument applied to the difference of two solutions, alternatively by the group law E(−t)u(t)=x.

3.1step 1.1step 1.2step 1.3step 2.1∎

All of (i)-(iv) and the classical-solution statement are established, with ω=∥A∥ and M=1 in the exponential bound.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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