Alphabeta Math
TheoremStatement: 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.

Self-adjoint nonpositive operators generate bounded analytic semigroups

Statement

Assume Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) for the cited integral and semigroup suppliers.

Let H be a complex Hilbert space and let A be a self-adjoint operator on H with dense domain (Symmetric, self-adjoint and essentially self-adjoint operators, Unbounded linear operators: domain, graph and extension) satisfying the quadratic nonpositivity ⟨Au,u⟩≤0 for every u∈D(A). Then:

(1) for every λ=a+ib with b≠0, ∥(λI−A)u∥≥∣b∣ ∥u∥ for all u∈D(A), λ∈ρ(A) and ∥R(λ,A)∥≤1/∣b∣; more generally ∥R(λ,A)∥≤1/dist⁡(λ,{z:Re⁡z≤0}) for Re⁡λ>0;

(2) A is sectorial of angle π/2 in the etA convention (Sectorial operator with the semigroup sign convention) and generates a bounded analytic semigroup of angle π/2 which is contractive on [0,∞): ∥T(t)∥≤1. Dependent Choice is assumed for the semigroup suppliers; Countable Choice is inherited from the vocabulary item Symmetric, self-adjoint and essentially self-adjoint operators; the proof below uses no choice principle beyond Dependent Choice.

Facts & Assumptions

Given: A complex Hilbert space H, a densely defined self-adjoint operator A on H with ⟨Au,u⟩≤0 for all u∈D(A), and the numbers au:=⟨Au,u⟩/∥u∥H2 for u∈D(A)∖{0}.

[L1]

Self-adjointness means T=T∗: domains and values agree, under Countable Choice for the adjoint vocabulary (Symmetric, self-adjoint and essentially self-adjoint operators, Adjoint of a densely defined operator).

[L2]

For a densely defined T one has ran⁡(T−z)⊥=ker⁡(T∗−z‾) for every z∈C (The adjoint is well defined, closed, and reverses inclusions).

[L4]

Cauchy-Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[L5]

z∈ρ(T) when z−T:D(T)→H is bijective with bounded inverse RT(z)=(z−T)−1 (Resolvent and spectrum of an unbounded operator).

[L6]

A is sectorial of angle δ>0 at vertex 0 when Σπ/2+δ⊆ρ(A) with ∥R(λ,A)∥≤Mε/∣λ∣ on Σπ/2+δ−ε for every ε∈(0,δ) (Sectorial operator with the semigroup sign convention).

[L7]

The conditions (a)-(e) of the sectorial resolvent characterisation are equivalent, and when they hold the generated semigroup is the contour semigroup (Sectorial resolvent characterisation of bounded analytic semigroups).

[L8]

On a Hilbert space A is dissipative if and only if Re⁡⟨Au,u⟩≤0 for all u∈D(A), and Lumer-Phillips makes a densely defined dissipative A generate a contraction semigroup if and only if Ran⁡(λ0I−A)=H for some λ0>0 (Dissipative operator, Lumer-Phillips generation theorem).

[L9]

The contour semigroup generated by A is the unique strongly continuous semigroup generated by A within the class of exponentially bounded semigroups (The generator of the contour semigroup is the sectorial operator).

[L13]

Under Countable Choice, N⊥⊥=N‾ for every linear subspace N of a Hilbert space (The double orthogonal complement of a subspace is its closure).

Proof

technique · direct
1.1L1L3L4givenalgebra

The lower bound, injectivity and closed range. For u∈D(A)∖{0} put au:=⟨Au,u⟩/∥u∥H2≤0; by [L4], ∥(λI−A)u∥ ∥u∥H≥∣⟨(λI−A)u,u⟩∣=∣λ−au∣ ∥u∥H2≥dist⁡(λ,(−∞,0])∥u∥H2, so for every λ∉(−∞,0] the operator λI−A is injective with the lower bound ∥(λI−A)u∥≥dist⁡(λ,(−∞,0])∥u∥; moreover its range is closed, because if (λI−A)un→w then (un) is Cauchy, un→u and Aun=λun−(λI−A)un→λu−w, and closedness of A from [L3] and [L1] gives u∈D(A) with (λI−A)u=w.

2.1step 1.1L1L2L13givenalgebra

The range is dense. If v⊥Ran⁡(λI−A) for some λ∉(−∞,0], then [L2] with T=A and z=λ gives v∈ker⁡(A∗−λ‾); by self-adjointness [L1] this says Av=λ‾v, that is (λ‾I−A)v=0, and the lower bound of [step 1.1] at λ‾ (which also lies outside (−∞,0]) forces v=0; hence Ran⁡(λI−A)⊥={0} and, since the range is closed by [step 1.1], [L13] gives Ran⁡(λI−A)={0}⊥=H.

3.1step 1.1step 2.1L5L6givenalgebra

The resolvent bounds and sectoriality. By [step 2.1] and [step 1.1] the map λI−A is bijective with inverse bounded by 1/dist⁡(λ,(−∞,0]), so λ∈ρ(A) with ∥R(λ,A)∥≤1/dist⁡(λ,(−∞,0]) for every λ∉(−∞,0] by [L5]; for Re⁡λ>0 the distance to the smaller set (−∞,0] dominates the distance to {z:Re⁡z≤0}, which equals Re⁡λ, and for λ=a+ib with b≠0 the distance to the real set (−∞,0] is at least ∣b∣; finally, for ∣arg⁡λ∣≤π−ε the nearest point of (−∞,0] is the origin when ∣arg⁡λ∣≤π/2 and has distance ∣λ∣sin⁡(π−∣arg⁡λ∣)≥∣λ∣sin⁡ε otherwise, so ∥R(λ,A)∥≤Mε/∣λ∣ with Mε=1/sin⁡ε on Σπ−ε; since Σπ=C∖(−∞,0]⊆ρ(A), this is sectoriality of angle π/2.

4.1step 3.1L1L7L8L9givenalgebra∎

Generation and contractivity. By [step 3.1] A satisfies the sectorial resolvent condition with exponent π/2, so [L7] provides a bounded analytic semigroup T of angle π/2 generated by A; separately A is dissipative by [L8] because Re⁡⟨Au,u⟩≤0, and Ran⁡(λI−A)=H for every λ>0 by [step 3.1], so Lumer-Phillips [L8] makes A generate a strongly continuous contraction semigroup; that semigroup is bounded, hence exponentially bounded, and has generator A, so by uniqueness [L9] it coincides with the analytic semigroup T, giving ∥T(t)∥≤1 for t≥0; the argument assumes Dependent Choice and inherits Countable Choice from the adjoint vocabulary [L1] and uses no further choice principle beyond Dependent Choice.

Depends on

Used by

Dependency tree · two levels

83 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