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.

Yosida approximants are bounded and converge on the domain

Statement

Under the hypotheses of The Yosida resolvent converges strongly to the identity, let Aλ=λAR(λ,A) be the Yosida approximants (Yosida approximants). Then ∥Aλ∥≤λ2Mλ−ω+∣λ∣ for λ>ω, and Aλx→Ax as λ→∞ for every x∈D(A).

Facts & Assumptions

Given: The hypotheses of The Yosida resolvent converges strongly to the identity on the closed densely defined operator A, and the Yosida approximants Aλ=λAR(λ,A)=λ2R(λ,A)−λI (Yosida approximants).

[F1]

Aλ=λ2R(λ,A)−λI is bounded with ∥Aλ∥≤λ2∥R(λ,A)∥+∣λ∣ (Yosida approximants, The operator norm is a norm on the space of bounded linear operators, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F2]

∥R(λ,A)∥≤M/(λ−ω) and λR(λ,A)x→x for all x∈X, λR(λ,A)Ax→Ax for x∈D(A) (the bound is a hypothesis of The Yosida resolvent converges strongly to the identity, which proves both convergence conclusions).

[F3]

For x∈D(A) one has AR(λ,A)x=R(λ,A)Ax: both equal λR(λ,A)x−x by the resolvent identity (Resolvent and spectrum of a closed operator on a Banach space).

Proof

technique · direct: the norm bound from the identity form, and pointwise convergence from the strong resolvent convergence
1.1F1F2

By [F1] and [F2], ∥Aλ∥≤λ2Mλ−ω+∣λ∣ for λ>ω, which is the asserted bound.

1.2F2F3

For x∈D(A), Aλx=λAR(λ,A)x=λR(λ,A)Ax by [F3]; by [F2] the right-hand side converges to Ax as λ→∞. Hence Aλx→Ax for every x∈D(A).

2.1step 1.1step 1.2∎

Both conclusions hold for every λ>ω, and no uniform convergence on all of D(A) or on bounded sets is claimed.

Depends on

Used by

Dependency tree · two levels

23 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