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.
Scalar H1 and H2 extension across a bounded Lipschitz boundary
Statement
Assume the Axiom of Choice. Let be a nonempty bounded open set whose boundary is locally a Lipschitz graph, with on one side in each chart. It need not be connected. There is one linear operator with almost everywhere on , which maps boundedly into . Its support can be confined to a fixed bounded neighborhood of . The bounds depend only on a finite choice of boundary charts and cutoffs. In particular no mesh enters them.
Facts & Assumptions
Given: AC, the nonempty bounded open set , and weak-derivative Sobolev norms. Every cube below is axis aligned, and denote its center and side length.
On a cube of side , . This is Poincare-Wirtinger on bounded convex domains by the direct pairwise argument.
Translation is continuous in , convolution with a smooth approximate identity converges in , and convolution differentiates distributionally. Apply in as , for , Every approximate identity converges to the identity in for , and Convolution with a mollifier is smooth, and derivatives pass under the integral sign to each of the finitely many derivatives of order at most two.
Smooth cutoff multiplication obeys the weak Leibniz rule, and finite sums of local weak derivative identities give a global identity. Use Weak Leibniz rule with a smooth factor. AC licenses the countable analytic interfaces and approximation selections; it is not replaced by a finite-choice assertion.
The compact-set cutoff and real Euclidean partition statements of Test function cutoffs and euclidean localization apply in every dimension in ZF, and Explicit compactly supported smooth cutoffs supplies fixed rescaled cutoffs with all derivative bounds. In a neighborhood of a compact set a locally finite partition has only finitely many relevant supports. This gives the finite chart cutoffs and also a fixed bump equal to one on the closed unit cube and supported in its enlargement for step 2.1. Affine coordinate changes are made on bounded open chart pieces using Affine pullback of weak derivatives and Sobolev seminorms, with , , ; its CC hypothesis follows from AC.
Fix a nonnegative cutoff equal to one on and supported in by [F4]. Its integral is positive and finite by Euclidean balls have positive finite Lebesgue measure. Normalize that cutoff to obtain with unit mass and support in . Use The mollifier family generated by a unit-mass smooth bump and A unit-mass smooth bump generates an approximate identity for its scaled approximate identity. For derivative commutation on the smaller domains in step 2.2 use Interior mollification commutes with weak derivatives with , ; only zero extensions of derivatives occur there. Completeness in step 8.1 is Integer-order Sobolev spaces are Banach with the open whole space, , . Cutoff-tail limits and the shrinking-strip integrals use Dominated convergence. The graph-strip volume estimate uses vertical sections and Tonelli and Fubini for the completed product, with only almost-everywhere section measurability. Completed-product integration is applied to Euclidean Lebesgue measure using The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures, whose CC hypothesis follows from AC. All CC and AC assumptions are covered by the stated AC.
Proof
It suffices first to treat the special graph , with globally -Lipschitz. A local graph extends to a global graph without increasing by , taking over the original graph base; for use the same constant. Localized input will have support strictly inside the original chart. The construction for is truncated at side length one, which fixes an inhomogeneous length scale. Rotations, translations, and a fixed dilation transfer it to any chart scale.
Decompose into maximal dyadic cubes for which . Cubes of sufficiently small size containing any given exterior point satisfy this condition, while large ancestors fail, so maximal cubes exist and cover the exterior, with disjoint interiors. Failure for the parent and the triangle inequality give . For two cubes whose enlargements meet, the distance function is 1-Lipschitz; these two inequalities imply , with a dimension-only , and boundedly many such neighbors by volume packing. The enlarged cubes have bounded overlap for the same reason. Pick a fixed nonnegative smooth bump supported in the enlargement of the unit cube and positive on the closed unit cube; rescale it to and put . The denominator is bounded below, only boundedly many comparable scales meet, and differentiation of this quotient gives for . Thus is a locally finite smooth partition on the exterior.
Restrictions of smooth functions defined in a neighborhood of are dense in for . First cut off at large radius, with convergence in by the product rule and integrable tails. For the resulting compactly supported , translate inward: is defined on the neighborhood of . Each derivative on is the restriction of the corresponding derivative of , extended by zero merely as an function and translated; [F2] therefore gives convergence to in as . Convolve with a mollifier of radius . Every ball used at a point of stays inside , so differentiation under the convolution is legitimate there. [F2] gives convergence of all these derivatives, by choosing sufficiently small after . Fixed cutoffs retain compact support. This proves the asserted density without assuming an extension theorem.
Write . Distance to a Lipschitz graph and vertical distance satisfy : the second inequality follows by comparing to any graph point and applying Cauchy–Schwarz to . Hence . Fix and let be the cube of side centered at . It lies in , its distance to the graph is between and , and . The cubes have bounded overlap: at any point in one of them their scale is comparable to its distance from the graph, and their original disjoint cubes lie in a ball of radius .
For neighboring exterior cubes , their interior cubes can be joined by a chain of a bounded number (depending only on ) of interior cubes of sides comparable to , with consecutive overlaps containing a cube of side . Here is an explicit construction. Join vertically upward to height , then horizontally to the vertical line through , then vertically down to . Each segment stays above the graph by at least , has length at most , and stays at distance at most from the graph. Subdivide these segments into steps of length , and use centered cubes of side , with small enough to lie in ; append as endpoints. Call the union . These bridges have bounded overlap when all neighbor pairs are considered: every point in a bridge has graph distance comparable to its scale, and all corresponding exterior cubes are disjoint cubes of comparable size in a fixed multiple of a ball of that scale. There are boundedly many of them by volume packing.
For put , an affine polynomial determined linearly by the class. Put when . For an interior cube of side and center , write . Applying [F1] first to and then to , whose mean is zero, gives and for data. For merely data, . These estimates also hold on the finite cube chains in step 4.1, with constants depending on their uniform chain geometry. To see the latter assertion without assuming a chain Poincare theorem, compare the polynomials on each consecutive overlap. For consecutive chain cubes , choose a cube of side . On the triangle inequality gives , so the already proved residual bounds apply on the actual cubes , without assuming their union lies in another interior cube. If an affine polynomial is on , direct integration gives . Since the exterior target cube has side comparable to and lies within distance of each chain cube, this formula gives for , while . Apply it to and telescope along the chain. There are boundedly many links, so summing those finitely many bounds proves, for neighbors with both scales at most one, Here of an affine polynomial is zero; may be enlarged by the finitely many overlapping chain cubes used in the comparison, retaining step 4.1's overlap property.
Define on and on its exterior. For an exterior cube , subtract inside the sum and differentiate. For second derivatives, all terms containing vanish, and derivatives of the partition of total order one or two multiply derivatives of . Step 5.1 bounds their norm by . For first derivatives, the remaining term is bounded by the average of on , and the residual terms are bounded by the version of step 5.1. For the zeroth derivative, . Cubes with have zero polynomial; if a neighbor is nonzero, all scales involved lie between and , so one bounds its polynomial and both its derivatives directly by instead of a difference estimate. Summing squares, using bounded neighbor counts and the bounded overlap of interior cubes and bridges, proves where the norms on the right are taken only when defined. This estimates derivatives separately on the two open sides; the next steps verify that there is no boundary distribution.
For such smooth , use a fixed ambient smooth continuation near the graph to compare with . At an exterior point at distance from the graph, every active cube has and is within distance of . Taylor's formula and the affine reproduction of therefore give and on compact neighborhoods of the graph. To verify the weak derivatives across the graph, define on the exterior . Local finiteness makes smooth there. At each exterior point the active cube sizes are comparable to , so . Since , differentiating after subtracting one active scale gives and , using and the bounded number of active cubes. Choose a smooth scalar cutoff that is zero on and one on , and put outside, extended by zero across . This is smooth across the boundary because it vanishes in a full exterior collar. On its transition strip, and the chain rule gives and . In a graph chart, the vertical gap satisfies : compare to any graph point and use the Lipschitz bound on , then take the infimum. Thus on a compact chart the strip has vertical sections of length at most , so its volume is by [F5]. The product-rule errors from on that strip satisfy and , so , , and tend to zero in ; the omitted piecewise second derivatives tend to zero in by absolute continuity of their squared integrals. Thus the cutoffs converge in locally and prove that the zero-inside function has precisely the piecewise weak derivatives, with no boundary distribution. The same argument with only first derivatives proves the assertion. Consequently step 6.1 is a genuine whole-space Sobolev bound for the smooth dense class.
For arbitrary data take the smooth approximating sequence in step 2.2. The bound in step 6.1 and step 7.1 makes its extensions Cauchy in the complete whole-space norm. Their limit equals the original input on . On each exterior cube its formula equals the displayed averaged-polynomial formula, since the finitely many local averages and derivatives entering that formula converge. Thus the and extensions are the same operator on their common domain, rather than two incompatible choices. This completes the special graph case.
For bounded , cover its compact boundary by finitely many graph charts and choose smooth cutoffs supported strictly inside them, together with an interior cutoff, summing to one near . Each localized function is extended by zero within its special graph outside its original chart; since its cutoff vanishes near the chart sides, this is an function on the graph with the expected product derivatives. Apply the graph operator, then multiply the result by a second fixed cutoff supported in the chart and equal to one on the first cutoff's support. On the result is the localized original function, including the part where that function is zero. The interior term is extended by zero, with no interface near its support. Summing these finitely many extensions gives , preserves the restriction identity, and gives both asserted boundedness estimates by the weak product rule. A final cutoff equal to one near confines support. Finite graph covers work equally for disconnected ; no connectivity or topology is used. All construction coefficients are fixed independently of . This proves the statement.
Depends on
- Integer-order Sobolev spaces are Banach
- Sobolev extension domains and extension operators
- Poincare-Wirtinger on bounded convex domains by the direct pairwise argument
- $\|\tau_h f - f\|_p \to 0$ in $L^p(\mathbb{R}^n)$ as $h \to 0$, for $1 \le p < \infty$
- Every $L^1$ approximate identity converges to the identity in $L^p$ for $1 \le p < \infty$
- Convolution with a mollifier is smooth, and derivatives pass under the integral sign
- Weak Leibniz rule with a smooth factor
- The Axiom of Choice
- Test function cutoffs and euclidean localization
- Explicit compactly supported smooth cutoffs
- The mollifier family generated by a unit-mass smooth bump
- A unit-mass smooth bump generates an $L^1$ approximate identity
- Interior mollification commutes with weak derivatives
- Euclidean balls have positive finite Lebesgue measure
- Affine pullback of weak derivatives and Sobolev seminorms
- Dominated convergence
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ 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
- Tonelli and Fubini for the completed product, with only almost-everywhere section measurability
- The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures
Used by
- A bounded regular decomposition with both summands satisfying full Dirichlet conditions Lemma
- Exterior finite-energy functions have a trace controlled by their gradient Lemma
- Finite-energy transmission pairs have the double-layer kernel representation across polyhedral edges Lemma
- Smooth-boundary trace lifts and Sobolev Helmholtz layer extensions Lemma
- Sobolev pullback and Green identity on Lipschitz graphs Lemma
- The H1 trace and lifting theorem on a compact Lipschitz boundary Lemma
- The relative curl kernel on a contractible Lipschitz polyhedron Lemma
- Weak curl-free fields on a contractible polyhedron are gradients Lemma
Dependency tree · two levels
118 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
- Ralf Hiptmair and Clemens Pechstein, Regular Decompositions of Vector Fields—Continuous, Discrete, and Structure-Preserving (standard reference, not scraped)