zbMATH — the first resource for mathematics

Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Countability, completeness and the closed graph theorem. (English) Zbl 0744.46003
Generalized functions, convergence structures, and their applications, Proc. Int. Conf., Dubrovnik/Yugosl. 1987, 375-381 (1988).

[For the entire collection see Zbl 0708.00008.]

The webs of M. de Wilde have made an enormous contribution to the closed graph theorems in locally convex spaces $\left(\ell cs\right)$. 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.

In [the first author, Sigma Ser. Pure Math. 5, 29-45 (1984; Zbl 0574.46003) and Math. Nachr. 116, 159-164 (1984; Zbl 0574.46004)] webs were examined in the context of convergence spaces. The webs gave rise to a convergence vector space (cvs), the webspace, and the countability and completeness properties of the web were reflected in similar properties of the web-space. The weg-space turned out to play a central role in De Wilde closed graph theorems.

In this paper we show that neither the web nor the web-space is required for this type of closed graph theorem. Its validity depends precisely on the countability and completeness properties of the web-space and not on the intrinsic structure of the web itself.

MSC:
 46A30 Open mapping and closed graph theorems; completeness 46A19 Generalizations of topological linear spaces