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.

The first Dirichlet eigenfunction by constrained minimisation

Statement

Assume the Axiom of Choice, the ultrafilter lemma, DC and HB (The Axiom of Choice, The ultrafilter extension principle (UL/BPI), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The real dominated-extension principle as an additional hypothesis over ZF). Let n≥1, let Ω⊆Rn be a nonempty bounded open set, let E(u)=∫Ω∣Du∣2 dx on H01(Ω;R) (The notation Hk and the reserved zero-boundary symbol, Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure) and let S={u∈H01(Ω):∥u∥L2=1} (The space Lp(μ) as the quotient by null functions). Then S is nonempty and E attains its infimum λ1 on S. Every minimiser u0 is a weak eigenpair of the Dirichlet Laplacian, ∫ΩDu0⋅Dh dx=λ1∫Ωu0h dx(h∈H01(Ω)), with λ1=E(u0)>0 (Symmetric elliptic weak eigenpairs); some minimiser is nonnegative, and λ1 coincides with the first Dirichlet eigenvalue listed in Discrete spectrum of a symmetric elliptic Dirichlet operator for the principal Dirichlet form (The L2 operator associated with a symmetric elliptic form), the minimisers being exactly the elements of S∩Eλ1.

Facts & Assumptions

Given: A nonempty bounded open set Ω⊆Rn, the Dirichlet energy E(u)=∫Ω∣Du∣2 dx on H01(Ω;R), and the L2-unit sphere S={u∈H01(Ω):∥u∥L2=1}.

[F1]

Zero-boundary Sobolev space as a norm closure, Hk is a Hilbert space under the derivative-sum inner product, A closed subspace of a Banach space is Banach: H01(Ω) is the norm closure of Cc∞(Ω) in H1(Ω)=W1,2(Ω), hence a closed subspace of the Banach space H1(Ω) and itself a real Banach space with the H1 norm.

[F2]

W^{1,p}(Omega) is reflexive for 1<p<infinity, Closed subspaces of reflexive spaces are reflexive, Reflexivity is surjectivity of the canonical map: under the ultrafilter lemma, DC and HB the space W1,2(Ω) is reflexive, and under HB its closed subspace H01(Ω) is reflexive, hence a real reflexive Banach space.

[F3]

Convex and strictly convex functionals on a convex subset of a real vector space, A convex norm-lower-semicontinuous functional is weakly lower semicontinuous: E is convex, being the squared norm of the bounded linear map u↦Du composed with the convex square; it is continuous because ∣E(u)−E(v)∣≤∥Du−Dv∥L2(∥Du∥L2+∥Dv∥L2). By the convex-lower-semicontinuity lemma (Axiom of Choice) E is weakly sequentially lower semicontinuous on every nonempty convex subset of H01(Ω).

[F4]

Test function cutoffs and euclidean localization: since Ω is nonempty and open there is a nonzero φ∈Cc∞(Ω), for instance a cutoff equal to one on a neighbourhood of a chosen point; then u1:=φ/∥φ∥L2 lies in S, so S≠∅ and λ1:=inf⁡SE≤E(u1)<∞.

[F5]

The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction, Coercivity of the principal Dirichlet form, Dependent choice implies countable choice: since the bounded set Ω is bounded in every direction, Poincaré at p=2 gives a constant CP with ∥v∥L2≤CP∥Dv∥L2 for all v∈H01(Ω); by the coercivity lemma (Axiom of Choice and Countable Choice, the latter from DC) the model principal form satisfies E(v)=∥Dv∥L22≥(1+CP2)−1∥v∥H012.

[F6]

A bounded sequence in a reflexive Banach space has a weakly convergent subsequence: under the ultrafilter lemma, DC and HB every norm-bounded sequence in a real reflexive Banach space has a weakly convergent subsequence.

[F7]

Weak H^1 convergence plus Rellich preserves the L^2 unit normalisation: if Ω is bounded and open, (vj)⊆H01(Ω) is norm bounded with vj⇀v in H01(Ω) and ∥vj∥L2=1, then v∈H01(Ω) and ∥v∥L2=1.

[F8]

The Lagrange multiplier rule for finitely many regular constraints, Fréchet derivative between Banach spaces: let X be a real Banach space, U⊆X open, I:U→R Fréchet differentiable at u, and G:U→Rm of class C1 with DG(u) surjective; if u is a local minimiser or maximiser of I on the level set {G=G(u)}, then there is a unique λ∈Rm with DI(u)=∑iλiDGi(u).

[F9]

The absolute value preserves the L^2 norm and the Dirichlet energy on H^1_0: for every open Ω⊆Rn and real v∈H01(Ω), one has ∣v∣∈H01(Ω), ∥∣v∣∥L2=∥v∥L2 and ∫Ω∣D∣v∣∣2=∫Ω∣Dv∣2.

[F10]

The Rayleigh principle for the first Dirichlet eigenvalue, Discrete spectrum of a symmetric elliptic Dirichlet operator, The L2 operator associated with a symmetric elliptic form, Symmetric elliptic weak eigenpairs: in the symmetric case over a bounded open set the discrete spectral theorem provides the nondecreasing eigenvalue list λ1≤λ2≤⋯ of the principal Dirichlet form and an orthonormal basis {ej} of L2(Ω) of weak eigenfunctions; the Rayleigh principle states that its first eigenvalue equals min⁡v≠0a0(v,v)/∥v∥L22 with a0(v,w)=∫ΩDv⋅Dw, the minimum being attained exactly on Eλ1∖{0}, and that it is positive whenever the form is coercive, as it is for the principal form by [F5].

Proof

technique · direct

Given: The set Ω, the energy E and the unit sphere S above.

1.1givenF1F2F3F4

By [F4] the set S is nonempty and λ1=inf⁡SE≤E(u1)<∞; by [F1] and [F2] the space H01(Ω) is a real reflexive Banach space with the H1 norm, and by [F3] the functional E is weakly sequentially lower semicontinuous on the convex set H01(Ω).

2.1step 1.1F6

Since 0≤λ1<∞, DC supplies a sequence vj∈S with E(vj)<λ1+1/j for j≥1, so E(vj)→λ1. Since ∥vj∥L2=1 and E(vj)≤E(u1)+1 for all large j, one has ∥vj∥H012=1+E(vj)≤E(u1)+2, so (vj) is norm bounded; by [F6] some subsequence satisfies vjl⇀v0 in H01(Ω).

3.1step 2.1F7

Since Ω is bounded and open, ∥vjl∥L2=1 and vjl⇀v0, [F7] gives v0∈H01(Ω) and ∥v0∥L2=1, that is v0∈S.

4.1step 1.1step 2.1step 3.1F3

By weak lower semicontinuity [F3] and step 2.1, E(v0)≤lim inf⁡lE(vjl)=λ1; since v0∈S by step 3.1, also E(v0)≥λ1. Hence E(v0)=λ1: the infimum is attained on S.

5.1step 4.1F8

Let v0∈S be any minimiser and put G(u):=∥u∥L22; then S={G=1}={G=G(v0)}, and E, G are Fréchet differentiable at v0 with DE(v0)h=2∫ΩDv0⋅Dh dx and DG(v0)h=2∫Ωv0h dx, because the remainders ∫Ω∣Dh∣2 and (∫Ωh2) are o(∥h∥H01). The same derivative formula holds at every u∈H01, and ∥DG(u)−DG(v)∥≤2∥u−v∥L2≤2∥u−v∥H01 by Cauchy--Schwarz, so G is C1. Since DG(v0)v0=2∥v0∥L22=2≠0, the functional DG(v0) is surjective onto R, so the multiplier rule [F8] with m=1 gives a unique λ∈R with DE(v0)=λDG(v0), that is ∫ΩDv0⋅Dh=λ∫Ωv0h for every h∈H01(Ω). Testing h=v0 gives λ=E(v0)=λ1; hence every minimiser is a weak eigenpair with eigenvalue λ1.

5.2step 4.1F9

A nonnegative minimiser exists: by [F9] the class ∣v0∣ lies in H01(Ω) with the same L2 norm and the same energy, so ∣v0∣∈S and E(∣v0∣)=E(v0)=λ1; thus ∣v0∣ is a minimiser and it is nonnegative.

6.1step 5.1F5

The eigenvalue is positive: by [F5], 1=∥v0∥L2≤CP∥Dv0∥L2, so λ1=E(v0)=∥Dv0∥L22≥CP−2>0.

7.1step 4.1step 5.1step 6.1step 5.2F5F10∎

Finally, apply the Rayleigh principle [F10] to the principal Dirichlet form a0(v,w)=∫ΩDv⋅Dw: its first listed eigenvalue equals min⁡v≠0a0(v,v)/∥v∥L22=min⁡SE=λ1, the minimum being attained exactly on the eigenspace Eλ1 minus the origin, and positivity holds since the principal form is coercive by [F5]. Hence the listed first Dirichlet eigenvalue is λ1, and the minimisers of E on S are exactly the elements of S∩Eλ1; steps 5.1 and 6.1 show that every such minimiser is a weak eigenpair with eigenvalue λ1=E(v0)>0, and step 5.2 supplies a nonnegative minimiser.

Depends on

Used by

Dependency tree · two levels

134 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