jackschmidt / misc-gap Goto Github PK
View Code? Open in Web Editor NEWSome miscellaneous gap code
Some miscellaneous gap code
I noticed the function LinearRepresentationFromCharacter defined as follows:
Lines 90 to 112 in 8a583e8
However, it seems that this can be done in a more concise way, as follows:
gap> gensSmallGroup16:=[
> [[-E(4), 0, 0, 0],
> [0, E(4), 0, 0],
> [0, 0, 0, -E(4)],
> [0, 0, -E(4), 0]],
> [[0, 1, 0, 0],
> [-1, 0, 0, 0],
> [0, 0, 0, E(4)],
> [0, 0, E(4), 0]]
> ];;
gap> SmallGroup16:=Group(gensSmallGroup16);
<matrix group with 2 generators>
gap> chi := MinimalFaithfulLinearCharacterUsingChars( Irr( SmallGroup16 ) );
Character( CharacterTable( <matrix group of size 16 with 2 generators> ), [ 3, -1, -E(4), E(4), -1, 1, 1, -3, -E(4), E(4) ] )
gap> irrs := ConstituentsOfCharacter(chi);
[ Character( CharacterTable( <matrix group of size 16 with 2 generators> ), [ 1, 1, -E(4), E(4), -1, 1, -1, -1, -E(4), E(4) ] ),
Character( CharacterTable( <matrix group of size 16 with 2 generators> ), [ 2, -2, 0, 0, 0, 0, 2, -2, 0, 0 ] ) ]
gap> grp := UnderlyingGroup(chi);
<matrix group of size 16 with 2 generators>
gap> reps := IrreducibleRepresentationsDixon(grp, irrs);
[ CompositionMapping( [ [ [ 0, -1, 0, 0, 0, 0, 0, 0 ], [ 1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ 0, 0, -1, 0, 0, 0, 0, 0 ],
[ 0, 0, 0, 0, 0, 0, 0, -1 ], [ 0, 0, 0, 0, 0, 0, 1, 0 ], [ 0, 0, 0, 0, 0, -1, 0, 0 ], [ 0, 0, 0, 0, 1, 0, 0, 0 ] ],
[ [ 0, 0, 1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ -1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, -1, 0, 0, 0, 0, 0, 0 ],
[ 0, 0, 0, 0, 0, 0, 0, 1 ], [ 0, 0, 0, 0, 0, 0, -1, 0 ], [ 0, 0, 0, 0, 0, 1, 0, 0 ], [ 0, 0, 0, 0, -1, 0, 0, 0 ] ] ] -> [ [ [ -E(4) ] ], [ [ E(4) ] ] ],
<mapping: Group([ [ [ -E(4), 0, 0, 0 ], [ 0, E(4), 0, 0 ], [ 0, 0, 0, -E(4) ], [ 0, 0, -E(4), 0 ] ],
[ [ 0, 1, 0, 0 ], [ -1, 0, 0, 0 ], [ 0, 0, 0, E(4) ], [ 0, 0, E(4), 0 ] ] ]) -> Group([ [ [ 0, -1, 0, 0, 0, 0, 0, 0 ],
[ 1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ 0, 0, -1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, -1 ], [ 0, 0, 0, 0, 0, 0, 1, 0 ],
[ 0, 0, 0, 0, 0, -1, 0, 0 ], [ 0, 0, 0, 0, 1, 0, 0, 0 ] ], [ [ 0, 0, 1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ],
[ -1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, -1, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 1 ], [ 0, 0, 0, 0, 0, 0, -1, 0 ], [ 0, 0, 0, 0, 0, 1, 0, 0 ],
[ 0, 0, 0, 0, -1, 0, 0, 0 ] ] ]) > ), CompositionMapping( [ [ [ 0, -1, 0, 0, 0, 0, 0, 0 ], [ 1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ],
[ 0, 0, -1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, -1 ], [ 0, 0, 0, 0, 0, 0, 1, 0 ], [ 0, 0, 0, 0, 0, -1, 0, 0 ], [ 0, 0, 0, 0, 1, 0, 0, 0 ] ],
[ [ 0, 0, 1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ -1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, -1, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 1 ],
[ 0, 0, 0, 0, 0, 0, -1, 0 ], [ 0, 0, 0, 0, 0, 1, 0, 0 ], [ 0, 0, 0, 0, -1, 0, 0, 0 ] ] ] -> [ [ [ 0, -E(4) ], [ -E(4), 0 ] ], [ [ -E(4), 0 ], [ 0, E(4) ] ] ],
<mapping: Group([ [ [ -E(4), 0, 0, 0 ], [ 0, E(4), 0, 0 ], [ 0, 0, 0, -E(4) ], [ 0, 0, -E(4), 0 ] ],
[ [ 0, 1, 0, 0 ], [ -1, 0, 0, 0 ], [ 0, 0, 0, E(4) ], [ 0, 0, E(4), 0 ] ] ]) -> Group([ [ [ 0, -1, 0, 0, 0, 0, 0, 0 ],
[ 1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ 0, 0, -1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, -1 ], [ 0, 0, 0, 0, 0, 0, 1, 0 ],
[ 0, 0, 0, 0, 0, -1, 0, 0 ], [ 0, 0, 0, 0, 1, 0, 0, 0 ] ], [ [ 0, 0, 1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ],
[ -1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, -1, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 0, 0, 0, 0, 1 ], [ 0, 0, 0, 0, 0, 0, -1, 0 ], [ 0, 0, 0, 0, 0, 1, 0, 0 ],
[ 0, 0, 0, 0, -1, 0, 0, 0 ] ] ]) > ) ]
gap> gens := GeneratorsOfGroup( grp );
[ [ [ -E(4), 0, 0, 0 ], [ 0, E(4), 0, 0 ], [ 0, 0, 0, -E(4) ], [ 0, 0, -E(4), 0 ] ], [ [ 0, 1, 0, 0 ], [ -1, 0, 0, 0 ], [ 0, 0, 0, E(4) ], [ 0, 0, E(4), 0 ] ] ]
gap> imgrep:=List(gens,x->List(reps, y-> x^y ));
[ [ [ [ -E(4) ] ], [ [ 0, -E(4) ], [ -E(4), 0 ] ] ], [ [ [ E(4) ] ], [ [ -E(4), 0 ], [ 0, E(4) ] ] ] ]
gap> imggen:=List(imgrep, x-> DirectSumMat(x) );
[ [ [ -E(4), 0, 0 ], [ 0, 0, -E(4) ], [ 0, -E(4), 0 ] ], [ [ E(4), 0, 0 ], [ 0, -E(4), 0 ], [ 0, 0, E(4) ] ] ]
gap> IsomorphismGroups(SmallGroup16,Group(imggen));
#I Forcing finiteness test
CompositionMapping( [ [ [ 0, -1, 0, 0, 0, 0, 0, 0 ], [ 1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ 0, 0, -1, 0, 0, 0, 0, 0 ],
[ 0, 0, 0, 0, 0, 0, 0, -1 ], [ 0, 0, 0, 0, 0, 0, 1, 0 ], [ 0, 0, 0, 0, 0, -1, 0, 0 ], [ 0, 0, 0, 0, 1, 0, 0, 0 ] ],
[ [ 0, 0, 1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ -1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, -1, 0, 0, 0, 0, 0, 0 ],
[ 0, 0, 0, 0, 0, 0, 0, 1 ], [ 0, 0, 0, 0, 0, 0, -1, 0 ], [ 0, 0, 0, 0, 0, 1, 0, 0 ], [ 0, 0, 0, 0, -1, 0, 0, 0 ] ] ] ->
[ [ [ -E(4), 0, 0 ], [ 0, 0, -E(4) ], [ 0, -E(4), 0 ] ], [ [ E(4), 0, 0 ], [ 0, -E(4), 0 ], [ 0, 0, E(4) ] ] ], <mapping: Group(
[ [ [ -E(4), 0, 0, 0 ], [ 0, E(4), 0, 0 ], [ 0, 0, 0, -E(4) ], [ 0, 0, -E(4), 0 ] ], [ [ 0, 1, 0, 0 ], [ -1, 0, 0, 0 ], [ 0, 0, 0, E(4) ], [ 0, 0, E(4), 0 ] ] ]) -> Group(
[ [ [ 0, -1, 0, 0, 0, 0, 0, 0 ], [ 1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ 0, 0, -1, 0, 0, 0, 0, 0 ],
[ 0, 0, 0, 0, 0, 0, 0, -1 ], [ 0, 0, 0, 0, 0, 0, 1, 0 ], [ 0, 0, 0, 0, 0, -1, 0, 0 ], [ 0, 0, 0, 0, 1, 0, 0, 0 ] ],
[ [ 0, 0, 1, 0, 0, 0, 0, 0 ], [ 0, 0, 0, 1, 0, 0, 0, 0 ], [ -1, 0, 0, 0, 0, 0, 0, 0 ], [ 0, -1, 0, 0, 0, 0, 0, 0 ],
[ 0, 0, 0, 0, 0, 0, 0, 1 ], [ 0, 0, 0, 0, 0, 0, -1, 0 ], [ 0, 0, 0, 0, 0, 1, 0, 0 ], [ 0, 0, 0, 0, -1, 0, 0, 0 ] ] ]) > )
But the above result, aka, imggen is different from the results given by the following method:
gap> lpchi:=LinearRepresentationFromCharacter( chi );;
gap> IsGroupHomomorphism(lpchi);
true
gap> imgchi:=MappingGeneratorsImages(lpchi)[2];
[ [ [ -E(4), 0, 0 ], [ 0, 0, -1 ], [ 0, 1, 0 ] ], [ [ E(4), 0, 0 ], [ 0, -E(4), 0 ], [ 0, 0, E(4) ] ] ]
As you can see, imggen and imgchi are different. Any hints for these two different methods?
Regards,
Zhao
Hi Jack Schmidt,
I noticed the following interesting description:
Lines 9 to 10 in 8a583e8
But I still don't know how to use it. Can you provide a simple example to illustrate this method?
Regards,
Zhao
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.