Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Subcritical compactness of the Sobolev trace

Statement

Assume the Axiom of Choice. Let n≥2, let Ω⊂Rn be a bounded C1 domain, let T:W1,p(Ω)→Lp(∂Ω) be the trace of The Lp trace operator on a bounded C1 domain, and let 1<p<n with p∗:=(n−1)pn−p. Then T is compact as a map into Lq(∂Ω) for every 1≤q<p∗: every sequence bounded in W1,p(Ω) has a subsequence whose traces converge in Lq(∂Ω). If n<p<∞, then the traces of a suitable subsequence converge in C0,β(∂Ω) for every 0≤β<1−np, hence also in every Lq(∂Ω), 1≤q<∞; the endpoint case p=n is not claimed.

Facts & Assumptions

Given: the Axiom of Choice, a bounded C1 domain Ω⊂Rn, n≥2, and 1<p<∞, p≠n, with a sequence (uj) bounded in W1,p(Ω).

[F1]

Sharp trace boundedness. For 1<p<∞ and θ=1−1p, the trace satisfies ∥Tu∥Wθ,p(∂Ω)≤C∥u∥W1,p(Ω), where the boundary norm is the finite sum over a finite atlas of Euclidean Wθ,p-norms of compactly supported chart representations, and it is independent of the atlas up to equivalence. (The sharp trace theorem: boundedness and range in the fractional space, The fractional Sobolev space on a compact C1 boundary, Chart independence of the fractional boundary norm)

[F2]

Fractional compactness in dimension n−1. For 1<p<n and θ=1−1p one has (n−1)−pθ=n−p>0 and the critical exponent of Wθ,p(Rn−1) is (n−1)pn−p=p∗; a family of functions supported in one fixed bounded set and bounded in Wθ,p(Rn−1) is therefore relatively compact in Lq(Rn−1) for every 1≤q<p∗. (Subcritical compactness for compactly supported Slobodeckij functions, The fractional Sobolev space on a compact C1 boundary)

[F3]

Trace and chart cutoffs. The trace commutes with multiplication by smooth ambient cutoffs and with the chart parametrisations; on a compact boundary patch the surface-measure density of the parametrisation is continuous and positive, so Lq convergence of the finitely many chart representations gives Lq(∂Ω) convergence of their sum. (The trace commutes with smooth cutoffs and is chart local, Surface integration on compact C1 hypersurfaces, Finite ambient partitions near compact sets, Bounded C1 domains and their outward normals)

[F4]

The Morrey branch. For n<p<∞, the extension theorem at k=1 makes the bounded C1 domain Ω a W1,p-extension domain; hence a bounded sequence in W1,p(Ω) has a subsequence whose representatives converge in C0,β(Ω‾) for every 0≤β<1−np, and the trace of such a class is its classical boundary restriction. (Bounded C^k domains admit integer-order Sobolev extension, Morrey--Rellich compactness for p>n, The trace agrees with classical restriction for continuous Sobolev functions)

Proof

technique · bound the traces in the boundary fractional space, apply fractional compactness chart by chart, and take the Morrey branch for $p>n$
1.1F1given

Assume 1<p<n. By [F1] the traces satisfy sup⁡j∥Tuj∥Wθ,p(∂Ω)≤Csup⁡j∥uj∥W1,p(Ω)<∞ with θ=1−1p; by the definition of the boundary norm this means that each of the finitely many compactly supported chart representations of the traces is bounded in Wθ,p(Rn−1).

2.1F2F3step 1.1given

Choose exponents qℓ↑p∗ with 1≤qℓ<p∗. For each ℓ, [F2] applied successively on the finitely many charts supplies a common subsequence converging in every chart in Lqℓ. Dependent Choice selects nested subsequences for ℓ=1,2,…; their diagonal converges in each chart for each qℓ. For any 1≤q<p∗, choose ℓ with q<qℓ and use finite-measure inclusion on the common bounded chart supports. The chart Jacobian is bounded on each compact support, so [F3] transfers convergence of the finitely many chart pieces to convergence of their sum in Lq(∂Ω). Thus the same subsequence works throughout the stated range.

3.1F1F2F3F4step 2.1∎

If n<p<∞, [F4] first verifies the extension-domain hypothesis and then provides a subsequence of the uj whose representatives converge in C0,β(Ω‾) for every 0≤β<1−np, and their traces, being the classical boundary restrictions, converge in C0,β(∂Ω) and hence in every Lq(∂Ω), 1≤q<∞. The endpoint p=n would require the limiting fractional embedding at θ=1−1/n=d/p in dimension d=n−1 and is deliberately not claimed. The Axiom of Choice is inherited through the published trace theorem [F1] and the Morrey branch [F4].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

80 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