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 first Dirichlet eigenvalue is monotone under domain inclusion

Statement

Assume the Axiom of Choice and Countable Choice. Let Ω1⊆Ω2⊆Rn be nonempty bounded open sets, let aij be measurable, essentially bounded and uniformly elliptic on Ω2 with aij=aji‾, and for i=1,2 let a(i) be the principal Dirichlet form a(i)(u,v)=∫ΩiaijDjuDiv‾ dx on H01(Ωi); the model case aij=δij is the Dirichlet Laplacian. Let λk(Ωi) be the eigenvalues of the corresponding symmetric elliptic Dirichlet operator (Discrete spectrum of a symmetric elliptic Dirichlet operator) . Then λk(Ω2)≤λk(Ω1)for every k≥1, in particular λ1(Ω2)≤λ1(Ω1): making the domain smaller raises the Dirichlet frequencies. The mechanism is that extension by zero maps H01(Ω1) isometrically into H01(Ω2) for the energy form and preserves the L2 norm (Zero extension of W_0^{1,p} has no boundary derivative), so every k-dimensional competitor in H01(Ω1) is a competitor in H01(Ω2) with the same Rayleigh quotient.

Facts & Assumptions

Given: the Axiom of Choice and Countable Choice; nonempty bounded open sets Ω1⊆Ω2⊆Rn; Hermitian uniformly elliptic coefficients aij on Ω2; the principal forms a(1) on H01(Ω1) and a(2) on H01(Ω2); and k≥1.

[F1]

Zero extension: the extension operator E sending a class u∈W01,2(Ω1) to its zero extension is linear and isometric for the Sobolev norm, with weak derivatives the zero extensions of the weak derivatives (Zero extension of W_0^{1,p} has no boundary derivative, Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).

[F2]

Because Ω1⊆Ω2, the inclusion Cc∞(Ω1)⊆Cc∞(Ω2) induces E(H01(Ω1))⊆H01(Ω2), and for u∈H01(Ω1) the integrals of the coefficient form over Ω2 see only Ω1: a(2)(Eu,Ev)=a(1)(u,v) and ∥Eu∥L2(Ω2)=∥u∥L2(Ω1) (Uniformly elliptic divergence-form operators and their sesquilinear forms, The L2 operator associated with a symmetric elliptic form, Zero-boundary Sobolev space as a norm closure).

[F3]

Courant--Fischer: for i=1,2 and every k≥1, λk(Ωi)=min⁡{max⁡u∈S∖{0}a(i)(u,u)/∥u∥L2(Ωi)2:S⊆H01(Ωi), dim⁡S=k}, the extrema being attained (The Courant-Fischer min-max principle for elliptic eigenvalues, Discrete spectrum of a symmetric elliptic Dirichlet operator, The Rayleigh principle for the first Dirichlet eigenvalue).

Proof

technique · direct
1.1F1F2givenalgebra

Isometry of the extension. By [F1] the map E is linear and isometric for the Sobolev norm, and by [F2] its image lies in H01(Ω2) and the coefficient form and L2 norm are preserved: for every u∈H01(Ω1), a(2)(Eu,Eu)=a(1)(u,u),∥Eu∥L2(Ω2)2=∥u∥L2(Ω1)2. In particular the Rayleigh quotients agree, a(2)(Eu,Eu)/∥Eu∥L2(Ω2)2=a(1)(u,u)/∥u∥L2(Ω1)2 for u≠0.

2.1F3step 1.1givenalgebra∎

Min-max comparison. Fix k≥1 and let Si be the family of k-dimensional subspaces of H01(Ωi); by [F3], λk(Ωi)=min⁡S∈Simax⁡u∈S∖{0}Qi(u) with Qi the corresponding Rayleigh quotient. The extension E maps S1 into S2 (linear isometry preserves dimension), and the quotients agree on corresponding vectors by step 1.1, so λk(Ω2)≤min⁡S∈S1max⁡u∈S∖{0}Q2(Eu)=min⁡S∈S1max⁡u∈S∖{0}Q1(u)=λk(Ω1), the inequality holding because the minimum over the larger family S2 is at most the minimum over the restricted family E(S1). This proves the monotonicity λk(Ω2)≤λk(Ω1) for every k; the case k=1 is the statement about the first Dirichlet eigenvalue.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

57 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