scholarly journals Chief factors in Polish groups

Author(s):  
COLIN D. REID ◽  
PHILLIP R. WESOLEK ◽  
FRANÇOIS LE MAÎTRE

Abstract In finite group theory, chief factors play an important and well-understood role in the structure theory. We here develop a theory of chief factors for Polish groups. In the development of this theory, we prove a version of the Schreier refinement theorem. We also prove a trichotomy for the structure of topologically characteristically simple Polish groups. The development of the theory of chief factors requires two independently interesting lines of study. First we consider injective, continuous homomorphisms with dense normal image. We show such maps admit a canonical factorisation via a semidirect product, and as a consequence, these maps preserve topological simplicity up to abelian error. We then define two generalisations of direct products and use these to isolate a notion of semisimplicity for Polish groups.

1991 ◽  
Vol 138 (1) ◽  
pp. 137-185 ◽  
Author(s):  
Zvi Arad ◽  
Harvey I. Blau

1992 ◽  
Vol 57 (4) ◽  
pp. 1469-1477 ◽  
Author(s):  
Alexandre V. Borovik ◽  
Ali Nesin

The Schur-Zassenhaus Theorem is one of the fundamental theorems of finite group theory. Here is its statement:Fact 1.1 (Schur-Zassenhaus Theorem). Let G be a finite group and let N be a normal subgroup of G. Assume that the order ∣N∣ is relatively prime to the index [G:N]. Then N has a complement in G and any two complements of N are conjugate in G.The proof can be found in most standard books in group theory, e.g., in [S, Chapter 2, Theorem 8.10]. The original statement stipulated one of N or G/N to be solvable. Since then, the Feit-Thompson theorem [FT] has been proved and it forces either N or G/N to be solvable. (The analogous Feit-Thompson theorem for groups of finite Morley rank is a long standing open problem).The literal translation of the Schur-Zassenhaus theorem to the finite Morley rank context would state that in a group G of finite Morley rank a normal π-Hall subgroup (if it exists at all) has a complement and all the complements are conjugate to each other. (Recall that a group H is called a π-group, where π is a set of prime numbers, if elements of H have finite orders whose prime divisors are from π. Maximal π-subgroups of a group G are called π-Hall subgroups. They exist by Zorn's lemma. Since a normal π-subgroup of G is in all the π-Hall subgroups, if a group has a normal π-Hall subgroup then this subgroup is unique.)The second assertion of the Schur-Zassenhaus theorem about the conjugacy of complements is false in general. As a counterexample, consider the multiplicative group ℂ* of the complex number field ℂ and consider the p-Sylow for any prime p, or even the torsion part of ℂ*. Let H be this subgroup. H has a complement, but this complement is found by Zorn's Lemma (consider a maximal subgroup that intersects H trivially) and the use of Zorn's Lemma is essential. In fact, by Zorn's Lemma, any subgroup that has a trivial intersection with H can be extended to a complement of H. Since ℂ* is abelian, these complements cannot be conjugated to each other.


1995 ◽  
Vol 09 (07) ◽  
pp. 819-847
Author(s):  
ROBERT R. TUCCI

This paper presents a new, computer-implementable algorithm for determining Bell inequalities. The algorithm is very general: one can use it to derive the Bell inequalities for any of the experiments that are usually considered for this purpose, such as the Bohm-Bell experiment, the Clauser-Horne experiment, or the experiments with spin 1, 3/2, 2 and 5/2 particles proposed by Mermin, Schwarz and Garg. As an example, this paper applies the algorithm to the Clauser-Horne experiment. The algorithm, which is based on simple notions from n-dimensional Euclidean geometry, gives a simple geometrical interpretation to the Bell inequalities. The algorithm allows one to demonstrate that a set of Bell inequalities is complete. The algorithm uses special hidden variables that were first used by Wigner and Belinfante. This paper also shows how to use finite group theory to express a set of Bell inequalities in a form that makes its invariance under relabellings explicit.


2010 ◽  
Vol 439-440 ◽  
pp. 1141-1146
Author(s):  
Jin Cang Han ◽  
Yang Li

In the work, the concept of orthogonal vector-valued trivariate wavelet packets, which is a generalization of uniwavelet packets, is introduced. A new method for constructing them is developed, and their characteristics is discussed by using time-frequency analysis method, matrix theory and finite group theory. Orthogonality formulas are established.


2003 ◽  
pp. 319-327
Author(s):  
Alexander Lubotzky ◽  
Dan Segal

Sign in / Sign up

Export Citation Format

Share Document