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.

Partial extension across an artificial sphere and annular cutoff gluing

Statement

Assume AC and let n≥2. Let Ω=Rn∖Θ be a smooth compact-obstacle exterior, let Θ⋐BL, and put G0=Ω∩BL. If 1≤s≤2, v∈Hs(G0) and v=0 on a neighborhood of the outer sphere inside G0, then the function equal to v on G0 and zero on Ω∖G0 belongs to Hs(Ω). For each fixed gap and separating cutoff this extension is bounded, with constants allowed to depend on that gap/cutoff. No vanishing near ∂Θ is required, and no uniform shrinking-gap assertion is made.

For 1≤s≤2 and U∈Hs(Ω), define the exterior obstacle trace by ΓΩU=γ∂ΘG0(U∣G0)∈Hs−1/2(∂Θ), where γ∂ΘG0 is the bounded-domain boundary trace, applied on each obstacle-boundary component. This defines a bounded linear map independent of the choice of truncation radius L with Θ⋐BL. It is local near ∂Θ and commutes with smooth cutoffs. The notation γ∂Θ for an exterior input means ΓΩ; for an input on G0 it means γ∂ΘG0.

Fix ε>0 with Θ⊂BL−3ε. Fix smooth bounded cutoffs ζ,ζ~ on Rn, with bounded derivatives through order two, such that ζ=0 on BL−2ε, ζ=1 for ∣x∣≥L−ε, ζ~=0 on BL−3ε, and ζ~=1 on supp⁡ζ. Let A={L−3ε<∣x∣<L} and let EA be the simultaneous bounded annular extension. Then Gu=(1−ζ)u^+ζ~EA((ζu)∣A)∣Ω is a bounded linear map Hs(G0)→Hs(Ω) with (Gu)∣G0=u, where the hat extends only across the artificial sphere. Its canonical trace on ∂Θ equals that of u. If this inner trace is zero, then Gu∈H01(Ω) as well. The cutoffs and gap are fixed in this gluing assertion.

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]

Simultaneous Sobolev extension and localization provides bounded whole-space extensions from the smooth bounded G0 and annulus A, and from the exterior, for every order zero through two, in the restriction-quotient convention. Its weak endpoint identification is at order two; the first-order whole-space identification used below is supplied separately in F7.

[F3]

Localized smooth coordinate changes and cutoffs on Fourier Hʳ bounds whole-space cutoff multiplication at all these orders. Test function cutoffs and euclidean localization constructs the separating cutoffs. Domain cutoff bounds follow by applying a whole-space extension, multiplying there, and restricting; their constants depend on the chosen cutoff.

[F4]

Canonical higher traces on a bounded boundary or compact interior hypersurface gives the bounded-domain boundary traces and their locality and cutoff commutation, including equality with the existing H1 trace as an L2 function. In its Proof steps 1.1 and 2.1 these traces are constructed as γSGu=TSF for any whole-space extension F of u, with the same ambient surface trace TS for each fixed compact smooth S and independent of the extension and charts. We apply this bounded-domain construction on truncations of the exterior; no boundary-trace theorem for an unbounded domain is assumed.

[F5]

The kernel of the trace is the closure of the test functions identifies the zero trace kernel in W1,2 with W01,2 on a bounded smooth domain. Zero-boundary Sobolev space as a norm closure defines this weak-norm closure by compactly supported tests, denoted H01 for complex scalars and p=2. Compactly supported smooth functions are dense in Wk,p(Rn) supplies whole-space W1,2 approximation by compactly supported smooth functions. F7 converts the whole-space approximations to the Fourier H1 norm.

[F6]

Zero extension of W₀^1,p has no boundary derivative gives a linear zero-extension isometry W01,2(G0;C)→W1,2(Rn;C): weak first derivatives are extended by zero and all component norms are preserved. Its Countable Choice hypothesis follows from the standing AC assumption. This applies after the bounded trace-kernel theorem has established zero-boundary membership; it requires no compact support for the limiting input.

[F7]

Integer-order W^k,2 and Hᵏ agree with equivalent norms at k=1 identifies whole-space Fourier H1(Rn) with W1,2(Rn;C) under the regular-distribution embedding, with equivalent norms. It uses the negative-sign 2π Fourier normalization and bracket weight of F2. Its hypotheses n≥1, complex scalars and Countable Choice hold here, the last by F1. We use this whole-space equivalence, not an unstated first-order domain identification.

Proof

Given: The hypotheses and data in the Statement.

Goal: Establish every assertion of the Statement with the stated spaces and bounds.

1.1F2F3given

Compactness of the artificial sphere gives δ>0 with v=0 for L−δ<∣x∣<L inside G0; shrink δ if necessary to separate this collar from Θ. Choose ρ∈Cc∞(BL) equal to 1 on BL−δ and supported in BL−δ/2. If EG0 is the ordinary simultaneous extension, then rΩ(ρEG0v) equals v on G0 and zero outside BL, so it is exactly the partial extension. Its Hs(Ω) norm is at most Cs,ρ∥v∥Hs(G0) by the whole-space extension and multiplier bounds. The construction uses values inside Θ only as an ordinary extension auxiliary and then restricts to Ω; it never asserts zero extension across the obstacle. The dependence on ρ is retained, so no uniform bound for arbitrary shrinking gaps is inferred.

1.2F2F3F4given

For a fixed admissible truncation G0, restriction Hs(Ω)→Hs(G0) is contractive: every whole-space extension of U is also one of U∣G0, so take the infimum of their norms. F4 on each obstacle-boundary component therefore makes ΓΩ bounded and linear into Hs−1/2(∂Θ). To compare two admissible truncations Ga=Ω∩BLa and Gb=Ω∩BLb, take one whole-space F∈Hs(Rn) with F∣Ω=U, which exists by the restriction-space convention. It extends both U∣Ga and U∣Gb. The ambient construction in F4 computes both bounded-domain obstacle traces as T∂ΘF, componentwise, so their values agree. This also proves independence of any bounded smooth truncation agreeing with Ω on a neighborhood of its compact obstacle boundary. Locality and cutoff commutation follow by restricting to a fixed such truncation and applying those properties in F4; F3 makes the cutoff products bounded. The L2 value agrees with the bounded-domain H1 trace there.

2.1F2F3step 1.1algebra

For the gluing formula, (1−ζ)u has the fixed outer gap ε and bounded Hs(G0) norm, so the first term is bounded by the preceding construction. Restriction Hs(G0)→Hs(A) is contractive in the quotient model, and multiplication by the fixed cutoffs is bounded by extension and whole-space multiplication. The second term is therefore bounded Hs(G0)→Hs(Ω) through EA. These are fixed linear operators. On A its correction restricts to ζ~ζu=ζu, while below the annulus ζ=0. Hence the two terms sum to u on all of G0.

3.1F3F4step 2.1step 1.2

By step 2.1, (Gu)∣G0=u, so the definition in step 1.2 gives ΓΩGu=γ∂ΘG0u. Equivalently, near ∂Θ the first term of the gluing formula equals u since ζ=0, and the second term vanishes since ζ~=0. The local exterior trace just constructed thus preserves the inner trace, with its higher regularity and its bounded-domain H1 value in L2. No zero extension across ∂Θ is involved.

4.1F1F2F3F4F5F6F7step 3.1

If the inner trace is zero, choose a smooth θ equal to 1 near Θ with support inside BL−3ε and put U=Gu. The function w=(θU)∣G0=θu belongs to Hs(G0) and has zero trace on both boundary components of G0: on the inner one by hypothesis and on the outer one because θ vanishes nearby. To place w in the weak space, take a whole-space Hs extension Q of w. The Fourier weights imply Q∈H1(Rn) since s≥1, and F7 gives Q∈W1,2(Rn;C). Testing its weak derivative identity against the zero extension of any ψ∈Cc∞(G0) gives Diw=(DiQ)∣G0. Restriction decreases each L2 component norm. More generally the same test calculation on any open D, followed by infimizing over all whole-space H1 extensions of h, gives ∥h∥W1,2(D)≤C∥h∥H1(D). Thus w∈W1,2(G0); F4 identifies its zero trace with the first-order trace in F5, and the bounded kernel theorem gives w∈W01,2(G0;C). Choose φj∈Cc∞(G0;C) converging to w in W1,2(G0), using the closure definition and the countable-choice consequence of AC. By F6 their whole-space zero extensions satisfy ∥E0φj−E0w∥W1,2(Rn)=∥φj−w∥W1,2(G0)→0. F7 converts this to whole-space H1 convergence. Their restrictions to Ω lie in Cc∞(Ω) and converge in quotient H1(Ω) by contractive restriction, hence also in W1,2(Ω) by the bound just proved. The limit is θU: it agrees with w on G0 and both functions vanish on Ω∖G0, since θ is supported inside BL−3ε. Thus the weak-norm closure definition gives θU∈H01(Ω).

5.1F1F2F3F5F7step 4.1∎

Take an ordinary whole-space H1 extension F of U and set W=(1−θ)F. F3 makes W∈H1(Rn), and F7 identifies it with a W1,2 class. Choose a smooth bounded b with bounded derivatives through order two, vanishing near Θ and equal to 1 on supp⁡(1−θ), so bW=W. By F5 choose Wj∈Cc∞(Rn;C) converging to W in W1,2(Rn), using the countable-choice consequence of F1. F7 gives convergence in whole-space H1; the fixed multiplier bound in F3 and contractive restriction give (bWj)∣Ω→(1−θ)U in H1(Ω). The restriction bound in step 4.1 also gives convergence in W1,2(Ω). Each (bWj)∣Ω lies in Cc∞(Ω) because b vanishes on a fixed neighborhood of the compact obstacle. Hence the weak-norm closure definition gives (1−θ)U∈H01(Ω), and adding θU proves the final assertion. This argument proves only the claimed integer zero-trace preservation and ordinary Hs gluing; it does not impose any additional higher normal trace condition.

Depends on

Used by · 3

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.