/usr/share/gap/pkg/Polycyclic/gap/matrix/modules.gi is in gap-polycyclic 2.11-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 | #############################################################################
##
#W modules.gi Polycyc Bettina Eick
##
#############################################################################
##
#F RadicalSeriesOfFiniteModule( mats, d, f )
##
RadicalSeriesOfFiniteModule := function( mats, d, f )
local base, sers, modu, radb;
if d = 0 then return []; fi;
base := IdentityMat( d, f );
sers := [base];
modu := GModuleByMats( mats, d, f );
repeat
radb := SMTX.BasisRadical( modu );
if Length( radb ) > 0 then
base := radb * base;
else
base := [];
fi;
Add( sers, base );
if Length( base ) > 0 then
modu := SMTX.InducedActionSubmodule( modu, radb );
fi;
until Length( base ) = 0;
return sers;
end;
#############################################################################
##
#F RadicalOfCongruenceModule( mats, d ) . . . . . . .for congruence subgroups
##
RadicalOfCongruenceModule := function( mats, d )
local coms, i, j, new, base, full, nath, indm, l, algb, newv, tmpb, subb,
f, g, h, mat;
# get commutators
coms := [];
for i in [1..Length( mats )] do
for j in [i+1..Length( mats )] do
new := mats[i] * mats[j] - mats[j] * mats[i];
Append(coms, new );
od;
od;
base := SpinnUpEchelonBase( [], coms, mats, OnRight );
full := IdentityMat( d );
nath := NaturalHomomorphismBySemiEchelonBases( full, base );
indm := List( mats, x -> InducedActionFactorByNHSEB( x, nath ) );
#Print("found derived submodule of dimension ",Length(base),"\n");
# start spinning up basis and look for nilpotent elements
i := 1;
algb := [];
while i <= Length( indm ) do
# add next element to algebra basis
l := Length( algb );
newv := Flat( indm[i] );
tmpb := SpinnUpEchelonBase( algb, [newv], indm{[1..i]}, OnMatVector );
# check whether we have added a non-semi-simple element
subb := [];
for j in [l+1..Length(tmpb)] do
mat := MatByVector( tmpb[j], Length(indm[i]) );
f := MinimalPolynomial( Rationals, mat );
g := Collected( Factors( f ) );
if ForAny( g, x -> x[2] > 1 ) then
h := Product( List( g, x -> Value( x[1], mat ) ) );
Append( subb, List( h, x -> ShallowCopy(x) ) );
fi;
od;
#Print("found nilpotent submodule of dimension ", Length(subb),"\n");
# spinn up new subspace of radical
subb := SpinnUpEchelonBase( [], subb, indm, OnRight );
if Length( subb ) > 0 then
base := PreimageByNHSEB( subb, nath );
nath := NaturalHomomorphismBySemiEchelonBases( full, base );
indm := List( mats, x -> InducedActionFactorByNHSEB( x, nath ) );
algb := [];
i := 1;
else
i := i + 1;
fi;
od;
return rec( radical := base, nathom := nath, algebra := algb );
end;
#############################################################################
##
#F TraceMatProd( m1, m2, d )
##
TraceMatProd := function( m1, m2, d )
local t, i, j;
t := 0;
for i in [1..d] do
for j in [1..d] do
t := t + m1[i][j] * m2[j][i];
od;
od;
return t;
end;
#############################################################################
##
#F AlgebraBase( mats )
##
InstallGlobalFunction( AlgebraBase, function( mats )
local base, flat;
if Length( mats ) = 0 then return []; fi;
flat := List( mats, Flat );
base := SpinnUpEchelonBase( [], flat, mats, OnMatVector);
return List( base, x -> MatByVector( x, Length(mats[1]) ) );
end );
#############################################################################
##
#F RadicalOfRationalModule( mats, d ) . . . . . . . . . . . .general approach
##
RadicalOfRationalModule := function( mats, d )
local base, trac, null, j;
# get base
base := AlgebraBase( mats );
if Length(base) = 0 then return rec( radical := [] ); fi;
# set up system of linear equations ( Tr( ai * aj ) )
trac := List( base, b -> List( base, c -> TraceMatProd( b, c, d ) ) );
# compute nullspace
null := NullspaceMat( trac );
if Length(null) = 0 then return rec( radical := [] ); fi;
# translate
null := List( null, x -> LinearCombination( x, base ) );
null := Concatenation( null );
TriangulizeMat( null );
j := Position( null, 0 * null[1] );
return rec( radical := null{[1..j-1]} );
end;
#############################################################################
##
#F RadicalSeriesOfRationalModule( mats, d ) . . . . . .compute radical series
##
RadicalSeriesOfRationalModule := function( mats, d )
local acts, full, base, sers, radb, nath;
if d = 0 then return []; fi;
full := IdentityMat( d );
sers := [full];
base := full;
acts := mats;
repeat
radb := RadicalOfRationalModule( acts, d ).radical;
if Length(radb) > 0 then
base := radb * base;
nath := NaturalHomomorphismBySemiEchelonBases( full, base );
acts := List( mats, x -> InducedActionSubspaceByNHSEB( x, nath ) );
else
base := [];
fi;
d := Length( base );
Add( sers, base );
until d = 0;
return sers;
end;
#############################################################################
##
#F PrimitiveAlgebraElement( mats, base )
##
InstallGlobalFunction( PrimitiveAlgebraElement, function( mats, base )
local d, mat, f, c, b, l;
# set up
d := Length( base );
# first try one of mats
for mat in mats do
f := MinimalPolynomial( Rationals, mat );
if Degree( f ) = d then return rec( elem := mat, poly := f ); fi;
od;
# otherwise try random elements
l := Sqrt( Length( base[1] ) );
repeat
c := List( [1..d], x -> Random( Integers ) );
b := MatByVector( c * base, l );
f := MinimalPolynomial( Rationals, b );
if Degree( f ) = d then return rec( elem := b, poly := f ); fi;
until false;
end );
#############################################################################
##
#F SplitSemisimple( base )
##
SplitSemisimple := function( base )
local d, b, f, s, i;
d := Length( base );
b := PrimitiveAlgebraElement( [], base );
f := Factors( b.poly );
# the trivial case
if Length( f ) = 1 then
return [rec( basis := IdentityMat(Length(base[1])), poly := f )];
fi;
# the non-trivial case
s := List( f, x -> NullspaceRatMat( Value( x, b.elem ) ) );
s := List( [1..Length(f)], x -> rec( basis := s[x], poly := f[x] ) );
return s;
end;
#############################################################################
##
#F HomogeneousSeriesOfCongruenceModule( mats, d ). . for congruence subgroups
##
HomogeneousSeriesOfCongruenceModule := function( mats, d )
local radb, splt, nath, l, sers, i, sub, full, acts, rads;
# catch the trivial case and set up
if d = 0 then return []; fi;
full := IdentityMat( d );
if Length( mats ) = 0 then return [full, []]; fi;
sers := [full];
# get the radical
radb := RadicalOfCongruenceModule( mats, d );
splt := SplitSemisimple( radb.algebra );
nath := radb.nathom;
# refine radical factor and initialize series
l := Length( splt );
for i in [2..l] do
sub := Concatenation( List( [i..l], x -> splt[x].basis ) );
TriangulizeMat( sub );
Add( sers, PreimageByNHSEB( sub, nath ) );
od;
Add( sers, radb.radical );
# induce action to radical
nath := NaturalHomomorphismBySemiEchelonBases( full, radb.radical );
acts := List( mats, x -> InducedActionSubspaceByNHSEB( x, nath ) );
# use recursive call to refine radical
rads := HomogeneousSeriesOfCongruenceModule( acts, Length(radb.radical) );
for i in [2..Length(rads)] do
if Length(rads[i]) > 0 then rads[i] := rads[i] * radb.radical; fi;
od;
Append( sers, rads{[2..Length(rads)]} );
return sers;
end;
#############################################################################
##
#F HomogeneousSeriesOfRationalModule( mats, cong, d ). . . . . use full space
##
HomogeneousSeriesOfRationalModule := function( mats, cong, d )
local full, sers, radb, nath, fact, base, splt, l, i, sub, acts, subs,
rads;
# catch the trivial case and set up
if d = 0 then return []; fi;
full := IdentityMat( d );
sers := [full];
# other trivial case
if Length( cong ) = 0 then return [full, []]; fi;
# get the radical and split its factor
radb := RadicalOfRationalModule( mats, d );
nath := NaturalHomomorphismBySemiEchelonBases( full, radb.radical );
fact := List( cong, x -> InducedActionFactorByNHSEB( x, nath ) );
base := AlgebraBase( fact );
splt := SplitSemisimple( List( base, Flat ) );
# refine radical factor and initialize series
l := Length( splt );
for i in [2..l] do
sub := Concatenation( List( [i..l], x -> splt[x].basis ) );
TriangulizeMat( sub );
Add( sers, PreimageByNHSEB( sub, nath ) );
od;
Add( sers, radb.radical );
# use recursive call to refine radical
l := Length( radb.radical );
acts := List( mats, x -> InducedActionSubspaceByNHSEB( x, nath ) );
subs := List( cong, x -> InducedActionSubspaceByNHSEB( x, nath ) );
rads := HomogeneousSeriesOfRationalModule( acts, subs, l );
for i in [2..Length(rads)] do
if Length(rads[i]) > 0 then rads[i] := rads[i] * radb.radical; fi;
od;
Append( sers, rads{[2..Length(rads)]} );
return sers;
end;
#############################################################################
##
#F RefineSplitting( mats, subs ) . . . . . . . . . . for congruence subgroups
##
RefineSplitting := function( mats, subs )
local i, full, news, dims, j, d, e, tmp;
# refine each of the subspaces subs in turn by spinning
for i in [1..Length(subs)] do
full := subs[i];
news := [];
dims := 0;
j := 1;
d := Length( subs[i] );
while dims < d do
e := full[j];
if ForAll( news, x -> MemberBySemiEchelonBase(e, x) = false ) then
tmp := SpinnUpEchelonBase( [], [e], mats, OnRight );
Add( news, tmp );
dims := dims + Length( tmp );
fi;
j := j + 1;
od;
subs[i] := news;
od;
return Concatenation( subs );
end;
|