The MinimalEquation constructs minimal equation (y1-consequence) for the given system corresponding to the matrix M and Ore algebra A and a given function with the index n of its undetermined functions. The minimal equation is a scalar equation whose solution is the component of some solution of the given system corresponding to the given function. The output is OrePoly L, such that  is the y1-consequence, i.e. the minimal equation such that its solution is the n-th element of some solution of the given system.

The ReducedSystem reduces the given system corresponding to the matrix M and Ore algebra A with respect to a given subset ns of its undetermined functions. The reduced system is a system which contains the given subset of the undetermined functions of the given system among its undetermined functions and components of its closed form solution corresponding to the given subset are components of some solution of the given system. It addresses the following problem: given a subset of the components of solutions to be found and an appropriate class of functions, find all solutions whose specified components are in the given class (more precisely we are interested in computing those components only). For example, given a differential system, find all the rational functions that are first and second components of a solution of the system. The output is , where R is the matrix of the reduced system and s is the set of pairs, the first element of each is the index out of ns and the second one is the index of the same undetermined function in the reduced system.