Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Infinitesimal generator of a C0-semigroup

Definition

For a Banach space X, the operator vocabulary of Unbounded linear operators: domain, graph and extension and Densely defined, closed and closable operators, and cores is extended as follows: an operator is a linear map A:D(A)→X on a linear subspace of X, its graph is Γ(A)={(x,Ax):x∈D(A)}⊆X×X, it is closed when this graph is closed, and densely defined when D(A) is dense in X. Use ∥(x,y)∥=∥x∥+∥y∥ on X×X and the graph norm ∥x∥A=∥x∥+∥Ax∥. These norms are equivalent to the square-sum norms in the Hilbert suppliers. The product is Banach because its two coordinate Cauchy sequences converge in X; the closed graph is therefore Banach, and x↦(x,Ax) is an isometry of the graph-norm domain onto it. Under Countable Choice, sequential closedness is equivalent to closedness: for any point in a closure, choose graph points within 1/n and pass to their limit.

Let (T(t))t≥0 be a strongly continuous semigroup on a Banach space X (Strongly continuous semigroup). Its infinitesimal generator is the linear operator A:D(A)⊆X→X with domain D(A):={x∈X: lim⁡t↓0T(t)x−xt exists in X} and Ax:=lim⁡t↓0T(t)x−xt for x∈D(A). The limit is a one-sided limit at the boundary point 0, and D(A) is a linear subspace of X (Normed subspace); the operator is recorded as the pair (A,D(A)) in the sense of Unbounded linear operators: domain, graph and extension and Densely defined, closed and closable operators, and cores. Neither boundedness nor closedness of A, nor density of D(A), is assumed in the definition; under its stated choice hypothesis, The generator is closed and densely defined proves that the graph of A is closed and D(A) is dense in X. The domain need not be closed in the norm of X.

The one-sided limit. For x∈D(A) the difference quotient T(t)x−xt∈X is defined for every t>0, and the defining limit is taken along t↓0 only; no two-sided limit at the boundary point 0 of [0,∞) is considered, and the vector Ax is the limit when it exists. The value Ax is unique because X is a metric space (Banach space).

The domain is a linear subspace. The zero vector lies in D(A) and A0=0. If x,y∈D(A) and α,β are scalars, then by linearity of each T(t) (A bounded linear operator between normed spaces) the difference quotient of αx+βy equals αT(t)x−xt+βT(t)y−yt for every t>0; as t↓0 this converges to αAx+βAy, because vector addition and scalar multiplication are continuous and scalar multiplication by the fixed scalars α,β is continuous. Hence αx+βy∈D(A) with A(αx+βy)=αAx+βAy, so D(A) is a linear subspace of X (Normed subspace) and A is linear on it. The operator is recorded as the pair (A,D(A)) in the vocabulary of Unbounded linear operators: domain, graph and extension and Densely defined, closed and closable operators, and cores.

What is not assumed. Boundedness and graph closedness of A, and density of D(A) in X, are not defining assumptions. Graph closedness and domain density are conclusions of the later theorem under its stated choice hypothesis; they do not assert that D(A) is closed in the norm of X. The semigroup axioms used here are those of Strongly continuous semigroup, in particular T(t) is everywhere defined and bounded for every t≥0.

Depends on

Used by

Dependency tree · two levels

18 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