Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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

Definition

Let A:D(A)⊆X→X be closed and densely defined on a Banach space X with (ω,∞)⊆ρ(A), and let R(λ,A)=(λI−A)−1 (Resolvent and spectrum of a closed operator on a Banach space). For real λ>ω the Yosida approximant of A at λ is Aλ:=λAR(λ,A)=λ2R(λ,A)−λI∈B(X). The equality with λ2R(λ,A)−λI uses AR(λ,A)=λR(λ,A)−I; in particular Aλ is a bounded everywhere defined operator. Distinct approximants commute, AλAμ=AμAλ, and each commutes with R(μ,A).

The two formulae agree. Since λ∈ρ(A), the resolvent identity AR(λ,A)=λR(λ,A)−I of Resolvent and spectrum of a closed operator on a Banach space gives Aλ=λAR(λ,A)=λ(λR(λ,A)−I)=λ2R(λ,A)−λI, and the right-hand side is a sum of bounded everywhere defined operators (A bounded linear operator between normed spaces). Hence each Aλ is bounded with D(Aλ)=X, and it is meant as a bounded approximation of the possibly unbounded A; the sense in which Aλx→Ax for x∈D(A) is a theorem proved on this page, not part of the definition.

Commutativity. For real λ,μ>ω the resolvents commute, R(λ,A)R(μ,A)=R(μ,A)R(λ,A), by Resolvent identity for closed operators. Therefore AλAμ=(λ2R(λ,A)−λI)(μ2R(μ,A)−μI) is symmetric in λ and μ: the only mixed term that is not obviously symmetric is λ2μ2R(λ,A)R(μ,A), and that product is symmetric by the resolvent identity. Hence distinct approximants commute, and for the same reason AλR(μ,A)=λ(λR(λ,A)−I)R(μ,A)=λ2R(λ,A)R(μ,A)−λR(μ,A) equals R(μ,A)Aλ, since Aλ is the product of R(λ,A) with bounded operators and resolvents at λ and μ commute. The closedness and density of A are hypotheses, not conclusions drawn from a generator theorem. The resolvent vocabulary is Resolvent and spectrum of a closed operator on a Banach space, and the definition itself asserts no approximation property.

Depends on

Used by

Dependency tree · two levels

12 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