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.
Bounded C^k domains admit integer-order Sobolev extension
Statement
Assume the Axiom of Choice. Let , , , and let be a bounded domain in the graph sense of Bounded C^k domains and boundary charts. Then for every open set with there is a bounded linear extension operator such that is a compact subset of for every . In particular each bounded domain is a -extension domain, with an operator whose output is supported in any prescribed neighbourhood of . For , extension by zero is an isometric extension on any open ; its output is supported in the compact set when is bounded.
Facts & Assumptions
Given: the Axiom of Choice; ; ; ; a bounded domain ; an open with ; and a class .
Chart data: by Bounded C^k domains and boundary charts, at every there are an open neighbourhood , a rigid motion and a graph function making the one-sided subgraph ; the flattening chart and its inverse are maps whose derivatives through order are bounded on compactly contained patches, and , so . Compactness of is what allows finitely many such charts to cover the boundary.
Half-space extension: for and all , there is a bounded linear extension operator , equal to the input on , given for by the moment reflection and for by even reflection (Integer-order Sobolev extension from a half-space).
flattening is a bounded change of variables between corresponding compactly contained local spaces when the two patches are images of one another, with constants depending only on and the compact chart bounds; for bounded data suffice (C^k boundary flattening preserves local W^{k,p}).
Cutoffs and locally finite partitions: every open cover of an open Euclidean set has an at most countable locally finite smooth partition of unity with compact supports, each lying in some cover member; a compact set inside an open set admits a smooth cutoff equal to one nearby (Test function cutoffs and euclidean localization). On a compact neighbourhood of , local finiteness leaves only finitely many active pieces, which can be grouped by the finitely many chart labels.
Multiplication by a smooth factor with bounded derivatives through order is bounded on and satisfies the Leibniz formula (Weak Leibniz rule with a smooth factor).
Restriction and cutoff localisation: restriction to an open subset is a contraction, and multiplication by a factor is bounded, with the explicit constants (Bounded restriction and cutoff localisation in Sobolev spaces).
Compactly supported Sobolev classes extend by zero in every integer order and every , with equal norms (Compactly supported Sobolev functions extend by zero in every integer order).
Extension operator and Sobolev norms: the definition of a bounded linear extension operator as a right inverse of the restriction map (Sobolev extension domains and extension operators), with the norm convention of Integer-order Sobolev spaces and their norms.
For an increasing sequence of nonnegative measurable functions, the integrals converge to the integral of the pointwise limit (Monotone convergence for the integral).
Choice use. AC selects a chart from the nonempty chart family at each boundary point before compactness reduces the cover to finitely many charts. Its countable instance is inherited through the Sobolev, cutoff and weak-Leibniz interfaces [F3]–[F6]. The remaining finite cutoffs and reflection formulas use no additional selection.
Proof
Since is compact and is an open neighbourhood of , choose with . Choose finitely many boundary charts , with the larger patches compactly contained in their original chart neighbourhoods, on nested patches , so that the larger patches have -neighbourhoods in and the smaller patches cover . The inner patches may be taken thin enough in flattened normal coordinates that reflection by any factor keeps the support of a function localized there inside the larger flattened patch. Compactness also gives an open set with .
Let , an open neighbourhood of inside . Apply [F4] on to this finite cover and choose a compact neighbourhood of . Only finitely many partition supports meet ; these pieces still sum to one on a neighbourhood of . Group them by their assigned cover member and extend them by zero outside . This gives with near , , and for . Each support is compact in .
To apply [F3] on patches reaching the boundary, let be either direction of a chart restricted to corresponding open half-patches. The derivatives of and through order have uniform bounds inherited from the compact ambient chart. Exhaust by nested open sets , , and put . For , [F3] applied on each matched pair gives the weak composition formulas and , with independent of . Every test support in lies in some , so these same formula fields are weak derivatives on . Increasing the integrals by [F9] for finite , or taking essential bounds on the countable union for , proves the identical norm bound on . Thus no compact-containment hypothesis is being assumed of the entire half-patch.
Let . By [F5], since the ambient cutoff has bounded derivatives through order , each product belongs to , is supported in , and satisfies with determined by the cutoff; moreover almost everywhere on .
Interior piece: is supported in the compact set , so by [F7] its extension by zero lies in , agrees with on , is supported in , and satisfies .
Boundary pieces: fix . The flattened function is defined on . The cutoff support is compactly contained laterally in the chart; extending by zero across the artificial edges inside this half-space gives a class, since the cutoff vanishes near those edges and tests in stay away from . Step 2.2 applied to the corresponding half-patches bounds its norm by . Conjugating the upper-half-space operator of [F2] by the coordinate flip gives an extension from , so the zero-extended has an extension . Its support remains inside the larger flattened patch by the choice in step 1.1, and its extension formula is linear. Pulling back by and multiplying by a cutoff equal to one near gives by [F3] on matched ambient patches and [F5], followed by [F7] to extend the compactly supported product from by zero. These operations give . It agrees with almost everywhere on , and its support lies in , a compact subset of .
Define . Each step above is linear in , so is linear; on the sum equals almost everywhere by step 3.1; the support of is contained in the union of finitely many compact subsets of , hence compact in ; and [F8] together with the bounds of steps 3.1, 4.1 and 4.2 gives for a constant independent of .
Therefore is a bounded linear extension operator in the sense of [F8], and is a -extension domain for every , including through the chart and half-space interfaces used above. For the extension property is immediate on any open : extension by zero of an class lies in with the same norm, is linear, and restricts back to the class, so zero extension is the required operator; its support is contained in , which is compact in under the bounded-domain hypotheses.
Depends on
- Sobolev extension domains and extension operators
- Bounded C^k domains and boundary charts
- Integer-order Sobolev extension from a half-space
- C^k boundary flattening preserves local W^{k,p}
- Test function cutoffs and euclidean localization
- Weak Leibniz rule with a smooth factor
- Bounded restriction and cutoff localisation in Sobolev spaces
- Compactly supported Sobolev functions extend by zero in every integer order
- Integer-order Sobolev spaces and their norms
- Monotone convergence for the integral
- The Axiom of Choice
Used by
Dependency tree · two levels
54 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Sung-Jin Oh, Lecture Notes for Math 222A (2024), §11.3 (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (2020), Theorem 3.12 and Corollary 3.13 (standard reference, not scraped)
- Juha Kinnunen, Sobolev Spaces (2026), Definition 3.42 and Theorem 3.43 (standard reference, not scraped)