Chain conditions in topology

By:

Comfort, W. W

Contributor(s):

Negrepontis, S [Co-Author]

Series: Cambridge tracts in mathematics, no. 79Publication details: Cambridge University Press, 2008. Cambridge:Description: xiii, 300p.; pbk; 24cmISBN:

9780521090629

Subject(s):

DDC classification:

514.32 COM

Summary: A chain condition is a property, typically involving considerations of cardinality, of the family of open subsets of a topological space. (Sample questions: (a) How large a fmily of pairwise disjoint open sets does the space admit? (b) From an uncountable family of open sets, can one always extract an uncountable subfamily with the finite intersection property. This monograph, which is partly fresh research and partly expository (in the sense that the authors co-ordinate and unify disparate results obtained in several different countries over a period of several decades) is devoted to the systematic use of infinitary combinatorial methods in topology to obtain results concerning chain conditions. The combinatorial tools developed by P. Erdös and the Hungarian school, by Erdös and Rado in the 1960s and by the Soviet mathematician Shanin in the 1940s, are adequate to handle many natural questions concerning chain conditions in product spaces. https://www.cambridge.org/core/books/chain-conditions-in-topology/F44FFAD5D7E675BDB0ECA722FDE39436#fndtn-information

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	IIT Gandhinagar	General	514.32 COM (Browse shelf(Opens below))	1	Available		031777

Includes index and references

A chain condition is a property, typically involving considerations of cardinality, of the family of open subsets of a topological space. (Sample questions: (a) How large a fmily of pairwise disjoint open sets does the space admit? (b) From an uncountable family of open sets, can one always extract an uncountable subfamily with the finite intersection property. This monograph, which is partly fresh research and partly expository (in the sense that the authors co-ordinate and unify disparate results obtained in several different countries over a period of several decades) is devoted to the systematic use of infinitary combinatorial methods in topology to obtain results concerning chain conditions. The combinatorial tools developed by P. Erdös and the Hungarian school, by Erdös and Rado in the 1960s and by the Soviet mathematician Shanin in the 1940s, are adequate to handle many natural questions concerning chain conditions in product spaces.

https://www.cambridge.org/core/books/chain-conditions-in-topology/F44FFAD5D7E675BDB0ECA722FDE39436#fndtn-information

There are no comments on this title.

to post a comment.