73.37 InclusionMorphism for crossed modules

InclusionMorphism( S,X )

This function constructs the inclusion of a sub-crossed module S of X. When S = X the identity morphism is returned.

    gap> inc := InclusionMorphism( subSX, SX );
    Morphism of crossed modules <[c4->q8] >-> [q8->sl(2,3)]>
    gap> IsXModMorphism( inc );
    true
    gap> XModMorphismPrint( inc );
    Morphism of crossed modules :- 
    : Source = Crossed module [c4->q8] with generating sets:
      [ (1,2,3,4)(5,8,7,6) ]
      [ (1,2,3,4)(5,8,7,6), (1,5,3,7)(2,6,4,8) ]
    :  Range = Crossed module [q8->sl(2,3)] with generating sets:
      [ (1,2,3,4)(5,8,7,6), (1,5,3,7)(2,6,4,8) ]
      [ (1,2,3,4)(5,8,7,6), (1,5,3,7)(2,6,4,8), (2,5,6)(4,7,80(9,10,11) ]
    : Source Homomorphism maps source generators to:
      [ (1,2,3,4)(5,8,7,6) ]
    : Range Homomorphism maps range generators to:
      [ (1,2,3,4)(5,8,7,6), (1,5,3,7)(2,6,4,8) ] 
    :  isXModMorphism? true                            

Previous Up Top Next
Index