1999
DOI: 10.1006/jabr.1998.7598
|View full text |Cite
|
Sign up to set email alerts
|

On Groups of Finite Morley Rank with Weakly Embedded Subgroups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
49
0

Year Published

1999
1999
2002
2002

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 19 publications
(49 citation statements)
references
References 17 publications
(23 reference statements)
0
49
0
Order By: Relevance
“…If it is a K-group then Proposition 5.21 in [2] and Fact 3.9 in [20] prove the statement. If it is a simple group then the arguments used to prove Proposition 2.33 in [3] show that the stabilizer of a connected component of G is weakly embedded in G. Then Fact 2.11 yields the stated identification. Proof.…”
Section: Weak Embeddingmentioning
confidence: 85%
See 2 more Smart Citations
“…If it is a K-group then Proposition 5.21 in [2] and Fact 3.9 in [20] prove the statement. If it is a simple group then the arguments used to prove Proposition 2.33 in [3] show that the stabilizer of a connected component of G is weakly embedded in G. Then Fact 2.11 yields the stated identification. Proof.…”
Section: Weak Embeddingmentioning
confidence: 85%
“…The following result was proved in [3] though stated somewhat differently; our formulation comes from [4]. …”
Section: O G Is the Largest Connected Definable Normalmentioning
confidence: 86%
See 1 more Smart Citation
“…Section 2.4) is a natural generalization of strong embedding and far more flexible in practice (see for example the rapid elimination of cores in 2-local subgroups at the end of [3]). Tameness will be discussed in Section 2.…”
Section: Theorem 11 Let G Be a Simple Tame K * -Group Of Finite Mormentioning
confidence: 98%
“…The present paper, together with the ongoing work on pushing up and the global C G T theorem, constitutes the last in the series of papers laying the foundations of the analysis of tame groups of even type by providing some general tools which are mostly connected with fusion analysis. One of the main tools in proving Theorem 1.1, or any of the classification theorems of this type, is the following classification theorem: Fact 1.2 [3]. Let G be a simple, tame, K * -group of finite Morley rank of even type.…”
Section: Theorem 11 Let G Be a Simple Tame K * -Group Of Finite Mormentioning
confidence: 99%