SSL chap7.html Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/ctbllib/doc2/chap7.html

<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (CTblLibXpls) - Chapter 7: Large Nilpotent Subgroups of Sporadic Simple Groups</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chap7" onload="jscontent()">

<div class="chlinktop">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chap10.html">10</a> <a href="chap11.html">11</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap6.html">[Previous Chapter]</a> <a href="chap8.html">[Next Chapter]</a> </div>

<a href="chap7_mj.html">[MathJax on]</a>
<a id="X8102827B85FE3BCA" name="X8102827B85FE3BCA"></a>
<div class="ChapSects"><a href="chap7.html#X8102827B85FE3BCA">7 Large Nilpotent Subgroups of Sporadic Simple Groups</a>
<div class="ContSect"> <a href="chap7.html#X7F817DC57A69CF0D">7.1 The Result</a>

</div>
<div class="ContSect"> <a href="chap7.html#X787B841383A16711">7.2 The Proof</a>

</div>
<div class="ContSect"> <a href="chap7.html#X798EACC07F6C36D9">7.3 Alternative: Use GAP's Tables of Marks

</div>
</div>

<h3>7 Large Nilpotent Subgroups of Sporadic Simple Groups</h3>

Date: June 6th, 2009

We show that any nontrivial nilpotent subgroup U in a sporadic simple group G satisfies |U| ⋅ |N_G(U)| < |G|. The proof uses the information in the Atlas of Finite Groups <a href="chapBib.html#biBCCN85">[CCN+85]</a> and the GAP system <a href="chapBib.html#biBGAP">[GAP24]</a>, in particular its Character Table Library <a href="chapBib.html#biBCTblLib">[Bre25]</a> and its library of Tables of Marks <a href="chapBib.html#biBTomLib">[MNP19]</a>. (In <a href="chapBib.html#biBVdo00">[Vdo00]</a>, it is shown that in any finite nonabelian simple group G, any nilpotent subgroup U satisfies |U|^2 < |G|.)

<a id="X7F817DC57A69CF0D" name="X7F817DC57A69CF0D"></a>

<h4>7.1 The Result</h4>

The aim of this writeup is to show the following statement.

Proposition: Let G be a sporadic simple group, let U be a nontrivial nilpotent subgroup in G, and let N_G(U) denote the normalizer of U in G. Then |U| ⋅ |N_G(U)| < |G| holds.

The following criteria are sufficient to prove this proposition. Note that we are interested in an argument that uses only information about the character tables of the sporadic simple groups and of their maximal subgroups.

Lemma 1: Let G be a nonabelian finite simple group, and suppose that U is a nontrivial nilpotent subgroup of G such that |U| ⋅ |N_G(U)| ≥ |G| holds. Let Π = { p_1, p_2, ..., p_n } be the set of prime divisors of |U|, and set n = ∏_{p ∈ Π} p.

<dl>
<dt>(a)</dt>
<dd>G contains an element g of order n and a maximal subgroup M with the properties g ∈ Z(U) and N_G(U) ≤ M. Set c:= gcd(|C_G(g)|_Π, |M|), where |C_G(g)|_Π denotes the largest divisor of the order of the centralizer of g in G whose prime divisors are elements of the set Π. Then we have |U| ≤ c and hence c ⋅ |M| ≥ |G|, in particular |M|^2 ≥ |G|.

</dd>
<dt>(b)</dt>
<dd>If (g, M) is as in part (a) then one of the following holds.

<dl>
<dt>(b1)</dt>
<dd>U is normal in M, and the Fitting subgroup Fit(M) of M satisfies |Fit(M)| ⋅ |M| ≥ |G|.

</dd>
<dt>(b2)</dt>
<dd>U is not normal in M, so N_G(U) is a proper subgroup of M, in particular |G| ≤ |U| ⋅ |M|/2 ≤ c ⋅ |M| / 2 holds.

</dd>
</dl>
</dd>
<dt>(c)</dt>
<dd>Let (g, M) be as in part (b2) and assume that M contains a normal subgroup K such that π(M):= M/K is an almost simple group with socle S, i. e., π(M) has a nonabelian simple normal subgroup S such that C_{π(M)}(S) is trivial. Then either U ≤ K holds, and hence |K| ⋅ |M| ≥ |G|, or we are in the following situation.

The group π(U):= U K / K is a nontrivial nilpotent normal subgroup of π(N):= N_G(U) K / K, and H:= S ∩ π(N) is a proper subgroup of S. The latter statement holds because otherwise S ∩ π(U) would be normal in S and thus would be trivial, which would imply that S would centralize π(U).

As a consequence, |π(N)| divides |π(M)/S| ⋅ |H| = |π(M)| / [S:H], in particular, [S:H] ≤ |π(M)| / |π(N)| = |M| / |N_G(U) K| ≤ |M| / |N_G(U)| ≤ |M| ⋅ |U| / |G| ≤ c / [G:M] holds.

</dd>
</dl>
We will apply Lemma 1 as follows.

From the character tables of G and M, the value |Fit(M)| and the maximal possible c can be computed. If part (a) of the lemma applies then we verify that part (b1) does not apply, and that either (b2) or (c) yields a contradiction. Note that we can determine from the character table of M whether M has a normal subgroup K such that M/K is almost simple, and in this case we can compute the order of the socle S of M/K.

For proving the nonexistence of the subgroup H in the situation of part (c), we will show that all subgroups of π(M) of index up to d:= c ⋅ [π(M):S] / [G:M] contain S. For that, we will compute the complete list of those possible permutation characters of π(M) whose degree is at most d, and then check that the kernels of these characters contain S.

(Note that these computations are cheap because the bound d is small in the cases that occur. There are easier criteria for proving the nonexistence of a subgroup of index at most d in a simple group S, for example in the case |S| > d! / 2 or if the smallest nontrivial irreducible degree of S is at least d; but these criteria do not suffice in our situation.)

We illustrate the application of Lemma 1 with some examples.

<dl>
<dt>J_1:</dt>
<dd>The first Janko group J_1 (see <a href="chapBib.html#biBCCN85">[CCN+85, p. 36]</a>) has order 175560, and the largest maximal subgroup has order 660. The largest centralizer of a nonidentity element in J_1 has order 120, and 660 ⋅ 120 = 79200 < |J_1|. Thus J_1 satisfies the proposition.

</dd>
<dt>��:</dt>
<dd>For the Monster group �� (see <a href="chapBib.html#biBCCN85">[CCN+85, p. 234]</a>), we read off from the list <a href="chapBib.html#biBMmaxes">[Wil]</a> of maximal subgroups that the only maximal subgroups M of �� with the property |M|^2 ≥ �� have the structure 2.B. Already for the second largest maximal subgroups, with the structure 2^{1+24}.Co_1, the order is smaller than the index in the Monster.

Only elements g from the classes <code class="code">2A</code>, <code class="code">2B</code>, and <code class="code">3A</code> have the property that the product of |2.B| and the order of the centralizer of g in M is not smaller than |M|. So U can be only a 2- or a 3-subgroup of 2.B. However, the 2-part and the 3-part of |2.B| are 2^42 and 3^13, respectively, which are smaller than the index of 2.B in M. Thus M satisfies the proposition.

</dd>
<dt>Fi_23:</dt>
<dd>We show that no counterexample to the proposition can arise from maximal subgroups M of the type O_8^+(3):S_3 in the Fischer group Fi_23 (see <a href="chapBib.html#biBCCN85">[CCN+85, p. 177]</a>). Several element centralizers in G satisfy Lemma 1 (a), the largest value c arises from elements in the class <code class="code">6B</code>, whose centralizers have order 2^8 ⋅ 3^9, which divides |M|. So |U| ≤ 2^8 ⋅ 3^9, and a possible counterexample to the proposition must satisfy |N_G(U)| ≥ |G| / (2^8 ⋅ 3^9) = 811588377600. We have |M| = 29713078886400, which is less than 37 times this minimal order required for N_G(U). However, the intersection H of this group with the simple subgroup S ≅ O_8^+(3) in M cannot be at most 36, because the largest maximal subgroups in S have index 1080 (see <a href="chapBib.html#biBCCN85">[CCN+85, p. 140]</a>). Arguing not with S but with M, we can show –using only the character table of M– that all proper subgroups of index less than 37 ⋅ 6 in M contain S.

</dd>
</dl>
<a id="X787B841383A16711" name="X787B841383A16711"></a>

<h4>7.2 The Proof</h4>

The following GAP function utilizes Lemma 1. Its input are the GAP character table <code class="code">tbl</code> of a group G, say, and a list <code class="code">maxesinfo</code> of character tables of maximal subgroups of G, covering at least all those maximal subgroups M for which |M|^2 ≥ |G| holds.

The idea is to collect pairs (M, g) that satisfy part (a) of Lemma 1, and then to show that they do not satisfy part (b) or part (c). For each maximal subgroup M that admits elements g as in Lemma 1, information is printed how this candidate is excluded.

The function returns a list of length three. The first entry is <code class="keyw">true</code> if the criteria of Lemma 1 are sufficient to prove that the proposition is true for G, and <code class="keyw">false</code> otherwise. The second entry is the name of G, and the third entry in the number of maximal subgroups M for which an element g as in Lemma 1 (a) exists.

<div class="example"><pre>
gap> ApplyTheLemma:= function( tbl, maxesinfo )
> local Gname, Gsize, cents, orders, result, Mtbl, Msize, maxc, i,
> pi, pipart, c, Mclasslengths, Fit, excluded, Kclasses, Mbar,
> Ksize, Sclasses, Ssize, d;
> Gname:= Identifier( tbl );
> Gsize:= Size( tbl );
> cents:= SizesCentralizers( tbl );
> orders:= OrdersClassRepresentatives( tbl );
> result:= [ true, Gname, 0 ];
> # Run over the relevant maximal subgroups.
> for Mtbl in maxesinfo do
> Msize:= Size( Mtbl );
> # Run over nonidentity class representatives g of squarefree
> # order, compute the largest c that occurs.
> maxc:= 1;
> for i in [ 2 .. NrConjugacyClasses( tbl ) ] do
> pi:= Factors( orders[i] );
> if IsSet( pi ) then
> # The elements in class `i' have squarefree order.
> pipart:= Product( Filtered( Factors( cents[i] ),
> x -> x in pi ) );
> c:= Gcd( pipart, Msize );
> if maxc < c then
> maxc:= c;
> fi;
> fi;
> od;
> if maxc * Msize >= Gsize then
> # Criterion (a) is satisfied, try to exclude (b) and (c).
> result[3]:= result[3] + 1;
> Print( Gname, ": consider M = ", Identifier( Mtbl ),
> ", c = ", StringPP( maxc ),
> ", c * |M| / |G| >= ", Int( maxc * Msize / Gsize ),
> "\n" );
> Mclasslengths:= SizesConjugacyClasses( Mtbl );
> Fit:= Mclasslengths{ ClassPositionsOfFittingSubgroup( Mtbl ) };
> if Sum( Fit ) * Msize >= Gsize then
> # Criterion (b1) is satisfied.
> Print( Gname, ": not excludable by (b1)\n" );
> result[1]:= false;
> elif maxc * Msize < 2 * Gsize then
> # Criterion (b2) is not satisfied.
> Print( Gname, ": excluded by (b2)\n" );
> else
> # Run over the normal subgroups of M.
> excluded:= false;
> for Kclasses in ClassPositionsOfNormalSubgroups( Mtbl ) do
> Mbar:= Mtbl / Kclasses;
> Ksize:= Sum( Mclasslengths{ Kclasses } );
> if IsAlmostSimpleCharacterTable( Mbar ) and
> Ksize * Msize < Gsize then
> # We are in the situation of criterion (c).
> # The socle is the unique minimal normal subgroup.
> Sclasses:= ClassPositionsOfMinimalNormalSubgroups(
> Mbar )[1];
> Ssize:= Sum( SizesConjugacyClasses( Mbar ){ Sclasses } );
> d:= Int( maxc * Msize * Size( Mbar )
> / ( Gsize * Ssize ) );
> # Try to show that all subgroups of index up to d
> # in Mbar contain the socle.
> if ForAll( [ 2 .. d ],
> n -> ForAll( PermChars( Mbar, rec( torso:= [ n ] ) ),
> chi -> IsSubset(
> ClassPositionsOfKernel( chi ),
> Sclasses ) ) ) then
> Print( Gname, ": excluded by (c), |K| = ",
> StringPP( Ksize ), ", degree bound ", d, "\n" );
> excluded:= true;
> break;
> fi;
> fi;
> od;
> if not excluded then
> Print( Gname, ": not excludable by (c)\n" );
> result[1]:= false;
> fi;
> fi;
> fi;
> od;
> return result;
> end;;
</pre></div>

So our proof relies on the classifications of maximal subgroups of sporadic simple groups, see <a href="chapBib.html#biBCCN85">[CCN+85]</a> and <a href="chapBib.html#biBBN95">[BN95]</a>.

The GAP Character Table Library <a href="chapBib.html#biBCTblLib">[Bre25]</a> contains the character tables of the sporadic simple groups and of their maximal subgroups, except that not all character tables of maximal subgroups of the Monster group are available yet. (See Section <a href="chap7.html#X7F817DC57A69CF0D">7.1</a> for the treatment of the Monster group.)

Since the GAP Character Table Library is used for the computations in this section, we first load this package.

<div class="example"><pre>
gap> LoadPackage( "ctbllib", false );
true
</pre></div>

Now we apply the function to the sporadic simple groups.

<div class="example"><pre>
gap> info:= [];; 
gap> for name in AllCharacterTableNames( IsSporadicSimple, true,
> IsDuplicateTable, false ) do
> tbl:= CharacterTable( name );
> if HasMaxes( tbl ) then
> mx:= List( Maxes( tbl ), CharacterTable ); 
> elif name = "M" then
> mx:= [ CharacterTable( "2.B" ) ];
> else
> Error( "this should not happen ...");
> fi;
> Add( info, ApplyTheLemma( tbl, mx ) );
> od;
B: consider M = 2.2E6(2).2, c = 2^38, c * |M| / |G| >= 20
B: excluded by (c), |K| = 2, degree bound 40
Co1: consider M = Co2, c = 2^13*3^5, c * |M| / |G| >= 20
Co1: excluded by (c), |K| = 1, degree bound 20
Co1: consider M = 3.Suz.2, c = 2^13*3^5, c * |M| / |G| >= 1
Co1: excluded by (b2)
Co2: consider M = U6(2).2, c = 2^16, c * |M| / |G| >= 28
Co2: excluded by (c), |K| = 1, degree bound 56
Co2: consider M = 2^10:m22:2, c = 2^18, c * |M| / |G| >= 5
Co2: excluded by (c), |K| = 2^10, degree bound 11
Co2: consider M = 2^1+8:s6f2, c = 2^18, c * |M| / |G| >= 4
Co2: excluded by (c), |K| = 2^9, degree bound 4
Co3: consider M = McL.2, c = 2^4*3^4, c * |M| / |G| >= 4
Co3: excluded by (c), |K| = 1, degree bound 9
F3+: consider M = Fi23, c = 2^9*3^9, c * |M| / |G| >= 32
F3+: excluded by (c), |K| = 1, degree bound 32
Fi22: consider M = 2.U6(2), c = 2^7*3^6, c * |M| / |G| >= 26
Fi22: excluded by (c), |K| = 2, degree bound 26
Fi22: consider M = O7(3), c = 2^7*3^6, c * |M| / |G| >= 6
Fi22: excluded by (c), |K| = 1, degree bound 6
Fi22: consider M = Fi22M3, c = 2^7*3^6, c * |M| / |G| >= 6
Fi22: excluded by (c), |K| = 1, degree bound 6
Fi22: consider M = O8+(2).3.2, c = 2^7*3^6, c * |M| / |G| >= 1
Fi22: excluded by (b2)
Fi23: consider M = 2.Fi22, c = 2^8*3^9, c * |M| / |G| >= 159
Fi23: excluded by (c), |K| = 2, degree bound 159
Fi23: consider M = O8+(3).3.2, c = 2^8*3^9, c * |M| / |G| >= 36
Fi23: excluded by (c), |K| = 1, degree bound 219
HS: consider M = M22, c = 2^7, c * |M| / |G| >= 1
HS: excluded by (b2)
M11: consider M = A6.2_3, c = 2^4, c * |M| / |G| >= 1
M11: excluded by (b2)
M12: consider M = M11, c = 2^4, c * |M| / |G| >= 1
M12: excluded by (b2)
M12: consider M = M12M2, c = 2^4, c * |M| / |G| >= 1
M12: excluded by (b2)
M22: consider M = L3(4), c = 2^6, c * |M| / |G| >= 2
M22: excluded by (c), |K| = 1, degree bound 2
M22: consider M = 2^4:a6, c = 2^7, c * |M| / |G| >= 1
M22: excluded by (b2)
M23: consider M = M22, c = 2^7, c * |M| / |G| >= 5
M23: excluded by (c), |K| = 1, degree bound 5
M24: consider M = M23, c = 2^7, c * |M| / |G| >= 5
M24: excluded by (c), |K| = 1, degree bound 5
M24: consider M = 2^4:a8, c = 2^10, c * |M| / |G| >= 1
M24: excluded by (b2)
McL: consider M = U4(3), c = 3^6, c * |M| / |G| >= 2
McL: excluded by (c), |K| = 1, degree bound 2
Ru: consider M = 2F4(2)'.2, c = 2^12, c * |M| / |G| >= 1
Ru: excluded by (b2)
Suz: consider M = G2(4), c = 2^12, c * |M| / |G| >= 2
Suz: excluded by (c), |K| = 1, degree bound 2
</pre></div>

First of all, we see that Lemma 1 is sufficient to prove the proposition, since all candidates were excluded.

Moreover, we see that for the following ten sporadic simple groups, no candidates had to be considered. (No information was printed about these groups.)

<div class="example"><pre>
gap> Filtered( info, x -> x[3] = 0 );
[ [ true, "HN", 0 ], [ true, "He", 0 ], [ true, "J1", 0 ],
 [ true, "J2", 0 ], [ true, "J3", 0 ], [ true, "J4", 0 ],
 [ true, "Ly", 0 ], [ true, "M", 0 ], [ true, "ON", 0 ],
 [ true, "Th", 0 ] ]
</pre></div>

<a id="X798EACC07F6C36D9" name="X798EACC07F6C36D9"></a>

<h4>7.3 Alternative: Use GAP's Tables of Marks

We can easily inspect all conjugacy classes of subgroups of a group G whose table of marks is contained in GAP's Library of Tables of Marks [MNP19]. First we load this GAP package.

<div class="example"><pre>
gap> LoadPackage( "tomlib", false );
true
</pre></div>

The following GAP function takes the table of marks of a group G and returns the list of pairs [ U, N_G(U) ] where U ranges over representatives of conjugacy classes of those nilpotent subgroups of G for which |U| ⋅ |N_G(U)| is maximal.

<div class="example"><pre>
gap> maximalpairs:= function( tom )
> local g, max, result, i, u, n, prod;
> g:= UnderlyingGroup( tom );
> max:= 1;
> result:= [];
> for i in [ 1 .. Length( OrdersTom( tom ) ) ] do
> u:= RepresentativeTom( tom, i );
> if not IsTrivial( u ) and IsNilpotent( u ) then
> n:= Normalizer( g, u );
> prod:= Size( u ) * Size( n );
> if max < prod then
> max:= prod;
> result:= [ [ u, n ] ];
> elif max = prod then
> Add( result, [ u, n ] );
> fi;
> fi;
> od;
> return result;
> end;;
</pre></div>

So let us collect the data for those sporadic simple groups for which the table of marks is known.

<div class="example"><pre>
gap> info:= [];;
gap> for name in AllCharacterTableNames( IsSporadicSimple, true,
> IsDuplicateTable, false ) do
> tom:= TableOfMarks( name );
> if tom <> fail then
> Add( info, [ name, tom, maximalpairs( tom ) ] );
> fi;
> od;
gap> Length( info );
12
</pre></div>

We got results for twelve sporadic simple groups. The following computations show that in ten cases, the simple group G contains a unique class of nontrivial nilpotent subgroups U for which the maximal value of |U| ⋅ |N_G(U)| is attained. The ratio of this value and |G| is less than 21 per cent. The following table shows the name of the group G, the orders of U and N_G(U), and the integral part of 10^6 times the ratio.

<div class="example"><pre>
gap> List( info, x -> Length( x[3] ) );
[ 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1 ]
gap> mat:= [];;
gap> for entry in info do
> pair:= entry[3][1]; # [ U, N_G(U) ]
> bound:= Size( pair[1] ) * Size( pair[2] ); # |U|*|N_G(U)|
> size:= Size( UnderlyingGroup( entry[2] ) ); # |G|
> Add( mat, [ entry[1],
> StringPP( Size( pair[1] ) ),
> StringPP( Size( pair[2] ) ),
> Int( 10^6 * bound / size ) ] );
> if Size( pair[1] ) * Size( pair[2] ) >= 21/100 * size then
> Error("!");
> fi;
> od;
gap> PrintArray( mat );
[ [ Co3, 3^5, 2^5*3^7*5*11, 1886 ],
 [ HS, 2^6, 2^9*3*7, 15515 ],
 [ He, 2^6, 2^10*3^3*5, 2195 ],
 [ J1, 19, 2*3*19, 12337 ],
 [ J2, 2^6, 2^7*3^2, 121904 ],
 [ J3, 3^5, 2^3*3^5, 9404 ],
 [ M11, 3^2, 2^4*3^2, 163636 ],
 [ M12, 2^5, 2^6*3, 64646 ],
 [ M22, 2^4, 2^7*3^2*5, 207792 ],
 [ M23, 2^4, 2^7*3^2*5*7, 63241 ],
 [ M24, 2^6, 2^10*3^3*5, 36137 ],
 [ McL, 3^5, 2^4*3^6*5, 15779 ] ]
</pre></div>

Moreover, we see that in most cases, the group U for which the maximum is attained is not the largest p-subgroup in the simple group in question.

<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chap6.html">[Previous Chapter]</a> <a href="chap8.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chap8.html">8</a> <a href="chap9.html">9</a> <a href="chap10.html">10</a> <a href="chap11.html">11</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div>

<hr />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</body>
</html>

quality100%

¤ Dauer der Verarbeitung: 0.22 Sekunden (vorverarbeitet) ¤

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.