From ae71d58873e987e985187703c3010ac413b79b5e Mon Sep 17 00:00:00 2001 From: Glen Whitney Date: Sat, 21 Oct 2017 20:47:54 +0200 Subject: [PATCH] Quandles constructed from finite groups are finite --- gap/byconj.gi | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) diff --git a/gap/byconj.gi b/gap/byconj.gi index b1df98f..e1ea660 100644 --- a/gap/byconj.gi +++ b/gap/byconj.gi @@ -76,7 +76,7 @@ InstallOtherMethod(LeftQuotient, "for two conjugator objects", InstallMethod(ConjugationQuandle, "for a group", [IsGroup and IsFinite], function(G) - local fam, elts; + local fam, elts, Q; fam := CollectionsFamily(ConjugatorFamily(ElementsFamily(FamilyObj(G)))); # Question: how do we easily/quickly determine a set of generators of # Conj(G) from a set of generators of G, so that we can handle infinite @@ -85,7 +85,11 @@ InstallMethod(ConjugationQuandle, "for a group", # What we would like to do is # return AsLeftQuandle[NC?](elts); # but that's NIY. - return LeftQuandleNC(fam, elts); + Q := LeftQuandleNC(fam, elts); + # We know that elts was actually closed under * and LeftQuotient, and + # since we are in a method only for finite groups, ergo Q is finite: + SetIsFinite(Q, true); + return Q; end);