Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

Compact-manifold Dirichlet spectrum and boundary regularity

Statement

Assume Countable Choice. Let (M,g) be a nonempty compact smooth Riemannian manifold of positive dimension with smooth boundary and q a smooth real function. Set H=L2(M,dVg), V=H01(M) and c=1+∥q∥∞. Then b(u,v)=∫M(⟨∇u,∇vˉ⟩+(q+c)uvˉ) dVg is an equivalent Hilbert inner product on V. There are an H-orthonormal sequence (ej) complete in H and positive numbers μj→∞ such that b(ej,v)=μj(ej,v)H for every v∈V, and b(u,u)=∑jμj∣(u,ej)H∣2(u∈V). For A=−Δg+q, weak solutions v∈V of Av=f∈Hk(M) satisfy ∥v∥Hk+2(M)≤Ck(∥f∥Hk(M)+∥v∥L2(M)),k=0,1,…. Here integer Sobolev norms use any finite smooth atlas. For every nonnegative integer a, the inclusion Hk(M)→Ca(M) is bounded for all sufficiently large integers k.

Facts & Assumptions

Given: Countable Choice and the compact smooth metric and real smooth potential in the statement; complex spaces use conjugation in the second slot.

[F1]

The Lax--Milgram theorem gives a unique inverse for bounded coercive forms on a Hilbert space under Countable Choice.

[F2]

Spectral theorem for compact self adjoint operators supplies the complete nonzero-eigenvalue decomposition of a compact self-adjoint operator on the orthogonal complement of its kernel.

[F3]

Global H2 Dirichlet regularity gives the H2 estimate for smooth uniformly elliptic divergence-form operators on bounded smooth domains, including flattened boundary localizations.

[F4]

Riemannian Green identity, boundary trace, and wave lifting gives the coordinate divergence formula and smooth boundary collar.

[F5]

A finite smooth partition subordinate to a finite chart cover of compact M is constructed as follows. Refine to finitely many pairs of nested coordinate balls whose smaller balls cover M and whose larger balls have compact closure in their charts. For 0<r<R, the function ϑ(R2−∣x∣2)/(ϑ(R2−∣x∣2)+ϑ(∣x∣2−r2)), where ϑ(t)=e−1/t for t>0 and 0 otherwise, is a smooth bump equal to one on the radius-r ball and supported in the radius-R ball. Restrict it to boundary half-charts, extend by zero, and divide these finitely many bumps by their positive sum.

Proof

1.1F4F5givenalgebra

On each of finitely many relatively compact coordinate charts, metric eigenvalues and the volume density have positive lower and finite upper bounds. Thus the intrinsic H1 norm is equivalent to the sum of coordinate H1 norms of a fixed smooth partition of unity. A Cauchy sequence has L2 limits for the localized functions and their first derivatives; testing against a smooth function and passing to the limit identifies the derivative limits as the weak derivatives of the function limit. This proves completeness; V, being a closure, is closed. Moreover 1≤q+c≤1+2∥q∥∞, so b and the H1 inner product have equivalent norms. To prove density of V in H, localize an H-function by a finite smooth partition. In an interior chart, extend each localized piece by zero and approximate it in L2 by mollification. In a boundary half-chart, the localized piece is supported away from the chart sides; multiply it by a smooth cutoff that vanishes for 0≤xn≤δ and equals one for xn≥2δ. The boundary face has n-dimensional volume zero. Given ϵ>0, choose R so large that ∫{∣u∣2>R}∣u∣2 dVg<ϵ/2, by truncating the integrable function ∣u∣2. For the strip Sδ={0<xn<2δ}, ∫Sδ∣u∣2 dVg≤ϵ/2+R vol⁡g(Sδ), and vol⁡g(Sδ)=O(δ) because the coordinate density is bounded. Thus the L2 error tends to zero as δ↓0. Each cut-off piece is supported away from the boundary and is then approximated by mollification. Summing the finite chart approximations proves that Cc∞(M∘) is dense in H.

2.1F5step 1.1givenconstructalgebra

The inclusion V↪H is compact without an arbitrary-index choice argument. Indeed, a localized v∈V extends by zero across a flattened boundary: approximate in H1 by localized interior smooth functions, extend those, and pass to the weak-derivative identities. All extensions have bounded support in a fixed coordinate box. On a cube C of side δ, successively average in its n coordinate variables. The one-variable identity f(s)−f(t)=∫tsf′(r)dr and Cauchy–Schwarz give ∥f−avg⁡Cf∥L2(C)≤nδ∥Df∥L2(C) by telescoping those averages; density extends this to H1. Replacement by the mean on each cube of a fixed finite grid is therefore a finite-rank approximation to each coordinate inclusion, with error O(δ) uniformly on the H1 unit ball. Sum the finitely many coordinate reconstructions to approximate V↪H in operator norm by finite-rank maps. A bounded finite-dimensional set has finite nets; choosing δ=2−k makes the inclusion's image totally bounded, and completeness of H makes its closure compact. Only countably many finite nets are involved.

2.2F3F4F5step 1.1algebra

In a coordinate chart Av=f is −∂i(ρgij∂jv)+ρqv=ρf,ρ=det⁡g. The principal matrix is smooth uniformly positive on each compact chart. Localize by a smooth cutoff; its commutator with A has order one. For n=1, put G=ρg11>0 on a localized interval or half-interval and absorb the first-order cutoff commutator into an L2 right side fχ, with ∥fχ∥2≤C(∥f∥2+∥v∥H1). The weak equation is −(Gv′)′+ρqv=fχ, so (Gv′)′=ρqv−fχ∈L2. Since Gv′∈L2, this gives Gv′∈H1, and smooth positivity of G gives v∈H2 with the local estimate ∥v∥H2≤C(∥fχ∥2+∥v∥H1). For n≥2, in a boundary chart flatten to xn≥0 and localize away from the chart sides. The localization can be regarded as a zero-Dirichlet function on a bounded smooth domain agreeing with the half-space near its support and rounded elsewhere. Applying [F3] and the same interior estimate, then summing the finite cover, gives ∥v∥H2≤C(∥f∥2+∥v∥H1) in every dimension. Testing the equation with v gives ∥v∥H1≤C(∥f∥2+∥v∥2) by absorbing the gradient term, so this is the stated k=0 estimate.

3.1F1F2step 1.1step 2.1algebra

For f∈H, use [F1] to solve b(Kf,v)=(f,v)H. The map K:H→V is bounded, and step 2.1 makes K:H→H compact. Symmetry gives (Kf,h)H=b(Kf,Kh)=(f,Kh)H, positivity gives (Kf,f)H=b(Kf,Kf)>0 for f≠0, and density of V makes K injective. Its range is dense since a vector orthogonal to the range lies in the kernel by self-adjointness. Apply [F2] to obtain positive eigenvalues κj→0 and a complete H-orthonormal family; put μj=κj−1. Repeated finite multiplicities are included. The vectors ej/μj are b-orthonormal and complete in V: if b(v,ej)=0 for every j, then (v,ej)H=0 for every j, hence v=0. Orthogonal projection and completeness therefore give the asserted b-Parseval identity and convergence of the spectral projections in V.

3.2F5step 2.2givenalgebra

Here is the boundary induction for higher orders. For n=1, in each localized chart write G=ρg11>0 and −(Gv′)′+ρqv=fχ, where the cutoff commutator satisfies fχ∈Hk and ∥fχ∥Hk≤Ck(∥f∥Hk+∥v∥Hk+1) whenever f∈Hk and v∈Hk+1. Then (Gv′)′=ρqv−fχ∈Hk, so Gv′∈Hk+1 and smooth positivity of G gives v∈Hk+2, with ∥v∥Hk+2≤Ck(∥f∥Hk+∥v∥Hk+1). This proves the one-dimensional induction, including its k=0 start. For n≥2, suppose f∈Hk and v∈Hk+1 is already known. In a flattened boundary chart apply a tangential derivative Dx′α, ∣α∣=k, to the localized equation. Its commutator with the second-order operator contains derivatives of v of order at most k+1 with bounded smooth coefficients. The localized Dx′αv has zero trace and lies in H1; this follows first for tangential difference quotients, which preserve zero trace, and then by their H1 limit. The k=0 local estimate of step 2.2 gives its H2 bound in terms of ∥f∥Hk+∥v∥Hk+1. If a derivative has total order k+2 and at least three normal factors, differentiate the equation k times, isolating the term ρgnnDn2v. Divide by the positive coefficient ρgnn. Each other highest-order derivative has fewer normal factors because its two principal derivatives include a tangential derivative; all commutators have order at most k+1. Induction on the number of normal factors therefore bounds every derivative of order k+2. Interior patches allow derivatives in all directions. Difference quotients justify each differentiation before regularity is established; the bounds are uniform in their increments, and testing their weak limits identifies the claimed derivatives. Nested cutoffs and the finite cover give ∥v∥Hk+2≤Ck(∥f∥Hk+∥v∥Hk+1), and the previous induction level absorbs the last term into Ck(∥f∥Hk+∥v∥2). This proves all asserted elliptic estimates.

4.1F5step 1.1step 3.2constructalgebra∎

For completeness the needed high-order embedding also has a finite-chart proof with this axiom base. In a half-chart extend across xn=0 by ∑j=1k+1ajv(x′,−jxn) for xn<0, where the finite Vandermonde system ∑jaj(−j)ℓ=1 for 0≤ℓ≤k matches the derivatives at the interface. After a cutoff this is a bounded Hk extension; the assertion follows first on smooth functions and then by the weak derivative identities and approximation. On a bounded support box, iterated one-dimensional integration gives ∥Dαw∥∞≤C∥D1⋯DnDαw∥2 for smooth compactly supported w. Apply this also to first derivatives of Dαw and to differences of mollifications. For k≥n+a+1 these mollifications and all derivatives through order a are uniformly Cauchy and their limits are continuous, with the asserted norm bound; passing to the coordinate segment integral identifies them as classical derivatives. Sum the finite chart extensions. This proves the embedding and completes the lemma.

Depends on

Used by

Dependency tree · two levels

82 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