Math 2.0

Functional analysis Topological vector spaces: basic notions Theorem

Kolmogorov's normability criterion

Builds on Hausdorff spaceConvex setvon Neumann bounded setNeighbourhoodNormMinkowski functional

Statement

Let 𝕂\mathbb{K} be ℝ\R or ℂ\C, and let EE be a Hausdorff topological vector space over 𝕂\mathbb{K}. Then some norm on EE induces the topology of EE if and only if 00 has a convex von Neumann bounded neighbourhood in EE.

Remarks

If the topology comes from a norm, the open unit ball is a convex bounded neighbourhood of 00. Conversely, a convex bounded neighbourhood of 00 contains a convex balanced open neighbourhood UU of 00, which is still bounded. Its Minkowski functional pUp_U is a seminorm, and boundedness of UU shows that the sets tUt U, t>0t > 0, form a neighbourhood base at 00, so pUp_U induces the topology. The Hausdorff property then forces pU(x)>0p_U(x) > 0 for x≠0x \ne 0, so pUp_U is a norm. Example: the Fréchet space C(ℝ)C(\R) with the seminorms pn(f)=sup⁡∣t∣≤n∣f(t)∣p_n(f) = \sup_{\abs{t} \le n} \abs{f(t)} is not normable, because no neighbourhood of 00 is bounded. The space Lp([0,1])L^p([0, 1]) with 0<p<10 < p < 1 is not normable either: it has bounded neighbourhoods of 00 but no convex ones other than the whole space. The Hausdorff hypothesis is needed: ℝ\R with the indiscrete topology is a topological vector space. In it, ℝ\R itself is a convex bounded neighbourhood of 00, but no norm induces this topology.

Going deeper

For a student

Local convexity means that the topology is generated by seminorms. So the criterion says that a locally convex space is normable precisely when one seminorm suffices, up to equivalence. It shows that spaces such as C∞(Ω)C^\infty(\Omega), H(Ω)H(\Omega) or the Schwartz space are not normable. In each of them a bounded neighbourhood of 00 would be relatively compact, which happens only in finite dimension. A topological vector space with a bounded neighbourhood of 00 is called locally bounded, so the criterion reads: normable means Hausdorff, locally convex and locally bounded. The construction of the norm is the same Minkowski functional argument that links convex sets and seminorms in the theory of locally convex spaces.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convex set concept
  2. Hausdorff space concept
  3. Minkowski functional concept
  4. Neighbourhood concept
  5. Norm concept
  6. von Neumann bounded set concept
  7. Kolmogorov's normability criterion statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Kolmogorov's_normability_criterion
About this page
Tag822WQ7S91T
URIm2://822WQ7S91T
Kindstatement, theorem
WritingW0 stub
MSC46A03
StatusThis copy of the site has no build data. Run m2 status 822WQ7S91T.
AboutNorm
UsesHausdorff space, Convex set, von Neumann bounded set, Neighbourhood, Norm, Minkowski functional
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.