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 trace, supported in a prescribed collar

Statement

Assume the Axiom of Choice. Let Ω⊂Rn, n≥2, be a bounded C1 domain, 1<p<∞, θ=1−1/p, and let T be the trace operator of The Lp trace operator on a bounded C1 domain. Then there is a bounded linear operator R:Wθ,p(∂Ω;K)⟶W1,p(Ω;K) with T∘R=idWθ,p(∂Ω) and ∥Rg∥W1,p(Ω)≤C(Ω,p)∥g∥Wθ,p(∂Ω). Moreover, for every open neighbourhood U of ∂Ω in Rn there is such an operator RU whose image is contained in the classes vanishing a.e. outside U, with ∥RUg∥W1,p(Ω)≤C(Ω,p,U)∥g∥Wθ,p(∂Ω). The right inverse is not unique and no canonical choice is claimed.

Facts & Assumptions

Given: The Axiom of Choice; a bounded C1 domain Ω; 1<p<∞; θ=1−1/p; the boundary space of The fractional Sobolev space on a compact C1 boundary; the trace T of The Lp trace operator on a bounded C1 domain; and an open neighbourhood U of ∂Ω.

[F1]

The flat trace T+ has a bounded linear right inverse R+ with T+∘R+=id on Wθ,p(Rn−1) and ∥R+h∥W1,p(H)≤C∥h∥Wθ,p(Rn−1). (A bounded right inverse of the half-space trace by normal mollification)

[F2]

T(ηu)=(η∣∂Ω)Tu for smooth cutoffs; on chart-supported classes T is the transported flat trace; and the boundary norm is computed by finite chart representations with equivalent norms for any atlas. (The trace commutes with smooth cutoffs and is chart local, Chart independence of the fractional boundary norm, The fractional Sobolev space on a compact C1 boundary)

[F3]

Composition with a flattening chart is bounded between the local W1,p spaces in both directions, and multiplication by an ambient smooth cutoff is bounded on W1,p. (C^k boundary flattening preserves local W^{k,p}, Bounded restriction and cutoff localisation in Sobolev spaces, Weak Leibniz rule with a smooth factor)

[F4]

A finite family of open sets covering ∂Ω admits a subordinate finite ambient partition of unity, and the partition can be chosen with supports inside any prescribed open neighbourhood of ∂Ω. (Finite ambient partitions near compact sets)

[F5]

W1,p(Ω) is a vector space with the triangle inequality for its norm, and T is linear. (The Lp trace operator on a bounded C1 domain, Sobolev functions paste across an overlap)

Proof

technique · direct
1.1F1F3F4given

Construction inside a prescribed collar. Let U be an open neighbourhood of the compact boundary. Choose a finite boundary atlas {(Φj,Wj)} with Wj⊆U (shrinking the chart neighbourhoods of the boundary, which is possible because U is open and contains ∂Ω) and a subordinate finite ambient partition {ρj} with supp⁡ρj⊆Wj and ∑jρj=1 on a neighbourhood of ∂Ω, by [F4]. For g∈Wθ,p(∂Ω) and each j, transport the localised datum: gj:=(ρjg)∘Ψj−1∈Wθ,p(Rn−1); lift it flat, wj:=R+gj, so that T+wj=gj and ∥wj∥≤C∥gj∥ by [F1]; then transport back through the chart and multiply by a fixed cutoff equal to 1 on a neighbourhood of supp⁡ρj and supported in Wj∩U. The result uj is a class in W1,p(Ω) with support in U and ∥uj∥W1,p(Ω)≤Cj∥gj∥Wθ,p(Rn−1) by [F3].

2.1F2step 1.1algebra

The traces of the pieces. By the chart-transport and multiplicativity parts of [F2], applied to the flattened piece and its cutoff, Tuj=(ρj∣∂Ω)g=ρjg on ∂Ω: the transported flat lift has flat trace gj, and multiplication by the cutoff, which equals one near the support of ρj on the boundary, leaves the localised datum unchanged.

3.1F2F5step 1.1step 2.1algebra

The operator RU. Define RUg:=∑juj. This is linear in g (every construction is linear), its image is contained in the classes supported in ⋃jWj⊆U, and ∥RUg∥W1,p(Ω)≤∑j∥uj∥≤C(Ω,p,U)∥g∥Wθ,p(∂Ω) by [F5], the atlas-independence of [F2] and step 1.1. Its trace is T(RUg)=∑jTuj=∑jρjg=g by step 2.1 and linearity of T.

4.1F2F5step 3.1algebragiven∎

Conclusion and non-uniqueness. Taking U=Rn gives R, and the construction for general U gives RU with the claimed dependence of its bound. To exhibit distinct right inverses, fix a nonzero v∈Cc∞(Ω) and the bounded nonzero linear functional ℓ(g)=∫∂Ωg dS on the boundary space (Hölder and its Lp term give boundedness). Since Tv=0 by classical restriction, R~g=Rg+ℓ(g)v is another bounded linear right inverse, distinct from R. For the collar version choose v∈Cc∞(Ω∩U); this open set is nonempty since U contains the boundary. No canonical choice is claimed.

Source notes

Gagliardo's second half of Teorema [1.I] (printed p. 289) gives the norm bound for the extension of a boundary function in the trace space; Kampanou's Theorems 3.3 and 3.5 (printed pp. 23-31) patch the local lifts on Cl domains, and Schikorra's Section V.2 (printed pp. 98-101) is the flat model. The proof above keeps the localisation explicit so that the image can be confined to a prescribed collar, which is the property later pages use.

Depends on

Used by

Dependency tree · two levels

71 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