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

Hille-Yosida generation theorem

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 A:D(A)⊆X→X be a closed and densely defined linear operator on a Banach space X and let M≥1, ω∈R. Then A generates a strongly continuous semigroup (T(t))t≥0 with ∥T(t)∥≤Meωt for all t≥0 if and only if both: (i) (ω,∞)⊆ρ(A), and (ii) ∥R(λ,A)n∥≤M(λ−ω)−n for every real λ>ω and every n≥1 (Resolvent and spectrum of a closed operator on a Banach space). All resolvent powers are required in general; the first power alone guarantees all power estimates when M=1, the exponentially rescaled contraction case, where all higher power estimates follow from the single one by submultiplicativity (treated later on this page).

Facts & Assumptions

Given: Dependent Choice; A closed densely defined linear operator A on a Banach space X and constants M≥1, ω∈R (Resolvent and spectrum of a closed operator on a Banach space, The generator is closed and densely defined).

[F1]

Sufficiency: under (i) (ω,∞)⊆ρ(A) and (ii) ∥R(λ,A)n∥≤M(λ−ω)−n for all real λ>ω, n≥1, the operator A generates a strongly continuous semigroup with ∥T(t)∥≤Meωt (Bounded Yosida semigroups converge to the generated semigroup).

[F2]

Necessity of the location of the spectrum and of the first estimate: if T is a strongly continuous semigroup with generator A and ∥T(t)∥≤Meωt, then A is closed and densely defined, (ω,∞)⊆ρ(A), and ∥R(λ,A)∥≤M/(λ−ω) (The generator is closed and densely defined, Laplace transform formula for the resolvent, Strongly continuous semigroup).

[F3]

Necessity of all powers: under the hypotheses of [F2], R(λ,A)mx=1(m−1)!∫0∞sm−1e−λsT(s)x ds and ∥R(λ,A)m∥≤M(λ−ω)−m for every m≥1 (Resolvent power estimates for semigroup generators).

Proof

technique · direct: sufficiency is the Yosida construction and necessity is read off from the Laplace representation of the resolvent
1.1F1

(Sufficiency.) Assume (i) and (ii). Then all hypotheses of [F1] hold, so A generates a strongly continuous semigroup (T(t))t≥0 with ∥T(t)∥≤Meωt for all t≥0.

1.2F2

(Necessity, domain and spectrum.) Assume conversely that A generates T with ∥T(t)∥≤Meωt. Then A is closed with dense domain by [F2]; the Laplace-transform formula for the resolvent gives λ∈ρ(A) and ∥R(λ,A)∥≤M/(λ−ω) for every real λ>ω; in particular (ω,∞)⊆ρ(A), which is (i).

1.3F3

(Necessity, all powers.) Under the same hypothesis, [F3] gives the integral representation of every power R(λ,A)m and the estimate ∥R(λ,A)m∥≤M(λ−ω)−m for all m≥1 and real λ>ω, which is (ii).

2.1step 1.1step 1.2step 1.3∎

Combining [step 1.1] with [steps 1.2-1.3]: A generates a strongly continuous semigroup with ∥T(t)∥≤Meωt if and only if (i) and (ii) hold. The general theorem retains all power estimates; the case where the first estimate alone suffices (M=1, ω=0) is isolated as the next corollary.

Depends on

Used by

Dependency tree · two levels

38 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