The µ -Basis of Improper Rational Parametric Surface and Its Application

: The µ -basis is a newly developed algebraic tool in curve and surface representations and it is used to analyze some essential geometric properties of curves and surfaces. However, the theoretical frame of µ -bases is still developing, especially of surfaces. We study the µ -basis of a rational surface V deﬁned parametrically by P ( t ) , t = ( t 1 , t 2 ) not being necessarily proper (or invertible). For applications using the µ -basis, an inversion formula for a given proper parametrization P ( t ) is obtained. In addition, the degree of the rational map φ P associated with any P ( t ) is computed. If P ( t ) is improper, we give some partial results in ﬁnding a proper reparametrization of V . Finally, the implicitization formula is derived from P (not being necessarily proper). The discussions only need to compute the greatest common divisors and univariate resultants of polynomials constructed from the µ -basis. Examples are given to illustrate the computational processes of the presented results.


Introduction
The study of representations of rational curves and surfaces is a fundamental task in computer aided geometric design (CAGD) and computer algebra. There exist two typical problems in the study of representations.
• Implicitization: for a rational parametric curve or surface, implicitization is to find an algebraic expression of the curve or surface. • Proper Reparametrization: for an improper rational parametric curve or surface, proper reparametrization is to find a proper parametric expression of the curve or surface.
The parametric expression of a curve or surface is widely used in geometric modeling, such as NURBS representations. The algebraic equation, which is also called implicit equation, is another important representation, and this is much better than the parametric expression in determining whether or not a point is on the curve or surface. Hence the implicitization problem is classical in CAGD and there are implicitization algorithms for rational curves and surfaces proposed over the past several decades [1][2][3][4][5][6][7][8][9][10][11][12][13][14]. Among all of these techniques, the Gröbner bases [2] is well-known, since it is theoretically complete. However, this method has exponential computational complexity and, thus, it is inefficient. This is the reason that people can not apply the Gröbner basis method for practical implicitization in application. Alternatively, in computational application, people prefer to find the implicit equations from certain implicit matrices. The implicit matrices can be constructed as resultant matrices or matrices of moving curves/surfaces. The implicit matrix of the curve is much simpler than that of the surface, since the curve only introduces one variable. Actually, the construction of bivariate resultant is not uniform and it is still a developing technique in computer algebra [15][16][17][18][19][20][21]. The implicit matrix of moving curves/surfaces was introduced in [10] and developed by more researchers [5,11,[22][23][24][25]. The µ-basis of a curve or surface was later defined by moving lines or moving planes with certain properties [5,23].
The implicit equation of the surface is generally included as a factor in its constructed resultants, but a constructed resultant may have extraneous factors that are not easy to identify and remove. For implicit matrices, some works attempt to construct the matrix whose determinant is exactly the implicit equation [10,24,26,27], but the ways to construct such implicit matrices are not complete for general surfaces. In the implicit matrix, there is more information than the implicit equation, such as singularities with multiplicity counting. Accordingly, people sometimes construct the implicit matrix by simple way and then the determinant of this matrix may have extraneous factors other than the implicit equation [22]. For the matrix constructed from the µ-basis of arbitrary three linearly independent syzygies, the extraneous factors are identified completely based on the analysis of base points or to parameters at infinity of tensor product surfaces [11,25], but some computations need the Gröbner bases of a zero dimensional algebraic variety.
When considering the proper reparametrization problem, an essential question is to decide whether a rational parametrization is proper. If a given rational parametrization is not proper, also called improper, a generic point lying on the variety corresponds to more than one parameter. On the other side, if a rational parametrization is improper, we ask whether it can be reparameterized, such that we can get a new proper parametrization. For algebraic curves, is well-known that the existence of a proper reparametrization for a given improper rational parametrization is certified by Lüroth's Theorem [28]. One can have a look, for instance, at a previous bibliography, as, for instance, [29][30][31], where some efficient methods are proposed to find a proper reparametrization for an improper parametrization of an algebraic curve. For a given algebraic surface, Castelnuovo's Theorem states that unirationality and rationality are equivalent over algebraically closed fields, but only some partial algorithmic methods approaching the problem are known (see [30,32]).
The µ-basis was first used in [17]. Here, the authors provided a representation for the implicit equation of a given curve defined parametrically. The µ-basis developing as a new algebraic tool can be used to obtain the parametric equation of a rational curve or a rational surface, in order to compute the implicit equation defining these varieties, and to study singularities and intersections [33]. There are several methods to compute the µ-basis for rational curves by computing two moving lines that satisfy the required properties [17], based on Gröbner basis [34] or based on vector elimination [23]. The µ-basis has also been generalized to rational surfaces [5], although the case of rational surfaces is different; for instance, the degrees of the µ-basis elements can be different. An algorithm to compute a µ-basis of a rational surface is designed that is based on polynomial matrix factorization [35]. Another possible way is to compute a basis of the syzygy module of the surface with the application of Quillen-Suslin Theorem [36,37]. In order to avoid the extraneous factor in implicitization, people tried to find the strong µ-bases of surfaces that have the very similar properties of the µ-bases of curves. However, the surfaces with strong µ-bases are relatively rare [25,38].
The µ-basis has shown different advantages by assuming that the given parametrization is always proper. A recent result attempts to find inverse formula, proper reparametrization, and algebraic equation for an improper parametrization of an algebraic curve by using µ-basis [39]. In this paper, we pay attention to the µ-basis of an improper parametrization of an algebraic surface and then apply the µ-basis in the problems of proper reparametrization and implicitization. There are intrinsical differences in the discussions between the surface and the curve; hence, some results of the curve can not be extended to the surface straightforward. After we give the definition of µ-basis of a rational parametric surface defined parametrically by P ( t ), we find the inversion formula (if P is proper) and the degree of the rational map that is induced by P while using the µ-basis. Although the proper reparametrization problem is still opening, we address the problem of proper reparametrization partially based on the latest results and the properties of the µ-basis. As an important application, we derive the implicitization formula from the µ-basis from a given parametrization not being necessarily proper. Starting from the µ-basis, the computations only involve greatest common divisors (gcds) and univariate resultants of some polynomials constructed from the µ-basis. While the surface implicitization form µ-basis involved the computation of Gröbner bases in [5].
We have structured the article, as indicated below. In Section 2, we present some important definitions and properties for the µ-basis of rational surfaces. In Section 3, given a rational parametrization P, we study the inversion computation (if P is proper) and the degree of the induced rational map. In Section 4, we focus on the proper reparametrization problem while using µ-basis. In Section 5, we come to the implicitization problem from a given rational parametrization not necessarily proper using µ-basis. We finish the paper with Section 6, where we present a brief summary of our work.

µ-Basis for Rational Surfaces: Definition and Previous Results
Let R denote the polynomial ring K[t 1 , t 2 ] over an algebraically closed field K of characteristic zero and R m denote the set of m−dimensional row vectors with entries in the polynomial ring R. A submodule M of R m is a subset of R m , for which this condition holds: for any f 1 , f 2 ∈ M and h 1 , The Hilbert Basis Theorem states that every submodule M ⊂ R m has a finite generating set. If, for any m ∈ M, the above expression is unique, then {f 1 , . . . , f k } is called a basis of the module M. If a module has a basis, then it is called a free module. For any (f 1 , . . . , is a module over R, called a syzygy module [40]. An important result regarding syzygy modules is that if a, b, c, d ∈ R[t 1 , t 2 ] are four relatively prime polynomials then, the syzygy module syz(a, b, c, d) is a free module of rank 3 (see [5]). Let V a be a rational affine irreducible surface, and let be a rational affine parametrization of V a , where gcd(℘ 1 , ℘ 2 , ℘ 3 , ℘ 4 ) = 1. Sometimes, we write the parametrization in the homogenous coordinate form P ( t ) = (℘ 1 ( t ) : ℘ 2 ( t ) : ℘ 3 ( t ) : ℘ 4 ( t )) and, in this case, we denote the surface in the projective space as V.
A moving surface of degree l is a family of algebraic surfaces with parameter pairs (t 1 , t 2 ) , where f i ( x ), i = 1, . . . , σ are polynomials of degree l, and b i ( t ) ∈ R[ t ], i = 1, . . . , σ (called blending functions) are linearly independent. We say that a moving surface follows the rational surface P if ℘ 4 ( t ) l S P a ( t ), t = 0.
We observe that the implicit equation of a given rational surface V is a moving surface of P. A moving plane is a moving surface of degree one. We denote the next moving plane 4 . In the following, we denote, by L t , the set of the moving planes that follow the rational surface that is parametrized by P. Thus, L t is exactly the syzygy module syz(℘ 1 , ℘ 2 , ℘ 3 , ℘ 4 ). Now, we define the µ-basis of the rational surface P. Definition 1. Let p, q, r ∈ L t be three moving planes satisfying that [p, q, r] = k P ( t ), where k is a nonzero constant. Subsequently, it is said that p, q, r form a µ-basis of the rational surface P. In the following, [p, q, r] denotes the outer product of p, q, r.
Geometrically, the above definition means that the point of rational surface P can be represented as the intersection of three moving planes p, q, r. This definition is generalized from the moving lines of a rational curves [23]. Notice that the result in the curve case was proposed twenty years ago, but the surface case has been a mystery for a long time. The µ-bases surfaces that have the very similar properties of the µ-bases of curves is called strong µ-basis, but the strong µ-bases are relatively rare [25]. Therefore, we have to study the µ-basis of the surface from initial definition and, here, we review some basic theorems in [5]. Theorem 1. For any rational surface P, there always exist three moving planes p, q, r, such that [p, q, r] = k · P ( t ) holds. In fact, any basis p, q, r of syz(℘ 1 ( t ), ℘ 2 ( t ), ℘ 3 ( t ), ℘ 4 ( t )) satisfies the above equality. Theorem 2. Let p, q, r be a µ-basis of the rational surface P. Thus, p, q, r provide a basis for the module L t (hence, L t is a free module). That is, for any l( t ) ∈ L t , there exist some polynomials h i ( t ), i = 1, 2, 3, satisfying that In addition, the above expression is unique.
An immediate consequence of the above theorems is that if p, q, r form a µ-basis if and only if p, q, r are a basis of syz(℘ 1 ( t ), ℘ 2 ( t ), ℘ 3 ( t ), ℘ 4 ( t ))

Inversion and Degree Using µ-Basis
Let K be an algebraically closed field of characteristic zero. We denote, by f (x 1 , x 2 , x 3 ) ∈ K[x 1 , x 2 , x 3 ], the defining polynomial of a rational affine irreducible surface V a defined by the rational affine parametrization The homogeneous implicit polynomial defining the corresponding the projective rational surface V will be denoted as F(x 1 , , and the parametrization in the homogenous coordinate form is given as Besides implicitization, other applications of µ-basis include, as in the case of algebraic curves, point inversion and, in general, the computation of the fiber. The point inversion problem can be stated, as follows: given a point Q on the space, decide whether the point is on a rational surface V defined parametrically by P ( t ) or not, and, in the affirmative case, compute the corresponding parameter values t 1 , t 2 , such that P (t 1 , t 2 ) = Q. In this section, we recall some efficient algorithms that allow for computing the point inversion and, in general, the computation of the degree of the rational map that is induced by P. For this purpose, we will use µ-basis.
In order to deal with these problems, we first recall that, associated with the parametrization P a ( t ), we consider the induced rational map φ P : K −→ V a ⊂ K 3 ; t −→ P a ( t ). We denote, by deg(φ P ), the degree of the induced rational map φ P (see [41] p. 143, and [42] p. 80). Observe that the birationality of φ P , which is the properness of the input parametrization, is characterized by deg(φ P ) = 1 (see [41,42]). We additionally remind that deg(φ P ) determines the cardinality of the fiber of a generic element (see Theorem 7, p. 76 in [41]). The degree measures the number of times the parametrization traces the curve when the parameter takes values in K 2 . Finally, let F P (Q) be the fiber of a point In the following, given the projective parametrization P ( t ) of a surface V and a µ-basis for P ( t ), we consider a generic point Q = (x 1 , x 2 , x 3 , x 4 ) on the surface, and the polynomials is the field of rational functions of the given surface.
Finally, let where Cont x (h) returns the content of a polynomial h w.r.t. some variable x, pp x (h) returns the primitive part of a polynomial h with respect to a variable x and Res x (h 1 , h 2 ) returns the resultant of two polynomials h 1 and h 2 w.r.t. some variable x. Similarly, one also considers the polynomial The computation of S P , T P can be done in two different ways. First, we consider that the implicit equation defining the input surface is known. In this case, we carry out the arithmetic over K(V ) while using this implicit equation. We observe that, since I(V ) = F (I(V ) represents the ideal of V), the basic arithmetic on K[V ] can be carried out by computing polynomial remainders. Thus, we conclude that the quotient field K(V ) is computable. Furthermore, we note that we calculate the resultants of polynomials in K(V )[ t ], which is a unique factorization domain, and we compute gcds of univariate polynomials over K(V ) and, thus, in an Euclidean domain. In the second way, we avoid the requirement on the implicit equation. More precisely, the elements are represented (not uniquely) as function of polynomials in the variables x 1 , x 2 , x 3 , x 4 . We check the zero equality while using the input rational parametrization. This way could be too time consuming. In order to avoid this problem, one may test zero-equality by substituting a random point on the surface. The result of this test is correct with probability almost one. Additionally, one may also test the correctness of the computation of the inverse by checking it on a randomly chosen point on the given surface. In this way, we avoid the computation of the implicit polynomial.
In the following theorem, we provide the technique for computing the components of the inverse of a given rational proper parametrization P ( t ). Additionally, we characterize the properness of P ( t ). We illustrate this result in Example 1.
Theorem 3. The rational parametrization P ( t ) is proper if and only if for a generic point Q = (x 1 , x 2 , x 3 , x 4 ) on the surface, it holds that deg t 1 (S P ) = 1. In this case, the t 1 -coordinate of the inverse of P ( t ) is given by solving S P (t 1 , x ) = 0 w.r.t the variable t 1 .

Proof.
Using the results shown in [43] (see Proposition 1), we deduce that the non-constant t 1 -coordinates of the intersections points in V i , i = 1, 2, 3 are given by the roots of the polynomial S P (t 1 , x ). Thus, we only have to prove that P ( t ) is proper if and only there ) be the inverse of the rational proper parametrization P ( t ). Subsequently, M(P ) = t and, thus, p P (M(P ), P ) = q P (M(P ), P ) = r P (M(P ), P ) = 0, which implies that Afterwards, by the properties of resultants and by Lemma 1, we get that P ( t ) = k P (R( t )) and since P is proper we deduce that R( t ) = M * (P ( t )) = t . Thus, left composing by P −1 , we get that M * = P −1 = M.

Reciprocally, because there exists a unique point in
fixed under the action of the Galois group and, thus, A ∈ K(V ) 2 . Reasoning similarly, as we did for the uniqueness in the above implication, one gets that A • P = t and, then, we conclude that A is the inverse of P.

Remark 1. Theorem 3 can be stated similarly for T
We also note that we may work over the affine space (i.e., x 4 = 1) and the obtained results are the same, but over the affine space. If x 4 = 1, then the computations are more efficient. Example 1. Let V be the rational surface that is defined by the parametrization First, we compute the polynomials where the µ-basis is given as Because deg t 1 (S P ) = 1, we conclude that P is proper and the first coordinate of the inverse is given as Reasoning similarly with T P , we obtain the second coordinate of the inverse, which is given as Based upon the above theorem, we may compute F P (Q) for a generic point Q and, thus, to obtain the degree of the rational map induced by deg(φ P ). For this purpose, we consider Q = P a ( s ), where s = (s 1 , s 2 ) are new variables, and the polynomials Thus, one obtains the following proposition.
Proof. First, we use Proposition 1 in [43], and we deduce that the non-constant t 1 -coordinates of the intersections points in V i , i = 1, 2, 3 are given by the roots of the polynomial S P (t 1 , s ).
Thus, p P (M, s ) = q P (M, s ) = r P (M, s ) = 0 and, hence, Clearly, Theorem 4 can be also stated for a generic point Q = (x 1 , x 2 , x 3 , x 4 ) on the surface, and the polynomials (remind that p P ( t , P ( t )) = q P ( t , P ( t )) = r P ( t , P ( t )) = 0 ([p, q, r] = k P ( t )). For this purpose, one considers the polynomials where computation can be done, as we described in the paragraph before Theorem 3, i.e., over the field of rational functions K(V ). Thus, one has the following corollary. t 2 , x )).

Remark 2.
From the proof of Theorem 4, we deduce that F P (Q) Example 2. Let V be the rational surface that is defined by the parametrization We determine the polynomials p P ( t , s ) = p( t ) · P ( s ), q P ( t , s ) = q( t ) · P ( s ), r P ( t , s ) = r( t ) · P ( s ), where the µ-basis is given by Now, we determine S P (t 1 , s ) (similarly, if we compute T P (t 2 , s )), and we obtain Therefore, applying Theorem 4, we conclude that P is not proper and in fact deg(φ P ) = 2. Furthermore, F P (P a ( s )) = {(s 1 , s 2 ), (−s 1 , s 2 )}.

On the Problem of the Reparametrization Using µ-Basis
In this section, we consider the problem of computing a rational proper reparametrization of a given algebraic surface defined by an improper parametrization. That is, given an algebraically closed field K, and P ( t ), t = (t 1 , t 2 ), a rational parametrization of a surface V over K, we want to compute a proper parametrization of V, Q( t ), and R( t ) ∈ (K( t ) \ K) 2 , such that P ( t ) = Q(R( t )).
Notice that we consider Q(R( t )), with R( t ) = ( , which is a polynomial vector in homogenous form. In this section, although we do not provide a solution to the general reparametrization problem, we show how the µ-basis can be used to provide some information concerning R( t ) ∈ (K( t ) \ K) 2 . We address the problem partially and the idea presented is based in the results in [32], but we trust that we could develop deeply these new approaches in future works, and more results concerning this topic allow us to get more advances.
The approach that is presented in this section is based on the computation of polynomial gcds and univariate resultants. These techniques always work and the time performance is very effective. The algorithm presented follows directly from the algorithm that was developed in [39], which solves the problem for the case of curves. Accordingly, we first outline this approach and illustrate it with an example. Example 3. Let C be the rational curve that is defined by the parametrization P (t) = (−t 4 + t 3 + 2t 2 + 2t + 1 : (t + 1)(3t 2 + 2t + 2) : 2t 4 + 3t 3 + 5t 2 + 4t + 2).

In
Step 2 of the algorithm, we determine the polynomials p P (t, s) and q P (t, s), where the µ-basis is Now, we compute G P (t, s), where C 0 (t) = −10t 2 , C 1 (t) = −10t 2 , and C 2 (t) = 10 + 10t. Because m := deg t (G P ) > 1, we go to Step 5 of Algorithm 1, and we consider Note that gcd(C 0 , C 2 ) = 1. Now, we determine the polynomials Finally, the algorithm outputs the proper parametrization Q(t), and the rational function R(t) (see Step 7)
Compute a µ-basis of P. Let p(t), q(t) be this µ-basis.
The main idea of the result that we develop in this paper consists in computing a reparametrization of two auxiliary parametrizations (defining two space curves), P 1 and P 2 , directly defined from a given rational parametrization of the surface P (see Definition 2). Moreover, using that the degree of a rational map is multiplicative under composition, we get some results that relate the degree of the rational map that is induced by P with the degree of Q, and the degree of the rational maps induced by P 1 and P 2 . In addition, we also prove the relation with the degree w.r.t. the variables t 1 , t 2 of R( t ) ∈ K( t ) 2 .
Proof. Taking into account thatp( t ),q( t ) andr( t ) is a µ-basis for Q( t ), from Theorem 1, it follows that [p,q,r] = k Q( t ) for some non-zero constant k. Therefore, we easily get that [p, q, r] = k P ( t ) for some non-zero constant k. Hence, from Theorem 1, we conclude that p( t ), q( t ), r( t ) is a µ-basis for P ( t ).
In the next proposition, we assume that we know p, q and r and R( t ) = (r 1 ( t ), r 2 ( t )) ∈ (K( t ) \ K) 2 , and we present a method for computingp,q andr from p, q and r, respectively. We state Proposition 1 for p = (p 1 , p 2 , p 3 , p 4 ) andp = (p 1 ,p 2 ,p 3 ,p 4 ). One reasons, similarly, to obtainq from q andr from r.
Let us assume that gcd(p 1 , p 4 ) = gcd(p 1 ,p 4 ) = 1 (otherwise, we simplify these rational functions). In addition, we note that, if p 1 = 0, then we easily get thatp 1 = 0. For the case of p 1 = 0, we consider (r 1 , r 2 , p 1 /p 4 ) that can be seen as an affine parametrization of the surface defined by the irreducible polynomialp 1 (note that gcd(p 1 ,p 4 ) = 1 andp 4p1 = 0). Hence, we only have to compute the implicit equation of that surface by applying, for instance, the method that is presented in [44].

Proposition 1.
Under the conditions that are stated above, it holds that the implicit equation of the parametrization (r 1 , r 2 , p i /p 4 ) is given asp i (x 1 , x 2 ) − x 3p4 (x 1 , x 2 ), for i = 1, 2, 3.
In Remark 3, we apply the same idea that is stated in Proposition 1, but for the particular case of curves.
Given a rational projective parametrization N ( t ) of a surface over K, in Definition 2 we introduce some auxiliary parametrizations over K(t i ) that are defined from N .

Definition 2.
Let N ( t ) be a parametrization with coefficients in K. We define the partial parametrizations associated to N as the parametrizations N i (t j ) := N ( t ) with coefficients in We note that the partial parametrization N i (t j ) (i = j) determines a space curve in In addition, we note that Definition 2 can also be stated for any N( t ) ∈ K( t ) 2 . That is, given N( t ) ∈ K( t ) 2 , one may consider N i (t j ) := N( t ) ∈ (K[t i ])(t j ) 2 (i.e., N is seen defined over K[t i ] and in the variable t j ), for i, j ∈ {1, 2} and i = j. Similarly, one also may adapt Definition 2 for any polynomial n( t ) ∈ K( t ).
The properness of the input parametrization P of a surface V can be characterized by means of the properness of its partial parametrizations. In particular, it is proved that P is birational if and only if its associated partial parametrizations, P i , are proper and P −1 [32]).
In the following, given a rational affine parametrization P ( t ) of a surface V, we develop an algorithm that computes a rational parametrization Q( t ) of V, and R( t ) ∈ K( t ) 2 , such that P ( t ) = Q(R( t )). The algorithm is based on the computation of polynomial gcds and univariate resultants whose computing time performance is very satisfactory.
We prove that the partial parametrizations that correspond to the output parametrization, Q( t ), are proper (see Theorem 5), and we get properties relating the degree of φ P with the degree of the rational map φ Q , and the degree of R( t ) (see Theorem 6). More precisely, we prove that In Corollaries 2 and 3, we analyze in which conditions deg(φ Q ) = 1 or, otherwise, the degree of the rational map induced by Q( t ) is lower than the degree that is induced by the input parametrization P ( t ).
In Theorem 5, we have that the partial parametrizations associated to the output parametrization, Q( t ), are proper (see [32]) but we can not ensure that Q is proper.
Theorem 5. The partial parametrizations Q 1 (t 2 ) and Q 2 (t 1 ) associated to the parametrization Q computed by Algorithm 2 are proper.

Algorithm 2 Proper Reparametrization for Surfaces using µ-Basis
Compute a µ-basis of P. Let p( t ), q( t ), r( t ) be this µ-basis.

4.
Return the rational parametrization Q( t ) of the surface V, and From Algorithm 2, and while using that the degree of a rational map is multiplicative under composition, we deduce some properties that relate the degree the rational map φ P with the degree of the rational maps φ Q , φ M , φ P i , i = 1, 2, and with deg(R), where R( t ) = (S( t ), T(S( t ), t 2 )). One reasons, similarly as in [32].

Theorem 6. It holds that
In addition, Corollary 2. The following statements are equivalent: Finally, in Corollary 3, we show in which conditions Algorithm 2 does not return a better reparametrization than the input one (in the sense of the degree of the rational map that is induced by the rational parametrization).
We observe that, while using previous results, one may easily analyze whether some families of surfaces can be properly reparametrized using the approach presented in this paper. For instance, if deg(φ P i ) = 1 for some i = 1, 2, and deg(φ P ) = n, where n is a prime number, then deg(φ Q ) = 1.
To finish this section, we illustrate Algorithm 2 with one example. The times of our implementation performance is similar to the times that were obtained in [32].

Example 4.
Let V be the rational surface that is defined by the parametrization For this purpose, in Step 1 of Algorithm 2, we compute a µ-basis of P and we get that is given by Using Theorem 4, one gets that deg(φ P ) = 4. Now, we apply Algorithm 1 to P 2 (t 1 ). We obtain that G P 2 (t 1 , is seen as a polynomial in the variable t 1 and with coefficients in K[t 2 ]). Subsequently, we determine the polynomials for i = 1, 2, 3. We obtain that ).

Now, in
Step 3 of the algorithm, we apply Algorithm 1 to M 1 (t 2 ). For this purpose, we first compute a µ-basis of M and we get that it is given by (see Remark 3) , and the polynomials is seen as a polynomial in the variable t 2 and with coefficients in K[t 1 ]). We obtain that In Step 4, the algorithm returns the parametrization Q( t ), and R( t ) = (S( t ), T(S( t ), t 2 )) = (−t 2 1 , −t 2 2 ). We observe that deg t 2 (T) = 2, and deg t 1 (S) = 2.

Remark 3.
Using Lemma 1, we may compute a µ-basis, p M , q M , r M , of M from the µ-basis, p, q, r, of P. Remind that P ( t ) = M(S 2 (t 1 ), t 2 ), and S 2 (t 1 ) = S(t 1 , t 2 ) is seen as a polynomial in the variable t 1 with coefficients in K[t 2 ]. Thus, we have a particular case (case of curves) of the reasoning that is presented in Proposition 1 (which is stated for surfaces). More precisely, we write p = (p 1 , p 2 , p 3 , p 4 ) and p M = (p m 1 , p m 2 , p m 3 , p m 4 ). Observe that the implicit equation of the parametrization (S 2 (t 1 ), p i /p 4 ) (seen with coefficients in K(t 2 ) and in the variable t 1 ) is given by the polynomial p m i (x 1 , t 2 ) − x 2 p m 4 (x 1 , t 2 ) ∈ (K(t 2 ))[x 1 , x 2 ] for i = 1, 2, 3 (i.e., the coefficients of the the implicit equation are in K(t 2 )). In order to compute this implicit equation, we may use that (see, e.g., [44]). Similarly one reasons to get q M from q and r M from r. Observe that this is a particular case of the result presented in Proposition 1 (we apply the same idea stated in Proposition 1, but for the particular case of curves).
Let d 12 be this quantity. Clearly, d 12 ≥ 1. In addition, let m = deg t 1 (H P ) and k = deg t 2 (H P ). Regarding S P 12 and H P as polynomials in K(t 2 , Z, W, x )[t 1 ], and us-ing that the resultant of two univariate polynomials is the product of the evaluations of one of them in the roots of the other, we get where A is the leading coefficient of S P 12 w.r.t. t 1 , and where {α 1 , . . . , α d 12 } are the roots of S P 12 in the algebraic closure K(x 1 , x 2 ) of K(x 1 , x 2 ) (we regard S P 12 as an univariate polynomial in t 1 ). Similarly, where B is the leading coefficient of T P 12 w.r.t. t 2 , and {β 1 , . . . , β d 12 } are the roots of T P 12 in K(x 1 , x 2 ) (we regard T P 12 as a univariate polynomial in t 2 ). Therefore, By Lemma 2, there exist d 12 pairs of points (α i , β j ) being in F P 12 (x 1 , x 2 ), and for each Note that for each root α i there exists a unique b j satisfying that the pair (α i , β j ) is in the fiber. Furthermore, for (α i , β j ) ∈ F P 12 (x 1 , x 2 ), either G P 1 (α i , β j , x ) = 0 or G P 2 (α i , β j , x ) = 0 (see Lemma 2). Hence, Q( x , Z, W) depends on Z or W. In addition, each H P (α i , β j , Z, W, x ) does depend on Z or W. Next . Taking into account that at least one of them is not zero, we get that N ∈ K[x 1 , x 2 ] and, thus, Q is primitive w.r.t. {Z, W}. Now, using that we obtain that Under these conditions, it holds that deg x 3 (pp x 3 (h( x ))) = d 12 . Indeed, clearly one has deg x 3 (pp x 3 (h( x ))) ≤ d 12 . If deg x 3 (pp x 3 (h( x ))) < d 12 , thus, there exists U ∈ F P 12 (x 1 , x 2 ), such that r 3 (U) = 0. Moreover, U ∈ K 2 , which is impossible since U ∈ F P 12 (x 1 , x 2 ). Now, we prove that Indeed, clearly one has that [44]) and deg x 3 (pp x 3 (h( x ))) = d 12 , we get that , which implies that d 12 (1 − r/deg(φ P )) = deg(g) and, hence, r ≤ deg(φ P ). Because r ≥ deg(φ P ), we conclude that deg(g) = 0 and r = deg(φ P ).
In the following examples, we illustrate the above theorem. These examples are taken from [5].
Example 5. Let V be the rational surface that is defined by the parametrization We determine the polynomials p P ( t , x ) = p( t ) · x , q P ( t , x ) = q( t ) · x , r P ( t , x ) = r( t ) · x , where the µ-basis is given by Also, let and K(t 2 , Z, W, x ) = Res t 1 (S P 12 (t 1 , x ), H P ( t , Z, W, x )) ∈ K[t 2 , Z, W, x ]. Finally, we compute h( x ) = Cont {Z,W} (Res t 2 (T P 12 (t 2 , x ), K(t 2 , Z, W, x ))) ∈ K[ x ], and Observe that we may conclude that deg(φ P ) = 1 and, thus, P ( t ) is a proper rational parametrization.
As the further work, the numerical consideration could be an interesting extension of the µ-basis theory. One possible way would consist in generalizing the symbolic computation to numerical situation using the ideas and techniques that have already been implemented in some other problems, such as the numerical proper reparametrization of surfaces [46].