SearcharxivSearch

arXiv · 1805.07000

Factoring a minimal ultrafilter into a thick part and a syndetic part

Abstract

Let $S$ be an infinite discrete semigroup. The operation on $S$ extends uniquely to the Stone-\v{C}ech compactification $\beta S$ making $\beta S$ a compact right topological semigroup with $S$ contained in its topological center. As such, $\beta S$ has a smallest two sided ideal, $K(\beta S)$. An ultrafilter $p$ on $S$ is \emph{minimal} if and only if $p \in K(\beta S)$. We show that any minimal ultrafilter $p$ factors into a thick part and a syndetic part. That is, there exist filters $\mathcal F$ and $\mathcal G$ such that $\mathcal F$ consists only of thick sets, $\mathcal G$ consists only of syndetic sets, and $p$ is the unique ultrafilter containing $\mathcal F \cup \mathcal G$. Letting $L = \widehat{\mathcal F}$ and $C = \widehat{\mathcal G}$, the sets of ultrafilters containing $\mathcal F$ and $\mathcal G$ respectively, we have that $L$ is a minimal left ideal of $\beta S$, $C$ meets every minimal left ideal of $\beta S$ in exactly one point, and $L \cap C = \{p\}$. We show further that $K(\beta S)$ can be partitioned into relatively closed sets, each of which meets each minimal left ideal in exactly one point. With some weak cancellation assumptions on $S$, one has also that for each minimal ultrafilter $p$, $S^* \setminus \{p\}$ is not normal. In particular, if $p$ is a member of either of the disjoint sets $K(\beta \mathbb N , +)$ or $K(\beta \mathbb N , \cdot)$, then $\mathbb N^* \setminus \{p\}$ is not normal.

Explore related subjects

Keep this discovery

BibTeXRIS

Will Brian, Neil Hindman. 2018-05-18. Factoring a minimal ultrafilter into a thick part and a syndetic part. https://arxiv.org/abs/1805.07000

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

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO