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 on arbitrary bounded open sets
Statement
Assume the Axiom of Choice. Let , let be a bounded open set with no boundary regularity assumed, let and . For every the space is compactly embedded in : every sequence bounded in has a subsequence converging in .
Facts & Assumptions
Given: the Axiom of Choice, a bounded open set , , , a target exponent , and a sequence with .
-compactness. Some subsequence converges in ; the extraction uses Countable and Dependent Choice. (Compactness of on bounded open sets, The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain)
Sobolev inequality for of an arbitrary bounded open set. for all , with ; the zero extensions of the therefore satisfy . (The Sobolev inequality for zero-boundary Sobolev closures on open sets, Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms, The Sobolev conjugate exponent and the scaling identity)
For , supply the endpoint separately: the zero extension of a zero-boundary class belongs to . Choose 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 the almost-everywhere subsequence theorem identify this limit with , since in as well. Passing to the limit in the endpoint inequality gives , and restriction supplies the bound asserted in [F2]. (Riesz-Fischer completeness of for , Assuming Countable Choice, -convergent sequences have almost-everywhere convergent subsequences)
Lyapunov interpolation and H"older. For and , ; 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 ; write . By [F2] the differences satisfy for all .
Fix . If , then [F3] gives by step 1.1; at the factor is . If , choose with ; [F3] gives by step 1.1. In both cases is Cauchy in , hence converges there by [F4].
Every bounded sequence in therefore has a subsequence convergent in , which is the asserted compact embedding; no property of was used. The Axiom of Choice is inherited through [F1] and the supplier [F2]; the extraction uses the Countable and Dependent Choice of [F1].
Depends on
- Compactness of $W^{1,p}_0(\Omega)\hookrightarrow L^p(\Omega)$ on bounded open sets
- The Sobolev inequality for zero-boundary Sobolev closures on open sets
- The Sobolev conjugate exponent and the scaling identity
- Lyapunov interpolation inequality for $L^p$ norms
- Holder's inequality for integrals, including the endpoint cases
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
- The space $L^p(\mu)$ as the quotient by null functions
- 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
- The critical Sobolev embedding is not compact Counterexample
- Rellich compactness is strictly subcritical Remark
Dependency tree · two levels
67 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)