Countability, Completeness and the Closed Graph Theorem
The webs of M. De Wilde  have made an enormous contribution to the closed graph theorems in locally convex spaces(lcs). Although webs have a very intricate layered construction, two properties in particular have contributed to the closed graph theorem. First of all, webs possess a strong countability condition in the range space which suitably matches the Baire property of Fréchet spaces in the domain space; as a result the zero neighbourhood filter is mapped to a p-Cauchy filter, a filter attempting to settle down. Secondly webs provide a completeness condition which allow p-Cauchy filters to converge.
KeywordsCountable Basis Closed Graph Graph Theorem Completeness Property Closed Graph Theorem
Unable to display preview. Download preview PDF.
- 2.R. Beattie, A convenient category for the closed graph theorem, Categorical Topology, Proc. Conference Toledo, Ohio 1983, Heldermann, Berlin, 29–45 (1984).Google Scholar
- 3.R. Beattie and H. -P. Butzmann, Strongly first countable convergence spaces, Convergence Structures 1984, Proc. Conference on Convergence, Bechyne, Czechoslovakia, Akademie-Verlag, Berlin, 39–46 (1985).Google Scholar
- 4.M. De Wilde, Closed Graph Theorems and Webbed Spaces, Research Notes in Mathematics 19, Pitman, London (1978).Google Scholar