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

Smooth coefficients and boundary make elliptic eigenfunctions smooth

Statement

Assume the Axiom of Choice (inherited through Smooth weak Dirichlet solutions are classical) and Countable Choice. Let Ω⊂Rn be a bounded C∞ domain, n≥2, and let aij,bi,c extend to C∞ functions on a neighbourhood of Ω‾, with a symmetric and uniformly elliptic. If (λ,u) is a symmetric elliptic weak eigenpair (Symmetric elliptic weak eigenpairs), a(u,v)=λ(u,v)L2 for all v∈H01(Ω) with u≠0, then u∈Hm(Ω) for every m, and u agrees almost everywhere with a function u~∈C∞(Ω‾) satisfying Lu~=λu~ pointwise in Ω and u~∣∂Ω=0. This is the relocated PDE-17 consequence: the spectral construction needs only weak eigenfunctions, and smoothness is supplied here by the regularity theory.

Facts & Assumptions

Given: the Axiom of Choice and Countable Choice; the bounded C∞ domain; the smooth coefficients with a symmetric uniformly elliptic principal part; and the weak eigenpair (λ,u) with u≠0.

[F1]

Weak eigenpair: a(u,v)=λ(u,v)L2 for every v∈H01(Ω), with u∈H01(Ω); equivalently u is a weak Dirichlet solution of Lu=λu with zero boundary values, since λu∈L2(Ω). (Symmetric elliptic weak eigenpairs, Weak Dirichlet solutions for a divergence-form operator)

[F2]

Higher-order boundary regularity for the eigen-equation: each regularity gain feeds the next datum, so the bootstrap in the k of that theorem gives u∈Hm(Ω) for every m when the coefficients are smooth on the closure and the domain is C∞. (Higher-order boundary regularity for Dirichlet problems)

[F3]

Conclusion of the classical-solution corollary: a zero-trace weak solution whose right-hand side extends smoothly has a C∞(Ω‾) representative solving the equation pointwise and vanishing on the boundary. (Smooth weak Dirichlet solutions are classical)

Proof

technique · direct
1.1F1F2

Bootstrap. Since u∈H01(Ω)⊂L2(Ω), the right-hand side λu lies in L2(Ω); the k=0 case of [F2] gives u∈H2(Ω). Then λu∈H2(Ω), and the k=2 case gives u∈H4(Ω); iterating, u∈H2j(Ω) for every j, hence u∈Hm(Ω) for every m.

2.1F3step 1.1

Smooth representative and boundary values. All Sobolev orders are available by step 1.1. Regard (L−λ)u=0 as a zero-trace weak Dirichlet problem for the operator whose principal and first-order coefficients are those of L and whose zeroth-order coefficient is c−λ. These coefficients remain smooth and uniformly elliptic. Apply [F3] to this operator with the smooth datum 0; it gives a representative u~∈C∞(Ω‾) satisfying (L−λ)u~=0 pointwise, equivalently Lu~=λu~, with u~∣∂Ω=0.

3.1step 2.1∎

Conclusion. The eigenfunction of a symmetric uniformly elliptic operator with smooth coefficients on a bounded C∞ domain is smooth up to the boundary and satisfies the eigen-equation pointwise with zero boundary values; the spectral construction itself needs only the weak eigenpair, and this corollary records the regularity supplied by the estimates of this page.

Source notes

Hunter (Sections 4.10-4.12) and Simon (Lectures 9-10) use the eigen-equation as the standard application of the boundary regularity theory; the statement is preserved from the PDE-17 owner resolution, which moved this corollary after the higher-order boundary regularity and embedding items. No new spectral input is recorded.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

42 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