SearcharxivSearch

arXiv · 2209.14425

Centralizer clones relative to a strong limit cardinal

Abstract

The notion of commutation of operations in universal algebra leads to the concept of centralizer clone and gives rise to a well-known class of problems that we call centralizer problems, in which one seeks to determine whether a given set of operations arises as a centralizer or, equivalently, coincides with its own double centralizer. Centralizer clones and centralizer problems in universal algebra have been studied by several authors, with early contributions by Cohn, Kuznecov, Danil'\v{c}enko, and Harnau. In this paper, we work within a generalized setting of infinitary universal algebra relative to a regular cardinal $\alpha$, thus allowing operations whose arities are sets of cardinality less than $\alpha$, and we study a notion of centralizer clone that is defined relative to $\alpha$. In this setting, we establish several new characterizations of centralizer clones and double centralizer clones, with special attention to the case in which $\alpha$ is a strong limit cardinal, and we discuss how these results enable a novel method for treating centralizer problems. We apply these results to establish positive solutions to finitary and infinitary centralizer problems for several specific classes of algebraic structures, including vector spaces, free actions of a group, and free actions of a free monoid.

Explore related subjects

Keep this discovery

BibTeXRIS

Rory B. B. Lucyshyn-Wright, Darian McLaren. 2022-09-28. Centralizer clones relative to a strong limit cardinal. https://arxiv.org/abs/2209.14425

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