Mutually complementary families of 𝑇₁ topologies, equivalence relations and partial orders

Author:

Steprāns Juris,Watson Stephen

Abstract

We examine the maximum sizes of mutually complementary families in the lattice of topologies, the lattice of T 1 {T_1} topologies, the semi-lattice of partial orders and the lattice of equivalence relations. We show that there is a family of κ \kappa many mutually complementary partial orders (and thus T 0 {T_0} topologies) on κ \kappa and, using this family, build another family of κ \kappa many mutually T 1 {T_1} complementary topologies on κ \kappa . We obtain κ \kappa many mutually complementary equivalence relations on any infinite cardinal κ \kappa and thus obtain the simplest proof of a 1971 theorem of Anderson. We show that the maximum size of a mutually T 1 {T_1} complementary family of topologies on a set of cardinality κ \kappa may not be greater than κ \kappa unless ω > κ > 2 c \omega > \kappa > {2^c} . We show that it is consistent with and independent of the axioms of set theory that there be 2 {\aleph _2} many mutually T 1 {T_1} -complementary topologies on ω 1 {\omega _1} using the concept of a splitting sequence. We construct small maximal mutually complementary families of equivalence relations.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference20 articles.

1. Paul S. Alexandroff, Diskrete Raume, Mat. Sb. 2 (1937), 501-519.

2. \bysame, Sur les espaces discrets, C. R. Acad. Sci. Paris 200 (1935), 1649-1651.

3. Families of mutually complementary topologies;Anderson, B. A.;Proc. Amer. Math. Soc.,1971

4. 𝑇₁-complements of 𝑇₁ topologies;Anderson, B. A.;Proc. Amer. Math. Soc.,1969

5. Finite topologies and Hamiltonian paths;Anderson, B. A.;J. Combinatorial Theory Ser. B,1973

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3