Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/9211201

Set-theoretic aspects of periodic $FC$-groups --- extraspecial p-groups and Kurepa trees

Jörg Brendle
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a group G, we let Z(G) denote its center, G' its commutator subgroup, and Phi (G) its Frattini subgroup (the intersection of all maximal proper subgroups of G). Given U leq G, we let N_G (U) stand for the normalizer of U in G. A group G is FC iff every element g in G has finitely many conjugates. A p-group E is called extraspecial iff Phi (E) = E' = Z(E) cong Z_p, the cyclic group with p elements. When generalizing a characterization of centre-by-finite groups due to B. H. Neumann, M. J. Tomkinson asked the following question. Is there an FC-group G with vert G / Z(G) vert = kappa but [G:N_G(U)] < kappa for all (abelian) subgroups U of G, where kappa is an uncountable cardinal. We consider this question for kappa = omega_1 and kappa = omega_2. It turns out that the answer is largely independent of ZFC, and that it differs greatly in the two cases. More explicitly, for kappa = omega_1, it is consistent with, and independent of, ZFC that there is a group G with vert G / Z(G) vert = omega_1 and [G:N_G (A)] leq omega for all abelian A leq G. We do not know whether the same statement is still consistent if we drop abelian. On the other hand, for kappa = omega_2, the non-existence of groups G with vert G / Z(G) vert = omega_2 and [G : N_G (A) ] leq omega_1 for all (abelian) A leq G is equiconsistent with the existence of an inaccessible cardinal. In particular, there is an extraspecial p-group with this property if there is a Kurepa tree.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Jörg Brendle. 1992-11-03. Set-theoretic aspects of periodic $FC$-groups --- extraspecial p-groups and Kurepa trees. https://arxiv.org/abs/math/9211201

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗