Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 bounded right inverse of the half-space trace by normal mollification

Statement

Assume the Axiom of Choice. Let d≥1, 1<p<∞, θ=1−1/p. Fix φ∈Cc∞(Rd) with ∫Rdφ=1, put φt(y):=t−dφ(y/t) for t>0 and ψ:=−∑i∂i(yiφ), so that ∫ψ=0 and ∂t(g∗φt)=t−1(g∗ψt); fix η∈Cc∞([0,∞)) with η≡1 on [0,1] and η≡0 on [2,∞). For g∈Wθ,p(Rd) define R+g(x,t):=η(t) (g∗φt)(x),x∈Rd, t>0. Then R+g∈W1,p(Rd×(0,∞)) with ∂t(R+g)=η′(t)(g∗φt)+η(t)t−1(g∗ψt),∂xi(R+g)=η(t)(g∗∂iφt), and ∥R+g∥W1,p≤C(d,p,φ,η)∥g∥Wθ,p(Rd). Moreover T+(R+g)=g, so R+ is a bounded linear right inverse of the half-space trace T+.

Facts & Assumptions

Given: The Axiom of Choice; d≥1, 1<p<∞, θ=1−1/p; a bump φ∈Cc∞(Rd) with ∫φ=1; the kernels φt(y)=t−dφ(y/t) and ψt for ψ=−∑i∂i(yiφ); a cutoff η∈Cc∞([0,∞)) equal to 1 on [0,1] and 0 on [2,∞); and the half-space trace T+ of The half-space trace estimate and the half-space trace operator.

[F1]

For K∈Cc(Rd) with ∫K=0, 1<p<∞ and g∈Lp, ∫0Tt−p∥g∗Kt∥Lppdt≤C(d,p,K)[g]θ,pp for every T>0, with C independent of T and g. (A scale integral estimate for mean-zero kernels)

[F2]

The half-space trace T+:W1,p(H)→Lp(Rd) is linear and bounded, and it agrees with classical restriction for compactly supported continuous classes in W1,p(H). (The half-space trace estimate and the half-space trace operator)

[F3]

Assume Countable Choice. Cc∞(Rd) is dense in Wθ,p(Rd). (Compactly supported smooth functions are dense in Slobodeckij spaces)

[F4]

For K∈L1 and f∈Lp, ∥K∗f∥p≤∥K∥1∥f∥p; for a mollifier the convolution is smooth and ∂α(ρε∗f)=(∂αρε)∗f. (Complex translation, convolution, approximate identities, and mollification)

[F5]

The Slobodeckij norm is ∥g∥Wθ,p=∥g∥Lp+[g]θ,p. (The Gagliardo--Slobodeckij space on Euclidean space)

[F6]

W1,p(H) and Lp are complete normed spaces. (Integer-order Sobolev spaces are Banach)

Proof

technique · direct
1.1F5algebragiven

The identities on the smooth class. First ∫ψ=0, because ∫∂i(yiφ)=0 for the compactly supported function yiφ. Next ψt(y)=t−dψ(y/t) satisfies ∂tφt(y)=−t−1(dφt(y)+y⋅∇φt(y))=t−1ψt(y): differentiating φt(y)=t−dφ(y/t) in t, the two contributions combine into −t−1[dφ(z)+∇φ(z)⋅z] times t−d, with z=y/t, which is exactly t−1ψt(y) by the definition of ψ. Let g∈Cc∞(Rd) and extend R+g to t=0 by η(0)⋅g=g. The function is smooth on (0,∞), and differentiating the convolution gives ∂xi(g∗φt)=g∗∂iφt and ∂t(g∗φt)=g∗∂tφt=t−1(g∗ψt); hence ∂xi(R+g)=η(g∗∂iφt) and ∂t(R+g)=η′(g∗φt)+ηt−1(g∗ψt) as classical derivatives. Finally g∗φt→g uniformly as t↓0 for g∈Cc∞, so the extension is continuous up to t=0 with boundary value g.

2.1F1F4F5step 1.1algebra

The norm estimates. For smooth compactly supported g, Young's inequality [F4] gives ∫0∞∥R+g(⋅,t)∥ppdt≤2∥η∥∞p∥φ∥1p∥g∥pp, and the term η′(g∗φt) is bounded by ∥η′∥∞p∥φ∥1p∥g∥pp, since η′ is supported in [1,2]. For Ki=∂iφ, compact support gives ∫Ki=0, and ∂iφt=t−1(Ki)t. Thus [F1] bounds ∫02∥η(t)(g∗∂iφt)∥ppdt by Ci∥η∥∞p[g]θ,pp. The same estimate with K=ψ controls the normal term ηt−1(g∗ψt). Combining with ∣a+b∣p≤2p−1(∣a∣p+∣b∣p) gives ∥R+g∥W1,pp≤C(∥g∥pp+[g]θ,pp)≤C∥g∥Wθ,pp. These smooth interior derivatives are weak derivatives by integration against compactly supported tests.

3.1F1F2F3F4F6step 1.1step 2.1algebragiven∎

Extension to Wθ,p and the right-inverse identity. Let now g∈Wθ,p(Rd) and choose gm∈Cc∞(Rd) with gm→g in Wθ,p by [F3]. By step 2.1 the sequence (R+gm) is Cauchy in the complete space W1,p(H) [F6]; define R+g as its limit. The value is independent of the approximating sequence and the resulting operator is linear and bounded with the constant of step 2.1, because any two approximating sequences can be interleaved. The weak derivatives of the limit are the limits of the weak derivatives, which by step 1.1 converge to the displayed convolution expressions in Lp(H) by [F1] for the mean-zero tangential and normal terms, and by [F4] for the cutoff term; hence the limit satisfies the same two derivative identities. The values themselves converge to η(t)(g∗φt) in Lp(H) by [F4], so this limit is the formula specified in the Statement. For the trace, step 1.1 and [F2] give T+(R+gm)=gm for each smooth gm; since T+ and R+ are bounded, T+(R+g)=lim⁡mT+(R+gm)=lim⁡mgm=g in Lp(Rd). Thus T+∘R+=id on Wθ,p(Rd) and R+ is a bounded linear right inverse.

Source notes

Mironescu's Theorem 25(b) with Remark 12 and Corollary 17 (printed pp. 77-79) is the source's lift v(x,t)=f∗ρ∣t∣(x), u=vϕ(t); Kampanou's Theorem 3.3 and estimates (3.4)-(3.7) (printed pp. 23-26) give the scaled-bump derivative estimates and the normal cutoff; Gagliardo's construction (printed pp. 290-300) and Schikorra's Section V.2 (printed pp. 98-101) are the companion treatments. The mean-zero kernel comes from differentiating the scaled mollifier in its scale, which is why the normal derivative is controlled by the fractional seminorm and not by the plain Lp norm.

Depends on

Used by

Dependency tree · two levels

69 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