SearcharxivSearch

arXiv · 1910.11287

A definability criterion for connected Lie groups

Abstract

It has been known since \cite{Pgroupchunk} that any group definable in an $o$-minimal expansion of the real field can be equipped with a Lie group structure. It is therefore natural to ask when is a Lie group Lie isomorphic to a group definable in such an expansion. Conversano, Starchenko and the first author answered this question in \cite{COSsolvable} in the case when the group is solvable. This paper answers similar questions in more general contexts. We first give a complete classification in the case when the group is linear. Specifically, a linear Lie group $G$ is Lie isomorphic to a group definable in an $o$-minimal expansion of the reals if and only if its solvable radical has the same property. We then deal with the general case of a connected Lie group, although unfortunately we cannot achieve a full characterization. Assuming that a Lie group $G$ has a "good Levi descomposition", we prove that in order for $G$ to be Lie isomorphic to a definable group it is necessary and sufficient that its solvable radical satisfies the conditions given in \cite{COSsolvable}.

Explore related subjects

Keep this discovery

BibTeXRIS

Alf Onshuus, Sacha Post. 2019-10-24. A definability criterion for connected Lie groups. https://arxiv.org/abs/1910.11287

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