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.
Compactly embedded normed spaces
Definition
Let and be normed spaces over the same field , read in the real case from A norm on a real vector space, the induced metric, and the dictionary with the metric axioms and in the complex case from Real and complex scalar conventions for normed spaces, and suppose with continuous inclusion : there is a real with for every .
One says that is compactly embedded in , written , when the inclusion operator is a compact operator in the sense of Compact linear operator: the image under of every bounded subset of (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) has compact closure in (Open cover, subcover, compact metric space, and compact subset of a metric space).
The sequential form. Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()) and the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain). Then if and only if every bounded sequence in has a subsequence converging in : Indeed, compact closure gives the sequence conclusion by For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice. Conversely, fix bounded and let . For any sequence in , Countable Choice selects with (start at ); a convergent subsequence of gives one of with the same limit, which belongs to the closed set . Thus is sequentially compact and For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice makes it compact. The empty case is immediate. Both readings of are used on this page; the second is the form in which the compactness theorems below are stated.
Continuity of the inclusion is a separate hypothesis and is never inferred from compactness: a compact operator is bounded by Compact linear operator and A bounded linear operator between normed spaces, but the definition above fixes the continuity of in advance. On this page the continuity of every Sobolev inclusion is verified separately, through the corresponding Sobolev embedding theorem.
Remarks
- The symbol is used only for pairs of normed spaces embedded in one another as above; it never abbreviates a claim that some particular Sobolev space is compactly embedded in another, which always requires its own theorem with its own domain, exponent and boundary hypotheses.
- If is finite-dimensional and is a normed space containing it with continuous inclusion, then : the coordinate isomorphism of A chosen algebraic basis identifies a finite-dimensional normed space with a coordinate space sends a closed bounded coordinate ball to a compact set containing any prescribed bounded subset of , by Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line (identify with ). Its image in is compact by continuity of the inclusion, and the closure of the bounded image is a closed subset of it. The zero-dimensional case is immediate.
- The two formulations agree without any hypothesis on or beyond their being normed spaces, and the choice cost of the passage between them is bounded above by Countable Choice plus Dependent Choice, as recorded in For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice.
Depends on
- Compact linear operator
- A norm on a real vector space, the induced metric, and the dictionary with the metric axioms
- Real and complex scalar conventions for normed spaces
- A bounded linear operator between normed spaces
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice
- 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
- A chosen algebraic basis identifies a finite-dimensional normed space with a coordinate space
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
Used by
- A bounded map into H¹₀ yields a compact L² operator Corollary
- Closed target constraints survive compact extraction Lemma
- Higher-order Rellich--Kondrachov compactness Theorem
- Morrey--Rellich compactness for p>n Theorem
- Rellich--Kondrachov at the critical source exponent p=n Theorem
- The Rellich--Kondrachov theorem for 1≤ p<n on bounded extension domains 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
- 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)