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

The Yosida resolvent converges strongly to the identity

Statement

Let A:D(A)⊆X→X be closed and densely defined on a Banach space X, and let M≥1, ω∈R be such that (ω,∞)⊆ρ(A) and ∥R(λ,A)n∥≤M(λ−ω)−n for all real λ>ω and every n≥1 (Resolvent and spectrum of a closed operator on a Banach space). Then, as λ→∞ along the reals, λR(λ,A)x→x for every x∈X, and λR(λ,A)Ax→Ax for every x∈D(A).

Facts & Assumptions

Given: 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 (Resolvent and spectrum of a closed operator on a Banach space).

[F1]

Resolvent identities: R(λ,A)X=D(A), R(λ,A)(λI−A)y=y for y∈D(A), and λR(λ,A)x−x=AR(λ,A)x for x∈X; in particular λR(λ,A)y=y+R(λ,A)Ay for y∈D(A), since λR(λ,A)y=R(λ,A)((λI−A)y+Ay)=y+R(λ,A)Ay (Resolvent and spectrum of a closed operator on a Banach space).

[F2]

First power estimate: ∥R(λ,A)∥≤M/(λ−ω) for λ>ω (Resolvent power estimates for semigroup generators is the source of this estimate in the semigroup case; here it is assumed directly).

[F3]

D(A) is dense in X, and operators of the form λR(λ,A) are bounded (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Proof

technique · direct: the identity on the dense domain and a uniform bound, then a three-epsilon argument
1.1F1F2

For y∈D(A) and λ>ω, [F1] gives λR(λ,A)y=y+R(λ,A)Ay, hence by [F2] ∥λR(λ,A)y−y∥≤Mλ−ω∥Ay∥→0 as λ→∞.

1.2F2

The operators Bλ:=λR(λ,A) are uniformly norm bounded for large λ: ∥Bλ∥≤λMλ−ω≤2M for λ≥2ω when ω>0, and ∥Bλ∥≤M for ω≤0 and λ>0.

2.1F3step 1.1step 1.2

For arbitrary x∈X: given ε>0, choose y∈D(A) with ∥x−y∥<ε/(4M+2) by density [F3]; by [step 1.1] choose λ0 with ∥λR(λ,A)y−y∥<ε/2 for λ>λ0; then for such λ, ∥λR(λ,A)x−x∥≤∥Bλ(x−y)∥+∥λR(λ,A)y−y∥+∥y−x∥<2Mε4M+2+ε2+ε4M+2<ε. Hence λR(λ,A)x→x for every x∈X.

3.1F1step 2.1∎

The second statement is [step 2.1] applied to the vector Ax∈X: λR(λ,A)Ax→Ax; by [F1] and [F2] this is the same as λAR(λ,A)x=λ2R(λ,A)x−λx→Ax for x∈D(A).

Depends on

Used by

Dependency tree · two levels

29 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