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.
Rellich compactness is strictly subcritical
Remarks
The compactness statements of this page are strictly subcritical ; the companion page gives witnesses for the critical target exponents and for escape to infinity.
- (i) For on a bounded domain the continuous embedding is not compact, so the strict inequality in The Rellich--Kondrachov theorem for on bounded extension domains and Subcritical compactness for on arbitrary bounded open sets cannot be replaced by (witness: a concentrating bump sequence ↗).
- (ii) On boundedness in and translation control alone do not give compactness: the family of translates of one compactly supported bump satisfies the boundedness and translation hypotheses of The Fr'echet--Kolmogorov compactness criterion in but not its tightness hypothesis, and has no strongly convergent subsequence (The tightness hypothesis of the Fr'echet--Kolmogorov criterion cannot be dropped ↗); the tightness hypothesis is therefore indispensable.
- (iii) In the Morrey range the endpoint H"older exponent is excluded from Morrey--Rellich compactness for (witness: rescaled H"older spikes ↗).
- (iv) At the critical source exponent , Rellich--Kondrachov at the critical source exponent gives compactness into every finite and makes no compactness claim. When is nonempty, the local log-log test function constructed in the proof of The critical Sobolev embedding into every finite belongs to and is essentially unbounded; this construction needs only an interior ball, independently of the extension hypotheses. For each its superlevel set has positive measure, so forces the best continuous embedding constants to tend to infinity as . On the empty domain all spaces are zero.
For the compactness theorems on extension domains, boundedness and the extension hypothesis are part of the stated setting. The compactness results need only bounded openness and zero extension, with no boundary regularity. On , translations and dilations destroy compactness when the corresponding tail control is absent.
Depends on
- 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$
- The Fr\'echet--Kolmogorov compactness criterion in $L^p(\mathbb R^n)$
- Subcritical compactness for $W^{1,p}_0$ on arbitrary bounded open sets
- The critical Sobolev embedding into every finite $L^q$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
49 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
- John K. Hunter, Notes on Partial Differential Equations (UC Davis, revised 18 June 2014, complete 242-page two-quarter notes) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (archived 2025 author manuscript) (standard reference, not scraped)
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026, complete graduate lecture notes) (standard reference, not scraped)