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.
Every finite-dimensional normed space is Banach
Statement
Let be a normed space over and assume admits an ordered basis of finite length. Then is a Banach space in the sense of Banach space.
Facts & Assumptions
Given: A normed space over with an ordered basis .
The basis map is a topological isomorphism (A chosen algebraic basis identifies a finite-dimensional normed space with a coordinate space).
is the real coordinate plane with coordinate arithmetic ( is the real coordinate plane, with coordinate arithmetic). The coordinate function is a complex norm (The complex coordinate sum norm, including the zero space), and realification preserves its metric (Realification preserves a complex norm and its metric).
A Banach space is a normed space complete for its norm metric (Banach space).
Proof
By [L1], it is enough to prove that is complete for the coordinate norm, because a bounded bijection with bounded inverse preserves Cauchy sequences and their limits.
In the real case , if then is complete trivially. If , [L2] applies directly to the norm on , so is complete.
In the complex case, if the coordinate space is a singleton and complete. If , let send each coordinate to its real and imaginary parts. By [L3] it is a real-linear bijection, and is a real norm on . It is complete by [L2]. Since , the bijection transports Cauchy sequences and limits exactly; thus is complete in its complex coordinate norm metric.
Let be a Cauchy sequence in , and write . Since is bounded, is Cauchy in ; by steps 1.2 and 1.3 it converges to some . Since is bounded, in . Thus every Cauchy sequence in converges in .
By [L4], step 2.1 says exactly that is Banach.
Remarks
- The only substantive input is completeness of finite-dimensional real coordinate space. Everything else is transport of structure.
Depends on
- The complex coordinate sum norm, including the zero space
- Realification preserves a complex norm and its metric
- A chosen algebraic basis identifies a finite-dimensional normed space with a coordinate space
- All norms on a finite-dimensional complex normed space are equivalent
- Banach space
- For $n \ge 1$ a sequence in $\mathbb{R}^n$ converges iff each coordinate sequence converges, is Cauchy iff each coordinate sequence is Cauchy, and $\mathbb{R}^n$ is complete in every norm
- $\mathbb C$ is the real coordinate plane, with coordinate arithmetic
Used by
- A finite-dimensional normed subspace is closed Corollary
- A first resolvent estimate does not ensure the prescribed semigroup bound Counterexample
- Exact one-qubit gates and rotations Definition
- An affine shear field passes the frictionless contact patch test Example
- Bounded operators form a Banach algebra, noncommutative in dimension at least two Example
- Fredholm alternative for an integral equation Example
- One midpoint sample destroys a quadratic stiffness coercivity bound Example
- Spectrum in a finite-dimensional matrix algebra Example
- The standard basis of ℓ²(ℕ) Example
- The standard inner products make K n, ell two and quotient L two Hilbert spaces Example
- Vector and normalized-trace states on matrix algebras Example
- A Hurwitz matrix exponential has a polynomial-exponential decay bound Lemma
- Exponential Euler has a second-order local defect Lemma
- Finite matrix algebras with the operator norm are C star algebras Lemma
- Finite-dimensional conforming Ritz values satisfy min–max Lemma
- Integral representations of the first two phi functions Lemma
- Local convergence of the Baker–Campbell–Hausdorff series Lemma
- One-step stability after removing the exact linear flow Lemma
- Second derivative formula for a composed cycle map Lemma
- The logarithmic norm bounds forward and reverse matrix exponentials Lemma
- The scalar and matrix phi series converge absolutely Lemma
- The two-stage ETD2 method has a third-order local defect Lemma
- Variation of constants for a finite-matrix action defect Lemma
- Variation of constants for a finite-matrix semilinear system Lemma
- Riccati residual sensitivity and invariant graph conditioning retain spectral separation Proposition
- Separated DARE pencils have quantitatively stable deflating graphs Proposition
- Sufficient explicit Runge–Kutta order conditions through order four Proposition
- A Banach space has no countably infinite Hamel basis Theorem
- A CARE residual and Lyapunov margin certify a unique stabilizing root in a matrix ball Theorem
- A DARE residual, Stein inverse bound, and Lyapunov margin certify a stabilizing root Theorem
- A split surjective derivative parametrises its level set Theorem
- Arnoldi action error is the semigroup-weighted residual integral Theorem
- Complete reducibility of finite-dimensional compact-group representations Theorem
- Exact-Hessian SQP converges locally to a regular transcription KKT point Theorem
- Falk error bound for nodal Signorini contact Theorem
- Fixed-matrix global orders and certified-action error propagation Theorem
- Newton sign iteration converges off the imaginary axis and is locally quadratic Theorem
- Padé error and squaring defects give a conditional exponential error bound Theorem
- Pauli formula for an axis rotation Theorem
- Schauder compact adjoint theorem Theorem
…and 4 more results.
Dependency tree · two levels
44 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
- Daniel Daners, Introduction to Functional Analysis (standard reference, not scraped)
- Tomasz Kochanek, Functional analysis, Lecture 1 (standard reference, not scraped)