Merge pull request #61 from mohamed-barakat/devel

comply with paper and simplify code

Author: mohamed-barakat

PackageInfo.g

@@ -10,7 +10,7 @@ SetPackageInfo( rec(
 
 PackageName := "FinGSetsForCAP",
 Subtitle := "The (skeletal) elementary topos of finite G-sets",
-Version := "2026.04-04",
+Version := "2026.04-05",
 
 Date := (function ( ) if IsBound( GAPInfo.SystemEnvironment.GAP_PKG_RELEASE_DATE ) then return GAPInfo.SystemEnvironment.GAP_PKG_RELEASE_DATE; else return Concatenation( ~.Version{[ 1 .. 4 ]}, "-", ~.Version{[ 6, 7 ]}, "-01" ); fi; end)( ),
 License := "GPL-2.0-or-later",

gap/SkeletalCategoryOfTransitiveLeftGSets.gi

@@ -161,8 +161,8 @@ InstallMethod( SkeletalCategoryOfTransitiveLeftGSets,
         return g in UnderlyingGroup( SkeletalTransitiveGSets ) and
                ## well-defined means equal input results in equal output:
                ## U[s] = h U[s] ⟹ g U[t] = h g U[t] (by equivariance) ⟺
-               ## ∀ h ∈ U[s], g⁻¹ h g ∈ U[t] ⟺ g⁻¹ U[s] g ⊆ U[t] ⟺ U[s] ⊆ g U[t] g⁻¹ ≕ ᵍU[t]
-               IsSubset( ConjugateSubgroup( U[t], Inverse( g ) ), U[s] ); ## ConjugateSubgroup( U[t], Inverse( g ) ) := g U[t] g⁻¹
+               ## ∀ h ∈ U[s], g⁻¹ h g ∈ U[t] ⟺ g⁻¹ U[s] g ≕ U[s]ᵍ ⊆ U[t]
+               IsSubset( U[t], ConjugateSubgroup( U[s], g ) ); ## ConjugateSubgroup( U[s], g ) ≔ g⁻¹ U[s] g ≕ U[s]ᵍ ⊆ U[t]
 
     end );
 
@@ -376,7 +376,7 @@ InstallMethod( SkeletalCategoryOfTransitiveLeftGSets,
         ## LeftTransversal is not defined in GAP
         L := List( RightTransversal( G, U[t] ), Inverse );
 
-        L := Filtered( L, g -> IsSubset( ConjugateSubgroup( U[t], Inverse( g ) ), U[s] ) );
+        L := Filtered( L, g -> IsSubset( U[t], ConjugateSubgroup( U[s], g ) ) );
 
         return List( L, g ->
                      MorphismConstructor( SkeletalTransitiveGSets,