First query: Can one make a trivial PcGroup, and if so, are all PcGroup
operations applicable to it? My problem is that an algorithm of mine
may produce as an answer a PcGroup which happens to be trivial.
Second query: Is there any way of asserting that the type of an object
(say a vector over a given finite field F) will *never* change, in
order that checks do not have to be made if, say, an element of F is
appended to that vector?
Many thanks, Leonard.