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 Rellich--Kondrachov theorem for on bounded extension domains
Statement
Assume the Axiom of Choice. Let , let be a bounded extension domain, let and . Then for every the inclusion is bounded and compact: every sequence bounded in has a subsequence converging in .
Facts & Assumptions
Given: the Axiom of Choice, a bounded extension domain , , , a target exponent , and a sequence with .
-compactness. Some subsequence converges in . (Compactness of on bounded extension domains, Sobolev extension domains and extension operators, Compactly embedded normed spaces)
Sobolev embedding on bounded extension domains. for all , , hence and . (Sobolev embedding on bounded extension domains for , The Sobolev conjugate exponent and the scaling identity, Integer-order Sobolev spaces and their norms)
For , supply the endpoint separately: take the given extension and smooth compactly supported in by Compactly supported smooth functions are dense in W^{k,p}(R^n). The endpoint The p=1 Gagliardo-Nirenberg-Sobolev inequality on differences makes Cauchy in ; completeness and almost-everywhere subsequences identify this limit with , since in . Passing to the limit gives , and restriction gives [F2]. (Riesz-Fischer completeness of for , Assuming Countable Choice, -convergent sequences have almost-everywhere convergent subsequences)
Interpolation and H"older. For , with ; for , . (Lyapunov interpolation inequality for norms, Holder's inequality for integrals, including the endpoint cases, The space as the quotient by null functions)
Under Countable Choice, each , , is complete. (Riesz-Fischer completeness of for )
Proof
If , all classes are zero and the claim is immediate. Otherwise, by [F1] extract a subsequence converging in and write ; by [F2] the differences satisfy .
Fix . If then by [F3] and step 1.1; if then [F3] gives . Completeness [F4] therefore makes converge in .
Boundedness of the inclusion holds for every by [F2] and the interpolation bound of [F3], and for by H"older's inequality of [F3]; compactness is the extraction just proved, so in the sense of Compactly embedded normed spaces. The Axiom of Choice is inherited through [F1] and the supplier [F2].
Depends on
- Compactness of $W^{1,p}(\Omega)\hookrightarrow L^p(\Omega)$ on bounded extension domains
- Sobolev embedding on bounded extension domains for $p<n$
- The Sobolev conjugate exponent and the scaling identity
- Lyapunov interpolation inequality for $L^p$ norms
- Holder's inequality for integrals, including the endpoint cases
- Sobolev extension domains and extension operators
- Integer-order Sobolev spaces and their norms
- The space $L^p(\mu)$ as the quotient by null functions
- Compactly embedded normed spaces
- 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
- Riesz-Fischer completeness of $L^p$ for $1 \le p \le \infty$
- The p=1 Gagliardo-Nirenberg-Sobolev inequality
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- Assuming Countable Choice, $L^p$-convergent sequences have almost-everywhere convergent subsequences
Used by
- Bounded Sobolev sequences have strongly convergent subsequences with the weak limit as limit Corollary
- Injectivity removes the Lᵖ term from the global W^2,p estimate Corollary
- Rellich compactness is strictly subcritical Remark
- Subcritical compactness for compactly supported Slobodeckij functions Theorem
Dependency tree · two levels
78 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
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026, complete graduate lecture notes) (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (University of Illinois, complete graduate notes) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (archived 2025 author manuscript) (standard reference, not scraped)
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations (Springer Universitext, 2011, complete text) (standard reference, not scraped)