Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedaudited 2026-09-22
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.

Relative boundedness with respect to an operator

Definition

Let A be a linear operator on H with domain D(A). An operator B is A-bounded, or relatively bounded with respect to A, when D(A)D(B) and there are finite constants a,b0 with BxaAx+bxfor all xD(A). The infimum of the admissible constants a is the A-bound of B, and one says the A-bound is below one when some a<1 is admissible.

Equivalent form. B is A-bounded exactly when B is bounded on D(A) for the graph norm xA=(x2+Ax2)1/2 of Unbounded linear operators: domain, graph and extension: each estimate BxaAx+bx gives Bxmax(a,b)2xA, and conversely a graph-norm bound BxCxA gives the estimate with a=b=C. The constant b is not intrinsic, and no closedness, density or resolvent hypothesis is needed for the definition. If A is closed with nonempty resolvent set, then A-bounded operators are exactly those with D(A)D(B) for which BRA(z) is bounded for some, equivalently every, zρ(A) (Resolvent and spectrum of an unbounded operator). Indeed, an A-bound makes BRA(z) bounded because ARA(z)=zRA(z)I; conversely, if BRA(z) is bounded, then Bx=BRA(z)(zA)x gives an A-bound. Thus boundedness for one resolvent implies relative boundedness and hence boundedness for every resolvent. This is used in the Kato-Rellich theorem below and recorded here as an interface.

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