RAQ/gap/byconj.gi
2017-10-21 01:08:13 +02:00

80 lines
2.4 KiB
Plaintext

# byconj.gi RAQ Implementation of quandles by conjugation
InstallMethod(ConjugatorFamily, "for a family",
[IsFamily],
function(fam)
local F;
# Does GAP provide any way to get at the name of a family other than
# fam!.NAME ?
F := NewFamily(Concatenation("ConjugatorFamily(", fam!.NAME, ")"),
IsConjugatorObject);
F!.ConjType := NewType(F, IsDefaultConjugatorObject);
return F;
end);
ConjugatorType@ := obj -> ConjugatorFamily(FamilyObj(obj))!.ConjType;
InstallMethod(ConjugatorObj,
"for a mult element that allows left quotients (and should be assoc)",
[IsMultiplicativeElement and IsLeftQuotientElement],
obj -> Objectify(ConjugatorType@(obj), Immutable(obj))
);
## Printing and viewing
InstallMethod(String, "for conjugator objects",
[IsDefaultConjugatorObject],
obj -> Concatenation("ConjugatorObj( ", String(obj![1]), " )")
);
InstallMethod(ViewString, "for conjugator objects",
[IsDefaultConjugatorObject],
obj -> Concatenation("^", ViewString(obj![1]), ":")
);
InstallMethod(UnderlyingMultiplicativeElement, "for a conjugator object",
[IsDefaultConjugatorObject],
obj -> obj![1]
);
InstallMethod( \=, "for two conjugator objects",
IsIdenticalObj,
[IsDefaultConjugatorObject, IsDefaultConjugatorObject],
function(l,r) return l![1] = r![1]; end
);
InstallMethod( \<, "for two conjugator objects",
IsIdenticalObj,
[IsDefaultConjugatorObject, IsDefaultConjugatorObject],
function(l,r) return l![1] < r![1]; end
);
InstallMethod( \*, "for two conjugator objects",
IsIdenticalObj,
[IsDefaultConjugatorObject, IsDefaultConjugatorObject],
function(l,r) return LeftQuotient(l![1],r![1])*l![1]; end
);
InstallMethod(LeftQuotient, "for two conjugator objects",
IsIdenticalObj,
[IsDefaultConjugatorObject,IsDefaultConjugatorObject],
function(l,r) return (l*r)/l; end
);
InstallMethod("ConjugationQuandle", "for a group",
[IsGroup and IsFinite],
function(G)
local fam, elts;
fam := CollectionFamily(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
# conj-quandles here?
elts := List(Elements(G), g -> ConjugatorObj(g));
# What we would like to do is
# return AsLeftQuandle[NC?](elts);
# but that's NIY.
return LeftQuandleNC(fam, elts);
end);