EconPapers    
Economics at your fingertips  
 

B-Completeness and the Open-Mapping Theorem

Taqdir Husain
Additional contact information
Taqdir Husain: McMaster University

Chapter 4 in The Open Mapping and Closed Graph Theorems in Topological Vector Spaces, 1965, pp 45-58 from Springer

Abstract: Abstract In Chapter 3 we tried to find pairs E and F of 1.c. spaces for which statements (A) and (B) (Chapter 3, § 1) are true. To this end we proved several theorems. Continuing our search for such pairs, an apparent generalization of Theorems 3, 7, and 9 (Chapter 3) is suggested to the reader as follows: If E is a complete 1.c. space and F a t-space then statements (A) and (B) (Chapter 3, § 1) are true. Unfortunately this generalization is not true as will be shown in the sequel. One needs a stronger notion than that of completeness in order to have the open mapping and closed graph theorems. This is exactly where B-completeness comes in. The notion of B-completeness is due to V. Pták [28]. The results of this chapter are based on [28], [31] and [32]. Because of its repeated use we first prove the following:

Keywords: Open Mapping; Topological Vector Space; Canonical Mapping; Fundamental System; Dense Subspace (search for similar items in EconPapers)
Date: 1965
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-322-96210-2_4

Ordering information: This item can be ordered from
http://www.springer.com/9783322962102

DOI: 10.1007/978-3-322-96210-2_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-12-08
Handle: RePEc:spr:sprchp:978-3-322-96210-2_4