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

Coercive sectorial forms define closed densely defined sectorial operators

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 a be a closed sectorial form on V⊆H with constants M,θ and associated operator A (Closed sectorial form and its associated operator). Choose any κ>0 satisfying the continuous embedding bound ∥u∥H≤κ∥u∥V for every u∈V; such a positive bound exists, including when H={0}. By the comparison clause of Closed sectorial form and its associated operator under Dependent Choice, the closed form norm ∥u∥a,M2:=Re⁡a(u,u)+(M+1)∥u∥H2 is equivalent to ∥u∥V2; fix ca>0 such that ∥u∥a,M2≥ca∥u∥V2. Then:

(1) A is closed and D(A) is dense in H;

(2) for every λ with Re⁡λ>M, the form aλ(u,v):=a(u,v)+λ(u,v) is coercive on V with constant βλ:=camin⁡{1,Re⁡λ−M}>0. The Lax-Milgram solution of a(u,v)+λ(u,v)=(f,v) is the unique u∈D(A) with (λI−A)u=f, and satisfies ∥u∥V≤κβλ−1∥f∥H,∥u∥H≤κ2βλ−1∥f∥H;

(3) A is sectorial with vertex M and every exponent δ<π/2−θ in the sense of Sectorial operator with the semigroup sign convention; in particular, ∥R(λ,A)∥≤Kε/∣λ−M∣ on M+Σπ/2+δ−ε;

(4) B:=A−MI generates a bounded analytic semigroup S on every sector Σδ with δ<π/2−θ, and T(z):=eMzS(z) is the analytic semigroup generated by A, with ∥T(z)∥≤Cδ′eMRe⁡z on each smaller sector Σδ′ with δ′<δ. If a is coercive with Re⁡a(u,u)≥α∥u∥V2, then ∥T(t)∥≤e−αt/κ2 for t≥0. Countable Choice is inherited from The Lax--Milgram theorem; no additional choice principle is used.

Facts & Assumptions

Given: A closed sectorial form a on V⊆H with constants M≥0, θ∈[0,π/2), associated operator A, and a positive embedding bound κ>0 with ∥u∥H≤κ∥u∥V for all u∈V; a form bound C on V; and a constant ca>0 with ∥u∥a,M2:=Re⁡a(u,u)+(M+1)∥u∥H2≥ca∥u∥V2.

[L1]

The associated operator is D(A)={u∈V:∃f∈H with a(u,v)=−(f,v) ∀v∈V} and Au=f (Closed sectorial form and its associated operator).

[L2]

V⊆H is a dense linear subspace carrying a Hilbert norm ∥⋅∥V whose inclusion into H is continuous, and the chosen positive constant κ satisfies ∥u∥H≤κ∥u∥V; the shifted form norm satisfies ∥u∥a,M2=Re⁡a(u,u)+M∥u∥H2+∥u∥H2 (Closed sectorial form and its associated operator).

[L3]

A form is coercive with constant α>0 when Re⁡a(u,u)≥α∥u∥2 for all u (Bounded, coercive and symmetric sesquilinear forms).

[L4]

Lax-Milgram assumes Countable Choice, and for a bounded coercive form on a Hilbert space with coercivity constant α and a bounded conjugate-linear functional F it produces a unique u with a(u,v)=F(v) for all v and the estimate ∥u∥≤∥F∥/α (The Lax--Milgram theorem, The Axiom of Countable Choice (ACω)).

[L5]

For u∈D(A) one has ⟨Au,u⟩=−a(u,u) (The sectorial form angle controls the numerical range of its operator).

[L6]

For u∈D(A) one has ⟨(A−M)u,u⟩∈−Sθ‾, where Sθ‾ is the closed sector of half-angle θ around the positive real axis (The sectorial form angle controls the numerical range of its operator).

[L7]

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

[L8]

The resolvent set is open: if λ0∈ρ(A) and ∣λ−λ0∣∥R(λ0,A)∥<1 then λ∈ρ(A) (Resolvent identity and holomorphy for a closed operator, Resolvent and spectrum of a closed operator on a Banach space).

[L9]

The conditions (a)-(e) of the sectorial resolvent characterisation are equivalent; in particular condition (e) holds exactly when A has a bounded analytic semigroup extension and generates a bounded strongly continuous semigroup (Sectorial resolvent characterisation of bounded analytic semigroups).

[L12]

If the equivalent conditions hold, the generated semigroup is the contour semigroup (Sectorial resolvent characterisation of bounded analytic semigroups).

[L10]

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).

[L11]

On a Hilbert space an operator is dissipative if and only if Re⁡⟨Ax,x⟩≤0 for every x∈D(A); and Lumer-Phillips: a densely defined dissipative operator generates a strongly continuous contraction semigroup if and only if Ran⁡(λ0I−A)=X for some λ0>0 (Dissipative operator, Lumer-Phillips generation theorem).

[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.1L1L2L3L4givenalgebra

Coercivity and the resolvent solution. Put q(u):=Re⁡a(u,u)+M∥u∥H2≥0, so that ∥u∥a,M2=q(u)+∥u∥H2 and, for Re⁡λ>M, Re⁡aλ(u,u)=q(u)+(Re⁡λ−M)∥u∥H2≥min⁡{1,Re⁡λ−M}∥u∥a,M2≥βλ∥u∥V2, while ∣aλ(u,v)∣≤(C+∣λ∣κ2)∥u∥V∥v∥V and the functional F(v):=(f,v)H is conjugate-linear with ∥F∥≤κ∥f∥H; Lax-Milgram on the Hilbert space V therefore gives, for each f∈H, a unique u∈V with aλ(u,v)=(f,v)H for all v∈V and the bounds ∥u∥V≤κβλ−1∥f∥H and ∥u∥H≤κ2βλ−1∥f∥H, and rewriting the weak equation as a(u,v)=−(λu−f,v) for all v gives u∈D(A) with Au=λu−f, that is (λI−A)u=f; conversely every u∈D(A) with (λI−A)u=f satisfies the weak equation and is therefore this unique solution.

2.1step 1.1L1givenalgebra

Closedness of A. Fix a real λ>M; by [step 1.1] the map λI−A:D(A)→H is bijective with ∥u∥H≤κ2βλ−1∥(λI−A)u∥H, so if un∈D(A) with un→u and Aun→g then λun−Aun→λu−g and un=R(λ,A)(λun−Aun)→R(λ,A)(λu−g); comparing limits gives u=R(λ,A)(λu−g)∈D(A) and (λI−A)u=λu−g, that is Au=g, so the graph of A is closed.

2.2step 1.1L1L2L5L13givenalgebra

Density of D(A). Let f∈H satisfy (f,w)=0 for every w∈D(A); by [step 1.1] with a real λ>M there is u∈D(A) with (λI−A)u=f, so (f,u)=0 while, by [L5], Re⁡(f,u)=λ∥u∥H2+Re⁡a(u,u)=q(u)+(λ−M)∥u∥H2≥(λ−M)∥u∥H2≥0; hence u=0 and then (f,v)=aλ(u,v)=0 for every v∈V; since V is dense in H by [L2], continuity of the inner product gives f=0, so D(A)⊥={0} and [L13] gives D(A)‾=H.

3.1step 1.1step 2.1L6L7L8givenalgebra

Sectoriality with vertex M. For u∈D(A)∖{0} the normalised value zu:=⟨Au,u⟩/∥u∥H2 lies in the closed sector M−Sθ‾ by [L6], so for λ outside M−Sθ‾ one has dist⁡(λ,M−Sθ‾)>0 and, by [L7], ∥(λI−A)u∥ ∥u∥H≥∣⟨(λI−A)u,u⟩∣=∣λ−zu∣ ∥u∥H2≥dist⁡(λ,M−Sθ‾)∥u∥H2; thus λI−A is injective and ∥R(λ,A)g∥H≤∥g∥H/dist⁡(λ,M−Sθ‾) on every surjectivity point λ. Let Ω:=C∖(M−Sθ‾) and S:={λ∈Ω:λI−A is surjective}: S is nonempty because (M,∞)⊆S by [step 1.1]; S is open in Ω because at λ0∈S injectivity and surjectivity give ∥R(λ0,A)∥≤1/dist⁡(λ0,M−Sθ‾) and [L8] applies; S is closed in Ω because for λn∈S with λn→λ∈Ω the resolvent identity gives ∥R(λn,A)f−R(λm,A)f∥≤∣λn−λm∣(2/dist⁡(λ,M−Sθ‾))2∥f∥, so un:=R(λn,A)f converges to some u, and λnun−Aun=f with closedness of A from [step 2.1] gives u∈D(A) and (λI−A)u=f; since Ω is connected (the complement of a closed sector of opening angle 2θ<π), S=Ω; finally, for δ<π/2−θ and λ=M+reiα with ∣α∣≤π/2+δ−ε the angular distance from λ to M−Sθ‾ is at least π/2−θ−δ+ε, so dist⁡(λ,M−Sθ‾)≥∣λ−M∣cos⁡(θ+δ−ε) and hence ∥R(λ,A)∥≤Kε/∣λ−M∣ with Kε:=1/cos⁡(θ+δ−ε) on M+Σπ/2+δ−ε, which is sectoriality of vertex M and every exponent δ<π/2−θ.

4.1step 2.1step 2.2step 3.1L9L12L10givenalgebra

The shifted operator and the generated semigroup. Since D(B)=D(A) is dense and B is closed by [step 2.1] and [step 2.2], and since λI−B=(λ+M)I−A shows that B is sectorial with vertex 0 and every exponent δ<π/2−θ together with the same Kε/∣λ∣ bound, the characterisation theorem [L9, L12] provides a bounded analytic semigroup S of angle δ generated by B=A−MI on every such sector; the family T(z):=eMzS(z) satisfies T(0)=I, T(z+w)=T(z)T(w), is norm-holomorphic and strongly continuous, is bounded by Cδ′eMRe⁡z on each Σδ′, and has generator A because for x∈D(A) the difference quotient tends to Bx+Mx=Ax; conversely S(t)=e−MtT(t) shows that a convergent T difference quotient implies a convergent S difference quotient, so the generator domain is exactly D(A); it is therefore the analytic semigroup generated by A, unique among exponentially bounded semigroups by [L10].

5.1step 1.1step 2.2step 4.1L5L10L11givenalgebra∎

The coercive case. If Re⁡a(u,u)≥α∥u∥V2, then for u∈D(A) one has Re⁡⟨Au,u⟩=−Re⁡a(u,u)≤−α∥u∥V2≤−ακ−2∥u∥H2 by [L5] and ∥u∥H≤κ∥u∥V, so A0:=A+ακ−2I is densely defined by [step 2.2] and dissipative by [L11], and Ran⁡(λ0I−A0)=Ran⁡((λ0−ακ−2)I−A)=H for λ0:=M+ακ−2+1 because λ0−ακ−2=M+1>M lies in ρ(A) by [step 1.1]; hence A0 generates a contraction semigroup S′ by [L11], and the family t↦e−ακ−2tS′(t) is an exponentially bounded strongly continuous semigroup with generator A, so it equals T by [L10] and ∥T(t)∥≤e−αt/κ2 for t≥0; the argument assumes Dependent Choice and inherits Countable Choice from the Lax-Milgram step [step 1.1] and uses no further choice principle beyond Dependent Choice.

Depends on

Used by

Dependency tree · two levels

95 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