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.
If (Y) is Banach then (\mathcal B(X,Y)) is Banach
Statement
Let and be normed spaces over the same scalar field. If is Banach, then is Banach for the operator norm.
Facts & Assumptions
Given: A Banach space and an operator-norm Cauchy sequence in .
A Banach space is complete for its norm metric (Banach space).
For a bounded operator, the operator norm is the unit-ball supremum and satisfies for every (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
is the vector space of bounded linear operators (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators).
Proof
Fix . Since is Cauchy in operator norm, [L2] gives , so is a Cauchy sequence in . Because is Banach, there is with .
Step 1.1 defines a map . If , then for every , so passing to the limit gives . The same argument with gives . Thus is linear.
Choose such that for all . Fix and . For every , by [L2]. Letting in step 1.1 gives , so is bounded and hence .
Let . Since is operator-norm Cauchy, choose so that for all . Fix and with . Step 1.1 gives , so by [L2]. Taking the supremum over the unit ball yields .
Step 2.3 shows in operator norm, with by step 2.2. Therefore every operator-norm Cauchy sequence converges in , so is Banach by [L1].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Theo Buhler and Dietmar A. Salamon, Functional Analysis (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis (standard reference, not scraped)