Alphabeta Math
LemmaStatement: AI-generatedProof: AI-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.

Collar and tail assembly of the exterior graph domain

Statement

Assume AC and let Ω=Rn∖Θ be a smooth compact-obstacle exterior, n≥2. Then {u∈H01(Ω):Δu∈L2(Ω)}=H2(Ω)∩H01(Ω). For the shifted form operator A=I−ΔD on this domain, C−1∥u∥H2(Ω)≤∥Au∥L2(Ω)≤C∥u∥H2(Ω). The constants may depend on the fixed exterior geometry, but no non-trapping hypothesis is needed.

Facts & Assumptions

Given: The hypotheses and conventions of the Statement.

[F1]

Assume the Axiom of Choice The Axiom of Choice; in particular its countable and dependent instances are available.

[F2]

Weak shifted Dirichlet form and energy bound on an open set identifies D(A) with the weak Dirichlet domain and gives ∥u∥H1≤∥Au∥2.

[F3]

Bounded collar regularity for an exterior weak Dirichlet function gives ηu∈H2(G) with a bound by ∥Δu∥2+∥u∥H1.

[F4]

Zero extension of a free exterior tail by distribution tests extends (1−η)u with its distributional Laplacian, and Whole-space H² regularity from an L² distributional Laplacian then gives its global H2 regularity.

[F5]

Write Hk(U)=Wk,2(U;C), k=1,2, using the weak derivatives and sum-of-squares norms of Integer-order Sobolev spaces and their norms. The space H01(U)=W01,2(U;C) is the H1 norm closure of Cc∞(U;C) by Zero-boundary Sobolev space as a norm closure. Their Countable Choice hypothesis is supplied by the AC assumption in [F1].

[F6]

Test function cutoffs and euclidean localization supplies a smooth compactly supported cutoff equal to one near a compact subset of an open Euclidean set, and a locally finite smooth partition subordinate to any open cover. On a compact test support only finitely many members of that partition contribute.

Proof

Given: The hypotheses and data in the Statement.

Goal: Prove the conclusions in the statement under its stated hypotheses.

1.1F3F5F6givenconstruct

Choose L>0 with Θ⋐BL and, by [F6] with compact set Θ⊂BL, choose η∈Cc∞(BL) equal to 1 near Θ. Put G=BL∖Θ, exactly as in [F3]. Let u belong to the weak domain and put g=Δu. The collar lemma gives w=ηu∈H2(G) and ∥w∥H2(G)≤C(∥g∥2+∥u∥H1). Define w~=w on G and zero on Ω∖G. The two open sets G and Ω∖supp⁡η cover Ω. On the second set w~ is identically zero, and on the overlap w and all its weak derivatives through order two vanish. For each compactly supported test on Ω, a subordinate smooth partition from [F6] has only finitely many terms meeting its support. Applying the weak derivative identities on each open piece and summing proves the global weak identities; thus w~∈H2(Ω), with each derivative given by zero extension of the corresponding derivative on G and with unchanged component norms. This extends only across the artificial sphere, not across the obstacle.

2.1F3F4F5step 1.1

The tail lemma and whole-space Fourier lemma give a function v∈H2(Rn) with v∣Ω=(1−η)u and ∥v∥H2≤C(∥g∥2+∥u∥H1). Adding the extended collar part to v∣Ω gives u∈H2(Ω) and ∥u∥H2≤C(∥g∥2+∥u∥H1). Conversely u∈H2∩H01 has Δu∈L2 by its weak derivatives, so the two domains coincide.

3.1F2F5step 2.1algebra∎

For u∈D(A), the weak form bound gives ∥u∥2≤∥u∥H1≤∥Au∥2, while g=u−Au gives ∥g∥2≤2∥Au∥2. Substitution in the preceding estimate proves ∥u∥H2≤C∥Au∥2. In the other direction ∥Au∥2=∥u−Δu∥2≤Cn∥u∥H2. These are the stated graph-norm comparisons.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.