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--Kondrachov at the critical source exponent
Statement
Assume the Axiom of Choice. Let and let be a bounded extension domain. Then is compactly embedded in for every finite : for each fixed , every sequence bounded in has a subsequence converging in . There is no claim of compactness into .
Facts & Assumptions
Given: the Axiom of Choice, a bounded extension domain , , 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)
Critical embedding into every finite . For every finite there is with for all ; the sequence is therefore uniformly bounded in for each fixed finite . (Higher-order Sobolev embedding (case , ), Integer-order Sobolev spaces and their norms)
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 fix and choose . By [F1] extract a subsequence converging in and write ; by [F2] the differences satisfy .
If , then by [F3] and step 1.1. If , then and [F3] gives for the corresponding . In both cases is Cauchy, hence convergent by [F4], in .
Every bounded sequence in therefore has a subsequence converging in for each fixed finite , so in the sense of Compactly embedded normed spaces. No compactness into is asserted. The proof uses only finite target exponents. 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
- The critical Sobolev embedding into every finite $L^q$
- 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$
- Higher-order Sobolev embedding
Used by
Dependency tree · two levels
76 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
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (archived 2025 author manuscript) (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)
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026, complete graduate lecture notes) (standard reference, not scraped)