SearcharxivSearch

arXiv · 2407.05462

Pairs of separably closed fields and exotic groups

Abstract

We look at simple groups associated primarily with the general theory of Moufang buildings, and to analyze their relation to stability theory in the model theoretic sense. As it becomes quite technical in the details, a lengthy introduction surveys the developments at a less detailed level. The text, beginning from the second section, first deals with some model theoretic algebra of fields, followed by an extended study of three associated families of simple groups coming from the theory of Tits buildings, Moufang polygons, and Timmesfeld's theory of exotic analogs of SL_2. The field theoretic part is fundamental ({\S}2). The rest of the paper relates this to group theoretic constructions, with two sections surveying the consequences for the original Tits and Timmesfeld theory before concentrating on the more exotic groups associated with Moufang polygons. A good deal of the group theoretical material is expository, aimed to make the relevant structural information meaningful to those coming from the direction of model theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Zoé Chatzidakis, Gregory Cherlin. 2024-07-07. Pairs of separably closed fields and exotic groups. https://arxiv.org/abs/2407.05462

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