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

Non-invertible elliptic shifts form a discrete set in the self-adjoint case

Statement

Assume the Axiom of Choice and Countable Choice. In the symmetric case of The L2 operator associated with a symmetric elliptic form, let the scalar field be K∈{R,C} and let Ω be nonempty, bounded and open. Write L,D(L) for the symmetric-case operator. Define the complex Hilbert space H~:=L2(Ω;C) and the complex operator L~ as follows: if K=C, set L~=L; if K=R, use the canonical isometric identification L2(Ω;R)C≅L2(Ω;C) and set L~=LC, the complexification LC(u+iv)=Lu+iLv on D(L)+iD(L) (The complex L2 pairing on equivalence classes, Complex Lp classes and Euclidean test-function conventions, Complexification as C⊗RV with its canonical real-linear embedding, Complexification of a real-linear map, The symmetric elliptic form operator is self-adjoint with compact resolvent). Let {λj} be the eigenvalues of Discrete spectrum of a symmetric elliptic Dirichlet operator, repeated according to multiplicity. For every real λ, the base-field operator L−λ:D(L)→L2(Ω;K) is bijective with bounded inverse if and only if λ∉{λj}. For such λ the inverse Rλ:=(L−λ)−1, in the adopted L−λ convention, is given by the convergent series Rλf=∑j≥1(f,ej)L2λj−λ ej(f∈L2(Ω;K)), which converges in L2(Ω;K) and in H01(Ω;K), and ∥Rλ∥=1/dist⁡(λ,{λj}). In the real case this inverse complexifies to (L~−λ)−1 with the same operator norm, and conversely the complex resolvent at a real λ restricts to the real inverse. Finally, the complex spectrum is σ(L~)={λj}: a closed discrete subset of R, bounded below, unbounded above, with no finite accumulation point; the nonreal resolvent exclusion follows from Resolvent of a self-adjoint operator: nonreal resolvents and the estimate.

Facts & Assumptions

Given: the Axiom of Choice and Countable Choice; a nonempty bounded open set Ω⊆Rn; the symmetric divergence-form case with operator L and form a; the orthonormal eigenbasis {ej} and nondecreasing eigenvalue list λj→+∞ of the discrete spectral theorem; a real λ; and f∈L2(Ω).

[F1]

Eigenbasis expansion: for u∈H01(Ω) and g∈L2(Ω), u=∑j(u,ej)L2ej in H01 and g=∑j(g,ej)L2ej in L2, with ∥g∥L22=∑j∣(g,ej)L2∣2 and aμ(u,u)=∑j(λj+μ)∣(u,ej)L2∣2 (Eigenbasis expansion in the form norm, Discrete spectrum of a symmetric elliptic Dirichlet operator).

[F2]

The distinct eigenvalues of L are exactly the list {λj}, the list is nondecreasing with λj→+∞, and every weak eigenpair occurs there (Discrete spectrum of a symmetric elliptic Dirichlet operator, Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism).

[F3]

Form norm: aμ is a complete inner product on H01(Ω) equivalent to the standard Sobolev norm, with aμ(w,w)≥α∥w∥H012 for α=θ/2; also a is bounded on H01(Ω) and aμ(ej,ej)=λj+μ>0 for each normalized eigenfunction (A sufficiently large shift is coercive, Hilbert space, The L2 operator associated with a symmetric elliptic form, The shifted elliptic solution operator).

[F4]

Resolvent convention: for a complex operator L~, membership in the resolvent set means bijectivity of L~−λ with an everywhere-defined bounded inverse, whose negative is the library resolvent (λ−L~)−1 (Resolvent and spectrum of an unbounded operator, The operator norm as the least bound and as the unit-sphere or unit-ball supremum). In the real case the canonical Hilbert complexification has ∥u+iv∥2=∥u∥2+∥v∥2, so a real bounded inverse complexifies to a bounded inverse with the same norm (The symmetric elliptic form operator is self-adjoint with compact resolvent).

[F5]

Nonreal resolvent exclusion: L~ is self-adjoint on the complex Hilbert space H~, so every nonreal z belongs to its resolvent set and σ(L~)⊆R (The symmetric elliptic form operator is self-adjoint with compact resolvent, Resolvent of a self-adjoint operator: nonreal resolvents and the estimate).

Proof

technique · direct
1.1F1F2F4givenalgebra

The candidate series. Suppose λ∉{λj}. Since λj→+∞ and the distinct eigenvalues have no finite accumulation point, the set of distinct eigenvalues is closed and its distance δ:=dist⁡(λ,{λj}) to λ is positive. Set cj:=(f,ej)L2(λj−λ)−1. Then ∣cj∣≤δ−1∣(f,ej)L2∣, and [F1] gives ∑j∣cj∣2≤δ−2∑j∣(f,ej)L2∣2=δ−2∥f∥L22<∞; hence u:=∑jcjej converges in L2(Ω) with ∥u∥L2≤δ−1∥f∥L2.

2.1F1F2F3step 1.1givenalgebra

Strong form convergence and the equation. For M<N, form orthogonality of the eigenfunctions gives aμ(uN−uM,uN−uM)=∑M<j≤N(λj+μ)∣cj∣2. The ratio (λj+μ)(λj−λ)−2 is bounded over j (the denominator is nonzero and quadratic growth dominates the linear numerator), so Parseval [F1] gives ∑j(λj+μ)∣cj∣2≤C∑j∣(f,ej)L2∣2=C∥f∥L22<∞. Its tails tend to zero, so (uN) is Cauchy in the aμ norm; by [F3] this norm is complete and equivalent to H01, hence uN converges strongly in H01 to some u~. The continuous inclusion H01↪L2 and the L2 convergence of step 1.1 identify u~=u, so u∈H01 and uN→u strongly there. For each v∈H01(Ω), boundedness of a and the eigenrelations give a(u,v)=lim⁡Na(uN,v)=lim⁡N∑j≤N[(f,ej)L2+λcj](ej,v)L2=(f,v)L2+λ(u,v)L2, where the last equality uses the L2 basis expansions of f, u and v. Thus a(u,v)=(f+λu,v)L2 for all v, so u∈D(L) and (L−λ)u=f.

3.1F2step 1.1step 2.1given

Bijectivity. If λ=λk for some k, the eigenfunction ek≠0 satisfies (L−λk)ek=0, so L−λ is not injective and hence not bijective. If λ∉{λj}, step 2.1 produces a solution of (L−λ)u=f for every f∈L2(Ω), so L−λ is surjective; it is injective, because (L−λ)u=0 makes u a weak eigenfunction with eigenvalue λ, forcing λ∈{λj} by [F2] or u=0. The solution estimate of step 1.1 gives ∥(L−λ)−1f∥2≤δ−1∥f∥2, so L−λ is bijective with bounded inverse exactly for λ∉{λj}.

4.1F1F4step 1.1step 3.1givenalgebra

The inverse series and its norm. For λ∉{λj} the series of step 1.1 has coefficients (f,ej)L2(λj−λ)−1, so the solution is Rλf=∑j(f,ej)L2(λj−λ)−1ej, converging in L2 and, by step 2.1, with H01 membership; its L2 norm satisfies ∥Rλf∥L22=∑j∣(f,ej)L2∣2∣λj−λ∣−2≤δ−2∥f∥L22. Choose k with ∣λk−λ∣=δ (attained because the eigenvalue set is closed); testing at f=ek gives ∥Rλek∥L2=1/δ, so the operator norm is exactly ∥Rλ∥=1/δ=1/dist⁡(λ,{λj}).

5.1F2F4F5step 3.1step 4.1given∎

Complex spectrum. By [F5], every nonreal scalar is in ρ(L~). For a real λ∉{λj}, step 3.1 gives a bounded inverse for L−λ over the base field; if K=C this is directly the complex resolvent, while if K=R its complexification is a bounded inverse of L~−λ. Conversely, each λj is an eigenvalue, so L~−λj is not injective (in the real case, complexify its nonzero real eigenfunction). Therefore σ(L~)={λj}, which is discrete with no finite accumulation point because λj→+∞, bounded below by λ1≥−β from the discrete spectral theorem, and unbounded above because λj→+∞.

Depends on

Used by

Dependency tree · two levels

99 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