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.

The symmetric elliptic form operator is self-adjoint with compact resolvent

Statement

Assume Countable Choice, together with the Axiom of Choice where the compactness clause is used. Let Ω⊆Rn be open and let L,D(L) be the symmetric-case operator of The L2 operator associated with a symmetric elliptic form, with D(L) dense and L symmetric and lower bounded (The associated elliptic operator is densely defined, symmetric and lower bounded); let its scalar field be K∈{R,C} and fix μ≥β. Then L is self-adjoint: L=L∗, the adjoint being taken in L2(Ω;K) for the densely defined operator L (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators). Moreover L+μ:D(L)→L2(Ω;K) is a bijection with inverse Kμ. If Ω is bounded and the Axiom of Choice holds, then Kμ is compact (The shifted solution operator is compact on L2). Under these boundedness and AC hypotheses, for K=C, L has compact resolvent: (L−λ)−1 is compact on L2(Ω;C) for every λ in the resolvent set of L (Resolvent and spectrum of an unbounded operator). For K=R, identify L2(Ω;C) canonically with L2(Ω;R)C by u+iv↔(u,v), and let LC(u+iv):=Lu+iLv on D(LC)=D(L)+iD(L) (Complexification as C⊗RV with its canonical real-linear embedding, Complexification of a real-linear map, Complex Lp classes and Euclidean test-function conventions). Then LC is self-adjoint and has compact resolvent: (LC−λ)−1 is compact on L2(Ω;C) for every λ in its resolvent set (Resolvent and spectrum of an unbounded operator).

Facts & Assumptions

Given: Countable Choice; the symmetric divergence-form case with form a and operator L; a fixed μ≥β; the shifted solution operator Kμ; and the field K∈{R,C}.

[F2]

Solution operator: aμ(Kμf,v)=(f,v)L2 for all v∈H01(Ω) and f∈L2(Ω), with aμ=a+μ(⋅,⋅)L2 bounded and coercive on H01(Ω) with constant α=θ/2 (The shifted elliptic solution operator, A sufficiently large shift is coercive, Zero-boundary Sobolev space as a norm closure).

[F3]

Range description: a(Kμf,v)=(f−μKμf,v)L2 for all v∈H01(Ω), so Kμf∈D(L) and L(Kμf)=f−μKμf (The L2 operator associated with a symmetric elliptic form).

[F4]

Lax--Milgram applies to bounded coercive sesquilinear forms on H01(Ω) and bounded conjugate-linear data; the shifted forms aμ±i(⋅,⋅)L2 in the complex case have the same real part as aμ (The Lax--Milgram theorem, Bounded, coercive and symmetric sesquilinear forms).

[F5]

Range criterion: a densely defined symmetric operator on a complex Hilbert space is self-adjoint if and only if ran⁡(T±i)=H (Range criterion for self-adjointness, Adjoint of a densely defined operator).

[F6]

Compactness: if Ω is bounded and the Axiom of Choice holds, the L2 realization of Kμ is compact, and a bounded operator times a compact operator is compact (The shifted solution operator is compact on L2, Compositions with a compact operator are compact, Compact linear operator, A bounded linear operator between normed spaces, The Axiom of Choice).

[F7]

Complex resolvent: for a densely defined operator L~ on a complex Hilbert space and λ in its resolvent set, L~−λ:D(L~)→HC is a bijection with bounded inverse (L~−λ)−1 (Resolvent and spectrum of an unbounded operator).

[F8]

Canonical Hilbert-space complexification. By the componentwise convention for complex L2, every complex class has a unique decomposition u+iv with real u,v∈L2(Ω;R). The map 1⊗u+i⊗v↦u+iv identifies (L2(Ω;R))C with L2(Ω;C); expanding the complex integral pairing gives ⟨u+iv,p+iq⟩C=(u,p)R+(v,q)R+i((v,p)R−(u,q)R),∥u+iv∥L2(C)2=∥u∥L2(R)2+∥v∥L2(R)2. Thus the identification is a complex-linear Hilbert isometry. For a real densely defined operator T, its complexification is TC(u+iv)=Tu+iTv on D(T)+iD(T) (Complexification as C⊗RV with its canonical real-linear embedding, Complexification of a real-linear map, The complex L2 pairing on equivalence classes, Complex Lp classes and Euclidean test-function conventions, L2 with the integral pairing is a Hilbert space, The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz, Real and complex inner-product spaces and their induced length, Hilbert space).

[F9]

If a real bounded operator S is compact, then its componentwise complexification is compact: for any bounded sequence uj+ivj, the real and imaginary sequences are bounded; compactness of S and the metric compactness equivalences give a subsequence on which Suj converges, then a further subsequence on which Svj converges. Boundedness follows from ∥SC(u+iv)∥2=∥Su∥2+∥Sv∥2≤∥S∥2∥u+iv∥2. AC supplies the Countable and Dependent Choice hypotheses of the metric compactness equivalences. This applies to the compact real shifted inverse Kμ (For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice, AC supplies the countable and dependent choices used in Banach integration).

Proof

technique · direct
1.1F2F3given

Surjectivity of L+μ. Let f∈L2(Ω) and put u:=Kμf∈H01(Ω); by [F3] u∈D(L) and Lu=f−μu, that is (L+μ)u=f. Hence ran⁡(L+μ)=L2(Ω), and (L+μ)u=0 forces u=Kμ0=0 by [F2], so L+μ is a bijection of D(L) onto L2(Ω) with inverse Kμ.

1.2F2F3F4given

The complex case: ran⁡(L+μ±i)=L2(Ω). Assume K=C and let f∈L2(Ω). The forms aμ±(u,v):=aμ(u,v)±i(u,v)L2 are bounded and coercive on H01(Ω), because Re⁡aμ±(u,u)=Re⁡aμ(u,u)≥α∥u∥H012 and boundedness is inherited from aμ and the L2 pairing; applying [F4] to the bounded conjugate-linear datum v↦(f,v) gives a unique u±∈H01(Ω) with aμ(u±,v)±i(u±,v)L2=(f,v)L2 for every v∈H01(Ω), which rearranges to a(u±,v)=(f−μu±∓iu±,v)L2. Hence u±∈D(L) with (L+μ±i)u±=f, so both ranges are all of L2(Ω).

2.1F1F5step 1.2given

Complex case: self-adjointness. Assume K=C and put T:=L+μ on the dense domain D(L). By [F1] the operator T is densely defined and symmetric, and by step 1.2 ran⁡(T±i)=L2(Ω); the range criterion [F5] then makes T self-adjoint, and L=T−μ is self-adjoint because subtracting the real scalar μ preserves the adjoint relation D(L∗)=D(T∗)=D(L) and L∗=T∗−μ.

2.2F1step 1.1given

Real case: self-adjointness. Assume K=R. By step 1.1 the densely defined symmetric operator T=L+μ has full range L2(Ω;R). Let v∈D(T∗) and put w:=T∗v∈L2(Ω;R); by surjectivity choose u∈D(T) with Tu=w. Then for every z∈D(T), symmetry gives (Tz,v)=(z,T∗v)=(z,Tu)=(Tz,u), so v−u is orthogonal to ran⁡T=L2(Ω;R) and hence v=u∈D(T) with Tv=T∗v. Therefore D(T∗)=D(T) and T is self-adjoint, and so is L=T−μ.

3.1F8step 2.2givenalgebra

Complexification of the real branch. Write HC=L2(Ω;C)=HR+iHR using [F8], and define LC(u+iv)=Lu+iLv on D(L)+iD(L). Its domain is dense because D(L) is dense in the real space and each real and imaginary component can be approximated there. To check self-adjointness, let y=x+iz∈D(LC∗) and write LC∗y=p+iq. Testing the adjoint identity at real h∈D(L) gives (Lh,x)R−i(Lh,z)R=⟨LCh,y⟩C=⟨h,p+iq⟩C=(h,p)R−i(h,q)R. Thus x,z∈D(L∗)=D(L) and p=Lx, q=Lz. Hence y∈D(LC) and LC∗y=LCy. Conversely, the real self-adjoint identities give LC⊆LC∗, so equality holds.

4.1F6F7F8F9step 1.1step 2.1step 2.2step 3.1givenalgebra∎

Compact resolvent. If K=C, put L~=L and K~=Kμ; [F6] gives compactness of K~ when Ω is bounded. If K=R, put L~=LC and K~(u+iv)=Kμu+iKμv; [F6] makes Kμ compact on the real L2 space, and [F9] gives compactness of K~. By step 1.1 (componentwise in the real case), K~=(L~+μ)−1. In either case let λ lie in the resolvent set of L~, write R=(L~−λ)−1 and c=λ+μ. Using the inverse relations on their domains gives R−K~=R[(L~+μ)−(L~−λ)]K~=cRK~, and also R−K~=K~[(L~+μ)−(L~−λ)]R=cK~R. Therefore Q:=I−cK~ is boundedly invertible, with Q−1=I+cR, since (I−cK~)(I+cR)=I=(I+cR)(I−cK~) by these identities. On D(L~) one has L~−λ=(L~+μ)Q, whence (L~−λ)−1=Q−1K~=(I+cR)K~. This is a bounded operator composed with the compact K~, so it is compact. The complex resolvent definition applies to L~ in both scalar-field cases.

Depends on

Used by

Dependency tree · two levels

117 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