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.

A common exterior extension and explicit collar–tail retraction

Statement

Assume AC. Let Ω=Rn∖Θ have smooth compact boundary and compact complement. There is one EΩ:L2(Ω)→L2(Rn), bounded also on the weak W2,2 endpoint, with rΩEΩ=I. It is given by a finite smooth collar construction (boundary reflections and a compactly supported interior identity localization) plus an identity free tail. Consequently the restriction-quotient Hs(Ω) satisfies [L2(Ω),H2(Ω)]s/2=Hs(Ω) with equivalent norms for 0≤s≤2.

More explicitly choose a large L with Θ⋐BL/4, η∈Cc∞(BL/2) equal to 1 near Θ, a∈Cc∞(BL) equal to 1 near supp⁡η, and β∈Cc∞({η=1}∘) equal to 1 near Θ; put b=1−β and G=Ω∩BL. Let Zu be the zero extension of (1−η)u to Rn. If Vav denotes av on G and zero on Ω∖G, then the same maps Ju=((ηu)∣G,Zu),P(v,w)=Vav+(bw)∣Ω=(aEGv+bw)∣Ω are bounded Hs(Ω)→Hs(G)⊕Hs(Rn) and back for every 0≤s≤2, and PJ=I. In particular ∥u∥Hs(Ω)≍(∥ηu∥Hs(G)2+∥Zu∥Hs(Rn)2)1/2. These are ordinary restriction Sobolev spaces; no boundary condition is imposed by these maps. In addition, at the integer endpoint P maps (H2(G)∩H01(G))⊕H2(Rn) into H2(Ω)∩H01(Ω); this conditional property asserts no fractional Dirichlet-domain identification.

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]

A compactly supported common L²/H² extension from a bounded smooth domain gives one EG on the bounded smooth collar G, bounded at L2 and weak W2,2 endpoints, with restriction identity. We use specifically its Proof steps 1.1–4.1: the nested boundary charts may be chosen arbitrarily small before selecting a finite cover; the partition has an interior term ρ0 compactly supported in G and boundary terms ρi; the extension is the zero extension of ρ0v plus finitely many chart/reflection terms Eiv, each supported in its chosen larger ambient chart by the cutoff ψi. The same construction gives both endpoint bounds. The localization of these choices for the present G is specified in step 2.1 below.

[F3]

Whole-space interpolation of one extension–restriction operator gives fractional quotient bounds for any common endpoint extension and Restriction-quotient interpolation from a common endpoint retraction then identifies its domain interpolation norms.

[F4]

Test function cutoffs and euclidean localization supplies the separating cutoffs. Weak Leibniz rule with a smooth factor controls every weak derivative through order two, and Compactly supported Sobolev functions extend by zero in every integer order supplies compact-support zero extension; for the unbounded tail and for extension across only the artificial sphere, the compact-test argument is given below.

[F5]

Well-defined strip norm and the action of a common endpoint operator applies the same endpoint maps to admissible strip functions. Finite Hilbert-sum endpoint norms may be used; their interpolated norm is equivalent to the sum of component interpolated norms by coordinate injections, coordinate projections and paired strip functions.

[F6]

For any open D, write H01(D)=W01,2(D) for the closure of Cc∞(D) in the weak W1,2(D) norm, as defined by Zero-boundary Sobolev space as a norm closure. The supplier Compactly supported smooth functions are dense in Wk,p(Rn) gives Cc∞(Rn) approximation in weak W1,2(Rn), using only k=1, p=2 and complex scalars.

[F7]

Integer-order W^k,2 and Hᵏ agree with equivalent norms identifies whole-space Fourier H1(Rn) with weak W1,2(Rn) under the regular-distribution embedding, with equivalent norms. Bounded restriction and cutoff localisation in Sobolev spaces gives contractive weak W1,2 restriction to every open subset. AC supplies the Countable Choice hypotheses of these inputs. The boundary-closure argument below stays in weak first-order norms and does not assume a first-order quotient-norm comparison on G.

Proof

Goal: Establish every assertion of the Statement under the stated hypotheses.

Given: The hypotheses and data in the Statement.

1.1F4given

The compact obstacle lies strictly inside a large ball, so the stated nested cutoffs exist; choose β supported in the open plateau of η. Thus aη=η and b(1−η)=1−η. For a weak W2,2(Ω) function, Zu and the zero extensions of Dα((1−η)u), ∣α∣≤2, have L2 norms bounded by C∥u∥W2,2. They are its actual global weak derivatives: every test ϕ∈Cc∞(Rn) is localized away from Θ by the factor 1−η and its derivatives, so the weak product identity on Ω gives the global identity after integration. Equivalently partition its compact support into the open region where the tail is zero and the region inside Ω, on which the original local identities hold. This argument is valid even though the tail itself is unbounded. Hence Z is one common bounded L2/W2,2 map.

2.1F1F2F4step 1.1construct

Fix the extension in F2 using the following chart choices, all independent of the input. The boundary of G is the disjoint union of the obstacle boundary and ∂BL. Since a=η=1 on a neighborhood of the compact obstacle, choose all larger doubled obstacle charts compactly inside that neighborhood and inside BL. Since supp⁡a⋐BL and supp⁡η⋐BL/2, choose all larger doubled artificial-sphere charts in the open complement of supp⁡a∪B‾L/2∪Θ. At every boundary point these are open neighborhoods, so the nested chart construction of F2 fits inside them; compactness then gives finitely many inner charts covering each boundary component. Complete this cover by the interior set and choose ρ0,ρi,ψi exactly as in that construction, retaining its reflection margins. Write IΘ,IL for the two finite sets of boundary-chart indices and E0 for zero extension from G. Thus EGv=E0(ρ0v)+∑i∈IΘEiv+∑i∈ILEiv. For i∈IL, supp⁡Eiv⊆supp⁡ψi is disjoint from supp⁡a, hence aEiv=0 for every L2 input. For i∈IΘ, a=η=1 on the whole larger chart, hence aEiv=Eiv. These are support identities for the actual common endpoint construction, not properties inferred for an arbitrary right inverse.

2.2F2F4step 1.1

At order zero the displayed J and P are bounded by cutoff multiplication and restriction. At the second weak-derivative endpoint, J1 is bounded by restriction and Leibniz, and J2=Z is bounded by the first step. To justify Va, work on Ω: near the artificial sphere the function av and its derivatives vanish because a has support strictly inside BL. On G they have the weak Leibniz derivatives. Every compact test in Ω can be partitioned between these two regions, proving the partial zero-extension identity and its norm bound. This crosses only the artificial sphere, never the obstacle boundary. The term bw∣Ω is bounded at order two since b has bounded derivatives through order two. Consequently J and P are common endpoint maps between the ordinary domain couple and the finite product of the collar and whole-space couples.

3.1F2F3F4step 1.1step 2.1algebra

Define EΩu=aEG((ηu)∣G)+Zu for u∈L2(Ω). Every factor is fixed and linear, and the collar lemma and weak Leibniz bounds give both endpoint estimates for this very formula. On G its first term restricts to aηu=ηu; on Ω∖G it is zero because a is supported inside BL. Adding Zu therefore gives rΩEΩu=u. For v=(ηu)∣G, step 2.1 gives the exact decomposition aEGv=E0(aρ0v)+∑i∈IΘEiv. The first term is the compactly supported interior identity localization: aρ0v is supported compactly in G, so its zero extension is legitimate at both endpoints. Each remaining term is an obstacle-chart reflection, with no artificial-sphere contribution. Together with Zu these terms establish the claimed finite collar construction and identity free tail; in particular outside BL the extension is exactly u. Apply the whole-space Er and quotient/retraction lemmas to this common extension. They prove the exterior fractional quotient bounds and the asserted interpolation identity without presupposing an exterior fractional-domain theorem. If the complement is empty, take EΩ=I and the collar cutoffs zero.

3.2F4F7step 2.2

First record the weak first-order localization bounds. For f∈W1,2(G) the weak product rule gives ∂i(af)=a∂if+(∂ia)f on G. Since a vanishes near the artificial sphere, the compact-test argument of step 2.2, now through order one, shows that Vaf∈W1,2(Ω) with these derivatives on G and zero derivatives outside G. Integrating these expressions gives ∥Vaf∥W1,2(Ω)≤Ca∥f∥W1,2(G). For h∈W1,2(Rn), all derivatives of b through order one are bounded, so the same weak product rule and contractive restriction give ∥(bh)∣Ω∥W1,2(Ω)≤Cb∥h∥W1,2(Rn). These estimates require no extension across the obstacle.

4.1F3F5step 3.1step 2.2

For 0<s<2 apply the strip-map theorem to these same J,P. The domain interpolation couples are the quotient Hs spaces by the preceding step and the quotient lemma. For the product target, each coordinate projection and injection is bounded at both endpoints, hence after interpolation. Conversely, given admissible component strip functions with prescribed values, their ordered pair is an admissible product strip function, and its boundary Hilbert norm is at most the sum of the two component boundary norms. Infimizing proves the product identification with equivalent Hilbert-sum norms. These observations give the asserted J,P bounds on every intermediate order, consistent with their original L2 formulas. The endpoint bounds are already established.

5.1F3F4F5step 1.1step 4.1algebra

For any L2 input, PJu=aηu+b(1−η)u=u by the cutoff identities. This remains the identity on every Hs restriction class because all maps are the same restrictions of the L2 maps. The bound for J is one of the inequalities in the claimed norm comparison, while u=PJu and the bound for P give the other. The definition imposes no trace at either boundary: the first collar component is an arbitrary ordinary Sobolev function and the auxiliary cutoffs merely localize. This completes the ordinary exterior localization/retraction.

6.1F2F3F4F6F7step 2.2step 3.2∎

If v∈H2(G)∩H01(G), its closure membership gives vj∈Cc∞(G) converging to v in weak W1,2(G). Their a-localized partial zero extensions belong to Cc∞(Ω) and converge in weak W1,2(Ω) to Vav by step 3.2. For w∈H2(Rn), the Fourier-weight inequality ⟨ξ⟩≤⟨ξ⟩2 gives w∈H1(Rn), and F7 therefore gives w∈W1,2(Rn). Choose wj∈Cc∞(Rn) converging to w in weak W1,2(Rn) by F6. Then (bwj)∣Ω∈Cc∞(Ω) because b vanishes on a neighborhood of the obstacle, and step 3.2 gives convergence to (bw)∣Ω in weak W1,2(Ω). The sums of these approximants converge to P(v,w) in that norm, proving P(v,w)∈H01(Ω) by the closure definition. Its H2 membership follows from the already established endpoint bound, proving the stated conditional property. The alternate displayed formula for P holds because EGv=v on G and a vanishes outside BL, so it is the same map rather than a second extension.

Depends on

Used by · 2

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.