Alphabeta Math
LemmaStatement: 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.

The trace commutes with smooth cutoffs and is chart local

Statement

Assume the Axiom of Choice. Let Ω⊂Rn, n≥2, be a bounded C1 domain, 1≤p<∞, and let T be the trace operator of The Lp trace operator on a bounded C1 domain.

(i) If η∈Cc∞(Rn;K), then T(ηu)=(η∣∂Ω) Tu in Lp(∂Ω) for every u∈W1,p(Ω;K), and ∥T(ηu)∥Lp(∂Ω)≤Cη∥u∥W1,p(Ω).

(ii) If Ω′⊆Ω is a bounded C1 domain and ∂Ω∩∂Ω′ is relatively open in ∂Ω, then (Tu)∣∂Ω∩∂Ω′=TΩ′(u∣Ω′) a.e. for every u∈W1,p(Ω), where TΩ′ is the trace operator relative to Ω′; in particular the trace is local and compatible with restrictions to subdomains.

(iii) If a boundary chart Φ flattens a neighbourhood of a boundary point, then for u supported in a compact ambient patch inside that chart the transported trace equals T+ of the zero-extended flattened function after reflecting t↦−t and the corresponding boundary Lp norms agree up to the chart Jacobian.

Facts & Assumptions

Given: The Axiom of Choice; a bounded C1 domain Ω; 1≤p<∞; the trace operator T of The Lp trace operator on a bounded C1 domain; and the dense class D of restrictions to Ω of Cc∞(Rn) functions.

[F1]

T:W1,p(Ω)→Lp(∂Ω) is the unique bounded linear operator with Tu=u∣∂Ω for every u∈C(Ω‾)∩W1,p(Ω), and ∥Tu∥≤C(Ω,p)∥u∥W1,p(Ω); on each boundary chart it is the transported flat half-space trace. (The Lp trace operator on a bounded C1 domain)

[F2]

If a class in W1,p(Ω) has a continuous representative on Ω‾, its trace is the classical restriction of that representative. (The trace agrees with classical restriction for continuous Sobolev functions)

[F3]

Assume the Axiom of Choice. Restriction to an open subset is a contraction W1,p(Ω)→W1,p(U), and multiplication by the restriction of an ambient smooth function with bounded value and first derivatives is bounded on W1,p(Ω) with constant depending only on finitely many sup norms of derivatives of η. (Bounded restriction and cutoff localisation in Sobolev spaces, Weak Leibniz rule with a smooth factor)

[F4]

Assume the Axiom of Choice. D is dense in W1,p(Ω); and for a flattening chart Φ:W→B×R of a bounded Ck domain, k≥1, composition with Φ−1 is bounded from W1,p of a compact patch to W1,p of the corresponding flattened patch. (Ambient smooth restrictions are dense on bounded C^k domains, C^k boundary flattening preserves local W^{k,p})

[F5]

The half-space trace T+ is bounded from W1,p of the half-space to Lp of the flat boundary and agrees with classical restriction on the dense compactly supported smooth class. (The half-space trace estimate and the half-space trace operator)

[F6]

The surface integral on ∂Ω is defined chartwise with graph density J=1+∣Dh∣2 and is independent of the charts and partition; on the overlap of two subdomains sharing a boundary piece the two surface measures agree. (Surface integration on compact C1 hypersurfaces)

Proof

technique · direct
1.1F1F2F3F4algebra

Multiplicativity (i). Let u∈W1,p(Ω) and let um∈D with um→u in W1,p(Ω) by [F4]. Each um extends to a smooth compactly supported function, so ηum∈C(Ω‾)∩W1,p(Ω) has classical restriction (η∣∂Ω)(um∣∂Ω)=(η∣∂Ω)Tum by [F2]; hence T(ηum)=(η∣∂Ω)Tum. By [F3] ηum→ηu in W1,p(Ω), so T(ηum)→T(ηu) in Lp(∂Ω) by [F1]; and (η∣∂Ω)Tum→(η∣∂Ω)Tu because η∣∂Ω is bounded and multiplication by a bounded continuous function is continuous on Lp(∂Ω) (Holder). The identity follows, and the bound ∥T(ηu)∥≤C(Ω,p)∥ηu∥W1,p≤C(Ω,p)Cη∥u∥W1,p follows from [F1] and [F3].

1.2F1F2F3F4F6algebra

Locality (ii). Let Ω′⊆Ω be a bounded C1 domain with ∂Ω∩∂Ω′ relatively open in ∂Ω, and let TΩ′ be the trace operator relative to Ω′, which is defined by [F1] precisely when Ω′ is a bounded C1 domain of the type covered there. Define R:W1,p(Ω)→Lp(∂Ω∩∂Ω′), Ru:=(TΩ′(u∣Ω′))∣∂Ω∩∂Ω′, a bounded linear map by [F1] and [F3]. On the dense class D of smooth restrictions, Ru is the classical restriction of u to ∂Ω∩∂Ω′, which equals (Tu)∣∂Ω∩∂Ω′ by [F2]. Two bounded linear maps that agree on the dense subspace D are equal, so the identity holds on all of W1,p(Ω); the two surface measures agree on the common piece by [F6].

1.3F2F3F4F5F6algebra

Chart transport (iii). Fix a compact ambient patch K⊂W and a smooth ambient cutoff ζ∈Cc∞(W) equal to one near K. For u supported in K∩Ω‾, choose um∈D tending to u by [F4]. Then ζum→u in W1,p(Ω) by [F3]. Flatten, reflect, and extend each chart-supported function by zero within the half-space. These operations are bounded by [F4] (apply the local composition formula on interior patches and exhaust the chart with the uniform compact ambient derivative bounds); zero extension across the artificial chart edge is licensed by the cutoff support margin. The flattened functions are continuous, compactly supported and Sobolev, so their flat traces equal their classical restrictions by [F5], although they need only be C1, since the chart is C1. Those restrictions equal the transported T(ζum) by [F2]. Pass to the limit using both trace bounds. The surface formula [F6] gives the claimed norm comparison since its density is bounded above and below on the compact patch.

2.1step 1.1step 1.2step 1.3given∎

Conclusion. Step 1.1 proves (i) with the stated bound; step 1.2 proves (ii) by uniqueness of the bounded extension from the dense smooth class; step 1.3 proves (iii), including the equivalence of the transported boundary norms up to the chart Jacobian.

Source notes

Gagliardo's local-representation discussion (printed pp. 286-288) computes the trace chartwise and requires agreement on overlaps; Teschl's localisation argument (Lemma 9.21, printed p. 210) uses a partition of unity and checks compatibility of the traces on the flattened pieces; Schikorra's proofs of Theorems III.3.21-III.3.22 (printed pp. 76-77) are the second treatment. The lemma above isolates the three consequences used later: multiplicativity under smooth cutoffs, locality under restriction to subdomains, and the chart transport of the trace.

Depends on

Used by

Dependency tree · two levels

59 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