Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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 generator commutes with the semigroup on its domain

Statement

Assume Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). Let (T(t))t≥0 be a strongly continuous semigroup on a Banach space X with generator (A,D(A)) (Infinitesimal generator of a C0-semigroup). If x∈D(A), then T(t)x∈D(A) and AT(t)x=T(t)Ax for every t≥0; moreover the orbit t↦T(t)x is differentiable on (0,∞) with ddtT(t)x=T(t)Ax=AT(t)x, and right differentiable at t=0 with right derivative Ax.

Facts & Assumptions

Given: Dependent Choice; A strongly continuous semigroup (T(t))t≥0 on a Banach space X with generator (A,D(A)) (Strongly continuous semigroup, Infinitesimal generator of a C0-semigroup) and a vector x∈D(A).

[F1]

x∈D(A) means that T(h)x−xh→Ax as h↓0 (Infinitesimal generator of a C0-semigroup).

[F2]

The semigroup law T(t+h)=T(t)T(h) holds for all t,h≥0, and operator norms satisfy ∥Sy∥≤∥S∥ ∥y∥ (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, Composition satisfies |ST|\le|S|,|T|).

[F3]

The family is locally bounded and the orbit of every vector is continuous on [0,∞) (A semigroup with continuity at zero is uniformly bounded on every compact time interval, Strongly continuous semigroup): for t0>0 there is M with ∥T(s)∥≤M for s∈[0,t0], and T(s)z→T(t)z for every z as s→t.

Proof

technique · direct, writing the difference quotients of the orbit as $T(\cdot)$ applied to the generator quotient
1.1F2

For t≥0 and h>0, the semigroup law gives T(t+h)x−T(t)xh=T(t)T(h)x−xh.

2.1F1F2step 1.1

Since T(h)x−xh→Ax by [F1] and T(t) is a fixed bounded operator, the right difference quotient in [step 1.1] converges to T(t)Ax as h↓0. Hence the right derivative of the orbit at t exists and equals T(t)Ax; taking t=0 shows that the right derivative at 0 is Ax and, for general t, that T(t)x∈D(A) with AT(t)x=T(t)Ax.

3.1F2F3step 1.1step 2.1

Left derivative at t>0: for 0<h<t one has T(t−h)x−T(t)x−h=T(t−h)T(h)x−xh. Let vh:=T(h)x−xh→Ax and use the local bound M on [0,t] from [F3]: ∥T(t−h)vh−T(t)Ax∥≤M∥vh−Ax∥+∥(T(t−h)−T(t))Ax∥→0, because vh→Ax and T(t−h)→T(t) strongly as h↓0 by [F3]. Hence the left derivative at t also equals T(t)Ax=AT(t)x.

4.1step 2.1step 3.1∎

Combining [step 2.1] and [step 3.1], for every x∈D(A) and every t≥0 the orbit satisfies T(t)x∈D(A), AT(t)x=T(t)Ax, and t↦T(t)x is differentiable on (0,∞) with derivative T(t)Ax=AT(t)x, with right derivative Ax at t=0.

Depends on

Used by

Dependency tree · two levels

21 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