Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Discrete spectrum and min–max principle for a compact coercive form

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let H be an infinite-dimensional real or complex Hilbert space, let V be a real or complex Hilbert space over the same field, and let J:V→H be an injective, bounded, compact linear map with dense range (Compact linear operator). Let a:V×V→K be bounded, Hermitian and coercive with constants M,α>0 (Bounded, coercive and symmetric sesquilinear forms). Then there is a sequence of eigenpairs (λj,ej)j≥1 such that 0<λ1≤λ2≤⋯ ,λj⟶+∞, where each eigenvalue is repeated according to multiplicity, ej∈V, ∥Jej∥H=1, and a(ej,v)=λj(Jej,Jv)H(v∈V). The vectors Jej form an orthonormal basis of H, and ej/λj form an orthonormal basis of V for the energy inner product a. In particular, for v∈V, ∥Jv∥H2=∑j≥1∣(Jv,Jej)H∣2,a(v,v)=∑j≥1λj∣(Jv,Jej)H∣2, and the Rayleigh quotient R(v):=a(v,v)/∥Jv∥H2 satisfies the attained min–max identity λm=min⁡S⊆Vdim⁡S=mmax⁡v∈S∖{0}R(v)(m≥1). This is the abstract continuous spectral interface used below. The published elliptic suppliers on the Dirichlet branch have their own stated domain and axiom hypotheses; this theorem does not enlarge those imported interfaces.

Facts & Assumptions

Given: Countable Choice, the Hilbert spaces V,H, the injective compact inclusion J:V→H with dense range, and the bounded Hermitian coercive form a.

[F1]

Boundedness, Hermitian symmetry and coercivity mean ∣a(u,v)∣≤M∥u∥V∥v∥V, a(u,v)=a(v,u)‾, and Re⁡a(u,u)≥α∥u∥V2 (Bounded, coercive and symmetric sesquilinear forms).

[F2]

Countable Choice permits Lax–Milgram for a bounded coercive form on a Hilbert space (The Lax--Milgram theorem, The Axiom of Countable Choice (ACω)).

[F3]

A compact operator composed after a bounded operator is compact (Compact linear operator, Compositions with a compact operator are compact).

[F4]

A compact self-adjoint operator on a Hilbert space has finite-dimensional nonzero eigenspaces, at most countably many nonzero eigenvalues accumulating only at zero, and the closed span of its nonzero eigenspaces is the orthogonal complement of its kernel. Its orthogonal eigenprojections give a norm convergent spectral expansion (Spectral theorem for compact self adjoint operators).

[F5]

A complete orthonormal family in a Hilbert space gives norm convergence of its Fourier sums and Parseval's identity (Fourier expansion in a Hilbert space, Parseval equivalences for an orthonormal family).

[F6]

A closed subspace of a Hilbert space has an orthogonal decomposition (Orthogonal decomposition by a closed subspace).

[F7]

A linear map from an m-dimensional space to an (m−1)-dimensional space has a nonzero kernel (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

Proof

technique · direct

Given: The data of the statement and CJ:=∥J∥.

1.1F1F2givenchoose

For f∈H, the functional v↦(f,Jv)H is bounded on V because ∣(f,Jv)H∣≤CJ∥f∥H∥v∥V. Apply [F2] to obtain a unique Sf∈V satisfying a(Sf,v)=(f,Jv)H for every v∈V. Uniqueness makes S:H→V linear.

2.1F1step 1.1algebra

Testing with v=Sf and using coercivity gives α∥Sf∥V2≤a(Sf,Sf)=Re⁡(f,JSf)H≤∣(f,JSf)H∣≤CJ∥f∥H∥Sf∥V. If Sf≠0, divide by α∥Sf∥V; if Sf=0 the same bound is immediate. Thus S is bounded from H to V with ∥Sf∥V≤(CJ/α)∥f∥H.

2.2F1F3step 1.1givenalgebra

Set T:=JS:H→H. By [F3], T is compact. For f,g∈H, testing the defining equations for Sf and Sg at Sg and Sf respectively and using Hermitian symmetry gives (Tf,g)H=(f,Tg)H; hence T is self-adjoint. Also (f,Tf)H=a(Sf,Sf)≥0. If Tf=0, injectivity of J gives Sf=0, so (f,Jv)H=0 for every v∈V by step 1.1. Density of J(V) then gives f=0. Thus T is positive and injective.

3.1F2F4step 2.2givenchoose

Apply [F4] to T. Its nonzero eigenvalues are positive because T is positive, and its kernel is zero by step 2.2; therefore the eigenspaces of its nonzero eigenvalues span H. There are infinitely many eigenvalue occurrences, because each eigenspace has finite dimension while H is infinite-dimensional. Write d(ν):=dim⁡Eν. Recursively list a largest eigenvalue among those whose multiplicity has not yet been exhausted: after any finite number of entries the remaining set is nonempty, and if ρ>0 is any remaining value, only finitely many remaining eigenvalues are at least ρ, each with finite multiplicity. Iterated trichotomy gives a maximum of these finitely many occurrences, which is then maximal in the whole remainder. The resulting sequence lists every ν exactly d(ν) times, since only finitely many occurrences are at least its value. Thus μ1≥μ2≥⋯>0 includes all multiplicities. Compactness gives μj→0; Countable Choice selects an orthonormal basis of each finite-dimensional eigenspace, and these bases give the ordered family (fj) [F2, F4].

4.1step 3.1step 1.1givenalgebra

Since Tfj=J(Sfj)=μjfj and J is injective, each fj belongs to the image J(V). Identify it with its unique preimage ej∈V. The equation a(Sfj,v)=(fj,Jv)H and Sfj=μjej imply a(ej,v)=μj−1(Jej,Jv)H(v∈V). Set λj:=μj−1. Then 0<λ1≤λ2≤⋯, λj→+∞, ∥Jej∥H=1, and the displayed form eigenrelation holds.

5.1F1F6step 3.1step 4.1given

By [F1], the energy norm induced by a is equivalent to ∥⋅∥V, so V is complete in that norm. Put ϕj:=ej/λj. The eigenrelation in step 4.1 gives a(ϕi,ϕj)=δij, so (ϕj) is an orthonormal family in V with inner product a. If v∈V is a-orthogonal to every ϕj, the same eigenrelation gives (Jv,Jej)H=0 for every j. The vectors (Jej) are an orthonormal basis of H by step 3.1, so Jv=0; injectivity of J gives v=0. Thus the closed span of (ϕj) has zero orthogonal complement in V, and [F6] implies it is all of V.

6.1F5step 4.1step 5.1givenalgebra

Parseval in H for (Jej) and in V for (ϕj) yields, for every v∈V, ∥Jv∥H2=∑j∣(Jv,Jej)H∣2,a(v,v)=∑j∣a(v,ϕj)∣2=∑jλj∣(Jv,Jej)H∣2. For v≠0, ∥Jv∥H>0 by injectivity, so R(v) is the weighted average of the λj with weights ∣(Jv,Jej)H∣2.

7.1step 6.1givenalgebra

Let Em:=span⁡{e1,…,em}. Step 6.1 shows R(v)≤λm for every nonzero v∈Em, with equality at em; hence max⁡v∈Em∖{0}R(v)=λm. This gives one inequality in the min–max identity, attained by Em.

8.1F7F8step 6.1step 7.1givenalgebra∎

Let S⊆V have dimension m. The map S→Km−1 taking v to ((Jv,Je1)H,…,(Jv,Jem−1)H) has a nonzero kernel by [F7]. For a nonzero vector v in that kernel, the expansion of step 6.1 has no terms with index below m, so R(v)≥λm. Thus the maximum Rayleigh quotient on every such S is at least λm. It is attained on the unit sphere by [F8], so the outer minimum is at least λm and equals the value from step 7.1.

Remarks

The proof uses Countable Choice through Lax–Milgram and the compact self-adjoint spectral theorem. It does not use the Axiom of Choice. A specified coercive shift of a lower-bounded Hermitian form is handled by applying this theorem to the shifted form and subtracting the same shift from every continuous and discrete eigenvalue; the ordering is unchanged.

Depends on

Used by

Dependency tree · two levels

118 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