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.

Bounded Yosida semigroups converge to the generated semigroup

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 closed and densely defined on a Banach space X and let M≥1, ω∈R satisfy (ω,∞)⊆ρ(A) and ∥R(λ,A)n∥≤M(λ−ω)−n for all real λ>ω, n≥1. Let Aλ=λAR(λ,A) be the Yosida approximants (Yosida approximants) and let Eλ(t):=etAλ be the bounded-operator exponentials of The exponential series of a bounded operator. Then for every x∈X the limit T(t)x:=lim⁡λ→∞Eλ(t)x exists, uniformly for t in compact subsets of [0,∞), and T is a strongly continuous semigroup on X with ∥T(t)∥≤Meωt and generator A.

Facts & Assumptions

Given: Dependent Choice; A closed densely defined operator A on a Banach space X with (ω,∞)⊆ρ(A) and ∥R(λ,A)n∥≤M(λ−ω)−n for all real λ>ω and n≥1; the Yosida approximants Aλ=λAR(λ,A) and the exponentials Eλ(t)=etAλ of The exponential series of a bounded operator (Yosida approximants, Resolvent and spectrum of a closed operator on a Banach space).

[F1]

Exponential series: Eλ(t)=∑j≥0tjj!Aλj converges in operator norm, ∥Eλ(t)∥≤e∣t∣ ∥Aλ∥, Eλ(0)=I, Eλ(t+s)=Eλ(t)Eλ(s), Eλ is C1 with Eλ′(t)=AλEλ(t), so Eλ(t)x−x=∫0tEλ(s)Aλx ds for every x by the fundamental theorem of calculus (The exponential series of a bounded operator, Fundamental theorem of calculus for Banach-valued continuous curves).

[F2]

The approximants satisfy the norm bound of Yosida approximants are bounded and converge on the domain and Aλx→Ax for every x∈D(A); distinct approximants commute and so do the exponentials (Yosida approximants, Composition satisfies |ST|\le|S|,|T|).

[F3]

A is closed and D(A) is dense by hypothesis; since Aλ=λ2R(λ,A)−λI and R(λ,A) commutes with I, the binomial Cauchy-product argument in the exponential-series proof, applied to the commuting bounded operators −λI and λ2R(λ,A), gives Eλ(t)=e−λtetλ2R(λ,A), so the resolvent power estimates yield ∥Eλ(t)∥≤e−λt∑j≥0(tλ2)jj!M(λ−ω)j=Meωtλ/(λ−ω) for t≥0. [F1, F2]

[F4]

Average convergence and strong continuity: a continuous curve is Bochner integrable and its forward averages converge to its value (Average convergence for a continuous Banach-valued function); continuity at 0 plus the semigroup law gives continuity of every orbit (Continuity at time zero implies continuity of every orbit, Strongly continuous semigroup).

[F5]

Laplace formula: a strongly continuous semigroup with ∥T(t)∥≤Meωt has (ω,∞)⊆ρ(its generator) (Laplace transform formula for the resolvent).

Proof

technique · direct: uniform bounds and a Cauchy estimate on the dense domain, then passage to the limit, and identification of the generator by uniqueness of the resolvent
1.1F3

Uniform bound. For λ>max⁡{ω,0} and t≥0, [F3] gives ∥Eλ(t)∥≤Meωtλ/(λ−ω). For every T0<∞, ωtλ/(λ−ω)→ωt uniformly on 0≤t≤T0. Thus the displayed majorants converge uniformly to Meωt there; they are uniformly bounded for large λ, and lim sup⁡λ→∞∥Eλ(t)∥≤Meωt for each fixed t, regardless of the sign of ω.

2.1F1F2step 1.1

Cauchy estimate on D(A). For x∈D(A) and λ,μ>ω, the exponentials commute and the FTC gives Eλ(t)x−Eμ(t)x=−∫0tdds[Eλ(t−s)Eμ(s)x]ds=∫0tEλ(t−s)Eμ(s)(Aλx−Aμx) ds; hence ∥Eλ(t)x−Eμ(t)x∥≤t C(t)2∥Aλx−Aμx∥ with C(t):=sup⁡λ large,0≤s≤t∥Eλ(s)∥ finite by [step 1.1]. Since Aλx→Ax by [F2], the family (Eλ(t)x)λ is Cauchy, uniformly for t in compact intervals.

3.1F2F3step 1.1step 2.1

The limit and its bound. For x∈X and y∈D(A) close to x, ∥Eλ(t)x−Eμ(t)x∥≤∥Eλ(t)(x−y)∥+∥Eμ(t)(x−y)∥+∥Eλ(t)y−Eμ(t)y∥, and the first two terms are small uniformly in λ,μ and t in compacts by [step 1.1] while the last is small by [step 2.1]; density [F3] gives convergence uniformly on compact t-intervals for every x. The limit orbit is continuous on each compact interval: for any point, bound its increment by the two uniform approximation errors and the increment of one continuous approximating orbit. Define T(t)x:=lim⁡λEλ(t)x; then T(t) is linear and bounded with ∥T(t)x∥=lim⁡λ∥Eλ(t)x∥≤Meωt∥x∥ by [step 1.1].

4.1F1step 3.1

Semigroup law. For t,s≥0 and x∈X, Eλ(t+s)x=Eλ(t)Eλ(s)x→T(t)T(s)x by [step 3.1] and the uniform bound on compacts, while Eλ(t+s)x→T(t+s)x; hence T(t+s)=T(t)T(s), and T(0)=I.

4.2F1F4step 3.1

Strong continuity. For x∈D(A) and t in a compact interval, Eλ(t)x−x=∫0tEλ(s)Aλx ds=∫0tEλ(s)Ax ds+∫0tEλ(s)(Aλx−Ax) ds, and the two integrals tend to ∫0tT(s)Ax ds and 0 uniformly, because Eλ(s)→T(s) strongly uniformly on the interval by [step 3.1] and Aλx→Ax; hence T(t)x−x=∫0tT(s)Ax ds→0 as t↓0 by average convergence [F4]. With the local bound of [step 3.1] this extends from the dense domain to all x, so T(t)x→x as t↓0; by the semigroup law and [F4] every orbit is continuous, so T is a strongly continuous semigroup with bound ∥T(t)∥≤Meωt.

5.1F4step 4.2

The generator contains A. The identity of [step 4.2] shows T(t)x−x=∫0tT(s)Ax ds for x∈D(A); dividing by t and using average convergence for the continuous curve s↦T(s)Ax gives T(t)x−xt→Ax. Hence D(A)⊆D(B) and Bx=Ax for x∈D(A), where B is the generator of T.

6.1F2F5step 5.1∎

A=B. By [F5] applied to T and its bound, every real λ>ω lies in ρ(B); it also lies in ρ(A) by hypothesis, and λI−A=λI−B on D(A). Thus λI−A:D(A)→X and λI−B:D(B)→X are both bijections agreeing on D(A): given x∈D(B), (λI−B)x=(λI−A)y for some y∈D(A), and since (λI−B)y=(λI−A)y=(λI−B)x while λI−B is injective, x=y∈D(A); hence D(A)=D(B) and A=B.

Depends on

Used by

Dependency tree · two levels

51 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