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.

Resolvent and spectrum of a closed operator on a Banach space

Definition

Let X be a Banach space over K∈{R,C} (Banach space, Real and complex scalar conventions for normed spaces) and let A:D(A)⊆X→X be a closed linear operator: D(A) is a linear subspace and Γ(A)={(x,Ax):x∈D(A)} is closed in X×X with norm ∥(x,y)∥=∥x∥+∥y∥. This extends the Hilbert-space vocabulary of Unbounded linear operators: domain, graph and extension and Densely defined, closed and closable operators, and cores to Banach spaces. A scalar λ∈K belongs to the resolvent set ρ(A) if λI−A:D(A)→X is bijective and its inverse is bounded on X. Under Dependent Choice, boundedness of the inverse follows from bijectivity by Closed graph theorem; thus under DC this is equivalent to the bijectivity-only convention. For λ∈ρ(A) the bounded operator R(λ,A):=(λI−A)−1∈B(X) is the resolvent, and σ(A):=K∖ρ(A) is the spectrum. One has 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 AR(λ,A)=λR(λ,A)−I∈B(X). This is the Banach-space form of the Hilbert-space vocabulary Resolvent and spectrum of an unbounded operator; the shift convention λI−A is the same, with the closed graph theorem replacing the Hilbert-space bounded-inverse convention.

Boundedness under DC. Assume Dependent Choice. If λ∈K and λI−A is bijective, then λI−A is a closed operator: its graph is the image of the graph Γ(A)⊆X⊕X (Unbounded linear operators: domain, graph and extension) under the homeomorphism (y,z)↦(y,λy−z) of X⊕X with inverse (u,v)↦(u,λu−v). Hence (λI−A)−1:X→X has closed graph and is everywhere defined, so the closed graph theorem (Closed graph theorem, which assumes DC) makes it bounded; this is the one place where an axiom beyond ZF enters, and it is the DC carried by the cited theorem. The Banach-space vocabulary is Banach space with the scalar convention of Real and complex scalar conventions for normed spaces; boundedness and the space B(X) are those of A bounded linear operator between normed spaces.

Elementary identities. Let λ∈ρ(A) and R:=R(λ,A). Since R is the inverse of the bijection λI−A:D(A)→X, its range is D(A): RX=D(A). It satisfies R(λI−A)y=y(y∈D(A)),(λI−A)Rx=x(x∈X). The first identity says R(λ,A)(λI−A)=ID(A) and the second says (λI−A)R(λ,A)=IX. Reading the second identity as λRx−ARx=x and rearranging gives λR(λ,A)x−x=AR(λ,A)x(x∈X), that is AR(λ,A)=λR(λ,A)−I as everywhere-defined operators X→X; in particular AR(λ,A)∈B(X) even though A itself need not be bounded. The same identities hold for every λ∈ρ(A), and σ(A):=K∖ρ(A) collects the scalars for which λI−A fails to be bijective or has an unbounded inverse. Under DC, the latter possibility is excluded by the closed graph argument above. When X is a Hilbert space this is the Banach-space form of Resolvent and spectrum of an unbounded operator, with the same shift convention λI−A; the closed graph theorem replaces the Hilbert-space convention that the resolvent is bounded by definition.

Depends on

Used by

Dependency tree · two levels

22 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