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.

Dissipative operator

Definition

Let X be a Banach space over K∈{R,C} and let A:D(A)⊆X→X be a linear operator with domain D(A) (Unbounded linear operators: domain, graph and extension). A is dissipative if ∥(λI−A)x∥≥λ∥x∥for all λ>0 and all x∈D(A); equivalently ∥x−αAx∥≥∥x∥ for all α>0 and x∈D(A). A dissipative operator has injective λI−A for every λ>0 and ∥(λI−A)−1z∥≤λ−1∥z∥ on the range of λI−A; no surjectivity, closedness or density is implied. If X is a Hilbert space (Hilbert space), then A is dissipative if and only if Re ⟨Ax,x⟩≤0 for every x∈D(A): from the norm dissipativity inequality, squaring gives Re ⟨Ax,x⟩≤∥Ax∥2/(2λ) for every λ>0, so letting λ→∞ yields Re ⟨Ax,x⟩≤0. Conversely, if this real-part inequality holds, expanding ∥(λI−A)x∥2=λ2∥x∥2−2λRe ⟨Ax,x⟩+∥Ax∥2 gives the norm dissipativity inequality. Finally, under the Hahn-Banach extension principle HB (The real dominated-extension principle as an additional hypothesis over ZF) dissipativity is equivalent to the norm-duality form: for every x∈D(A) there exists x∗∈X∗ with ∥x∗∥=∥x∥, x∗(x)=∥x∥2 and Re x∗(Ax)≤0; the equivalence is the two-dimensional argument of [T] Lemma 11.19, where HB produces the norming functionals and supplies the extension from span{x,Ax} (Relative dual norming, point separation, and recovery of the norm), and the extraction of the limit uses compactness of the finite-dimensional dual unit ball (For n≥1 every bounded sequence in Rn has a convergent subsequence).

Two normalisations of the defining inequality. Putting α=1/λ shows that the displayed inequality is equivalent to ∥x−αAx∥≥∥x∥ for all α>0 and x∈D(A). Since λx=(λI−A)x+Ax, the inequality ∥(λI−A)x∥≥λ∥x∥ is in turn equivalent to the one-sided estimate λ∥x∥≤∥(λI−A)x∥ used below.

Injectivity and the inverse bound. If (λI−A)x=0 for some λ>0 and x∈D(A), then λ∥x∥≤∥(λI−A)x∥=0, so x=0: each λI−A is injective. If z=(λI−A)x lies in the range, then ∥x∥≤λ−1∥z∥, so the inverse defined on the range satisfies ∥(λI−A)−1z∥≤λ−1∥z∥. No surjectivity onto X, no closedness of A and no density of D(A) is asserted, and none is implied.

The real-part form on a Hilbert space. Let X be a Hilbert space. If A is dissipative and x∈D(A), then for every λ>0 the expansion ∥(λI−A)x∥2=λ2∥x∥2−2λRe⁡⟨Ax,x⟩+∥Ax∥2 gives 2λRe⁡⟨Ax,x⟩≤∥Ax∥2, that is Re⁡⟨Ax,x⟩≤∥Ax∥2/(2λ); letting λ→∞ yields Re⁡⟨Ax,x⟩≤0. Conversely, if Re⁡⟨Ax,x⟩≤0 for all x∈D(A), the same expansion gives ∥(λI−A)x∥2≥λ2∥x∥2 for every λ>0, so A is dissipative. This real-part form is choice-free; the Hilbert-space vocabulary comes from Hilbert space.

The norm-duality form under HB. Assume the Hahn-Banach extension principle (The real dominated-extension principle as an additional hypothesis over ZF) and let x∈D(A). We claim that A is dissipative if and only if for every x∈D(A) there is x∗∈X∗ with ∥x∗∥=∥x∥, x∗(x)=∥x∥2 and Re⁡x∗(Ax)≤0.

Sufficiency. If such x∗ is given and λ>0, then λ∥x∥2=λRe⁡x∗(x)=Re⁡x∗((λI−A)x)+Re⁡x∗(Ax)≤Re⁡x∗((λI−A)x)≤∥x∗∥ ∥(λI−A)x∥=∥x∥ ∥(λI−A)x∥. For x≠0 this is λ∥x∥≤∥(λI−A)x∥; for x=0 it is trivial. Hence A is dissipative.

Necessity. Fix x∈D(A); for x=0 take x∗=0, so assume x≠0 and put M:=span⁡{x,Ax}, a subspace of finite dimension at most two over the scalar field K. For each positive integer λ=n the vector (λI−A)x is nonzero, because (λI−A) is injective. Construct a sequence yn∈M∗ without simultaneously choosing functionals on X. Fix a basis of the finite-dimensional space M. The coordinate vectors of functionals of norm at most one form a closed bounded subset of a finite real coordinate space: ∣y(u)∣≤∥u∥ for every u∈M is an intersection of closed conditions, and each basis evaluation is bounded. For each n, intersect this set with y((nI−A)x)=∥(nI−A)x∥. The intersection is nonempty by Relative dual norming, point separation, and recovery of the norm applied to M, and compact by Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line. Select its lexicographically least coordinate vector by minimizing its real coordinates successively; each minimum exists because the corresponding projected compact set is nonempty. This finite deterministic procedure defines yn for all n, with norm one and the required norming identity, without Countable Choice. Write yλ=yn, λ=n, below. Then Re⁡yλ(Ax)=λRe⁡yλ(x)−∥(λI−A)x∥≤λ∣yλ(x)∣−λ∥x∥≤0, and likewise yλ(x)=∥(λI−A)x∥/λ+yλ(Ax)/λ, where ∣∥(λI−A)x∥/λ−∥x∥∣≤∥Ax∥/λ→0 and ∣yλ(Ax)∣≤∥Ax∥; hence yλ(x)→∥x∥.

Passing to a subsequence. The restrictions yn lie in the unit ball of the dual of the finite-dimensional space M, which is sequentially compact: after choosing coordinates for M∗, the coordinates of a functional amount to a bounded sequence in a Euclidean space, and For n≥1 every bounded sequence in Rn has a convergent subsequence extracts a convergent subsequence. Take λn→∞ along a subsequence on which yλn converges to some y∈M∗. Then ∥y∥≤1, Re⁡y(Ax)≤0 (a closed condition), and y(x)=lim⁡nyλn(x)=∥x∥; consequently ∥y∥=1 because ∣y(x)∣=∥x∥ with x≠0.

Extension to X. The real part g:=Re⁡y is a real-linear functional on the real vector space M with ∣g(u)∣≤∥u∥ for u∈M; here the real structure of X is the one underlying the complex case as well. Apply HB, with the sublinear functional p(u)=∥u∥, to extend g to a real-linear G:X→R satisfying G(u)≤∥u∥ for all u∈X; then ∣G(u)∣≤∥u∥ by applying the inequality to −u. In the real case set x~:=G. In the complex case set x~(u):=G(u)−iG(iu); then x~(iu)=G(iu)+iG(u)=ix~(u); together with real linearity this proves complex linearity, and its real part is G. For ∥u∥≤1 put z=x~(u). If z≠0, take c=z‾/∣z∣, so ∣c∣=1 and x~(cu)=cz=∣z∣ is real. Thus ∣z∣=G(cu)≤∥cu∥=∥u∥≤1; if z=0 the same bound is immediate. Thus ∥x~∥≤1 in either case, and x∗:=∥x∥ x~ satisfies ∥x∗∥=∥x∥ because x~(x), having real part G(x)=g(x)=∥x∥ and modulus at most ∥x∥, equals the positive real number ∥x∥. Finally Re⁡x∗(Ax)=∥x∥ G(Ax)=∥x∥Re⁡y(Ax)≤0, as required. The definition and both elementary forms are choice-free; only the norm-duality form uses HB and the finite-dimensional compactness above.

Depends on

Used by

Dependency tree · two levels

63 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