Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 D⊂R3 be a nonempty bounded open set whose boundary is locally a Lipschitz graph, with D on one side in each chart. It need not be connected. There is one linear operator E:H1(D)→H1(R3) with Ef=f almost everywhere on D, which maps H2(D) boundedly into H2(R3). Its support can be confined to a fixed bounded neighborhood of D‾. 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 D, and weak-derivative Sobolev norms. Every cube below is axis aligned, and aQ,ℓQ denote its center and side length.

[F1]

On a cube S of side s, ∥v−vS∥2≤Cs∥∇v∥2. This is Poincare-Wirtinger on bounded convex domains by the direct pairwise argument.

[F2]

Translation is continuous in L2, convolution with a smooth approximate identity converges in L2, and convolution differentiates distributionally. Apply ∥τhf−f∥p→0 in Lp(Rn) as h→0, for 1≤p<∞, Every L1 approximate identity converges to the identity in Lp for 1≤p<∞, 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.

[F3]

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.

[F4]

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 9/8 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 d=3, r=1,2, p=2; its CC hypothesis follows from AC.

[F5]

Fix a nonnegative cutoff equal to one on B‾1/4(0) and supported in B1/2(0) by [F4]. Its integral is positive and finite by Euclidean balls have positive finite Lebesgue measure. Normalize that cutoff to obtain ρ≥0 with unit mass and support in B1(0). Use The mollifier family generated by a unit-mass smooth bump and A unit-mass smooth bump generates an L1 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 k=m, p=2; only L2 zero extensions of derivatives occur there. Completeness in step 8.1 is Integer-order Sobolev spaces are Banach with the open whole space, k=m, p=2. 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

1.1givenconstructF4

It suffices first to treat the special graph G={(x′,x3):x3>ϕ(x′)}, with ϕ globally L-Lipschitz. A local graph extends to a global graph without increasing L by ϕ(x′)=inf⁡y′(ϕ(y′)+L∣x′−y′∣), taking y′ over the original graph base; for L=0 use the same constant. Localized input will have support strictly inside the original chart. The construction for G is truncated at side length one, which fixes an inhomogeneous length scale. Rotations, translations, and a fixed dilation transfer it to any chart scale.

2.1step 1.1constructalgebraF4

Decompose Gc∖∂G into maximal dyadic cubes Q for which 203ℓQ≤dist⁡(Q,∂G). 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 203ℓQ≤dist⁡(Q,∂G)≤CℓQ. For two cubes whose 9/8 enlargements meet, the distance function is 1-Lipschitz; these two inequalities imply C0−1ℓQ≤ℓR≤C0ℓQ, with a dimension-only C0, 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 9/8 enlargement of the unit cube and positive on the closed unit cube; rescale it to ηQ and put θQ=ηQ/(∑RηR). The denominator is bounded below, only boundedly many comparable scales meet, and differentiation of this quotient gives ∣DjθQ∣≤CjℓQ−j for j=0,1,2. Thus (θQ) is a locally finite smooth partition on the exterior.

2.2F2F3step 1.1constructF4F5

Restrictions of smooth functions defined in a neighborhood of G‾ are dense in Hm(G) for m=1,2. First cut off at large radius, with convergence in Hm by the product rule and integrable tails. For the resulting compactly supported f, translate inward: ft(x)=f(x+te3) is defined on the neighborhood G−te3 of G‾. Each derivative on G is the restriction of the corresponding derivative of f, extended by zero merely as an L2 function and translated; [F2] therefore gives convergence to Dαf in L2(G) as t↓0. Convolve ft with a mollifier of radius ε<t/(2(1+L)). Every ball used at a point of G‾ stays inside G−te3, so differentiation under the convolution is legitimate there. [F2] gives convergence of all these derivatives, by choosing ε sufficiently small after t. Fixed cutoffs retain compact support. This proves the asserted density without assuming an extension theorem.

3.1step 2.1constructalgebra

Write δQ=ϕ(aQ′)−aQ,3. Distance to a Lipschitz graph and vertical distance satisfy dist⁡(aQ,∂G)≤δQ≤1+L2dist⁡(aQ,∂G): the second inequality follows by comparing to any graph point and applying Cauchy–Schwarz to L∣aQ′−b′∣+∣aQ,3−ϕ(b′)∣. Hence cℓQ≤δQ≤CLℓQ. Fix A>2CL+100(1+L) and let Q∗ be the cube of side ℓQ centered at bQ=aQ+AℓQe3. It lies in G, its distance to the graph is between cLℓQ and CL′ℓQ, and dist⁡(Q,Q∗)≤AℓQ. The cubes Q∗ 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 CLℓQ.

4.1step 3.1constructalgebra

For neighboring exterior cubes Q,R, their interior cubes Q∗,R∗ can be joined by a chain of a bounded number (depending only on L) of interior cubes of sides comparable to ℓQ, with consecutive overlaps containing a cube of side cLℓQ. Here is an explicit construction. Join bQ vertically upward to height H=max⁡(bQ,3,bR,3)+L∣bQ′−bR′∣+103max⁡(ℓQ,ℓR), then horizontally to the vertical line through bR, then vertically down to bR. Each segment stays above the graph by at least cLℓQ, has length at most CLℓQ, and stays at distance at most CLℓQ from the graph. Subdivide these segments into steps of length bℓQ/4, and use centered cubes of side bℓQ, with b>0 small enough to lie in G; append Q∗,R∗ as endpoints. Call the union BQR. 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.

5.1F1step 4.1constructalgebra

For ℓQ≤1 put PQf(x)=fQ∗+(∇f)Q∗⋅(x−bQ), an affine polynomial determined linearly by the H1 class. Put PQ=0 when ℓQ>1. For an interior cube S of side s and center cS, write PSf=fS+(∇f)S⋅(x−cS). Applying [F1] first to ∇f and then to f−PSf, whose mean is zero, gives ∥f−PSf∥L2(S)≤Cs2∥D2f∥L2(S) and ∥∇(f−PSf)∥L2(S)≤Cs∥D2f∥L2(S) for H2 data. For merely H1 data, ∥f−PSf∥L2(S)≤Cs∥∇f∥L2(S). 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 S,T, choose a cube O⊂S∩T of side ρ≍s. On O the triangle inequality gives ∥PSf−PTf∥L2(O)≤∥f−PSf∥L2(S)+∥f−PTf∥L2(T), so the already proved residual bounds apply on the actual cubes S,T, without assuming their union lies in another interior cube. If an affine polynomial is P(x)=a+b⋅(x−cO) on O, direct integration gives ∥P∥L2(O)2=ρ3∣a∣2+ρ5∣b∣2/12. Since the exterior target cube Q has side comparable to s and lies within distance CLs of each chain cube, this formula gives ∥DjP∥L2(Q)≤CLs−j∥P∥L2(O) for j=0,1, while D2P=0. Apply it to PSf−PTf and telescope along the chain. There are boundedly many links, so summing those finitely many bounds proves, for Q,R neighbors with both scales at most one, ∥Dj(PQf−PRf)∥L2(Q)≤CℓQm−j∥Dmf∥L2(BQR),0≤j≤m,m=1,2. Here D2 of an affine polynomial is zero; BQR may be enlarged by the finitely many overlapping chain cubes used in the comparison, retaining step 4.1's overlap property.

6.1step 2.1step 3.1step 4.1step 5.1algebra

Define Ef=f on G and Ef=∑QθQPQf on its exterior. For an exterior cube Q, subtract PQ inside the sum and differentiate. For second derivatives, all terms containing D2PQ vanish, and derivatives of the partition of total order one or two multiply derivatives of PR−PQ. Step 5.1 bounds their L2(Q) norm by C∑R∼Q∥D2f∥L2(BQR). For first derivatives, the remaining term ∇PQ is bounded by the average of ∇f on Q∗, and the residual terms are bounded by the m=1 version of step 5.1. For the zeroth derivative, ∥PQ∥L2(Q)≤C(∥f∥L2(Q∗)+ℓQ∥∇f∥L2(Q∗)). Cubes with ℓQ>1 have zero polynomial; if a neighbor is nonzero, all scales involved lie between C0−1 and C0, so one bounds its polynomial and both its derivatives directly by C∥f∥Hm(R∗) instead of a difference estimate. Summing squares, using bounded neighbor counts and the bounded overlap of interior cubes and bridges, proves ∥Ef∥Hm(G)+∥Ef∥Hm(R3∖G‾)≤C∥f∥Hm(G),m=1,2, 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.

7.1step 2.1step 6.1step 2.2algebraF3F4F5

For such smooth f, use a fixed ambient smooth continuation near the graph to compare with Ef. At an exterior point x at distance d from the graph, every active cube has ℓQ≍d and Q∗ is within distance CLd of x. Taylor's formula and the affine reproduction of PQ therefore give ∣Ef(x)−f(x)∣≤Cfd2 and ∣∇(Ef−f)(x)∣≤Cfd on compact neighborhoods of the graph. To verify the weak derivatives across the graph, define on the exterior ρ(x)=∑QθQ(x)ℓQ. Local finiteness makes ρ smooth there. At each exterior point the active cube sizes are comparable to d, so cd≤ρ≤Cd. Since ∑QθQ=1, differentiating after subtracting one active scale gives ∣∇ρ∣≤C and ∣D2ρ∣≤C/d, using ∣DjθQ∣≤CjℓQ−j and the bounded number of active cubes. Choose a smooth scalar cutoff ζ that is zero on (−∞,1] and one on [2,∞), and put χt(x)=ζ(ρ(x)/t) outside, extended by zero across ∂G. This is smooth across the boundary because it vanishes in a full exterior collar. On its transition strip, d≍t and the chain rule gives ∣Dχt∣≤C/t and ∣D2χt∣≤C/t2. In a graph chart, the vertical gap δ=∣x3−ϕ(x′)∣ satisfies δ≤1+L2 d: compare x to any graph point and use the Lipschitz bound on ϕ, then take the infimum. Thus on a compact chart the strip d<Ct has vertical sections of length at most C′t, so its volume is O(t) by [F5]. The product-rule errors from h=Ef−f on that strip satisfy ∣h∣=O(t2) and ∣Dh∣=O(t), so hDχt, DhDχt, and hD2χt tend to zero in L2; the omitted piecewise second derivatives tend to zero in L2 by absolute continuity of their squared integrals. Thus the cutoffs converge in H2 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 H1 assertion. Consequently step 6.1 is a genuine whole-space Sobolev bound for the smooth dense class.

8.1step 5.1step 6.1step 2.2step 7.1constructF5

For arbitrary Hm 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 Hm norm. Their limit equals the original input on G. 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 H1 and H2 extensions are the same operator on their common domain, rather than two incompatible choices. This completes the special graph case.

9.1F3step 8.1constructF4∎

For bounded D, 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 D‾. 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 Hm 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 D 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 E, preserves the restriction identity, and gives both asserted boundedness estimates by the weak product rule. A final cutoff equal to one near D‾ confines support. Finite graph covers work equally for disconnected D; no connectivity or topology is used. All construction coefficients are fixed independently of f. This proves the statement.

Depends on

Used by

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