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 for compactly supported Slobodeckij functions

Statement

Assume the Axiom of Choice. Let d≥1, 0<θ<1, 1≤p<∞ with pθ<d and p⋆=dpd−pθ. Let F⊆Wθ,p(Rd) be a family of functions all supported in one fixed bounded set. In the displayed nonnegative supremum, take the value 0 if F=∅. Assume it satisfies sup⁡g∈F(∥g∥Lp(Rd)+[g]θ,p)<∞. Then F is relatively compact in Lq(Rd) for every 1≤q<p⋆: every sequence in F has a subsequence converging in Lq(Rd).

Facts & Assumptions

Given: the Axiom of Choice, d≥1, 0<θ<1, 1≤p<∞ with pθ<d, p⋆=dp/(d−pθ), a family F⊆Wθ,p(Rd) supported in one fixed bounded set and bounded in the norm ∥⋅∥p+[⋅]θ,p by M<∞, and 1≤q<p⋆.

[F1]

Fractional Sobolev inequality. For real compactly supported g, ∥g∥Lp⋆p≤C1[g]θ,pp; hence ∥g−h∥p⋆≤C11/p([g]+[h]) for compactly supported g,h. For complex g, apply the real inequality to its real and imaginary parts, whose seminorms are at most [g]θ,p, and use the Lp⋆ triangle inequality, enlarging the constant by at most 2. (The critical fractional Sobolev inequality on Rd)

[F2]

Mollification rates. With the radial mollifier at scale δ, ∥g−gδ∥Lp≤C2δθ[g]θ,p and ∥gδ∥W1,p≤C2(∥g∥p+δθ−1[g]θ,p); the mollified functions are supported in the δ-neighbourhood of the fixed support set, and [gδ]θ,p≤[g]θ,p because ∣gδ(x)−gδ(y)∣≤∫ηδ(z)∣g(x−z)−g(y−z)∣ dz and Minkowski's inequality applies in the weighted Lp-space of the seminorm. (Mollification rates for compactly supported Slobodeckij functions, The Gagliardo--Slobodeckij space on Euclidean space)

[F3]

First-order compactness on a ball. For fixed δ>0, the mollified family is bounded in W1,p on a smooth ball containing all its supports. Its closure in Lp is compact by the first-order Rellich theorem, including dimension one. (Compactness of W1,p(Ω)↪Lp(Ω) on bounded extension domains)

Proof

technique · Obtain finite $L^p$ nets from uniform mollification error and first-order Rellich, then interpolate pairwise differences against the fractional critical bound
1.1F2F3F4given

The empty family is immediate. Otherwise fix a ball S containing the common bounded support and its distance-one neighbourhood, and use only 0<δ≤1. By [F2], Gδ is supported in S and bounded in W1,p; [F3] makes it totally bounded in Lp(Rd), since restriction to S and zero extension preserve distances on this family. Also sup⁡g∥g−gδ∥p≤C2δθM→0. Given ε>0, choose δ making this error less than ε/4 and a finite ε/4-net for Gδ. Its centres cover F with radius ε/2; choosing one point of F in every nonempty such ball moves the centres into F and gives an ε-net. Thus F is totally bounded in Lp.

2.1F1F4step 1.1

Fix 1≤q<p⋆. If q=p, step 1.1 applies. If q<p, all members and their differences vanish off S, so ∥g−h∥q≤∣S∣1/q−1/p∥g−h∥p by [F4]. If p<q<p⋆, [F1] gives ∥g−h∥p⋆≤2C11/pM for g,h∈F, and [F4] gives ∥g−h∥q≤∥g−h∥pλ(2C11/pM)1−λ with 0<λ<1 and 1/q=λ/p+(1−λ)/p⋆. Hence a sufficiently fine finite Lp net with centres in F is an Lq net in each case. If M=0, the family contains only the zero class.

3.1F4step 2.1∎

By [F4] the totally bounded closure in the complete space Lq(Rd) is compact and sequentially compact, giving the asserted subsequence for every sequence in F. The assumed Axiom of Choice supplies the first-order Rellich interface and Countable and Dependent Choice in [F4].

Depends on

Used by

Dependency tree · two levels

129 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