The following procedure allows verbose information for the Invariant Theory algorithms to be displayed.
(Procedure.) Set the verbose printing level for the Invariant Theory algorithms of Magma to be v. Currently the legal values for v are true, false, 0, 1, 2, 3, or 4 (false has the same effect as 0, and true has the same effect as 1). Level 1 gives a minimal amount of useful information during the running of all the algorithms while higher levels give more detailed information. For the primary invariants computation, the verbose output displays each possible degree list (degrees of the potential primary invariants) before and then tries to find primary invariants corresponding to this degree list. For the secondary invariants computation, in the non-modular case the algorithm loops over the necessary degrees in increasing order and computes the relevant new invariants; in the modular case the algorithm finds secondary invariants with respect to a subgroup and then performs a module syzygy computation. Full details of the algorithms are found in [KS97].