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.
Compactness of on bounded extension domains
Statement
Assume the Axiom of Choice. Let , let be a bounded -extension domain (Sobolev extension domains and extension operators) and let . Then is compactly embedded in : every sequence bounded in has a subsequence converging in . Every bounded domain is an example.
Facts & Assumptions
Given: the Axiom of Choice, a bounded -extension domain , , and a sequence with .
Extension operator. There is a bounded linear with and . (Sobolev extension domains and extension operators)
Cutoff. Since is compact and contained in the open set , with large enough to contain , there is with on and , a fixed bounded set. This construction also works for the empty domain, choosing any ball . (A Euclidean bump for a compact set inside an open set, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space)
Products with a smooth cutoff. If and , then with for a constant depending only on and . (Weak Leibniz rule with a smooth factor)
Translation estimate and automatic tails. Under the Axiom of Choice, ; a family supported in one fixed bounded set has vanishing tails. (The translation estimate for functions on , Uniformly supported families have vanishing tails)
The Fr'echet--Kolmogorov criterion. A bounded family in with vanishing tails and uniform translation control has an -convergent subsequence. (The Fr'echet--Kolmogorov compactness criterion in , The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain)
Restriction and norms. ; and almost everywhere. (Integer-order Sobolev spaces and their norms, The space as the quotient by null functions)
Bounded domains are extension domains. (Bounded C^k domains admit integer-order Sobolev extension)
Proof
Fix as in [F1] and as in [F2], and put . By [F3] each lies in and is supported in the fixed bounded set ; moreover , and almost everywhere on because there.
The family satisfies the three hypotheses of [F5]: it is bounded in by step 1.1; its tails vanish by [F4] because all members are supported in the fixed bounded set ; and [F4] gives with and independent of , so the translation control is uniform and tends to with .
By [F5] some subsequence converges in , say to ; restricting and using almost everywhere on together with [F6] gives , so converges in . This proves compactness of the inclusion; its boundedness follows from by [F1] and [F6]. Finally, [F7] says every bounded domain carries such an extension operator, giving the stated examples. The Axiom of Choice is inherited through [F1], [F4] and [F7], while the extraction uses the Countable and Dependent Choice of [F5].
Depends on
- The translation estimate for $W^{1,p}$ functions on $\mathbb R^n$
- Uniformly supported families have vanishing tails
- The Fr\'echet--Kolmogorov compactness criterion in $L^p(\mathbb R^n)$
- Sobolev extension domains and extension operators
- A Euclidean bump for a compact set inside an open set
- Weak Leibniz rule with a smooth factor
- Integer-order Sobolev spaces and their norms
- The space $L^p(\mu)$ as the quotient by null functions
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- Bounded C^k domains admit integer-order Sobolev extension
- 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
Used by
- Weak H¹ convergence plus compactness gives strong L² convergence Corollary
- Higher-order Rellich--Kondrachov compactness Theorem
- Local Lᵖ compactness of W^1,p_loc-bounded sequences Theorem
- Poincare-Wirtinger on bounded connected extension domains by Rellich compactness Theorem
- Rellich--Kondrachov at the critical source exponent p=n Theorem
- Subcritical compactness for compactly supported Slobodeckij functions Theorem
- The first positive Neumann eigenvalue has the mean-zero Rayleigh characterisation Theorem
- The Rellich--Kondrachov theorem for 1≤ p<n on bounded extension domains Theorem
- Weak Neumann solvability on the mean-zero subspace Theorem
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
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (University of Illinois, complete graduate notes) (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)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (archived 2025 author manuscript) (standard reference, not scraped)