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.

The Poincare constant is the reciprocal square root of the first Dirichlet eigenvalue

Statement

Assume the Axiom of Choice and Countable Choice. Let Ω⊆Rn be nonempty bounded open and consider the Dirichlet Laplacian, i.e. the symmetric case with aij=δij, b=0, c=0 (Uniformly elliptic divergence-form operators and their sesquilinear forms). Then its first eigenvalue satisfies λ1>0 and λ1=min⁡u∈H01(Ω)∖{0}∥Du∥L22∥u∥L22,∥u∥L2(Ω)≤λ1−1/2∥Du∥L2(Ω)(u∈H01(Ω)), with equality for nonzero u exactly at the nonzero first eigenfunctions; u=0 is also the trivial equality case. Hence λ1−1/2 is the optimal (smallest) constant in the L2 zero-trace Poincare inequality on Ω: every constant C with ∥u∥L2≤C∥Du∥L2 for all u∈H01(Ω) satisfies C≥λ1−1/2, and the positive admissible constant CP of The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction at p=2 therefore satisfies CP≥λ1−1/2. No numerical value or domain formula for λ1 is asserted.

Facts & Assumptions

Given: the Axiom of Choice and Countable Choice; a nonempty bounded open set Ω⊆Rn; the Dirichlet Laplacian form a(u,v)=∫ΩDu⋅Dv‾ dx on H01(Ω) with eigenvalues λj and eigenbasis {ej}.

[F1]

Rayleigh principle: for the symmetric case, λ1=min⁡u≠0a(u,u)/∥u∥L22, attained exactly on the nonzero elements of the first eigenspace, and λ1 is the smallest weak eigenvalue; for the Dirichlet Laplacian a(u,u)=∥Du∥L22 (The Rayleigh principle for the first Dirichlet eigenvalue, The L2 operator associated with a symmetric elliptic form, Discrete spectrum of a symmetric elliptic Dirichlet operator, Uniformly elliptic divergence-form operators and their sesquilinear forms).

[F2]

Since Ω is bounded, it lies in a finite-width slab. The supplier at p=2 gives a finite Poincare constant for every u∈W01,2(Ω;C)=H01(Ω); enlarge it if necessary and fix a positive admissible CP, so ∥u∥L2(Ω)≤CP∥Du∥L2(Ω) (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction, Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions, The Axiom of Choice).

Proof

technique · direct
1.1F1F2givenalgebra

Positivity and the minimum. With a(u,u)=∥Du∥L22, the Rayleigh principle [F1] identifies λ1 with the displayed minimum, attained exactly on the nonzero first eigenfunctions. Fix the positive admissible CP of [F2]. For every u≠0, Poincare gives ∥Du∥L22/∥u∥L22≥CP−2>0, so λ1≥CP−2>0.

2.1F1step 1.1givenalgebra

The inequality and its equality cases. For nonzero u∈H01(Ω), the identity λ1=min⁡v≠0∥Dv∥2/∥v∥2 gives ∥Du∥L22≥λ1∥u∥L22, hence ∥u∥L2≤λ1−1/2∥Du∥L2. Equality for nonzero u holds exactly when its Rayleigh quotient equals λ1, which by [F1] is exactly at the nonzero first eigenfunctions. At u=0 both sides are zero.

3.1F2step 2.1givenalgebra∎

Optimality. Let C be any constant with ∥u∥L2≤C∥Du∥L2 for all u∈H01(Ω). Testing at a nonzero first eigenfunction e1, step 2.1 gives ∥e1∥L2=λ1−1/2∥De1∥L2≤C∥De1∥L2. Moreover ∥De1∥L2>0: if it were zero, [F2] would imply ∥e1∥L2≤CP∥De1∥L2=0, contradicting e1≠0. Thus C≥λ1−1/2. Hence λ1−1/2 is the smallest admissible constant, and the particular constant CP of the zero-trace Poincare inequality satisfies CP≥λ1−1/2.

Depends on

Used by

Dependency tree · two levels

56 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