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.

Closed sectorial form and its associated operator

Definition

Let H be a complex Hilbert space with inner product (⋅,⋅) linear in the first argument and conjugate-linear in the second (Hilbert space, Real and complex inner-product spaces and their induced length), and let V⊆H be a dense linear subspace carrying a Hilbert norm ∥⋅∥V whose inclusion V↪H is continuous (The Sobolev space H1 is a Hilbert space; the standard instance is V=H01(Ω)⊆H=L2(Ω)). A sesquilinear form a:V×V→C, linear in the first argument and conjugate-linear in the second (Bounded, coercive and symmetric sesquilinear forms), is a closed sectorial form on V⊆H if:

(i) a is bounded on V: there is C<∞ with ∣a(u,v)∣≤C∥u∥V∥v∥V for all u,v∈V;

(ii) there are M≥0 and θ∈[0,π/2) with Re⁡a(u,u)≥−M∥u∥H2,∣Im⁡a(u,u)∣≤tan⁡θ (Re⁡a(u,u)+M∥u∥H2) for every u∈V;

(iii) V is complete for the shifted form norm ∥u∥a,M2:=Re⁡a(u,u)+M∥u∥H2+∥u∥H2, By (ii) the square is nonnegative and ∥u∥H≤∥u∥a,M, so ∥u∥a,M=0 only for u=0; condition (iii) is the closedness of the form. The Hermitian pairing b(u,v)=(a(u,v)+a(v,u)‾)/2+(M+1)(u,v)H has b(u,u)=∥u∥a,M2>0 for u≠0, so it is an inner product and this expression is its norm (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

Comparison with a prescribed form-domain norm. Under Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain), ∥⋅∥a,M is equivalent to ∥⋅∥V. The upper bound is ∥u∥a,M2≤(C+(M+1)∥ι∥2)∥u∥V2. The identity in the reverse direction has closed graph: convergence in either norm implies convergence in H, so the two limits agree. Both normed versions of V are Banach, and Closed graph theorem makes this inverse identity bounded, giving a positive lower comparison constant. Generation results below may instead take this norm equivalence as an explicit hypothesis, retaining only Countable Choice for Lax–Milgram.

The associated operator A of such a form, in the etA sign convention, is D(A):={u∈V: ∃ f∈H with a(u,v)=−(f,v) for all v∈V},Au:=f.

The vector f is unique, so A is well defined: if f,g both satisfy the relation, then (f−g,v)=0 for every v∈V; since V is dense in H and the inner product is continuous, (f−g,w)=0 for every w∈H, and testing w=f−g gives ∥f−g∥2=0. The operator A is linear (Unbounded linear operators: domain, graph and extension, Densely defined, closed and closable operators, and cores): if u1,u2∈D(A) with associated vectors f1,f2 and λ∈C, then a(u1+λu2,v)=a(u1,v)+λa(u2,v)=−(f1+λf2,v) for all v∈V, so u1+λu2∈D(A) with A(u1+λu2)=f1+λf2. The defining relation reads ⟨Au,v⟩=−a(u,v)(u∈D(A), v∈V), and is the only sign convention used on this page.

The form is coercive with constant α>0 when Re⁡a(u,u)≥α∥u∥V2 for all u∈V. A coercive form is closed: (iii) holds with explicit estimates, since (i) and coercivity give, with ι:V↪H the inclusion, α∥u∥V2≤∥u∥a,M2≤(C+(M+1)∥ι∥2)∥u∥V2.

Sign convention

The dictionary ⟨Au,v⟩=−a(u,v) fixes the orientation: for u∈D(A) the quadratic form of A is the negative of a, ⟨Au,u⟩=−a(u,u), so the sector condition (ii) says that the shifted operator M−A is accretive, Re⁡⟨(M−A)u,u⟩=Re⁡a(u,u)+M∥u∥H2≥0, and gives Re⁡⟨(A−M)u,u⟩≤0 for every u∈D(A). This is the convention in which etA solves u′=Au and the resolvent sector of A opens to the right; the opposite pairing a(u,v)=⟨Au,v⟩ is the Pazy-Lunardi convention for −A and is not used here.

Coercivity versus sectoriality

A coercive form satisfies (ii) with M=0 and θ=arctan⁡(C/α) at most, because Re⁡a(u,u)≥α∥u∥V2≥0 and ∣Im⁡a(u,u)∣≤C∥u∥V2. The sectorial condition is a one-sided quantitative hypothesis on Re⁡a and Im⁡a along the diagonal; the phrase "elliptic operator" is never used as a hypothesis (Real and imaginary parts, complex conjugation, and modulus).

Depends on

Used by

Dependency tree · two levels

49 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