gap> LoadPackage( "Algebroids", false );
true
gap> Delta1 := SimplicialCategoryTruncatedInDegree( 1 );
PathCategory( FinQuiver( "Delta(C0,C1)[id:C1-≻C0,s:C0-≻C1,t:C0-≻C1]" ) )
/ [ s⋅id = id(C0), t⋅id = id(C0) ]
gap> Size( Delta1 );
7
gap> mors := SetOfMorphisms( Delta1 );
[ [id(C0)]:(C0) -≻ (C0), [id]:(C1) -≻ (C0), [s]:(C0) -≻ (C1), [t]:(C0) -≻ (C1),
  [id(C1)]:(C1) -≻ (C1), [id⋅s]:(C1) -≻ (C1), [id⋅t]:(C1) -≻ (C1) ]
gap> List( mors, DecompositionOfMorphismInCategory );
[ [  ], [ [id]:(C1) -≻ (C0) ], [ [s]:(C0) -≻ (C1) ], [ [t]:(C0) -≻ (C1) ],
  [  ], [ [id]:(C1) -≻ (C0), [s]:(C0) -≻ (C1) ],
  [ [id]:(C1) -≻ (C0), [t]:(C0) -≻ (C1) ] ]
gap> C := CategoryFromDataTables( Delta1 );
PathCategory( FinQuiver( "Delta(C0,C1)[id:C1-≻C0,s:C0-≻C1,t:C0-≻C1]" ) )
/ [ s⋅id = id(C0), t⋅id = id(C0) ]
gap> Size( C );
7
gap> morsC := SetOfMorphisms( C );
[ (C0)-[(C0)]->(C0), (C1)-[(id)]->(C0), (C0)-[(s)]->(C1), (C0)-[(t)]->(C1),
  (C1)-[(C1)]->(C1), (C1)-[(id*s)]->(C1), (C1)-[(id*t)]->(C1) ]
gap> List( morsC, DecompositionOfMorphismInCategory );
[ [  ], [ (C1)-[(id)]->(C0) ], [ (C0)-[(s)]->(C1) ], [ (C0)-[(t)]->(C1) ],
  [  ], [ (C1)-[(id)]->(C0), (C0)-[(s)]->(C1) ],
  [ (C1)-[(id)]->(C0), (C0)-[(t)]->(C1) ] ]
gap> NerveTruncatedInDegree2Data( C ) = NerveTruncatedInDegree2Data( Delta1 );
true
gap> IndicesOfGeneratingMorphisms( C );
[ 1, 2, 3 ]
gap> SetOfGeneratingMorphisms( C );
[ (C1)-[(id)]->(C0), (C0)-[(s)]->(C1), (C0)-[(t)]->(C1) ]
gap> Display( C );
A CAP category with name
PathCategory( FinQuiver( "Delta(C0,C1)[id:C1-≻C0,s:C0-≻C1,t:C0-≻C1]" ) )
/ [ s⋅id = id(C0), t⋅id = id(C0) ]:

19 primitive operations were used to derive 55 operations for this category
which algorithmically
* IsCategoryWithDecidableColifts
* IsCategoryWithDecidableLifts
* IsFiniteCategory
* IsEquippedWithHomomorphismStructure
gap> C0 := CreateObject( C, 0 );
<(C0)>
gap> IsWellDefined( C0 );
true
gap> C1 := 1 / C;
<(C1)>
gap> IsWellDefined( C1 );
true
gap> IsWellDefined( 2 / C );
false
gap> idC0 := CreateMorphism( C0, 0, C0 );
(C0)-[(C0)]->(C0)
gap> CreateMorphism( C, 0 ) = idC0;
true
gap> IsOne( idC0 );
true
gap> id := CreateMorphism( C, 1 );
(C1)-[(id)]->(C0)
gap> s := CreateMorphism( C, 2 );
(C0)-[(s)]->(C1)
gap> t := CreateMorphism( C, 3 );
(C0)-[(t)]->(C1)
gap> IsSplitMonomorphism( s );
true
gap> IsSplitMonomorphism( t );
true
gap> IsEpimorphism( s );
false
gap> IsEpimorphism( t );
false
gap> IsSplitEpimorphism( id );
true
gap> IsMonomorphism( id );
false
gap> idC1 := CreateMorphism( C, 4 );
(C1)-[(C1)]->(C1)
gap> IsOne( idC1 );
true
gap> sigma := CreateMorphism( C, 5 );
(C1)-[(id*s)]->(C1)
gap> tau := CreateMorphism( C, 6 );
(C1)-[(id*t)]->(C1)
gap> IsEndomorphism( sigma );
true
gap> IsMonomorphism( sigma );
false
gap> IsEpimorphism( sigma );
false
gap> IsEndomorphism( tau );
true
gap> IsMonomorphism( tau );
false
gap> IsEpimorphism( tau );
false
gap> IsOne( tau );
false
gap> IsWellDefined( CreateMorphism( C1, 7, C1 ) );
false
gap> PreCompose( s, id ) = idC0;
true
gap> PreCompose( t, id ) = idC0;
true
gap> PreCompose( id, s ) = sigma;
true
gap> PreCompose( id, t ) = tau;
true
gap> HomStructure( C0, C0 );
|1|
gap> HomStructure( C1, C1 );
|3|
gap> HomStructure( C0, C1 );
|2|
gap> HomStructure( C1, C0 );
|1|
gap> Display( HomStructure( s ) );
{ 0 } ⱶ[ 0 ]→ { 0, 1 }
gap> Display( HomStructure( t ) );
{ 0 } ⱶ[ 1 ]→ { 0, 1 }
gap> HomStructure( Source( s ), Target( s ), HomStructure( s ) ) = s;
true
gap> HomStructure( Source( t ), Target( t ), HomStructure( t ) ) = t;
true
gap> Display( HomStructure( s, t ) );
{ 0 } ⱶ[ 1 ]→ { 0, 1 }
gap> Display( HomStructure( t, s ) );
{ 0 } ⱶ[ 0 ]→ { 0, 1 }
gap> Display( HomStructure( sigma, tau ) );
{ 0, 1, 2 } ⱶ[ 2, 2, 2 ]→ { 0, 1, 2 }
gap> Display( HomStructure(
>         PreCompose( Delta1.id, Delta1.s ),
>         PreCompose( Delta1.id, Delta1.t ) ) );
{ 0, 1, 2 } ⱶ[ 2, 2, 2 ]→ { 0, 1, 2 }
gap> Display( HomStructure( tau, sigma ) );
{ 0, 1, 2 } ⱶ[ 1, 1, 1 ]→ { 0, 1, 2 }
gap> Display( HomStructure(
>         PreCompose( Delta1.id, Delta1.t ),
>         PreCompose( Delta1.id, Delta1.s ) ) );
{ 0, 1, 2 } ⱶ[ 1, 1, 1 ]→ { 0, 1, 2 }
gap> Display( HomStructure( tau, idC1 ) );
{ 0, 1, 2 } ⱶ[ 2, 1, 2 ]→ { 0, 1, 2 }
gap> Display( HomStructure( idC1, idC1 ) );
{ 0, 1, 2 } ⱶ[ 0, 1, 2 ]→ { 0, 1, 2 }
gap> mors := SetOfMorphisms( C );
[ (C0)-[(C0)]->(C0), (C1)-[(id)]->(C0), (C0)-[(s)]->(C1), (C0)-[(t)]->(C1),
  (C1)-[(C1)]->(C1), (C1)-[(id*s)]->(C1), (C1)-[(id*t)]->(C1) ]
gap> List( mors, OppositeMorphismInOppositeCategoryFromDataTables );
[ (C0)-[(C0)]->(C0), (C0)-[(id)]->(C1), (C1)-[(s)]->(C0), (C1)-[(t)]->(C0),
(C1)-[(C1)]->(C1), (C1)-[(s*id)]->(C1), (C1)-[(t*id)]->(C1) ]
gap> mors;
[ (C0)-[(C0)]->(C0), (C1)-[(id)]->(C0), (C0)-[(s)]->(C1), (C0)-[(t)]->(C1),
  (C1)-[(C1)]->(C1), (C1)-[(id*s)]->(C1), (C1)-[(id*t)]->(C1) ]
gap> List( mors, DecompositionOfMorphismInCategory );
[ [  ], [ (C1)-[(id)]->(C0) ], [ (C0)-[(s)]->(C1) ], [ (C0)-[(t)]->(C1) ],
  [  ], [ (C1)-[(id)]->(C0), (C0)-[(s)]->(C1) ],
  [ (C1)-[(id)]->(C0), (C0)-[(t)]->(C1) ] ]
gap> C_op := OppositeCategoryFromDataTables( C );
Opposite(
PathCategory( FinQuiver( "Delta(C0,C1)[id:C1-≻C0,s:C0-≻C1,t:C0-≻C1]" ) )
/ [ s⋅id = id(C0), t⋅id = id(C0) ] )
gap> IsIdenticalObj( OppositeCategoryFromDataTables( C_op ), C );
true
gap> IndicesOfGeneratingMorphisms( C_op );
[ 3, 1, 2 ]
gap> SetOfGeneratingMorphisms( C_op );
[ (C0)-[(id)]->(C1), (C1)-[(s)]->(C0), (C1)-[(t)]->(C0) ]
gap> mors_op := SetOfMorphisms( C_op );
[ (C0)-[(C0)]->(C0), (C1)-[(s)]->(C0), (C1)-[(t)]->(C0), (C0)-[(id)]->(C1),
  (C1)-[(C1)]->(C1), (C1)-[(s*id)]->(C1), (C1)-[(t*id)]->(C1) ]
gap> List( mors_op, DecompositionOfMorphismInCategory );
[ [  ], [ (C1)-[(s)]->(C0) ], [ (C1)-[(t)]->(C0) ], [ (C0)-[(id)]->(C1) ],
  [  ], [ (C1)-[(s)]->(C0), (C0)-[(id)]->(C1) ],
  [ (C1)-[(t)]->(C0), (C0)-[(id)]->(C1) ] ]