Covering compacta by discrete and other separated sets

نویسنده

  • G. Gruenhage
چکیده

Juhasz and van Mill denote by dis(X) the least cardinal of a cover of X by discrete subspaces. They show that dis(X) ≥ c (and hence the answer to Question 1.1 is positive) for any compact crowded hereditarily normal X. In fact, this follows from their stronger result that for such X, rs(X) + ls(X) ≥ c, where rs(X) (resp., ls(X)) is the least cardinal of a cover of X by right(resp., left)-separated subspaces. Here we prove that the answer to Question 1.1 is positive, without any further assumptions. Indeed, this is a corollary to our more general result that the property of being the union of ≤ κ-many discrete subspaces (i.e., dis(X) ≤ κ) is preserved by perfect mappings, a result proven earlier for the case κ = ω by D. Burke and R. Hansell [1]. It is still not known if either ls(X) ≥ c or rs(X) ≥ c holds for any compact crowded X. In [4], it is noted that rs(X) is at least m, tbe least cardinal of a cover of the real line by meager sets, and Juhasz and Szentmiklossy [5] showed that ls(X) ≥ m also. We obtain the partial result that both rs(X) ≥ c and ls(X) ≥ c hold for first countable crowded compacta, provided c is a regular cardinal. In [4], it is noted that any counterexample to Question 1.1 contains a separable counterexample which must have cardinality c. Their argument clearly works for the right and left-separated questions too.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

General form of a cooperative gradual maximal covering location problem

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

متن کامل

Branchpoint Covering Theorems for Confluent and Weakly Confluent Maps

A branchpoint of a compactum X is a point which is the vertex of a simple triod in X. A surjective map /: X -» Y is said to cover the branchpoints of Y if each branchpoint in Y is the image of some branchpoint in X. If every map in a class % of maps on a class of compacta & covers the branchpoints of its image, then it is said that the branchpoint covering property holds for ff on 0. According ...

متن کامل

Separated finitely supported $Cb$-sets

The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...

متن کامل

Multigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making

In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...

متن کامل

A robust approach to multi period covering location-allocation problem in pharmaceutical supply chain

This paper proposes a discrete capacitated covering location-allocation model for pharmaceutical centers. In the presented model, two objectives are considered; the first one is minimization of costs and the second one try to maximize customer satisfaction by definition of social justice. Social justice in the model means that we consider customers satisfaction by using distance. the introduced...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008