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 . Let be open with compact complement . Here a smooth exterior domain has the following one-sided local graph property. If , at every there are an open neighborhood of , rigid coordinates , an open ball and such that and For , every boundary point has an interval neighborhood and a sign such that . These conditions specify the local one-sided graph convention for the unbounded open set; is allowed.
For each there is one bounded linear map whose restriction to is bounded into and such that on , where 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 in this range; its norm constants may depend on .
Statement references
Facts & Assumptions
Given: The hypotheses and conventions of the Statement. The spaces use Lebesgue measure and may have real or complex scalars.
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.
Uniform endpoint localization in a smooth boundary chart gives each fixed boundary piece , with one formula on and and .
Test function cutoffs and euclidean localization supplies a fixed ambient cutoff 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.
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.
The local one-sided graph and flattening convention of Bounded domains and boundary charts is used at every finite order, with the vertical orientation chosen so that the exterior is . 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.
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.
If , take ; henceforth let . Choose equal to near . Both and are closed and bounded, hence compact, and . At each boundary point use the stated graph data and put . This is a smooth coordinate map with inverse , taking exactly to . Since is open and contains , choose a bounded ball centered at and so that , with . Choose a concentric with and . The smaller chart has compact closure inside . Reflection 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 are continuous on ; their Jacobians have absolute determinant one. For , use and two nested symmetric intervals, which have the same properties.
The sets cover the compact boundary, so retain finitely many, say . The set 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 with . Apply the finite ambient partition supplier to the resulting finite open cover of , obtaining and with total sum one near . Put and . Then has compact support in and on : wherever is nonzero in the point lies in , and elsewhere both sides are zero. Each has compact support in the smaller symmetric chart from step 1.1, so its reflected support stays compactly inside . Choose a final smooth cutoff compactly supported in 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 .
For define as the zero extension of . It is bounded. If , fix ; then , so the global weak derivative of is the zero extension of . Thus . This test argument does not require bounded support of the tail. The zero extension of has both endpoint bounds by its compact interior support.
Define , using the chart operators of the localization supplier with the data in step 2.1. This is one formula for every input; for a input it is exactly the same formula. The finite sum of the bounds gives , and the finite sum of the first-derivative bounds gives . On the sum equals . This proves , 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 , which proves the final claim.
Source notes
The one-sided local graph convention is supplied by Bounded 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 endpoint are proved explicitly above.
Depends on
- The Axiom of Choice
- Uniform endpoint localization in a smooth boundary chart
- Test function cutoffs and euclidean localization
- Weak Leibniz rule with a smooth factor
- Compactly supported Sobolev functions extend by zero in every integer order
- Integer-order Sobolev spaces and their norms
- Bounded Cᵏ domains and boundary charts
- 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
- Finite ambient partitions near compact sets
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.