A normed vector space is a real or complex vector space with a norm satisfying positivity, definiteness, absolute homogeneity and the triangle inequality. It is separable if it has a countable dense subset for the norm distance.
First prove the unlabelled general assertions. If is dense in , choose whenever that intersection is nonempty. These choices form a countable subset of . For any and , choose with and with . The corresponding intersection is nonempty and . Thus every subspace of a separable normed vector space is separable.
If a countable has dense linear span, take all finite linear combinations of its elements with rational coefficients in the real case, or coefficients in in the complex case. This set is countable and dense in the linear span, by approximating the finitely many coefficients of each combination. Its closure is therefore , proving separability. Conversely, a countable dense set already has dense linear span.
For , use all finitely supported sequences with coordinates in . Truncate a sequence tending to zero to control its supremum tail, then approximate the finite initial coordinates. This produces a countable dense subset, so
Map each bounded sequence to the continuous function that takes value at the integer and is affine on every interval . Convexity of absolute value gives , and evaluation at integers gives equality of suprema. Thus is an isometric embedding of the l-infinity sequence space into .
The former is not separable by the allowed fact. If the latter were separable, the subspace result just proved would make its isometric copy of separable, a contradiction. Hence
For , truncation makes the tail arbitrarily small, since converges. Approximate the finite remaining coordinates by numbers in . The resulting countable set of finitely supported sequences is dense. ThereforeThe same construction also works for , though that endpoint is not needed here.
Articles by others on the same topic
There are currently no matching articles.