SearcharxivSearch

arXiv · 2206.05471

Zero-divisor graph and comaximal graph of rings of continuous functions with countable range

Abstract

In this paper, two outwardly different graphs, namely, the zero divisor graph $\Gamma(C_c(X))$ and the comaximal graph $\Gamma_2^{'}(C_c(X))$ of the ring $C_c(X)$ of all real-valued continuous functions having countable range, defined on any Hausdorff zero dimensional space $X$, are investigated. It is observed that these two graphs exhibit resemblance, so far as the diameters, girths, connectedness, triangulatedness or hypertriangulatedness. are concerned. However, the study reveals that the zero divisor graph $\Gamma(A_c(X))$ of an intermediate ring $A_c(X)$ of $C_c(X)$ is complemented if and only if the space of all minimal prime ideals of $A_c(X)$ is compact. Moreover, $\Gamma(C_c(X))$ is complemented when and only when its subgraph $\Gamma(A_c(X))$ is complemented. On the other hand, the comaximal graph of $C_c(X)$ is complemented if and only if the comaximal graph of its over-ring $C(X)$ is complemented and the latter graph is known to be complemented if and only if $X$ is a $P$-space. Indeed, for a large class of spaces (i.e., for perfectly normal, strongly zero dimensional spaces which are not P-spaces), $\Gamma(C_c(X))$ and $\Gamma_2^{'}(C_c(X))$ are seen to be non-isomorphic. Defining appropriately the quotient of a graph, it is utilised to establish that for a discrete space $X$, $\Gamma(C_c(X))$ (= $\Gamma(C(X))$) and $\Gamma_2^{'}(C_c(X))$ (= $\Gamma_2^{'}(C(X))$) are isomorphic, if $X$ is atmost countable. Under the assumption of continuum hypothesis, the converse of this result is also shown to be true.

Explore related subjects

Keep this discovery

BibTeXRIS

Rakesh Bharati, Amrita Acharyya, A. Deb Ray, Sudip Kumar Acharyya. 2022-06-11. Zero-divisor graph and comaximal graph of rings of continuous functions with countable range. https://arxiv.org/abs/2206.05471

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