SearcharxivSearch

arXiv · 2302.05691

Methods of generating soft topologies and soft separation axioms

Abstract

The paper develops a novel analysis of mutual interactions between topology and soft topology. It is known that each soft topology produces a system of crisp (parameterized) topologies. The other way round is also possible. Namely, one can generate a soft topology from a system of crisp topologies. Different methods of producing soft topologies are discussed by implementing two formulas. Then, the relationships between the resulting soft topologies are obtained. With the help of an example, it is demonstrated that one formula is more constructible than the other. Now, it is reasonable to ask which (topological) properties of a soft topology can be transferred to the set of crisp topologies or the opposite. To address this question, we consider the standard separation axioms and show how well these axioms can be preserved when moving from a system of crisp topologies to the soft topology generated by it and contrariwise. Additionally, our findings extend and disprove some results from the literature.

Explore related subjects

Keep this discovery

BibTeXRIS

Zanyar A. Ameen, Baravan A. Asaad. 2023-02-11. Methods of generating soft topologies and soft separation axioms. https://arxiv.org/abs/2302.05691

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN