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 , , with and . Let be a family of functions all supported in one fixed bounded set. In the displayed nonnegative supremum, take the value if . Assume it satisfies . Then is relatively compact in for every : every sequence in has a subsequence converging in .
Facts & Assumptions
Given: the Axiom of Choice, , , with , , a family supported in one fixed bounded set and bounded in the norm by , and .
Fractional Sobolev inequality. For real compactly supported , ; hence for compactly supported . For complex , apply the real inequality to its real and imaginary parts, whose seminorms are at most , and use the triangle inequality, enlarging the constant by at most . (The critical fractional Sobolev inequality on )
Mollification rates. With the radial mollifier at scale , and ; the mollified functions are supported in the -neighbourhood of the fixed support set, and because and Minkowski's inequality applies in the weighted -space of the seminorm. (Mollification rates for compactly supported Slobodeckij functions, The Gagliardo--Slobodeckij space on Euclidean space)
First-order compactness on a ball. For fixed , the mollified family is bounded in on a smooth ball containing all its supports. Its closure in is compact by the first-order Rellich theorem, including dimension one. (Compactness of on bounded extension domains)
Interpolation, completeness and compactness. Strict interpolation between and is supplied by Lyapunov interpolation inequality for norms; finite-measure inclusion follows from Holder's inequality for integrals, including the endpoint cases. Under Countable Choice, is complete and total boundedness passes to closures, so a totally bounded family has compact closure. Under Countable and Dependent Choice the closure is sequentially compact. (Riesz-Fischer completeness of for , A totally bounded metric space is bounded, every subspace of a totally bounded space is totally bounded, and the closure of a totally bounded subset is totally bounded, A complete, totally bounded metric space is compact, proved from countable choice used exactly once, For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice, Finite -net and totally bounded metric space)
Proof
The empty family is immediate. Otherwise fix a ball containing the common bounded support and its distance-one neighbourhood, and use only . By [F2], is supported in and bounded in ; [F3] makes it totally bounded in , since restriction to and zero extension preserve distances on this family. Also . Given , choose making this error less than and a finite -net for . Its centres cover with radius ; choosing one point of in every nonempty such ball moves the centres into and gives an -net. Thus is totally bounded in .
Fix . If , step 1.1 applies. If , all members and their differences vanish off , so by [F4]. If , [F1] gives for , and [F4] gives with and . Hence a sufficiently fine finite net with centres in is an net in each case. If , the family contains only the zero class.
By [F4] the totally bounded closure in the complete space is compact and sequentially compact, giving the asserted subsequence for every sequence in . The assumed Axiom of Choice supplies the first-order Rellich interface and Countable and Dependent Choice in [F4].
Depends on
- The critical fractional Sobolev inequality on $\mathbb R^d$
- Mollification rates for compactly supported Slobodeckij functions
- The Rellich--Kondrachov theorem for $1\le p<n$ on bounded extension domains
- Rellich--Kondrachov at the critical source exponent $p=n$
- Morrey--Rellich compactness for $p>n$
- Lyapunov interpolation inequality for $L^p$ norms
- The Gagliardo--Slobodeckij space on Euclidean space
- The space $L^p(\mu)$ as the quotient by null functions
- Finite $\varepsilon$-net and totally bounded metric space
- A complete, totally bounded metric space is compact, proved from countable choice used exactly once
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- The Axiom of Choice
- Compactness of $W^{1,p}(\Omega)\hookrightarrow L^p(\Omega)$ on bounded extension domains
- One-dimensional $W^{1,p}$ functions have unique absolutely continuous representatives
- Holder's inequality for integrals, including the endpoint cases
- The Fr\'echet--Kolmogorov compactness criterion in $L^p(\mathbb R^n)$
- Uniformly supported families have vanishing tails
- Riesz-Fischer completeness of $L^p$ for $1 \le p \le \infty$
- A totally bounded metric space is bounded, every subspace of a totally bounded space is totally bounded, and the closure of a totally bounded subset is totally bounded
- For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice
- Complex Holder, Minkowski, and the quotient norm
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
- Eleonora Di Nezza, Giampiero Palatucci and Enrico Valdinoci, Hitchhiker's guide to the fractional Sobolev spaces (arXiv:1104.4345, survey) (standard reference, not scraped)
- John K. Hunter, Notes on Partial Differential Equations (UC Davis, revised 18 June 2014, complete 242-page two-quarter notes) (standard reference, not scraped)