Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 X and Y be normed spaces over the same field K∈{R,C}, 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 X⊆Y with continuous inclusion J:X→Y: there is a real C≥0 with ∥x∥Y≤C∥x∥X for every x∈X.

One says that X is compactly embedded in Y, written X⋐Y, when the inclusion operator J is a compact operator in the sense of Compact linear operator: the image under J of every bounded subset of X (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) has compact closure in Y (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 (ACω)) and the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain). Then X⋐Y if and only if every bounded sequence (xj) in X has a subsequence (xjk) converging in Y: 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 B⊆X and let K=J(B)‾. For any sequence (yj) in K, Countable Choice selects bj∈B with ∥yj−bj∥Y<1/j (start at j=1); a convergent subsequence of (bj) gives one of (yj) with the same limit, which belongs to the closed set K. Thus K 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 X⋐Y 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 J in advance. On this page the continuity of every Sobolev inclusion is verified separately, through the corresponding Sobolev embedding theorem.

Remarks

Depends on

Used by

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