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 of the contour semigroup is the sectorial operator

Statement

Assume Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) for the cited integral and semigroup suppliers.

Let A be a sectorial operator of angle δ∈(0,π/2] with vertex 0 on a complex Banach space X (Sectorial operator with the semigroup sign convention) and let (T(z))z∈Σδ∪{0} be the contour family of The Dunford contour integral defines a bounded holomorphic family on the sector, shown in The Dunford contour construction satisfies the semigroup law and strong continuity at the vertex to be a bounded analytic semigroup of angle δ. Then the generator of the strongly continuous semigroup (T(t))t≥0 (Infinitesimal generator of a C0-semigroup) is A, and (T(t))t≥0 is the unique strongly continuous semigroup generated by A within the class of exponentially bounded semigroups. No choice principle beyond Dependent Choice is used.

Facts & Assumptions

Given: A sectorial operator A of angle δ on the Banach space X, its contour semigroup (T(t))t≥0, the generator B of that semigroup, a real ω with ∥T(t)∥≤Meωt for all t≥0, and a fixed real λ>max⁡{ω,0}.

[L1]

For the contour semigroup, T(t)X⊆D(A), AT(t)=T′(t), t↦T(t) is norm-C1 for t>0, and T′(t)=12πi∫ΓλeλtR(λ,A) dλ (Smoothing estimates for the semigroup generated by a sectorial operator, The Dunford contour integral defines a bounded holomorphic family on the sector).

[L2]

For a strongly continuous semigroup with generator B and exponential bound ∥T(t)∥≤Meωt one has R(λ,B)x=∫0∞e−λtT(t)x dt for λ>ω (Laplace transform formula for the resolvent).

[L3]

The fundamental theorem of calculus for Banach-valued curves, and average convergence: for continuous g, h−1∫0hg(s)ds→g(0) (Fundamental theorem of calculus for Banach-valued continuous curves, Average convergence for a continuous Banach-valued function).

[L4]

Sectoriality with vertex 0 makes A closed and densely defined and puts every positive real λ in ρ(A) (Sectorial operator with the semigroup sign convention).

[L5]

For any strongly continuous semigroup with generator C, if y∈D(C) then its orbit remains in D(C) and CS(t)y=S(t)Cy (The generator commutes with the semigroup on its domain).

[L6]

For λ∈ρ(A), R(λ,A)X=D(A), AR(λ,A)=λR(λ,A)−I, and R(λ,A)(λI−A)y=y for y∈D(A) (Resolvent and spectrum of a closed operator on a Banach space).

[L7]

The generator B is defined by x∈D(B) exactly when h−1(T(h)x−x) has a limit as h↓0, and that limit is Bx (Infinitesimal generator of a C0-semigroup).

Proof

technique · direct
1.1L1L3L6L7givenalgebra

The inclusion A⊆B. First let y∈D(A) and s>0. The contour formula for T(s)Ay and [L1] give T(s)Ay=12πi∫ΓeλsR(λ,A)Ay dλ=12πi∫Γeλs(λR(λ,A)y−y) dλ=T′(s)y=AT(s)y. Here R(λ,A)Ay=λR(λ,A)y−y follows from [L6], and (2πi)−1∫Γeλsdλ=0: close a truncated keyhole, use the entire primitive eλs/s, and let its exponentially decaying outer arc tend to zero. Now for x∈D(A) and h>0, the fundamental theorem [L3] on [ε,h], followed by ε↓0 using strong continuity at 0, gives T(h)x−x=∫0hT(s)Ax ds. Dividing by h and applying average convergence [L3] yields h−1(T(h)x−x)→Ax. By the generator definition in [L7], x∈D(B) and Bx=Ax.

1.2L1L3L4givenalgebra

The resolvent computation. Fix x∈X and λ>max⁡{ω,0}, and put vη,R:=∫ηRe−λtT(t)x dt for 0<η<R. On the compact interval [η,R], both t↦T(t)x and t↦AT(t)x=T′(t)x are continuous, so the orbit is continuous in the graph norm of the closed operator A. Its graph-norm Bochner integral therefore lies in D(A) and satisfies Avη,R=∫ηRe−λtAT(t)x dt. Since (d/dt)[e−λtT(t)x]=e−λt(AT(t)x−λT(t)x), the fundamental theorem [L3] gives (λI−A)vη,R=∫ηRe−λt(λT(t)x−AT(t)x) dt=−∫ηRddt(e−λtT(t)x)dt=e−ληT(η)x−e−λRT(R)x. As η↓0 and R→∞, vη,R→v:=∫0∞e−λtT(t)x dt by the exponential bound and strong continuity at 0, while the displayed right side tends to x because λ>0. Closedness of A now gives v∈D(A) and (λI−A)v=x; since λ>0 and A is sectorial, λ∈ρ(A) and v=R(λ,A)x.

2.1step 1.2L2L4L6givenalgebra

The resolvents agree and B=A. By [step 1.2] the vector v=∫0∞e−λtT(t)x dt equals R(λ,A)x; by the Laplace formula [L2] the same integral equals R(λ,B)x. Hence R(λ,B)x=R(λ,A)x for every x∈X. Their ranges agree and equal D(B)=D(A); for each y in this common domain, applying the inverses gives (λI−B)y=(λI−A)y, so B=A.

2.2step 1.1L3L4L5givenalgebra

Uniqueness among exponentially bounded semigroups. Let S and T be two strongly continuous semigroups with generator A and exponential bounds, fix t>0 and x∈D(A), and set g(s):=S(t−s)T(s)x for s∈[0,t]. For 0<s<t, write the difference quotient as g(s+h)−g(s)h=S(t−s−h)−S(t−s)hT(s)x+S(t−s−h)T(s+h)x−T(s)xh. By [L5], T(s)x∈D(A), the first term tends to −S(t−s)AT(s)x, and the second tends to S(t−s)AT(s)x; hence g′(s)=0. Continuity at the endpoints and the fundamental theorem [L3] show that g is constant, so S(t)x=T(t)x. Since D(A) is dense by [L4] and S(t),T(t) are bounded, this extends to all x∈X.

3.1step 2.1step 2.2given∎

Assembly. [step 2.1] identifies the generator of the contour semigroup with A, and [step 2.2] proves uniqueness in the exponentially bounded class; no choice principle beyond Dependent Choice was used, since only the contour construction, the Laplace representation and the fundamental theorem were invoked.

Depends on

Used by

Dependency tree · two levels

50 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