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 single collar-reflection and free-tail exterior extension

Statement

Assume AC and let n≥1. Let Ω⊆Rn be open with compact complement C=Rn∖Ω. Here a smooth exterior domain has the following one-sided local graph property. If n≥2, at every a∈∂Ω there are an open neighborhood W of a, rigid coordinates R(x)=(y,z), an open ball B⊂Rn−1 and h∈C∞(B) such that R(W)⊆B×R and R(Ω∩W)=R(W)∩{(y,z):z>h(y)}. For n=1, every boundary point a has an interval neighborhood I and a sign ε∈{−1,1} such that Ω∩I={x∈I:ε(x−a)>0}. These conditions specify the local one-sided graph convention for the unbounded open set; C=∅ is allowed.

For each 1<q<∞ there is one bounded linear map E:Lq(Ω)⟶Lq(Rn) whose restriction to W1,q(Ω) is bounded into W1,q(Rn) and such that PE=I on Lq(Ω), where P is restriction to Ω. Its formula uses finitely many fixed boundary-chart reflections, a fixed compact interior piece and the zero extension of an identity tail vanishing near the obstacle. The same geometric formula can be chosen for all q in this range; its norm constants may depend on q.

Facts & Assumptions

Given: The hypotheses and conventions of the Statement. The Lq spaces use Lebesgue measure and may have real or complex scalars.

[F1]

Assume the Axiom of Choice The Axiom of Choice; in particular its countable and dependent instances are available for the Sobolev suppliers. It also permits selecting local chart data at the boundary points in step 1.1.

[F2]

Uniform endpoint localization in a smooth boundary chart gives each fixed boundary piece Ti, with one formula on Lq and W1,q and PTiu=ρiu.

[F3]

Test function cutoffs and euclidean localization supplies a fixed ambient cutoff η=1 near the compact complement, compactly supported in a large ball, and final chart cutoffs equal to one near specified compact supports. For a finite open cover of a compact Euclidean set, Finite ambient partitions near compact sets supplies ambient smooth functions compactly supported in the respective cover members whose sum is one near that set.

[F4]

Weak Leibniz rule with a smooth factor gives bounded cutoff multiplication. Compactly supported Sobolev functions extend by zero in every integer order extends a compact interior piece, while Integer-order Sobolev spaces and their norms supplies the test definition of derivatives for the unbounded tail.

[F5]

The local one-sided graph and flattening convention of Bounded Ck domains and boundary charts is used at every finite order, with the vertical orientation chosen so that the exterior is t>0. Only its local chart convention is used here. The exterior-domain hypotheses themselves are explicitly stated above; the nested chart construction is given in step 1.1.

[F6]

Heine-Borel in ℝⁿ: with the Euclidean metric a subset of ℝⁿ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line identifies compact Euclidean sets with closed bounded sets and supplies the finite-subcover property, including for the boundary and the compact sets used in steps 1.1 and 2.1.

Proof

Given: The hypotheses and data in the Statement.

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

1.1F1F3F5F6given

If C=∅, take E=I; henceforth let C≠∅. Choose η∈Cc∞(Rn) equal to 1 near C. Both ∂Ω⊂C and K=supp⁡η∩Ω‾ are closed and bounded, hence compact, and ∂Ω⊂K. At each boundary point use the stated graph data and put Φ(x)=(y,z−h(y)). This is a smooth coordinate map with inverse Φ−1(y,t)=R−1(y,h(y)+t), taking Ω∩W exactly to Φ(W)∩{t>0}. Since Φ(W) is open and contains Φ(a)=(ya,0), choose a bounded ball Ba centered at ya and ba>0 so that B‾a×[−ba,ba]⊂Φ(W), with B‾a⊂B. Choose a concentric Ba′ with Ba′‾⊂Ba and 0<ba′<ba. The smaller chart Ua′=Φ−1(Ba′×(−ba′,ba′)) has compact closure inside Ua=Φ−1(Ba×(−ba,ba)). Reflection (y,t)↦(y,−t) preserves the smaller closed cylinder, giving the required reflected-support margin. The first derivatives of these chart maps and their inverses are bounded on the larger closed cylinder because the derivatives of h are continuous on B‾a; their Jacobians have absolute determinant one. For n=1, use Φ(x)=ε(x−a) and two nested symmetric intervals, which have the same properties.

2.1F2F3F6step 1.1

The sets Ua′ cover the compact boundary, so retain finitely many, say U1′,…,Um′. The set K∖⋃iUi′ is closed and bounded, hence compact, and lies in Ω: every point of Ω‾ outside Ω is a boundary point and was covered. Cover this remainder by finitely many balls Vj with V‾j⊂Ω. Apply the finite ambient partition supplier to the resulting finite open cover of K, obtaining χi∈Cc∞(Ui′) and χ0j∈Cc∞(Vj) with total sum one near K. Put ρi=ηχi and ρ0=η∑jχ0j. Then ρ0 has compact support in Ω and ρ0+∑iρi=η on Ω: wherever η is nonzero in Ω the point lies in K, and elsewhere both sides are zero. Each ρi has compact support in the smaller symmetric chart from step 1.1, so its reflected support stays compactly inside Ui. Choose a final smooth cutoff compactly supported in Ui and equal to one near both these supports. These are precisely the chart and cutoff data needed by the localization supplier. All this data is fixed independently of q.

3.1F3F4step 2.1

For u∈Lq(Ω) define T∞u as the zero extension of (1−η)u. It is Lq bounded. If u∈W1,q, fix ϕ∈Cc∞(Rn); then (1−η)ϕ∈Cc∞(Ω), so the global weak derivative of T∞u is the zero extension of (1−η)∂ju−(∂jη)u. Thus ∥T∞u∥W1,q≤Cη∥u∥W1,q. This test argument does not require bounded support of the tail. The zero extension T0u of ρ0u has both endpoint bounds by its compact interior support.

4.1F2F3F4step 2.1step 3.1algebra∎

Define Eu=T∞u+T0u+∑i=1mTiu, using the chart operators of the localization supplier with the data in step 2.1. This is one formula for every Lq input; for a W1,q input it is exactly the same formula. The finite sum of the Lq bounds gives ∥Eu∥q≤Cq∥u∥q, and the finite sum of the first-derivative bounds gives ∥Eu∥W1,q≤C~q∥u∥W1,q. On Ω the sum equals ((1−η)+ρ0+∑iρi)u=u. This proves PE=I, the norm bounds and the common-operator assertion. All choices depend only on the geometry and cutoffs; reflection is the same even formula for every q, which proves the final claim.

Source notes

The one-sided local graph convention is supplied by Bounded Ck domains and boundary charts and specified for the exterior in the Statement. The finite nested chart cover is constructed locally using Heine-Borel in ℝⁿ: with the Euclidean metric a subset of ℝⁿ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, followed by the cutoff and finite ambient partition suppliers in [F3]. The endpoint assembly uses Uniform endpoint localization in a smooth boundary chart; the unbounded tail and simultaneous Lq endpoint are proved explicitly above.

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.