  
  [1m[4m[31m2. Groupoids[0m
  
  A   [22m[36mgroupoid[0m  is  a  (mathematical)  category  in  which  every  element  is
  invertible. It consists of a set of components, each of which is a connected
  groupoid.
  
  A  [22m[36mconnected  groupoid[0m  is  determined by a set of [22m[36mobjects[0m [22m[32mobs[0m and an [22m[36mobject
  group[0m  [22m[32mgrp[0m. Connected groupoids are represented as [22m[32mIsConnectedGroupoidRep[0m, a
  record  with  components  [22m[32mobjects[0m  and  [22m[32mgroup[0m.  The  objects  of a connected
  groupoid  are  generally chosen to be consecutive negative integers, but any
  suitable  ordered set is acceptable, and `consecutive' is not a requirement.
  The  object  groups  will  usually  be  taken  to be permutation groups, but
  pc-groups and fp-groups are also supported.
  
  A [22m[36mgroup[0m is a connected groupoid with one object.
  
  A  [22m[36mgroupoid[0m  is  a  set  of  one  or more connected groupoids, its connected
  [22m[36mcomponents[0m,   and   is   represented   as   [22m[32mIsGroupoidRep[0m,   with  attribute
  [22m[32mComponentsOfGroupoid[0m.
  
  For  the  definitions of the standard properties of groupoids we refer to R.
  Brown's book ``Topology'' [B88], recently revised and reissued as ``Topology
  and Groupoids'' [B06].
  
  
  [1m[4m[31m2.1 Groupoids: their elements and attributes[0m
  
  [1m[4m[31m2.1-1 ConnectedGroupoid[0m
  
  [1m[34m> ConnectedGroupoid( [0m[22m[34mobs, grp[0m[1m[34m ) ___________________________________[0moperation
  [1m[34m> GroupAsGroupoid( [0m[22m[34mobj, grp[0m[1m[34m ) _____________________________________[0moperation
  [1m[34m> GroupoidByUnion( [0m[22m[34mcomps[0m[1m[34m ) ________________________________________[0moperation
  [1m[34m> Groupoid( [0m[22m[34margs[0m[1m[34m ) _________________________________________________[0mfunction
  
  There  are  a  variety  of  constructors  for  groupoids,  with  one  or two
  parameters.  The global function [22m[32mGroupoid[0m will normally find the appropriate
  one to call, the options being:
  
  --    a list of objects, the object group;
  
  --    a single object, a group being converted to a groupoid;
  
  --    a list of groupoids which have already been constructed.
  
  Methods for [22m[32mViewObj[0m, [22m[32mPrintObj[0m and [22m[32mDisplay[0m are provided for groupoids and the
  other types of object in this package. Users are advised to supply names for
  all the groups and groupoids they construct.
  
  [22m[35m---------------------------  Example  ----------------------------[0m
    [22m[35m[0m
    [22m[35mgap> d8 := Group( (1,2,3,4), (1,3) );;[0m
    [22m[35mgap> SetName( d8, "d8" );[0m
    [22m[35mgap> Gd8 := ConnectedGroupoid( [-9,-8,-7], d8 );[0m
    [22m[35mPerm Connected Groupoid:[0m
    [22m[35m< [ -9, -8, -7 ], d8 >[0m
    [22m[35mgap> c6 := Group( (5,6,7)(8,9) );;[0m
    [22m[35mgap> SetName( c6, "c6" );[0m
    [22m[35mgap> Gc6 := GroupAsGroupoid( -6, c6 );[0m
    [22m[35mPerm Connected Groupoid:[0m
    [22m[35m< [ -6 ], c6 >[0m
    [22m[35mgap> Gd8c6 := GroupoidByUnion( [ Gd8, Gc6 ] );;[0m
    [22m[35mgap> Display( Gd8c6 );[0m
    [22m[35mPerm Groupoid with 2 components:[0m
    [22m[35m< objects: [ -9, -8, -7 ][0m
    [22m[35m    group: d8 = <[ (1,2,3,4), (1,3) ]> >[0m
    [22m[35m< objects: [ -6 ][0m
    [22m[35m    group: c6 = <[ (5,6,7)(8,9) ]> >[0m
    [22m[35mgap> SetName( Gd8, "Gd8" );  SetName( Gc6, "Gc6" );  SetName( Gd8c6, "Gd8+Gc6" );[0m
    [22m[35m[0m
  [22m[35m------------------------------------------------------------------[0m
  
  [1m[4m[31m2.1-2 ComponentsOfGroupoid[0m
  
  [1m[34m> ComponentsOfGroupoid( [0m[22m[34mgpd[0m[1m[34m ) _____________________________________[0mattribute
  [1m[34m> ObjectsOfGroupoid( [0m[22m[34mgpd[0m[1m[34m ) ________________________________________[0mattribute
  
  When  a groupoid consists of two or more components, we require their object
  lists to be disjoint. The components are sorted by the first object in their
  object  lists,  which  must  be  disjoint.  The  list [22m[32mObjectsOfGroupoid[0m of a
  groupoid is the sorted concatenation of the objects in the components.
  
  [22m[35m---------------------------  Example  ----------------------------[0m
    [22m[35m[0m
    [22m[35mgap> ComponentsOfGroupoid( Gd8c6 );[0m
    [22m[35m[ Gd8, Gc6 ][0m
    [22m[35mgap> ObjectsOfGroupoid( Gd8c6 );[0m
    [22m[35m[ -9, -8, -7, -6 ][0m
    [22m[35m[0m
  [22m[35m------------------------------------------------------------------[0m
  
  [1m[4m[31m2.1-3 IsPermGroupoid[0m
  
  [1m[34m> IsPermGroupoid( [0m[22m[34mgpd[0m[1m[34m ) ____________________________________________[0mproperty
  [1m[34m> IsPcGroupoid( [0m[22m[34mgpd[0m[1m[34m ) ______________________________________________[0mproperty
  [1m[34m> IsFpGroupoid( [0m[22m[34mgpd[0m[1m[34m ) ______________________________________________[0mproperty
  
  A  groupoid is a permutation groupoid if all its components have permutation
  groups.  Most of the examples in this chapter are permutation groupoids, but
  in principle any type of group known to [1mGAP[0m may be used.
  
  In the following example [22m[32mGf2[0m is an fp-groupoid, while [22m[32mGq8[0m is a pc-groupoid.
  
  [22m[35m---------------------------  Example  ----------------------------[0m
    [22m[35m[0m
    [22m[35mgap> f2 := FreeGroup( 2 );;[0m
    [22m[35mgap> SetName( f2, "f2" );[0m
    [22m[35mgap> Gf2 := Groupoid( -22, f2 );;[0m
    [22m[35mgap> q8 := SmallGroup( 8, 4 );;[0m
    [22m[35mgap> Gq8 := Groupoid( [ -28, -27 ], q8 );;[0m
    [22m[35mgap> SetName( q8, "q8" );  SetName( Gq8, "Gq8" );[0m
    [22m[35mgap> Gf2q8 := Groupoid( [ Gf2, Gq8 ] );;[0m
    [22m[35mgap> [ IsFpGroupoid( Gf2 ), IsPcGroupoid( Gq8 ), IsPcGroupoid( Gf2q8 ) ];[0m
    [22m[35m[ true, true, false ][0m
    [22m[35mgap> G4 := Groupoid( [ Gd8c6, Gf2, Gq8 ] );;[0m
    [22m[35mgap> Display( G4 );[0m
    [22m[35mGroupoid with 4 components:[0m
    [22m[35m< objects: [ -28, -27 ][0m
    [22m[35m    group: q8 = <[ f1, f2, f3 ]> >[0m
    [22m[35m< objects: [ -22 ][0m
    [22m[35m    group: f2 = <[ f1, f2 ]> >[0m
    [22m[35m< objects: [ -9, -8, -7 ][0m
    [22m[35m    group: d8 = <[ (1,2,3,4), (1,3) ]> >[0m
    [22m[35m< objects: [ -6 ][0m
    [22m[35m    group: c6 = <[ (5,6,7)(8,9) ]> >[0m
    [22m[35mgap> G4 = Groupoid( [ Gq8, Gf2, Gd8c6 ] );[0m
    [22m[35mtrue[0m
    [22m[35m[0m
  [22m[35m------------------------------------------------------------------[0m
  
  [1m[4m[31m2.1-4 GroupoidElement[0m
  
  [1m[34m> GroupoidElement( [0m[22m[34mgpd, elt, tail, head[0m[1m[34m ) _________________________[0moperation
  [1m[34m> IsElementOfGroupoid( [0m[22m[34melt[0m[1m[34m ) _______________________________________[0mproperty
  [1m[34m> GroupElement( [0m[22m[34melt[0m[1m[34m ) _____________________________________________[0mattribute
  [1m[34m> Tail( [0m[22m[34melt[0m[1m[34m ) _____________________________________________________[0mattribute
  [1m[34m> Head( [0m[22m[34melt[0m[1m[34m ) _____________________________________________________[0mattribute
  [1m[34m> Size( [0m[22m[34mgpd[0m[1m[34m ) _____________________________________________________[0mattribute
  
  A   [22m[36mgroupoid   element[0m  [22m[32me[0m  is  a  triple  consisting  of  a  group  element,
  [22m[32mGroupElement(e)[0m  or  [22m[32me![1][0m;  the tail (source) object, [22m[32mTail(e)[0m or [22m[32me![2][0m; and
  the head (target) object, [22m[32mHead(e)[0m or [22m[32me![3][0m.
  
  The  [22m[32mSize[0m of a groupoid is the number of its elements which, for a connected
  groupoid,  is  the  product  of the size of the group with the square of the
  number of objects.
  
  Groupoid elements have a [22m[36mpartial composition[0m: two elements may be multiplied
  when  the head of the first coincides with the tail of the second. Conjugate
  a^b is defined when a is a loop at the tail of b.
  
  [22m[35m---------------------------  Example  ----------------------------[0m
    [22m[35m[0m
    [22m[35mgap> e1 := GroupoidElement( Gd8, (1,2)(3,4), -9, -8 );[0m
    [22m[35m[(1,2)(3,4) : -9 -> -8][0m
    [22m[35mgap> e2 := GroupoidElement( Gd8, (1,3), -8, -7 );;[0m
    [22m[35mgap> Print( [ GroupElement( e2 ), Tail( e2 ), Head( e2 ) ], "\n" );[0m
    [22m[35m[ (1,3), -8, -7 ][0m
    [22m[35mgap> prod := e1*e2;[0m
    [22m[35m[(1,2,3,4) : -9 -> -7][0m
    [22m[35mgap> e3 := GroupoidElement( Gd8, (1,3)(2,4), -7, -9 );;[0m
    [22m[35mgap> cycle := prod*e3;[0m
    [22m[35m[(1,4,3,2) : -9 -> -9][0m
    [22m[35mgap> cycle^2;[0m
    [22m[35m[(1,3)(2,4) : -9 -> -9][0m
    [22m[35mgap> Order( cycle );[0m
    [22m[35m4[0m
    [22m[35mgap> cycle^e1;[0m
    [22m[35m[(1,2,3,4) : -8 -> -8][0m
    [22m[35mgap> [ Size( Gd8 ), Size( Gc6 ), Size( Gd8c6 ), Size( Gf2q8 ) ];[0m
    [22m[35m[ 72, 6, 78, infinity ][0m
    [22m[35m[0m
  [22m[35m------------------------------------------------------------------[0m
  
  [1m[4m[31m2.1-5 IsConnectedGroupoid[0m
  
  [1m[34m> IsConnectedGroupoid( [0m[22m[34mgpd[0m[1m[34m ) _______________________________________[0mproperty
  [1m[34m> IsDiscreteGroupoid( [0m[22m[34mgpd[0m[1m[34m ) ________________________________________[0mproperty
  
  The  forgetful  functor, which forgets the composition of elements, maps the
  category  of  groupoids  and their morphisms to the category of digraphs and
  their  morphisms.  Applying  this functor to a particular groupoid gives the
  [22m[36munderlying  digraph[0m  of  the  groupoid.  A  groupoid  is  [22m[36mconnected[0m  if  its
  underlying digraph is connected (and so complete). A groupoid is [22m[36mdiscrete[0m if
  it  is a union of groups, so that all the arcs in its underlying digraph are
  loops. It is sometimes convenient to call a groupoid element a [22m[36mloop[0m when its
  tail and head are the same object.
  
  
  [1m[4m[31m2.2 Subgroupoids[0m
  
  [1m[4m[31m2.2-1 SubgroupoidByComponents[0m
  
  [1m[34m> SubgroupoidByComponents( [0m[22m[34mgpd, obhoms[0m[1m[34m ) __________________________[0moperation
  [1m[34m> Subgroupoid( [0m[22m[34margs[0m[1m[34m ) ______________________________________________[0mfunction
  [1m[34m> FullSubgroupoid( [0m[22m[34mgpd, obs[0m[1m[34m ) _____________________________________[0moperation
  [1m[34m> MaximalDiscreteSubgroupoid( [0m[22m[34mgpd[0m[1m[34m ) _______________________________[0mattribute
  [1m[34m> DiscreteSubgroupoid( [0m[22m[34mgpd, obs, sgps[0m[1m[34m ) ___________________________[0moperation
  [1m[34m> FullIdentitySubgroupoid( [0m[22m[34mgpd[0m[1m[34m ) __________________________________[0mattribute
  [1m[34m> DiscreteIdentitySubgroupoid( [0m[22m[34mgpd[0m[1m[34m ) ______________________________[0mattribute
  
  A  [22m[36msubgroupoid[0m [22m[32msgpd[0m of [22m[32mgpd[0m has as objects a subset of the objects of [22m[32mgpd[0m. It
  is  [22m[36mwide[0m if all the objects are included. It is [22m[36mfull[0m if, for any two objects
  in [22m[32msgpd[0m, the [22m[32mHomset[0m is the same as in [22m[32mgpd[0m. The elements of [22m[32msgpd[0m are a subset
  of  those  of [22m[32mgpd[0m, closed under multiplication and with tail and head in the
  chosen object set.
  
  There  are  a  variety  of constructors for a subgroupoid of a groupoid. The
  operation  [22m[32mSubgroupoidByComponents[0m  is  the most general. Its two parameters
  are  a  groupoid and a list of connected components, where each component is
  specified  as a list [22m[32m[obs,sgp][0m, [22m[32mobs[0m is a subset of the objects in one of the
  components of [22m[32mgpd[0m, and [22m[32msgp[0m is a subgroup of the group in that component.
  
  The  [22m[32mFullSubgroupoid[0m  of  a  groupoid  [22m[32mgpd[0m  on  a  subset [22m[32mobs[0m of its objects
  contains all the elements of [22m[32mgpd[0m with tail and head in [22m[32mobs[0m.
  
  A   subgroupoid   is   [22m[36mdiscrete[0m   if   it   is   a   union  of  groups.  The
  [22m[32mMaximalDiscreteSubgroupoid[0m of [22m[32mgpd[0m is the union of all the single-object full
  subgroupoids of [22m[32mgpd[0m.
  
  An [22m[36midentity subgroupoid[0m has trivial object groups, but need not be discrete.
  A connected identity groupoid is sometimes called a [22m[36mtree groupoid[0m.
  
  The global function [22m[32mSubgroupoid[0m should call the appropriate operation.
  
  [22m[35m---------------------------  Example  ----------------------------[0m
    [22m[35m[0m
    [22m[35mgap> c4d := Subgroup( d8, [ (1,2,3,4) ] );;[0m
    [22m[35mgap> k4d := Subgroup( d8, [ (1,2)(3,4), (1,3)(2,4) ] );;[0m
    [22m[35mgap> SetName( c4d, "c4d" );  SetName( k4d, "k4d" );[0m
    [22m[35mgap> Ud8 := Subgroupoid( Gd8, [ [[-9, k4d]], [[-8,-7], c4d] ] );;[0m
    [22m[35mgap> SetName( Ud8, "Ud8" );[0m
    [22m[35mgap> Display( Ud8 );[0m
    [22m[35mPerm Groupoid with 2 components:[0m
    [22m[35m< objects: [ -9 ][0m
    [22m[35m    group: k4d = <[ (1,2)(3,4), (1,3)(2,4) ]> >[0m
    [22m[35m< objects: [ -8, -7 ][0m
    [22m[35m    group: c4d = <[ (1,2,3,4) ]> >[0m
    [22m[35mgap> FullSubgroupoid( Gd8c6, [-7,-6] );[0m
    [22m[35mPerm Groupoid with components:[0m
    [22m[35m< [ -7 ], d8 >[0m
    [22m[35m< [ -6 ], c6 >[0m
    [22m[35mgap> DiscreteSubgroupoid( Gd8c6, [-9,-8], [ c4d, k4d ] );[0m
    [22m[35mPerm Groupoid with components:[0m
    [22m[35m< [ -9 ], c4d >[0m
    [22m[35m< [ -8 ], k4d >[0m
    [22m[35mgap> FullIdentitySubgroupoid( Ud8 );[0m
    [22m[35mPerm Groupoid with components:[0m
    [22m[35m< [ -9 ], id(k4d) >[0m
    [22m[35m< [ -8, -7 ], id(c4d) >[0m
    [22m[35m[0m
  [22m[35m------------------------------------------------------------------[0m
  
  
  [1m[4m[31m2.3 Stars, Costars and Homsets[0m
  
  [1m[4m[31m2.3-1 ObjectStar[0m
  
  [1m[34m> ObjectStar( [0m[22m[34mgpd, obj[0m[1m[34m ) __________________________________________[0moperation
  [1m[34m> ObjectCostar( [0m[22m[34mgpd, obj[0m[1m[34m ) ________________________________________[0moperation
  [1m[34m> Homset( [0m[22m[34mgpd, tail, head[0m[1m[34m ) _______________________________________[0moperation
  
  The  [22m[36mstar[0m  at  [22m[32mobj[0m  is  the set of groupoid elements which have [22m[32mobj[0m as tail,
  while  the  [22m[36mcostar[0m is the set of elements which have [22m[32mobj[0m as head. The [22m[36mhomset[0m
  from  [22m[32mobj1[0m  to [22m[32mobj2[0m is the set of elements with the specified tail and head,
  and  so  is  bijective  with  the elements of the group. Thus every star and
  every costar is a union of homsets.
  
  In  order  not  to  create  unneccessary long lists, these operations return
  objects  of  type  [22m[32mIsHomsetCosetsRep[0m  for which an [22m[32mIterator[0m is provided. (An
  [22m[32mEnumerator[0m is not yet implemented.)
  
  [22m[35m---------------------------  Example  ----------------------------[0m
    [22m[35m[0m
    [22m[35mgap> star9 := ObjectStar( Gd8, -9 );[0m
    [22m[35m<star at [ -9 ] with group d8>[0m
    [22m[35mgap> for e in star9 do[0m
    [22m[35m>      if ( Order( e![1] ) = 2 ) then Print( e, "\n" ); fi;[0m
    [22m[35m>    od;[0m
    [22m[35m[(1,4,3,2) : -9 -> -9][0m
    [22m[35m[(1,4,3,2) : -9 -> -8][0m
    [22m[35m[(1,4,3,2) : -9 -> -7][0m
    [22m[35m[(1,2,3,4) : -9 -> -9][0m
    [22m[35m[(1,2,3,4) : -9 -> -8][0m
    [22m[35m[(1,2,3,4) : -9 -> -7][0m
    [22m[35mgap> costar6 := ObjectCostar( Gc6, -6 );[0m
    [22m[35m<costar at [ -6 ] with group c6>[0m
    [22m[35mgap> hset78 := Homset( Ud8, -7, -8 );[0m
    [22m[35m<homset -7 -> -8 with group c4d>[0m
    [22m[35mgap> for e in hset78 do  Print( e, "\n" );  od;[0m
    [22m[35m[() : -7 -> -8][0m
    [22m[35m[(1,3)(2,4) : -7 -> -8][0m
    [22m[35m[(1,4,3,2) : -7 -> -8][0m
    [22m[35m[(1,2,3,4) : -7 -> -8][0m
    [22m[35m[0m
  [22m[35m------------------------------------------------------------------[0m
  
  [1m[4m[31m2.3-2 IdentityElement[0m
  
  [1m[34m> IdentityElement( [0m[22m[34mgpd, obj[0m[1m[34m ) _____________________________________[0moperation
  
  The  identity  groupoid element [22m[32m1\_{o}[0m of [22m[32mgpd[0m at object [22m[32mo[0m is [22m[32m[e,o,o][0m where [22m[32me[0m
  is the identity group element in the object group. It is a left identity for
  the star and a right identity for the costar at that object.
  
  [22m[35m---------------------------  Example  ----------------------------[0m
    [22m[35m[0m
    [22m[35mgap> i7 := IdentityElement( Gd8, -7 );;[0m
    [22m[35mgap> i8 := IdentityElement( Gd8, -8 );;[0m
    [22m[35mgap> L := [ i7, i8 ];;[0m
    [22m[35mgap> for e in hset78 do  Add( L, i7*e*i8 = e );  od;[0m
    [22m[35mgap> L;[0m
    [22m[35m[ [() : -7 -> -7], [() : -8 -> -8], true, true, true, true ][0m
    [22m[35m[0m
  [22m[35m------------------------------------------------------------------[0m
  
  
  [1m[4m[31m2.4 Left, right and double cosets[0m
  
  [1m[4m[31m2.4-1 RightCoset[0m
  
  [1m[34m> RightCoset( [0m[22m[34mG, U, elt[0m[1m[34m ) _________________________________________[0moperation
  [1m[34m> RightCosetRepresentatives( [0m[22m[34mG, U[0m[1m[34m ) _______________________________[0moperation
  [1m[34m> RightCosetsNC( [0m[22m[34mG, U[0m[1m[34m ) ___________________________________________[0moperation
  [1m[34m> LeftCoset( [0m[22m[34mG, U, elt[0m[1m[34m ) __________________________________________[0moperation
  [1m[34m> LeftCosetRepresentatives( [0m[22m[34mG, U[0m[1m[34m ) ________________________________[0moperation
  [1m[34m> LeftCosetRepresentativesFromObject( [0m[22m[34mG, U, obj[0m[1m[34m ) _________________[0moperation
  [1m[34m> LeftCosetsNC( [0m[22m[34mG, U[0m[1m[34m ) ____________________________________________[0moperation
  [1m[34m> DoubleCoset( [0m[22m[34mG, U, elt, V[0m[1m[34m ) _____________________________________[0moperation
  [1m[34m> DoubleCosetRepresentatives( [0m[22m[34mG, U, V[0m[1m[34m ) ___________________________[0moperation
  [1m[34m> DoubleCosetsNC( [0m[22m[34mG, U, V[0m[1m[34m ) _______________________________________[0moperation
  
  If  [22m[32mU[0m  is  a  wide  subgroupoid  of  G,  the  [22m[36mright cosets[0m of U in G are the
  equivalence classes of the relation on the elements of G where g1 is related
  to  g2  if  and  only  if g2 = u*g1 for some element u of U. The right coset
  containing  g is written Ug. These right cosets refine the costars of G and,
  in  particular,  U1_o  is the costar of U at o, so that (unlike groups) U is
  itself a coset only when G has a single object.
  
  The  [22m[36mright  coset  representatives[0m  for  U  in  G form a list containing one
  groupoid  element  for each coset where, in a particular component of U, the
  group  element chosen is the right coset representative of the group of U in
  the group of G.
  
  Similarly, the [22m[36mleft cosets[0m gU refine the stars of G, while [22m[36mdouble cosets[0m are
  unions    of    left   cosets   and   of   right   cosets.   The   operation
  [22m[32mLeftCosetRepresentativesFromObject(  G,  U,  obj )[0m is used in Chapter 4, and
  returns only those representatives which have tail at [22m[32mobj[0m.
  
  As  with stars and homsets, these cosets are implemented with representation
  [22m[32mIsHomsetCosetsRep[0m  and provided with an iterator. Note that, when U has more
  than one component, cosets may have differing lengths.
  
  [22m[35m---------------------------  Example  ----------------------------[0m
    [22m[35m[0m
    [22m[35mgap> re2 := RightCoset( Gd8, Ud8, e2 );[0m
    [22m[35mRightCoset(c4d,[(1,3) : -8 -> -7])[0m
    [22m[35mgap> for x in re2 do Print( x, "\n" ); od;[0m
    [22m[35m[(1,3) : -8 -> -8][0m
    [22m[35m[(1,3) : -7 -> -8][0m
    [22m[35m[(2,4) : -8 -> -8][0m
    [22m[35m[(2,4) : -7 -> -8][0m
    [22m[35m[(1,4)(2,3) : -8 -> -8][0m
    [22m[35m[(1,4)(2,3) : -7 -> -8][0m
    [22m[35m[(1,2)(3,4) : -8 -> -8][0m
    [22m[35m[(1,2)(3,4) : -7 -> -8][0m
    [22m[35mgap> rcrd8 := RightCosetRepresentatives( Gd8, Ud8 );[0m
    [22m[35m[ [() : -9 -> -9], [() : -9 -> -8], [() : -9 -> -7], [(2,4) : -9 -> -9],[0m
    [22m[35m  [(2,4) : -9 -> -8], [(2,4) : -9 -> -7], [() : -8 -> -9], [() : -8 -> -8],[0m
    [22m[35m  [() : -8 -> -7], [(2,4) : -8 -> -9], [(2,4) : -8 -> -8], [(2,4) : -8 -> -7][0m
    [22m[35m ][0m
    [22m[35mgap> lcr7 := LeftCosetRepresentativesFromObject( Gd8, Ud8, -7 );[0m
    [22m[35m[ [() : -7 -> -9], [(2,4) : -7 -> -9], [() : -7 -> -8], [(2,4) : -7 -> -8] ][0m
    [22m[35m[0m
  [22m[35m------------------------------------------------------------------[0m
  
  More  examples  of  these  operations  may  be  found  in  the  example file
  [1mgpd/examples/gpd.g[0m.
  
