Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-23T16:09:28.989Z Has data issue: false hasContentIssue false

MONTEL (DF)-SPACES, SEQUENTIAL (LM)-SPACES AND THE STRONGEST LOCALLY CONVEX TOPOLOGY

Published online by Cambridge University Press:  24 March 2003

JERZY KĄKOL
Affiliation:
Faculty of Mathematics and Informatics, A Mickiewicz University, 60–769 Poznan, Matejki 48-79, [email protected]
STEPHEN A. SAXON
Affiliation:
Department of Mathematics, University of Florida, PO Box 118105, Gainesville, FL 32611-8105, [email protected]
Get access

Abstract

Topologists say that a space is sequential if every sequentially closed set is closed. Directly from the definitions, metrizable ⇒ Fréchet–Urysohn ⇒ sequential ⇒ $k$ -space. Kąkol showed that for an (LM)-space (the inductive limit of a sequence of locally convex metrizable spaces), metrizable , Fréchet–Urysohn. The Cascales and Orihuela result that every (LM)-space is angelic proved that for an (LM)-space, sequential [hArr ] $k$ -space. Within the class of (LM)-spaces, then, the four notions become only two distinct ones bearing the relation metrizable ⇒ sequential. Webb proved that every infinite-dimensional Montel (DF)-space is sequential but not Fréchet–Urysohn, and equivalently, not metrizable, since Montel (DF)-spaces are (LB)-spaces and, a fortiori, (LM)-spaces. Does the converse hold in the (LB)-space, (DF)-space or (LM)-space settings? Yes, in all cases. If a (DF)-space or (LM)-space is sequential, then it is either metrizable or it is a Montel (DF)-space. Pfister's result that every (DF)-space is angelic is needed, and the paper provides elementary proofs for this and the similar theorem by Cascales and Orihuela. The strongest locally convex topology plays a vital role throughout.

Type
Notes and Papers
Copyright
The London Mathematical Society, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)