Alphabeta Math
DefinitionDefinition: AI-generatedProof: Not applicable
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.

Compatible compact Banach triples

Definition

Let X,B,Y be real Banach spaces, or complex Banach spaces over the same field, in the sense of Banach space. A compatible compact Banach triple is a pair of injective linear maps j:X→B and k:B→Y such that j is compact in the sense of Compact linear operator and k is bounded. We identify X with j(X) and B with k(B), using k∘j for the map from X into Y; the notation is X⋐B↪Y. Bounded means that there are finite constants Cj,Ck with ∥jx∥B≤Cj∥x∥X and ∥kb∥Y≤Ck∥b∥B. No density, reflexivity or Hilbert pivot is part of this definition. Compact means that the image of every norm-bounded subset of X has compact closure in B.

Justification

Given: The spaces and maps in the Definition.

1.1 A compact linear map is bounded by the final assertion of Compact linear operator, so Cj exists. The composite is injective because both maps are injective, and ∥kjx∥Y≤CkCj∥x∥X. Thus the three spaces can consistently be identified along these maps. [given, algebra]

1.2 Completeness is already required of each space by Banach space. The definition adds specified embeddings and compactness; it does not assert existence of such maps for arbitrary Banach spaces. Therefore its notation has exactly the stated hypotheses and no implicit Hilbert-space assumption. [given] ∎

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.