Quelle CHAP007.htm Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/format/htm/CHAP007.htm

<html><head><title>[FORMAT] 7 Other Applications</title></head>
<body text="#000000" bgcolor="#ffffff">
[<a href = "chapters.htm">Up</a>] [<a href ="CHAP006.htm">Previous</a>] [<a href = "theindex.htm">Index</a>]
<h1>7 Other Applications</h1>

Up to this point our screens, i.e., normal subgroup functions, have yielded local formation residual subgroups, but there is no requirement that they do so. Screens for which the selected normal subgroups can be arbitrary have applications beyond formation theory. Chapter V of <a href="biblio.htm#CH"><cite>CH</cite></a> contains an account of a generalized normalizer theory built from them, and Wright (<a href="biblio.htm#WA"><cite>WA</cite></a> and <a href="biblio.htm#WB"><cite>WB</cite></a>) uses them to construct internal versions of formations that are conceptually related to ordinary formations much as Fitting sets are related to Fitting classes.

A major application of the generalized normalizers is to speed up computation of complements to normal factors (see <a href="biblio.htm#EW"><cite>EW</cite></a>).
Suppose that G is a finite solvable group with an elementary abelian
normal subgroup A for which there exists a normal subgroup N of G
containing A such that N/A is nilpotent and [N,A] = A. Then A has a complement in G, and all complements
are conjugate---indeed, they can be viewed as generalized
F-normalizers. We will show the idea, which of course is most useful with very large groups, by using <code>FNormalizerWrtFormation</code> to find a complement to an
elementary abelian normal subgroup, in this case to K in S4 with N = A4.

We need to define a formation <code>F</code> in GAP (not a real formation,
of course, just a local version) such that <code>ScreenOfFormation( F )(s4,p)</code> returns A4 for
every call. In order to call <code>FNormalizerWrtFormation</code> we must also set the property
<code>IsIntegrated</code> to <code>true</code>.
<pre>
gap> preform := rec( name := "ForComplement",
> fScreen := function( H, p )
> return Subgroup( H, GeneratorsOfGroup( H ){[2,3,4]});
> end);;
gap> form := Formation(preform);
formation of ForComplement groups
gap> SetIsIntegrated(form, true);
</pre>
Now we may use <code>FNormalizerWrtFormation</code> with <code>s4</code> to
get the complement, an S3. (Recall that unless <code>form</code> already
thinks it's integrated, FNormalizerWrtFormation will automatically
integrate <code>form</code> before running its computations, which may not be
the desired behavior.)
<pre>
gap> comp := FNormalizerWrtFormation(s4, form); Size(comp);
Group([ f1, f2 ])
6
</pre>

A user who wanted to employ the F-normalizer technique to compute very
many complements in this way would probably wish to create a new GAP
function by extracting portions of the code that computes
F-systems.


[<a href = "chapters.htm">Up</a>] [<a href ="CHAP006.htm">Previous</a>] [<a href = "theindex.htm">Index</a>]

<address>FORMAT manual January 2024
</address></body></html>

quality88%

¤ Dauer der Verarbeitung: 0.5 Sekunden ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.