SearcharxivSearch

arXiv · 1112.2652

Elementary equivalence of infinite-dimensional classical groups

Abstract

Let D be a division ring such that the number of conjugacy classes in the multiplicative group D^* is equal to the power of D^*. Suppose that H(V) is the group GL(V) or PGL(V), where V is an infinite-dimensional vector space over D. We prove, in particular, that, uniformly in dim(V) and D, the first-order theory of H(V) is mutually syntactically interpretable with the theory of the two-sorted structure (whose only relations are the division ring operations on D) in the second-order logic with quantification over arbitrary relations of power <= dim(V). A certain analogue of this results is proved for the groups the collinear groups GammaL(V) and PGammaL(V). These results imply criteria of elementary equivalence for infinite-dimensional classical groups of types H=GammaL, PGammaL, GL, PGL over division rings, and solve, for these groups, a problem posed by Felgner. It follows from the criteria that if H(V_1), H(V_2) are elementarily equivalent, then the cardinals dim(V_1) and dim(V_2) are second order equivalent as sets.

Explore related subjects

Keep this discovery

BibTeXRIS

Vladimir Tolstykh. 2011-12-12. Elementary equivalence of infinite-dimensional classical groups. https://arxiv.org/abs/1112.2652

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