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.
Complex Subspace Realification
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page establishes the real normed-subspace and finite-basis consequences of restricting scalars on a complex normed subspace. The induced metric remains the restricted ambient metric, and a supplied finite complex basis gives the interleaved real basis, including the zero-dimensional case.
3 · Logical flowchart
4 · Definitions, theorems and proofs
A complex normed subspace and its finite basis realify
Statement
Let be a complex normed space and let be a complex normed subspace with its restricted norm. Then is a real normed subspace of , and its norm metric is the restriction of the metric on to . If an ordered complex basis of is supplied, the interleaved list is an ordered real basis of . The basis clause includes .
Facts & Assumptions
Given: A complex normed space and a complex normed subspace . For the basis clause, an ordered complex basis is supplied as a finite list; the statement does not assert that such a basis exists.
A complex normed linear subspace defines as a complex-linear subspace with the restricted norm .
Realification of a complex vector space by restriction of scalars keeps the underlying set and addition and restricts scalar multiplication to the canonical real embedding.
Realification preserves a complex norm and its metric says the same norm makes a complex normed space real normed after realification, with the same underlying set, addition, norm values, and induced metric.
Normed subspace equips a real linear subspace with the restricted ambient norm.
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis requires each basis set to be linearly independent.
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis defines an ordered basis as a finite injective list whose image is a basis.
is the real coordinate plane, with coordinate arithmetic gives each complex number unique real coordinates and the coordinate arithmetic needed to expand a complex coefficient.
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis states that the empty set is a basis of the zero space and of no other space.
A complex norm is real-valued, separates zero, satisfies for every , and satisfies the triangle inequality (Complex norm and complex normed space).
Linear subspace of a vector space says a complex-linear subspace contains zero and is closed under addition and multiplication by every scalar in .
Normed subspace states that the induced metric on a normed subspace is the restriction of the ambient norm metric.
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis requires each basis set to span its vector space.
Linear combination of a finite list, and the span as the smallest linear subspace containing defines a linear combination as a finite sum of scalar multiples.
is exactly the set of linear combinations of finite lists of elements of , and identifies membership in a span with a finite linear combination.
Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent defines a linearly independent finite list by vanishing of every coefficient whenever its linear combination is zero.
In a vector space, addition is an abelian-group operation and scalar multiplication satisfies distributivity over vector addition and scalar addition, associativity of scalar multiplication, and the scalar identity law (Vector space over a field).
A finite list is linearly independent exactly when it is injective and its image is a linearly independent subset (Finite sums re-indexed along an injection, with a zero term deleted, and concatenated; and the closure properties of linear independence: an independent list is injective and never , its sublists are independent, a list is independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent).
Proof
The sets and additions underlying and are the original sets and additions by [F2]. By [F10], contains zero and is closed under addition and every complex scalar; therefore it is closed under the restricted real scalar action as well, so is a real linear subspace of .
If with , distributivity and scalar associativity [F16] give . The supplied complex basis list is injective by [F6] and has independent image by [F5], so [F17] makes it linearly independent; [F15] then forces each . Uniqueness of the coordinates in [F7] gives . Thus the displayed real list is linearly independent.
By [F1], . For , exactly when , hence exactly when by [F9]. For , closure under addition from [F10] and the ambient triangle inequality give . For every , by [F10], and [F9] gives . Thus is a complex normed space, so [F3] applies to both and ; with [F4], this makes a real normed subspace of .
Assume the supplied ordered complex basis exists. Its image spans by [F6] and [F12], so [F14] gives, for any , complex coefficients with , a finite linear combination in the sense of [F13]. Write each using [F7]. Distributivity and scalar associativity [F16] give , a real linear combination of the displayed list; conversely every such real combination lies in because is complex-linear. Hence the list spans .
For , subtraction is unchanged by realification [F2, F16] and the norms are unchanged by [F3], so . By [F11], this is exactly the restriction of the ambient metric to .
If , [F6] makes the supplied empty list an ordered basis and [F8] gives ; the empty real list is a basis of the same realification by [F2] and [F8]. If , steps 2.2 and 1.2 show the displayed list spans and is linearly independent. By [F17] it is injective with independent image, and step 2.2 gives that image's span as ; [F5] and [F12] make the image a basis, so [F6] makes the list an ordered real basis.
Remarks
The finite basis is an input, not a choice from a family. The argument uses no choice axiom.
5 · Examples, counterexamples and false statements
None yet.