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.
A finite-dimensional normed subspace is closed
Statement
Let be a normed space over and let be a normed subspace over that same field: use Normed subspace for and A complex normed linear subspace for . If admits an ordered basis of finite length, including length zero, then is closed in . This holds in ZF, without a choice axiom; the ambient space need not be complete.
Facts & Assumptions
Given: A normed space over , a normed subspace , and an ordered basis of .
Such a normed space is Banach (Every finite-dimensional normed space is Banach).
An ordered basis is an independent finite list spanning its space; the empty list spans exactly the zero subspace (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
The restricted norm on a normed subspace is the ambient one (Normed subspace, A complex normed linear subspace).
Fix an enumeration and a bijection ( is countably infinite, ). Rational numbers, identified with their real images, approximate every real number (Both and are dense in , and every nonempty open subset of is uncountable, clause 1).
A supplied total self-map and a starting value determine a sequence by recursion (The recursion theorem); every nonempty subset of has a least element (The well-ordering principle).
For every some integer satisfies (For every in a complete ordered field there is a natural with ).
Realification preserves the norm and metric (Realification of a complex vector space by restriction of scalars, Realification preserves a complex norm and its metric). A complex normed subspace realifies to a real normed subspace, and its supplied complex basis yields the real basis (A complex normed subspace and its finite basis realify). Complex coordinate arithmetic is given by is the real coordinate plane, with coordinate arithmetic.
Proof
If , then by [L2]. Every has the open ball of radius disjoint from , so its complement is open and is closed. It remains to treat .
For , in the real case put and . In the complex case put , , and , and use real scalars. Splitting complex coefficients proves real spanning; grouping a real relation into a complex relation among the proves independence. Thus is a supplied ordered real basis of , and its norm is still the restricted ambient norm. By [L1], is complete for this metric.
Define maps for as follows: is the empty tuple, and The unique inverse pair of each natural makes this a total definition. Finite recursion, or [L5] on states consisting of a stage and such a map, produces the maps uniformly; after stage keep the state fixed. By induction each is surjective: given a tuple of length , its initial tuple has a preimage under , its final coordinate has a preimage under , and maps to the entire tuple. This uses two witnesses for one tuple, not a family of selected enumerations. Define Its image is exactly the rational span of this finite basis.
This image is dense in . For and , let be the least index satisfying Existence follows from rational density and [L5] gives the least index. Surjectivity of gives a value of equal to , and Hence every ball in meets .
Let be an ambient adherent point of , meaning every ball about meets . For each , first such adherence and then step 3.1 give a point within of and a value within of . Thus the set is nonempty. Set and . This defines the sequence outright by a unique-index rule. By [L6] the error tends to zero, so in , and makes it Cauchy in the restricted metric of .
Completeness from step 1.2 supplies with in the restricted norm. Since the norm agrees with the ambient one, so . Every ambient adherent point therefore belongs to . A point outside consequently has a ball disjoint from , making the complement open and closed. Together with step 1.1 this proves all cases, without manufacturing a sequence in an arbitrary subset or using countable choice.
Depends on
- Every finite-dimensional normed space is Banach
- Normed subspace
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- $\mathbb{Q}$ is countably infinite
- $\mathbb{N} \times \mathbb{N} \approx \mathbb{N}$
- Both $\mathbb{Q}$ and $\mathbb{R} \setminus \mathbb{Q}$ are dense in $\mathbb{R}$, and every nonempty open subset of $\mathbb{R}$ is uncountable
- The recursion theorem
- The well-ordering principle
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- $\mathbb C$ is the real coordinate plane, with coordinate arithmetic
- Complex norm and complex normed space
- A complex normed linear subspace
- Realification of a complex vector space by restriction of scalars
- Realification preserves a complex norm and its metric
- A complex normed subspace and its finite basis realify
Used by
- Finite-dimensional subspaces are complemented Corollary
- A compact operator can have nondense range Counterexample
- The L² unit sphere is not weakly sequentially closed in infinite dimensions Counterexample
- A reentrant-corner mode separates fixed-degree h error from hp error Example
- Isotypic Haar projections specialize to finite character sums Example
- Peter-Weyl for an infinite product of finite groups Example
- Projection onto a finite-dimensional subspace by a Gram matrix Example
- Projection onto the constants is the mean Example
- A finitely generated cone in Euclidean space is closed Lemma
- Bounded density and finite-vector transitivity for C*-representations Lemma
- Bounded finite rank operators are compact Lemma
- Every nonzero unitary representation of a compact group has a finite-dimensional subrepresentation Lemma
- GCR kernel and Mackey Borel characterizations Lemma
- Intersection of root subcomplexes and purity under convexity Lemma
- K-type decomposition of the SL2(R) principal series Lemma
- Local separable trace-class determinant construction Lemma
- Riesz Schauder ascent and descent stabilize Lemma
- The boundary of a convex set is Lebesgue null Lemma
- Trace-norm continuity, growth and multiplicativity of the local determinant Lemma
- Under dependent choice, Riesz lemma builds an infinite separated sequence in the unit sphere Lemma
- A normed space is locally compact if and only if it is finite-dimensional Theorem
- A split surjective derivative parametrises its level set Theorem
- Céa quasi-optimality for coercive conforming Galerkin problems Theorem
- Complete reducibility of finite-dimensional compact-group representations Theorem
- Constructive ordinary Sobolev polynomial approximation on triangles Theorem
- First Strang estimate for conforming perturbed Galerkin problems Theorem
- Isotypic projections are mutually orthogonal equivariant projections Theorem
- The closed unit ball is compact if and only if the normed space is finite-dimensional Theorem
Dependency tree · two levels
84 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)