<html><head><title>[ref] 58 Abelian Number Fields</title></head>
<body text="#000000" bgcolor="#ffffff">
[<a href="../index.htm">Top</a>] [<a href = "chapters.htm">Up</a>] [<a href ="CHAP057.htm">Previous</a>] [<a href ="CHAP059.htm">Next</a>] [<a href = "theindex.htm">Index</a>]
<h1>58 Abelian Number Fields</h1><p>
<P>
<H3>Sections</H3>
<oL>
<li> <A HREF="CHAP058.htm#SECT001">Construction of Abelian Number Fields</a>
<li> <A HREF="CHAP058.htm#SECT002">Operations for Abelian Number Fields</a>
<li> <A HREF="CHAP058.htm#SECT003">Integral Bases of Abelian Number Fields</a>
<li> <A HREF="CHAP058.htm#SECT004">Galois Groups of Abelian Number Fields</a>
<li> <A HREF="CHAP058.htm#SECT005">Gaussians</a>
</ol><p>
<p>
An <strong>abelian number field</strong> is a field in characteristic zero
that is a finite dimensional normal extension of its prime field
such that the Galois group is abelian.
In <font face="Gill Sans,Helvetica,Arial">GAP</font>, one implementation of abelian number fields is given by fields
of cyclotomic numbers (see Chapter <a href="CHAP018.htm">Cyclotomic Numbers</a>).
Note that abelian number fields can also be constructed with
the more general <code>AlgebraicExtension</code> (see <a href="CHAP065.htm#SSEC001.1">AlgebraicExtension</a>),
a discussion of advantages and disadvantages can be found
in <a href="CHAP018.htm#SECT006">Internally Represented Cyclotomics</a>.
The functions described in this chapter have been developed for fields
whose elements are in the filter <code>IsCyclotomic</code> (see <a href="CHAP018.htm#SSEC001.3">IsCyclotomic</a>),
they may or may not work well for abelian number fields consisting of
other kinds of elements.
<p>
Throughout this chapter, <b>Q</b><sub><i>n</i></sub> will denote the cyclotomic field
generated by the field <b>Q</b> of rationals together with <i>n</i>-th roots of
unity.
<p>
In <a href="CHAP058.htm#SECT001">Construction of Abelian Number Fields</a>, constructors for abelian
number fields are described,
<a href="CHAP058.htm#SECT002">Operations for Abelian Number Fields</a> introduces operations for abelian
number fields,
<a href="CHAP058.htm#SECT003">Integral Bases of Abelian Number Fields</a> deals with the vector space
structure of abelian number fields, and
<a href="CHAP058.htm#SECT004">Galois Groups of Abelian Number Fields</a> describes field automorphisms
of abelian number fields,
<p>
<p>
<h2><a name="SECT001">58.1 Construction of Abelian Number Fields</a></h2>
<p><p>
Besides the usual construction using <code>Field</code> or <code>DefaultField</code>
(see <a href="CHAP058.htm#SECT002">Operations for Abelian Number Fields</a>),
abelian number fields consisting of cyclotomics can be created with
<code>CyclotomicField</code> and <code>AbelianNumberField</code>.
<p>
<a name = "SSEC001.1"></a>
<li><code>CyclotomicField( </code><var>n</var><code> ) F</code>
<li><code>CyclotomicField( </code><var>gens</var><code> ) F</code>
<li><code>CyclotomicField( </code><var>subfield</var><code>, </code><var>n</var><code> ) F</code>
<li><code>CyclotomicField( </code><var>subfield</var><code>, </code><var>gens</var><code> ) F</code>
<p>
The first version creates the <var>n</var>-th cyclotomic field <b>Q</b><sub><i>n</i></sub>.
The second version creates the smallest cyclotomic field containing the
elements in the list <var>gens</var>.
In both cases the field can be generated as an extension of a designated
subfield <var>subfield</var> (cf. <a href="CHAP058.htm#SECT003">Integral Bases of Abelian Number Fields</a>).
<p>
<a name = "I0"></a>
<code>CyclotomicField</code> can be abbreviated to <code>CF</code>,
this form is used also when <font face="Gill Sans,Helvetica,Arial">GAP</font> prints cyclotomic fields.
<p>
Fields constructed with the one argument version of <code>CF</code> are stored in
the global list <code>CYCLOTOMIC_FIELDS</code>,
so repeated calls of <code>CF</code> just fetch these field objects after they have
been created once.
<p>
<pre>
gap> CyclotomicField( 5 ); CyclotomicField( [ Sqrt(3) ] );
CF(5)
CF(12)
gap> CF( CF(3), 12 ); CF( CF(4), [ Sqrt(7) ] );
AsField( CF(3), CF(12) )
AsField( GaussianRationals, CF(28) )
</pre>
<p>
<a name = "SSEC001.2"></a>
<li><code>AbelianNumberField( </code><var>n</var><code>, </code><var>stab</var><code> ) F</code>
<p>
For a positive integer <var>n</var> and a list <var>stab</var> of prime residues modulo
<var>n</var>, <code>AbelianNumberField</code> returns the fixed field of the group described
by <var>stab</var> (cf. <a href="CHAP058.htm#SSEC002.4">GaloisStabilizer</a>), in the <var>n</var>-th cyclotomic field.
<code>AbelianNumberField</code> is mainly thought for internal use and for printing
fields in a standard way;
<code>Field</code> (see <a href="CHAP056.htm#SSEC001.3">Field</a>, cf. also <a href="CHAP058.htm#SECT002">Operations for Abelian Number Fields</a>)
is probably more suitable if one knows generators of the field in
question.
<p>
<a name = "I1"></a>
<code>AbelianNumberField</code> can be abbreviated to <code>NF</code>,
this form is used also when <font face="Gill Sans,Helvetica,Arial">GAP</font> prints abelian number fields.
<p>
Fields constructed with <code>NF</code> are stored in the global list
<code>ABELIAN_NUMBER_FIELDS</code>,
so repeated calls of <code>NF</code> just fetch these field objects after they have
been created once.
<p>
<pre>
gap> NF( 7, [ 1 ] );
CF(7)
gap> f:= NF( 7, [ 1, 2 ] ); Sqrt(-7); Sqrt(-7) in f;
NF(7,[ 1, 2, 4 ])
E(7)+E(7)^2-E(7)^3+E(7)^4-E(7)^5-E(7)^6
true
</pre>
<p>
<a name = "SSEC001.3"></a>
<li><code>GaussianRationals V</code>
<a name = "SSEC001.3"></a>
<li><code>IsGaussianRationals( </code><var>obj</var><code> ) C</code>
<p>
<code>GaussianRationals</code> is the field <b>Q</b><sub>4</sub> = <b>Q</b>(√{−1})
of Gaussian rationals, as a set of cyclotomic numbers,
see Chapter <a href="CHAP018.htm">Cyclotomic Numbers</a> for basic operations.
This field can also be obtained as <code>CF(4)</code> (see <a href="CHAP058.htm#SSEC001.1">CyclotomicField</a>).
<p>
The filter <code>IsGaussianRationals</code> returns <code>true</code> for the <font face="Gill Sans,Helvetica,Arial">GAP</font> object
<code>GaussianRationals</code>, and <code>false</code> for all other <font face="Gill Sans,Helvetica,Arial">GAP</font> objects.
<p>
(For details about the field of rationals, see Chapter <a href="CHAP016.htm">Rationals</a>.)
<p>
<pre>
gap> CF(4) = GaussianRationals;
true
gap> Sqrt(-1) in GaussianRationals;
true
</pre>
<p>
<p>
<h2><a name="SECT002">58.2 Operations for Abelian Number Fields</a></h2>
<p><p>
For operations for elements of abelian number fields, e.g.,
<code>Conductor</code> (see <a href="CHAP018.htm#SSEC001.5">Conductor</a>) or <code>ComplexConjugate</code> (see <a href="CHAP018.htm#SSEC005.2">ComplexConjugate</a>),
see Chapter <a href="CHAP018.htm">Cyclotomic Numbers</a>.
<p>
<a name = "I2"></a>
For a dense list <i>l</i> of cyclotomics, <code>DefaultField</code> (see <a href="CHAP056.htm#SSEC001.4">DefaultField</a>)
returns the smallest cyclotomic field containing all entries of <i>l</i>,
<code>Field</code> (see <a href="CHAP056.htm#SSEC001.3">Field</a>) returns the smallest field containing all entries of
<i>l</i>, which need not be a cyclotomic field.
In both cases, the fields represent vector spaces over the rationals
(see <a href="CHAP058.htm#SECT003">Integral Bases of Abelian Number Fields</a>).
<p>
<pre>
gap> DefaultField( [ E(5) ] ); DefaultField( [ E(3), ER(6) ] );
CF(5)
CF(24)
gap> Field( [ E(5) ] ); Field( [ E(3), ER(6) ] );
CF(5)
NF(24,[ 1, 19 ])
</pre>
<p>
<a name = "I3"></a>
Factoring of polynomials over abelian number fields consisting of cyclotomics
works in principle but is not very efficient if the degree of the field
extension is large.
<p>
<pre>
gap> x:= Indeterminate( CF(5) );
x_1
gap> Factors( PolynomialRing( Rationals ), x^5-1 );
[ x_1-1, x_1^4+x_1^3+x_1^2+x_1+1 ]
gap> Factors( PolynomialRing( CF(5) ), x^5-1 );
[ x_1-1, x_1+(-E(5)), x_1+(-E(5)^2), x_1+(-E(5)^3), x_1+(-E(5)^4) ]
</pre>
<p>
<a name = "SSEC002.1"></a>
<li><code>IsNumberField( </code><var>F</var><code> ) P</code>
<p>
<a name = "I4"></a>
returns <code>true</code> if the field <var>F</var> is a finite dimensional extension
of a prime field in characteristic zero, and <code>false</code> otherwise.
<p>
<a name = "SSEC002.2"></a>
<li><code>IsAbelianNumberField( </code><var>F</var><code> ) P</code>
<p>
<a name = "I5"></a>
returns <code>true</code> if the field <var>F</var> is a number field (see <a href="CHAP058.htm#SSEC002.1">IsNumberField</a>)
that is a Galois extension of the prime field, with abelian Galois group
(see <a href="CHAP056.htm#SSEC003.1">GaloisGroup!of field</a>).
<p>
<a name = "SSEC002.3"></a>
<li><code>IsCyclotomicField( </code><var>F</var><code> ) P</code>
<p>
returns <code>true</code> if the field <var>F</var> is a <strong>cyclotomic field</strong>, i.e.,
an abelian number field (see <a href="CHAP058.htm#SSEC002.2">IsAbelianNumberField</a>)
that can be generated by roots of unity.
<p>
<pre>
gap> IsNumberField( CF(9) ); IsAbelianNumberField( Field( [ ER(3) ] ) );
true
true
gap> IsNumberField( GF(2) );
false
gap> IsCyclotomicField( CF(9) );
true
gap> IsCyclotomicField( Field( [ Sqrt(-3) ] ) );
true
gap> IsCyclotomicField( Field( [ Sqrt(3) ] ) );
false
</pre>
<p>
<a name = "SSEC002.4"></a>
<li><code>GaloisStabilizer( </code><var>F</var><code> ) A</code>
<p>
Let <var>F</var> be an abelian number field (see <a href="CHAP058.htm#SSEC002.2">IsAbelianNumberField</a>)
with conductor <i>n</i>, say.
(This means that the <i>n</i>-th cyclotomic field is the smallest cyclotomic
field containing <var>F</var>, see <a href="CHAP018.htm#SSEC001.5">Conductor</a>.)
<code>GaloisStabilizer</code> returns the set of all those integers <i>k</i> in the range
from 1 to <i>n</i> such that the field automorphism induced by raising
<i>n</i>-th roots of unity to the <i>k</i>-th power acts trivially on <var>F</var>.
<p>
<pre>
gap> r5:= Sqrt(5);
E(5)-E(5)^2-E(5)^3+E(5)^4
gap> GaloisCyc( r5, 4 ) = r5; GaloisCyc( r5, 2 ) = r5;
true
false
gap> GaloisStabilizer( Field( [ r5 ] ) );
[ 1, 4 ]
</pre>
<p>
<p>
<h2><a name="SECT003">58.3 Integral Bases of Abelian Number Fields</a></h2>
<p><p>
Each abelian number field is naturally a vector space over <b>Q</b>.
Moreover, if the abelian number field <i>F</i> contains the <i>n</i>-th cyclotomic
field <b>Q</b><sub><i>n</i></sub> then <i>F</i> is a vector space over <b>Q</b><sub><i>n</i></sub>.
In <font face="Gill Sans,Helvetica,Arial">GAP</font>, each field object represents a vector space object over a
certain subfield <i>S</i>, which depends on the way <i>F</i> was constructed.
The subfield <i>S</i> can be accessed as the value of the attribute
<code>LeftActingDomain</code> (see <a href="CHAP055.htm#SSEC001.11">LeftActingDomain</a>).
<p>
The return values of <code>NF</code> (see <a href="CHAP058.htm#SSEC001.2">AbelianNumberField</a>) and of the one
argument versions of <code>CF</code> (see <a href="CHAP058.htm#SSEC001.1">CyclotomicField</a>) represent vector spaces
over <b>Q</b>,
and the return values of the two argument version of <code>CF</code> represent
vector spaces over the field that is given as the first argument.
For an abelian number field <var>F</var> and a subfield <var>S</var> of <var>F</var>,
a <font face="Gill Sans,Helvetica,Arial">GAP</font> object representing <var>F</var> as a vector space over <var>S</var> can be
constructed using <code>AsField</code> (see <a href="CHAP056.htm#SSEC001.9">AsField</a>).
<p>
<a name = "I6"></a>
Let <var>F</var> be the cyclotomic field <b>Q</b><sub><i>n</i></sub>, represented as a vector space
over the subfield <var>S</var>.
If <var>S</var> is the cyclotomic field <b>Q</b><sub><i>m</i></sub>, with <i>m</i> a divisor of <i>n</i>,
then <code>CanonicalBasis( </code><var>F</var><code> )</code> returns the Zumbroich basis of <var>F</var> relative
to <var>S</var>, which consists of the roots of unity <tt>E</tt><tt>(</tt><i>n</i> <tt>)</tt><sup><i>i</i></sup> where <var>i</var> is
an element of the list <code>ZumbroichBase( </code><var>n</var><code>, </code><var>m</var><code> )</code> (see <a href="CHAP058.htm#SSEC003.1">ZumbroichBase</a>).
If <var>S</var> is an abelian number field that is not a cyclotomic field
then <code>CanonicalBasis( </code><var>F</var><code> )</code> returns a normal <var>S</var>-basis of <var>F</var>, i.e.,
a basis that is closed under the field automorphisms of <var>F</var>.
<p>
<a name = "I7"></a>
Let <var>F</var> be the abelian number field <code>NF( </code><var>n</var><code>, </code><var>stab</var><code> )</code>, with conductor
<var>n</var>, that is itself not a cyclotomic field,
represented as a vector space over the subfield <var>S</var>.
If <var>S</var> is the cyclotomic field <b>Q</b><sub><i>m</i></sub>, with <i>m</i> a divisor of <i>n</i>,
then <code>CanonicalBasis( </code><var>F</var><code> )</code> returns the Lenstra basis of <var>F</var> relative
to <var>S</var> that consists of the sums of roots of unity described by
<code>LenstraBase( </code><var>n</var><code>, </code><var>stab</var><code>, </code><var>stab</var><code>, </code><var>m</var><code> )</code> (see <a href="CHAP058.htm#SSEC003.2">LenstraBase</a>).
If <var>S</var> is an abelian number field that is not a cyclotomic field
then <code>CanonicalBasis( </code><var>F</var><code> )</code> returns a normal <var>S</var>-basis of <var>F</var>.
<p>
<pre>
gap> f:= CF(8);; # a cycl. field over the rationals
gap> b:= CanonicalBasis( f );; BasisVectors( b );
[ 1, E(8), E(4), E(8)^3 ]
gap> Coefficients( b, Sqrt(-2) );
[ 0, 1, 0, 1 ]
gap> f:= AsField( CF(4), CF(8) );; # a cycl. field over a cycl. field
gap> b:= CanonicalBasis( f );; BasisVectors( b );
[ 1, E(8) ]
gap> Coefficients( b, Sqrt(-2) );
[ 0, 1+E(4) ]
gap> f:= AsField( Field( [ Sqrt(-2) ] ), CF(8) );;
gap> # a cycl. field over a non-cycl. field
gap> b:= CanonicalBasis( f );; BasisVectors( b );
[ 1/2+1/2*E(8)-1/2*E(8)^2-1/2*E(8)^3, 1/2-1/2*E(8)+1/2*E(8)^2+1/2*E(8)^3 ]
gap> Coefficients( b, Sqrt(-2) );
[ E(8)+E(8)^3, E(8)+E(8)^3 ]
gap> f:= Field( [ Sqrt(-2) ] ); # a non-cycl. field over the rationals
NF(8,[ 1, 3 ])
gap> b:= CanonicalBasis( f );; BasisVectors( b );
[ 1, E(8)+E(8)^3 ]
gap> Coefficients( b, Sqrt(-2) );
[ 0, 1 ]
</pre>
<p>
<a name = "SSEC003.1"></a>
<li><code>ZumbroichBase( </code><var>n</var><code>, </code><var>m</var><code> ) F</code>
<p>
Let <var>n</var> and <var>m</var> be positive integers, such that <var>m</var> divides <var>n</var>.
<code>ZumbroichBase</code> returns the set of exponents <var>i</var> for which <code>E(</code><var>n</var><code>)^</code><var>i</var><code></code>
belongs to the (generalized) Zumbroich basis of the cyclotomic field
<b>Q</b><sub><i>n</i></sub>, viewed as a vector space over <b>Q</b><sub><i>m</i></sub>.
<p>
This basis is defined as follows.
Let <i>P</i> denote the set of prime divisors of <var>n</var>,
<i>n</i> = ∏<sub><i>p</i> ∈ <i>P</i></sub> <i>p</i><sup>ν<sub><i>p</i></sub></sup>, and
<i>m</i> = ∏<sub><i>p</i> ∈ <i>P</i></sub> <i>p</i><sup>μ<sub><i>p</i></sub></sup> with μ<sub><i>p</i></sub> ≤ ν<sub><i>p</i></sub>.
Let <i>e</i><sub><i>n</i></sub> = <tt>E</tt><tt>(</tt><i>n</i> <tt>)</tt>,
and { <i>e</i><sub><i>n</i><sub>1</sub></sub><sup><i>j</i></sup>}<sub><i>j</i> ∈ <i>J</i></sub> ⊗{ <i>e</i><sub><i>n</i><sub>2</sub></sub><sup><i>k</i></sup>}<sub><i>k</i> ∈ <i>K</i></sub> = { <i>e</i><sub><i>n</i><sub>1</sub></sub><sup><i>j</i></sup> ·<i>e</i><sub><i>n</i><sub>2</sub></sub><sup><i>k</i></sup>}<sub><i>j</i> ∈ <i>J</i>, <i>k</i> ∈ <i>K</i></sub>.
<p>
Then the basis is
<br clear="all" /><table border="0" width="100%"><tr><td><table align="center" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center"> <i>B</i><sub><i>n</i>,<i>m</i></sub> = </td><td nowrap="nowrap" align="center"><small></small><!--sup--><br /><font size="+3">⊗<br /></font><small><i>p</i> ∈ <i>P</i></small> <br /></td><td nowrap="nowrap" align="center"></td><td nowrap="nowrap" align="center"><small>ν<sub><i>p</i></sub>−1</small><!--sup--><br /><font size="+3">⊗<br /></font><small><i>k</i>=μ<sub><i>p</i></sub></small> <br /></td><td nowrap="nowrap" align="center">{ <i>e</i><sub><i>p</i><sup><i>k</i>+1</sup></sub><sup><i>j</i></sup>}<sub><i>j</i> ∈ <i>J</i><sub><i>k</i>,<i>p</i></sub></sub> <span class="roman">where</span> <i>J</i><sub><i>k</i>,<i>p</i></sub> = </td><td align="left" class="cl"><br /><br /><br /><br /><br /><br /><br /><br /> </td><td nowrap="nowrap"><table border="0" align="left" cellspacing="0" cellpadding="0"><tr><td nowrap="nowrap" align="center"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center"> { 0 } </td></tr></table></td><td nowrap="nowrap" align="center"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center">; </td></tr></table></td><td nowrap="nowrap" align="center"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="left"><i>k</i>=0, <i>p</i>=2 </td></tr></table></td></tr> <tr><td nowrap="nowrap" align="center" colspan="1"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center"> { 0, 1 } </td></tr></table></td><td nowrap="nowrap" align="center"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center">; </td></tr></table></td><td nowrap="nowrap" align="center"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="left"><i>k</i> > 0, <i>p</i>=2 </td></tr></table></td></tr> <tr><td nowrap="nowrap" align="center" colspan="1"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center"> { 1, …, <i>p</i>−1 } </td></tr></table></td><td nowrap="nowrap" align="center"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center">; </td></tr></table></td><td nowrap="nowrap" align="center"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="left"><i>k</i> = 0, <i>p</i> ≠ 2 </td></tr></table></td></tr> <tr><td nowrap="nowrap" align="center" colspan="1"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center"> { −</td><td nowrap="nowrap" align="center"><i>p</i>−1<div class="hrcomp"><hr noshade="noshade" size="1"/></div>2<br /></td><td nowrap="nowrap" align="center">, …, </td><td nowrap="nowrap" align="center"><i>p</i>−1<div class="hrcomp"><hr noshade="noshade" size="1"/></div>2<br /></td><td nowrap="nowrap" align="center">} </td></tr></table></td><td nowrap="nowrap" align="center"><table border="0" cellspacing="0" cellpadding="2"><tr><td nowrap="nowrap" align="center">; </td></tr></table></td><td nowrap="nowrap" align="center"><table><tr><td nowrap="nowrap" align="center" colspan="1"><i>k</i> > 0, <i>p</i> ≠ 2 </td></tr></table></td></tr></table></td><td nowrap="nowrap"> </td></tr></table></td></tr></table>
<p>
<i>B</i><sub><i>n</i>,1</sub> is equal to the basis of <b>Q</b><sub><i>n</i></sub> over the rationals which is
introduced in <a href="biblio.htm#Zum89"><cite>Zum89</cite></a>.
Also the conversion of arbitrary sums of roots of unity into its
basis representation, and the reduction to the minimal cyclotomic field
are described in this thesis.
(Note that the notation here is slightly different from that there.)
<p>
<i>B</i><sub><i>n</i>,<i>m</i></sub> consists of roots of unity, it is an integral basis
(that is, exactly the integral elements in <b>Q</b><sub><i>n</i></sub> have integral
coefficients w.r.t. <i>B</i><sub><i>n</i>,<i>m</i></sub>, cf. <a href="CHAP018.htm#SSEC001.4">IsIntegralCyclotomic</a>),
it is a normal basis for squarefree <i>n</i>
and closed under complex conjugation for odd <i>n</i>.
<p>
<strong>Note:</strong>
For <i>n</i> ≡ 2 mod 4, we have
<code>ZumbroichBase(</code><var>n</var><code>, 1) = 2 * ZumbroichBase(</code><var>n</var><code>/2, 1)</code> and
<code>List( ZumbroichBase(</code><var>n</var><code>, 1), x -> E(</code><var>n</var><code>)^x ) =
List( ZumbroichBase(</code><var>n</var><code>/2, 1), x -> E(</code><var>n</var><code>/2)^x )</code>.
<p>
<pre>
gap> ZumbroichBase( 15, 1 ); ZumbroichBase( 12, 3 );
[ 1, 2, 4, 7, 8, 11, 13, 14 ]
[ 0, 3 ]
gap> ZumbroichBase( 10, 2 ); ZumbroichBase( 32, 4 );
[ 2, 4, 6, 8 ]
[ 0, 1, 2, 3, 4, 5, 6, 7 ]
</pre>
<p>
<a name = "SSEC003.2"></a>
<li><code>LenstraBase( </code><var>n</var><code>, </code><var>stabilizer</var><code>, </code><var>super</var><code>, </code><var>m</var><code> ) F</code>
<p>
Let <var>n</var> and <var>m</var> be positive integers, such that <var>m</var> divides <var>n</var>,
<var>stabilizer</var> be a list of prime residues modulo <var>n</var>, which describes
a subfield of the <var>n</var>-th cyclotomic field (see <a href="CHAP058.htm#SSEC002.4">GaloisStabilizer</a>),
and <var>super</var> be a list representing a supergroup of the group given by
<var>stabilizer</var>.
<p>
<code>LenstraBase</code> returns a list [ <i>b</i><sub>1</sub>, <i>b</i><sub>2</sub>, …, <i>b</i><sub><i>k</i></sub> ] of lists,
each <i>b</i><sub><i>i</i></sub> consisting of integers such that the elements
∑<sub><i>j</i> ∈ <i>b</i><sub><i>i</i></sub></sub> <tt>E</tt><tt>(</tt><tt>n</tt><tt>)</tt><sup><i>j</i></sup> form a basis of the abelian number field
<code>NF( </code><var>n</var><code>, </code><var>stabilizer</var><code> )</code>, as a vector space over the <var>m</var>-th
cyclotomic field (see <a href="CHAP058.htm#SSEC001.2">AbelianNumberField</a>).
<p>
This basis is an integral basis,
that is, exactly the integral elements in <code>NF( </code><var>n</var><code>, </code><var>stabilizer</var><code> )</code>
have integral coefficients.
(For details about this basis, see <a href="biblio.htm#Bre97"><cite>Bre97</cite></a>.)
<p>
If possible then the result is chosen such that the group described by
<var>super</var> acts on it, consistently with the action of <var>stabilizer</var>,
i.e., each orbit of <var>super</var> is a union of orbits of <var>stabilizer</var>.
(A usual case is <code></code><var>super</var><code> = </code><var>stabilizer</var><code></code>, so there is no additional
condition.
<p>
<strong>Note:</strong>
The <i>b</i><sub><i>i</i></sub> are in general not sets, since for <code></code><var>stabilizer</var><code> = </code><var>super</var><code></code>,
the first entry is always an element of <code>ZumbroichBase( </code><var>n</var><code>, </code><var>m</var><code> )</code>;
this property is used by <code>NF</code> (see <a href="CHAP058.htm#SSEC001.2">AbelianNumberField</a>)
and <code>Coefficients</code> (see <a href="CHAP058.htm#SECT003">Integral Bases of Abelian Number Fields</a>).
<p>
<var>stabilizer</var> must not contain the stabilizer of a proper
cyclotomic subfield of the <var>n</var>-th cyclotomic field,
i.e., the result must describe a basis for a field with conductor <var>n</var>.
<p>
<pre>
gap> LenstraBase( 24, [ 1, 19 ], [ 1, 19 ], 1 );
[ [ 1, 19 ], [ 8 ], [ 11, 17 ], [ 16 ] ]
gap> LenstraBase( 24, [ 1, 19 ], [ 1, 5, 19, 23 ], 1 );
[ [ 1, 19 ], [ 5, 23 ], [ 8 ], [ 16 ] ]
gap> LenstraBase( 15, [ 1, 4 ], PrimeResidues( 15 ), 1 );
[ [ 1, 4 ], [ 2, 8 ], [ 7, 13 ], [ 11, 14 ] ]
</pre>
<p>
The first two results describe two bases of the field <b>Q</b><sub>3</sub>(√6),
the third result describes a normal basis of <b>Q</b><sub>3</sub>(√5).
<p>
<p>
<h2><a name="SECT004">58.4 Galois Groups of Abelian Number Fields</a></h2>
<p><p>
<a name = "I8"></a>
<a name = "I9"></a>
<a name = "I10"></a>
The field automorphisms of the cyclotomic field <b>Q</b><sub><i>n</i></sub>
(see Chapter <a href="CHAP018.htm">Cyclotomic Numbers</a>) are given by the linear maps ∗<i>k</i>
on <b>Q</b><sub><i>n</i></sub> that are defined by <tt>E</tt>(<i>n</i>)<sup>∗<i>k</i></sup> = <tt>E</tt>(<i>n</i>)<sup><i>k</i></sup>,
where 1 ≤ <i>k</i> < <i>n</i> and <tt>Gcd</tt>( <i>n</i>, <i>k</i> ) = 1 hold (see <a href="CHAP018.htm#SSEC005.1">GaloisCyc</a>).
Note that this action is <strong>not</strong> equal to exponentiation of cyclotomics,
i.e., for general cyclotomics <i>z</i>, <i>z</i><sup>∗<i>k</i></sup> is different from <i>z</i><sup><i>k</i></sup>.
<p>
(In <font face="Gill Sans,Helvetica,Arial">GAP</font>, the image of a cyclotomic <i>z</i> under ∗<i>k</i> can be computed
as <tt>GaloisCyc</tt>( <i>z</i>, <i>k</i> ).)
<p>
<pre>
gap> ( E(5) + E(5)^4 )^2; GaloisCyc( E(5) + E(5)^4, 2 );
-2*E(5)-E(5)^2-E(5)^3-2*E(5)^4
E(5)^2+E(5)^3
</pre>
<p>
For <tt>Gcd</tt>( <i>n</i>, <i>k</i> ) ≠ 1, the map <tt>E</tt>(<i>n</i>) → <tt>E</tt>(<i>n</i>)<sup><i>k</i></sup> does <strong>not</strong>
define a field automorphism of <b>Q</b><sub><i>n</i></sub> but only a <b>Q</b>-linear map.
<p>
<pre>
gap> GaloisCyc( E(5)+E(5)^4, 5 ); GaloisCyc( ( E(5)+E(5)^4 )^2, 5 );
2
-6
</pre>
<p>
<a name = "SSEC004.1"></a>
<li><code>ANFAutomorphism( </code><var>F</var><code>, </code><var>k</var><code> ) F</code>
<p>
Let <var>F</var> be an abelian number field and <var>k</var> an integer that is coprime to
the conductor (see <a href="CHAP018.htm#SSEC001.5">Conductor</a>) of <var>F</var>.
Then <code>ANFAutomorphism</code> returns the automorphism of <var>F</var> that is defined as
the linear extension of the map that raises each root of unity in <var>F</var>
to its <var>k</var>-th power.
<p>
<pre>
gap> f:= CF(25);
CF(25)
gap> alpha:= ANFAutomorphism( f, 2 );
ANFAutomorphism( CF(25), 2 )
gap> alpha^2;
ANFAutomorphism( CF(25), 4 )
gap> Order( alpha );
20
gap> E(5)^alpha;
E(5)^2
</pre>
<p>
The Galois group <i>Gal</i>( <b>Q</b><sub><i>n</i></sub>, <b>Q</b>) of the field extension
<b>Q</b><sub><i>n</i></sub> / <b>Q</b> is isomorphic to the group (<b>Z</b>/ <i>n</i> <b>Z</b>)<sup>∗</sup>
of prime residues modulo <i>n</i>, via the isomorphism
(<b>Z</b>/ <i>n</i> <b>Z</b>)<sup>∗</sup> → <i>Gal</i>( <b>Q</b><sub><i>n</i></sub>, <b>Q</b>) that is defined by
<i>k</i> + <i>n</i> <b>Z</b>→ ( <i>z</i> → <i>z</i><sup>∗<i>k</i></sup> ).
<p>
The Galois group of the field extension <b>Q</b><sub><i>n</i></sub> / <i>L</i> with
any abelian number field <i>L</i> ⊆ <b>Q</b><sub><i>n</i></sub> is simply the
factor group of <i>Gal</i>( <b>Q</b><sub><i>n</i></sub>, <b>Q</b>) modulo the stabilizer of <i>L</i>,
and the Galois group of <i>L</i> / <i>L</i><sup>′</sup>, with <i>L</i><sup>′</sup> an abelian
number field contained in <i>L</i>, is the subgroup in this group that stabilizes
<i>L</i><sup>′</sup>.
These groups are easily described in terms of (<b>Z</b>/ <i>n</i> <b>Z</b>)<sup>∗</sup>.
Generators of (<b>Z</b>/ <i>n</i> <b>Z</b>)<sup>∗</sup> can be computed using
<code>GeneratorsPrimeResidues</code> (see <a href="CHAP015.htm#SSEC001.4">GeneratorsPrimeResidues</a>).
<p>
In <font face="Gill Sans,Helvetica,Arial">GAP</font>, a field extension <i>L</i> / <i>L</i><sup>′</sup> is given by the field
object <i>L</i> with <code>LeftActingDomain</code> value <i>L</i><sup>′</sup>
(see <a href="CHAP058.htm#SECT003">Integral Bases of Abelian Number Fields</a>).
<p>
<pre>
gap> f:= CF(15);
CF(15)
gap> g:= GaloisGroup( f );
<group with 2 generators>
gap> Size( g ); IsCyclic( g ); IsAbelian( g );
8
false
true
gap> Action( g, NormalBase( f ), OnPoints );
Group([ (1,6)(2,4)(3,8)(5,7), (1,4,3,7)(2,8,5,6) ])
</pre>
<p>
The following example shows Galois groups of a cyclotomic field
and of a proper subfield that is not a cyclotomic field.
<p>
<pre>
gap> gens1:= GeneratorsOfGroup( GaloisGroup( CF(5) ) );
[ ANFAutomorphism( CF(5), 2 ) ]
gap> gens2:= GeneratorsOfGroup( GaloisGroup( Field( Sqrt(5) ) ) );
[ ANFAutomorphism( NF(5,[ 1, 4 ]), 2 ) ]
gap> Order( gens1[1] ); Order( gens2[1] );
4
2
gap> Sqrt(5)^gens1[1] = Sqrt(5)^gens2[1];
true
</pre>
<p>
The following example shows the Galois group of a cyclotomic field
over a non-cyclotomic field.
<p>
<pre>
gap> g:= GaloisGroup( AsField( Field( [ Sqrt(5) ] ), CF(5) ) );
<group with 1 generators>
gap> gens:= GeneratorsOfGroup( g );
[ ANFAutomorphism( AsField( NF(5,[ 1, 4 ]), CF(5) ), 4 ) ]
gap> x:= last[1];; x^2;
IdentityMapping( AsField( NF(5,[ 1, 4 ]), CF(5) ) )
</pre>
<p>
<p>
<h2><a name="SECT005">58.5 Gaussians</a></h2>
<p><p>
<a name = "SSEC005.1"></a>
<li><code>GaussianIntegers V</code>
<p>
<code>GaussianIntegers</code> is the ring <b>Z</b>[√{−1}] of Gaussian integers.
This is a subring of the cyclotomic field <code>GaussianRationals</code>,
see <a href="CHAP058.htm#SSEC001.3">GaussianRationals</a>.
<p>
<a name = "SSEC005.2"></a>
<li><code>IsGaussianIntegers( </code><var>obj</var><code> ) C</code>
<p>
is the defining category for the domain <code>GaussianIntegers</code>.
<p>
<p>
[<a href="../index.htm">Top</a>] [<a href = "chapters.htm">Up</a>] [<a href ="CHAP057.htm">Previous</a>] [<a href ="CHAP059.htm">Next</a>] [<a href = "theindex.htm">Index</a>]
<P>
<font face="Gill Sans,Helvetica,Arial">GAP 4 manual<br>December 2008
</font></body></html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
5e1854624d3bc613bdd0dd13d1ef9ac7
>
files
>
200
