Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adapted
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 V be a normed space over K∈{R,C} and let W⊆V be a normed subspace over that same field: use Normed subspace for R and A complex normed linear subspace for C. If W admits an ordered basis of finite length, including length zero, then W is closed in V. This holds in ZF, without a choice axiom; the ambient space need not be complete.

Facts & Assumptions

Given: A normed space V over K∈{R,C}, a normed subspace W⊆V, and an ordered basis (bj)j<n of W.

[L1]

Such a normed space is Banach (Every finite-dimensional normed space is Banach).

[L2]

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).

[L3]

The restricted norm on a normed subspace is the ambient one (Normed subspace, A complex normed linear subspace).

[L4]

Fix an enumeration q:N→Q and a bijection p:N2→N (Q is countably infinite, N×N≈N). Rational numbers, identified with their real images, approximate every real number (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable, clause 1).

[L5]

A supplied total self-map and a starting value determine a sequence by recursion (The recursion theorem); every nonempty subset of N has a least element (The well-ordering principle).

[L6]

For every ε>0 some integer k≥1 satisfies 1/k<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[L7]

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 bj yields the real basis bj,ibj (A complex normed subspace and its finite basis realify). Complex coordinate arithmetic is given by C is the real coordinate plane, with coordinate arithmetic.

Proof

technique · direct
1.1givenL2algebra

If n=0, then W={0} by [L2]. Every x∈V∖{0} has the open ball of radius ∥x∥/2 disjoint from W, so its complement is open and W is closed. It remains to treat n>0.

1.2givenL1L2L3L7algebra

For n>0, in the real case put m=n and ej=bj. In the complex case put m=2n, e2j=bj, and e2j+1=ibj, and use real scalars. Splitting complex coefficients proves real spanning; grouping a real relation into a complex relation among the bj proves independence. Thus (ej)j<m is a supplied ordered real basis of W, and its norm is still the restricted ambient norm. By [L1], W is complete for this metric.

2.1L4L5step 1.2construct

Define maps Ej:N→Qj for j≤m as follows: E0(s) is the empty tuple, and Ej+1(p(s,t))=(Ej(s),q(t)). 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 m keep the state fixed. By induction each Ej is surjective: given a tuple of length j+1, its initial tuple has a preimage s under Ej, its final coordinate has a preimage t under q, and p(s,t) maps to the entire tuple. This uses two witnesses for one tuple, not a family of selected enumerations. Define d(s)=∑j<m(Em(s))jej. Its image is exactly the rational span of this finite basis.

3.1step 1.2step 2.1L4L5algebra

This image is dense in W. For w=∑j<majej and ε>0, let tj be the least index satisfying ∣aj−q(tj)∣<δ,δ=ε2m(1+∑j<m∥ej∥)>0. Existence follows from rational density and [L5] gives the least index. Surjectivity of Em gives a value of d equal to v=∑j<mq(tj)ej, and ∥w−v∥≤δ∑j<m∥ej∥<ε. Hence every ball in W meets d[N].

4.1step 3.1L3L5L6construct

Let x be an ambient adherent point of W, meaning every ball about x meets W. For each k∈N, first such adherence and then step 3.1 give a point w∈W within 1/(2(k+1)) of x and a value d(s) within 1/(2(k+1)) of w. Thus the set Ak={s∈N:∥x−d(s)∥<1/(k+1)} is nonempty. Set sk=min⁡Ak and uk=d(sk). This defines the sequence outright by a unique-index rule. By [L6] the error tends to zero, so uk→x in V, and ∥uk−ul∥≤∥uk−x∥+∥x−ul∥ makes it Cauchy in the restricted metric of W.

5.1step 1.1step 1.2step 4.1L3algebra∎

Completeness from step 1.2 supplies y∈W with uk→y in the restricted norm. Since the norm agrees with the ambient one, ∥x−y∥≤∥x−uk∥+∥uk−y∥⟶0, so x=y∈W. Every ambient adherent point therefore belongs to W. A point outside W consequently has a ball disjoint from W, making the complement open and W closed. Together with step 1.1 this proves all cases, without manufacturing a sequence in an arbitrary subset or using countable choice.

Depends on

Used by

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