Quadratic Split Quaternion Polynomials: Factorization and Geometry

We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split quaternions.


Introduction
Quaternions and dual quaternions provide compact and simple parametrizations for the groups SO(3), SE(2) and SE (3). This accounts for their importance in fields such as kinematics, robotics and mechanism science. In this context, polynomials over quaternion rings in one indeterminate can be used to parameterize rational motions. Factorization of polynomials corresponds to the decomposition of a rational motion into rational motions of lower degree. Since linear factors generically describe rotational motions, factorizations with linear factors give rise to a sequence of revolute joints from which mechanisms can be constructed [5].
In recent years, the theory of quaternion polynomial factorization [4,13] has been extended to the dual quaternion case and numerous applications have been found [9][10][11]. The main difficulty in comparison with the purely quaternion theory is the presence of zero divisors. As of today our general understanding of dual quaternion factorization is quite profound but some (hg) * = g * h * for h, g ∈ S. The split quaternion norm is defined by hh * = h * h = h 2 0 + h 2 1 − h 2 2 − h 2 3 ∈ R. A split quaternion h is invertible if and only if hh * = 0 in which case h −1 = (hh * ) −1 h * . The scalar or real part of h ∈ S is Re(h) := 1 2 (h+h * ) = h 0 , the vector or imaginary part is Im(h) := 1 2 (h−h * ) = h 1 i + h 2 j + h 3 k. The split quaternion h is called vectorial if Re(h) = 0.
By S[t] we denote the ring of polynomials in one indeterminate t with split quaternion coefficients. Addition is done in the usual way; multiplication is defined by the convention that the indeterminate t commutes with all coefficients in S. This is motivated by applications in hyperbolic kinematics [12] where t serves as a real motion parameter that, indeed, is in the center of S. Consider a left polynomial P = n =0 p t ∈ S[t] (coefficients are written to the left hand side of the indeterminate t). The conjugate polynomial P * := n =0 p * t is obtained by conjugation of the coefficients. Hence, the norm polynomial P P * = P * P ∈ R[t] is real. The evaluation of P at h ∈ S is defined by P (h) := n =0 p h . One calls it a right evaluation because the variable t is written to the right hand side of the coefficients and then substituted by h. To illustrate the substantial difference to the left evaluation (of right polynomials) where the variable t is written to the left hand side of the coefficients, consider the polynomial h 1 t = th 1 ∈ S[t] (t commutes with h 1 ) and a split quaternion h 2 ∈ S. Right evaluation of h 1 t at h 2 yields h 1 h 2 whereas left evaluation of th 1 yields h 2 h 1 . The results are different unless h 1 and h 2 commute.
Due to non-commutativity of split quaternion multiplication we have to differ between right and left factors and zeros of a polynomial as well. Consider two split quaternion polynomials P , F ∈ S[t]. We call F a right factor of P if there exists a polynomial Q ∈ S[t] such that P = QF . A right zero h of a left polynomial P is defined by the property that the right evaluation of P at h vanishes. Left factors and left zeros are defined analogously. In this paper we mainly deal with left polynomials, right evaluation, right factors and right zeros but often simply speak of polynomials, evaluation, factors and zeros, respectively. Of course, there exists a symmetric theory on right polynomials and left evaluation, factors and zeros.

Geometry of Split Quaternions
In this section we take a look at the geometry of split quaternions which, as we shall see, is closely related to factorizability of split quaternion polynomials. In particular, the symmetric bilinear form q : S × S → R, (h, g) → 1 2 (hg * + gh * ) will play a vital role. Since it is of signature (2,2), the real four-dimensional vector-space S together with q is a pseudo-Euclidean space. Its null cone consists of all split quaternions h that satisfy q(h, h) = 0. Because of q(h, h) = hh * , these are precisely the split quaternions of vanishing norm. Some aspects of polynomial factorization over split quaternions have a geometric interpretation in this pseudo-Euclidean space while others are of projective nature. Hence, we also consider the projective space P(S) over S. Any vector h ∈ S\{0} represents a point in P(S) which we denote by [h].
The two families of null lines can be distinguished by algebraic properties of split quaternions.
Proof. We observe that the system of homogeneous linear equations in the coefficients of x ∈ S resulting from xg = 0 (or gx = 0) with g ∈ S\{0} has non trivial solutions if and only if [g] ∈ N . In this case, the vector-space of solutions is of dimension two. This already implies that L and R are straight lines. Consider [r] ∈ L. We have 2 q(h, r) = hr * + rh * = (rh * ) * + rh * = 0 and L lies in the tangent plane of N in [h]. We choose p ∈ S such that ph = 0 and [ph] = [h]. This is possible since the solutions set of xh = 0 is a vector-space of dimension two and the set of all real multiples of h is a vector-space of dimension one. From (ph)(ph) Proof. The split quaternion equation g = xh results in a system of inhomogeneous linear equations for the coefficients of x. We already argued in our proof of Theorem 2.3 that the solution space of the corresponding system of homogeneous equations is of dimension two.
Corollary 2.7 is a pure existence result. The next theorem provides a parametrization of the affine two-plane in Corollary 2.7. The main idea of the proof is to derive properties of a split quaternion p = p 0 + p 1 i + p 2 j + p 3 k by finding relations between its "positive" part p 0 + p 1 i and its "negative" part p 2 j + p 3 k. These terms are motivated by the sign of their respective norms. Theorem 2.8. Suppose that h = h 0 + h 1 i + h 2 j + h 3 k ∈ S \ {0} and g = g 0 + g 1 i + g 2 j + g 3 k ∈ S\{0} are as in Corollary 2.7. The affine two-plane consisting of all split quaternions x ∈ S solving the equation g = xh can be parameterized by u + λh * + μih * , where u = (g 0 + g 1 i)(h 0 + h 1 i) −1 and λ, μ ∈ R. (The same statement holds for g = hx with u + λh * + μh * i where u = (h 0 + h 1 i) −1 (g 0 + g 1 i) and λ, μ ∈ R.) Proof. Regarding the system of linear equations arising from xh = g we have to show the following: • u solves xh = g, • h * and ih * solve the corresponding homogeneous system xh = 0, and • h * and ih * are linearly independent.
(Note that we already know that the solution space is of dimension two.  and, because h = 0, the norms of h 0 +h 1 i and h 2 j+h 3 k are different from zero. Hence, h 0 +h 1 i and h 2 j+h 3 k are both invertible and u = (g 0 +g 1 i)(h 0 +h 1 i) −1 is well defined. We have (2.5) where the first two terms form the positive part (they are in the span of 1 and i) while the two trailing terms form the negative part (they are in the span of j and k). Positive and negative parts both have to vanish whence Substituting Eqs. (2.6) into (2.5) we obtain via (2.4)

Factorization Results
In this section, we investigate factorizability of quadratic split quaternion polynomials. Consider a quadratic polynomial are split quaternions. We say that P admits a factorization, if there exist split quaternions h 1 , h 2 such that For the time being (until Sect. 3.4) we assume that the leading coefficient a is invertible. In this case, we may further assume that P is monic because we may easily construct all factorization of P from factorizations of the monic polynomial a −1 P . Finally, we apply the parameter transformation t → t − b0 2 whence b 0 = 0. To summarize, we investigate the factorizations where b, c, h 1 , h 2 ∈ S and Re b = 0 (or, equivalently, b + b * = 0). A fundamental result (for example [8,Theorem 2]) relates factorizations to right zeros: Once a right factor t−h 2 of a quadratic polynomial is found, a left factor t−h 1 can be computed by left polynomial division. Thus finding factorizations is essentially equivalent to finding right zeros and all results on right zeros of [1,2] are of relevance to us. Nonetheless, we continue by developing our own criteria that are related to a well-known procedure [5,8] for computing a factorization of a generic quadratic polynomial P : • Pick a monic quadratic factor M ∈ R[t] of the norm polynomial P P * .
• Compute the remainder polynomial R of P when dividing by M . Since P and M are monic we have is not only a factor of R, but also of M and therefore a factor of P .
We refer to above construction as generic factorization algorithm. It is sufficient unless RR * = 0. In this case the remainder polynomial R might not have a zero at all. If it has a zero, it already has infinitely many zeros but it is not guaranteed that they lead to right factors. In this sense, factorization of split quaternion polynomials is more interesting than factorization of polynomials over the division ring of ordinary (Hamiltonian) quaternions. The goal of this section is to provide necessary and sufficient criteria for factorizability of all monic quadratic split quaternion polynomials P = t 2 + bt + c. In doing so, we consider the following sub-cases: Regarding the remaining results in [1] or [2] it is not so straightforward to draw direct connections, one would find a set of polynomials which need to be treated by different cases with respect to our characterization but can be covered by only one theorem in [1] or [2] and vice versa.
A split quaternion x = x 0 +x 1 i+x 2 j+x 3 k ∈ S is a zero of P = t 2 +bt+c with Re(b) = 0 if and only if it solves the real system of nonlinear equations In view of Lemma 3.1, it gives rise to a right factor t−x of P . Above system is obtained by evaluating P at x and equating the coefficients of the quaternion units i, j, k and the real coefficient with zero. Note that we are only interested in real solutions. A priori it is not obvious that this system has a solution at all. Indeed, there exist examples with zero as well as with infinitely many solutions. Below we present necessary and sufficient conditions for solvability in all cases along with some solutions.

Factorization of Monic Polynomials with Dependent Coefficients
To begin with, we determine the zeros of the polynomial P in (3.1) supposing that P is real. In addition to the general assumptions a = 1 and b 0 = 0 this The factorization algorithm for generic polynomials (described on Page 6) fails in this setup. However, we can directly solve the polynomial system (3.2).

Lemma 3.2. The polynomial
, where c 0 ∈ R, has infinitely many split quaternion zeros given by the set {x ∈ S : Hence, x is real and a real solution exists if and only if c 0 ≤ 0. If so, there are two (possibly identical) Combining Lemmas 3.2 with 3.1, we can state Corollary 3.3. The polynomial P = t 2 +c 0 ∈ S[t] with c 0 ∈ R admits infinitely many factorizations over S.
The solution set {x ∈ S : x 0 = 0, xx * = c 0 } defines a hyperboloid of one sheet, a cone or a hyperboloid of two sheets for c 0 < 0, c 0 = 0 or c 0 > 0, respectively, in the affine space Im(S).  [6]. One noteworthy difference is non-negativity of the Hamiltonian norm = c 0 has no solution for c 0 < 0 and P has just two real zeros ± √ −c 0 . The zero set of P ∈ R[t] over the split quaternions is always infinite.
We continue by considering monic polynomials whose constant coefficient is not real. Such a polynomial is given by P in (3.1) with a = 1, Proof. We solve the equation system (3.2) which, in the current setup, reads as The assumption x 0 = 0 implies c 1 = c 2 = c 3 = 0 and contradicts c / ∈ R. Hence, we can plug , in the first equation and obtain 1 over C. We are only interested in real solutions and it is easy to see that all expressions in (3.3) yield non-real values if and only if cc * < 0 or cc * ≥ 0, c 0 > 0 and Im(c) Im(c) * < 0. We already verified x 0 = 0 to be invalid whence also the case Im(c) Im(c) * = 0 and c 0 ≥ 0 is excluded.
Hence, P has no split quaternion zeros and therefore does not admit a factorization if and only if The negation of these conditions are easily shown to be equivalent to • Im(c) Im(c) * > 0 or • cc * ≥ 0 and c 0 < 0, thus finishing the proof. Still assuming that P is monic, we are left with the case where b / ∈ R. Due to the assumed dependency of the coefficients there exist λ, μ ∈ R such that c = λ + μb and we can write P = t 2 + bt + λ + μb.

Theorem 3.6. Consider the split quaternion polynomial
• If bb * > 0, then P admits a factorization.
• Provided that bb * = 0, then P admits a factorization if and only if λ + μ 2 = 0 or λ < 0. • Provided that bb * < 0, then P admits a factorization if and only if Proof. First, let us assume that bb * > 0. We pick a quadratic factor M = t 2 +m 1 t+m 0 ∈ R[t] of the norm polynomial P P * and compute the remainder By the generic factorization algorithm, P admits a factorization if the leading coefficient of R is invertible. This is guaranteed by non-negativity of its norm Conversely, if P admits a factorization, then P has a right zero. Such a zero is a solution of the equation system (3.2) which, in our case, reads as Assuming that x 0 = 0, we can substitute The conditions b / ∈ R and bb * = 0 imply b 1 = 0 and the solution set of the equation system given by the last three equations is of dimension one. It can be parameterized by Substituting these solutions into the first equation yields λ+μ 2 = 0. This concludes the proof of the second statement. Assuming that bb * < 0, we can factor the norm polynomial as If bb * + 4λ ≤ 0 and bb * + 4λ ≤ 4μ √ −bb * ≤ −(bb * + 4λ), then P P * has even real linear factors Defining M := L 1 L 4 and computing R = r 1 t + r 0 = P − M ∈ S[t] yields a remainder polynomial with leading coefficient The polynomial P admits a factorization by means of the generic factorization algorithm if the norm r 1 r 1 * = bb * + 1 2 ( (bb * + 4λ) 2 + 16μ 2 bb * − (bb * + 4λ)) of r 1 is different from zero. This is, indeed, the case as bb * = 0 and μ 2 +λ = 0. If μ 2 + λ = 0, then P admits the factorization P = (t + μ)(t − μ + b) anyway. Similar to above considerations, a detailed inspection of the equation system (3.4) shows that no solutions exist if the conditions λ+μ 2 = 0 or bb * +4λ ≤ 0 and bb * + 4λ ≤ 4μ √ −bb * ≤ −(bb * + 4λ) are violated.

Factorization of Monic Polynomials with Independent Coefficients
In [8] the authors showed that the polynomial P in (3.1) admits a factorization if its coefficients a, b, c are linearly independent and the leading coefficient a is invertible. Assuming, without loss of generality, that a = 1, we recall this result and provide an improved version of the second half of the proof in [8], namely the case where the general factorization algorithm is not applicable. Proof. Let M 1 ∈ R[t] be a monic quadratic factor of the norm polynomial P P * and compute the corresponding linear remainder polynomial R 1 ∈ S[t] such that P = M 1 + R 1 . If R 1 R 1 * = 0, one can compute a factorization of P using the generic factorization algorithm. Hence, we continue by assuming that R 1 R 1 * = 0. Linear independence of the coefficients of P implies linear independence of the coefficients of R 1 . Consequently, R 1 parameterizes a null line (Lemma 2.2). Consider the complementary monic quadratic factor M 2 ∈ R[t] of P P * defined by P P * = M 1 M 2 , and the corresponding remainder polynomial R 2 such that P = M 2 + R 2 . From we conclude that M 2 = M 1 +R 1 +R 1 * and R 2 = −R 1 * . Hence, R 2 parameterizes a null line as well. The two null lines belong to different families of rulings of N . Without loss of generality we assume that the null line parameterized by R 1 is a right ruling. Moreover, we can assume that the linear coefficient of M 1 is zero by applying a suitable parameter transformation (t → t +m wherem ∈ R) to P .
Next we will show that M 1 = t 2 + m ∈ R[t] and R 1 = r 1 t + r 0 have a common right zero. By Corollary 2.7, there exists an h ∈ S such that −r 0 = r 1 h. Although Theorem 2.8 provides an explicit formula to compute such an h ∈ S in terms of r 1 and r 0 , any h ∈ S fulfilling the relation −r 0 = r 1 h will do and we choose one. Then the two-parametric set of right zeros of R 1 can be parameterized by h + λr 1 * + μr 1 * i where λ, μ ∈ R. The norm of such an element reads as We choose λ and μ such that this norm is equal to m, the constant coefficient of M 1 , and in addition the real part of h + λr 1 * + μr 1 * i is equal to zero. This is possible because the coefficient matrix With above's choice we have that h + λr 1 * + μr 1 * i satisfies all conditions from Lemma 3.2. Hence, h + λr 1 * + μr 1 * i is not only a right zero of R 1 but also a zero of M 1 . Therefore, it is also a zero of P whence P admits a factorization.
The following example illustrates the "interesting" case in the proof of Theorem 3.7.
Example. Consider the polynomial P = t 2 +(1+k)t+2+i+j+k ∈ S. Its norm polynomial factors into P P * = M 1 M 2 with M 1 = t 2 +1 and M 2 = t 2 +2t+3. The respective remainder polynomials R 1 , R 2 ∈ S such that P = M 1 + R 1 = M 2 + R 2 read as R 1 = (1 + k)t + 1 + i + j + k and R 2 = (k − 1)t − 1 + i + j + k. Both, R 1 and R 2 are null lines since R 1 R 1 * = R 2 R 2 * = 0, whereas only R 1 is a right ruling of N . According to Theorem 2.8, the two-parametric set of right zeros of R 1 = r 1 t + r 0 = (1 + k)t + 1 + i + j + k is parameterized by quaternion h+r 1 * − 1 2 r 1 * i = − 3 2 i+ 1 2 j−k is a zero of P and right division of P by t + 3 2 i − 1 2 j + k yields the factorization P = (t +1− 3 2 i + 1 2 j)(t + 3 2 i − 1 2 j + k). Note that the two polynomials M 1 and M 2 are irreducible, hence there is no quadratic factor of the norm polynomial P P * yielding a non-null line as remainder polynomial and therefore the possibility to avoid above's procedure.

Geometric Interpretation for Factorizability of Monic Polynomials
Theorems 3.5 and 3.6 relate factorizability of a quadratic split quaternion polynomial to validity of certain inequalities. Some of these conditions are not very intuitive but necessary in order to cover all special cases by the algebraic approach. However, we can give an alternative characterization of factorizability by interpreting the factorization algorithm for quadratic split quaternions geometrically. It turns out that this alternative characterization covers the statement in Theorem 3.7 as well. Hence, the geometrical approach allows a unified characterization of factorizability for quadratic split quaternions with invertible leading coefficient without inconvenient case distinctions.
Consider a monic split quaternion polynomial P = t 2 + bt + c ∈ S[t] and a monic real polynomial M ∈ R[t], both of degree two. Let t 1 , and, provided that t 1 = t 2 , the remainder R is the unique interpolation polynomial with respect to the interpolation data set {(t 1 , P (t 1 )), (t 2 , P (t 2 ))}. Hence R parameterizes the straight line [P (t 1 )]∨[P (t 2 )] or, if these two points coincide, the point [P (t 1 )] = [P (t 2 )].
If t 1 = t 2 and thus P (t 1 ) = P (t 2 ), the linear interpolation polynomial is not well defined. Instead, the remainder polynomial R describes the tangent of the rational curve parameterized by P at the point [P (t 1 )]. In order to see this, we compute 1 . In this case, the parametric representation of the tangent as well as the remainder polynomial are constant and equal to c − t 2 1 . In the context of the generic factorization algorithm the real polynomial M is one of the quadratic factors of the norm polynomial P P * and t 1 , t 2 ∈ C are parameter values where the rational curve parameterized by P intersects the null quadric N . Hence, the remainder polynomial R parameterizes Adv. Appl. Clifford Algebras P (t 2 )), R parameterizes the tangent of the rational curve P in [P (t 1 )] (or again a single point if P (t 1 ) = 0).

Definition 3.8.
Consider a monic split quaternion polynomial P = t 2 + bt + c ∈ S[t] of degree two. Let t 1 , t 2 , t 3 , t 4 ∈ C be the four roots of the norm polynomial P P * ∈ R[t]. We define the (at most six) remainder polynomials of P by R ij : Note that we only consider remainder polynomials that have real split quaternion coefficients, that is, we only use quadratic factors M ij ∈ R[t]. The curve parameterized by P intersects the null quadric N in four points [P (t 1 )], [P (t 2 )], [P (t 3 )], [P (t 4 )] ∈ P(S). Their respective parameter values t 1 , t 2 , t 3 , t 4 ∈ C are the four roots of the norm polynomial P P * . Hence, the polynomials M ij ∈ R[t] are the real quadratic factors of P P * and the remainder polynomials R ij ∈ S[t] are the interpolation polynomials with respect to the interpolation data sets {(t i , P (t i )), (t j , P (t j ))}. The interpolation polynomials are defined in above's sense, i.e. they can be constant or, if t i = t j , may parameterize the tangent of the curve at the point [P (t i )]. Lemma 3.9. Let P = t 2 + bt + c ∈ S[t] be a split quaternion polynomial and R = r 1 t + r 0 ∈ S[t] be one of its remainder polynomials. If R is of degree one, then R has a either a unique root, R parameterizes a null line or r 1 and r 0 are linearly dependent.
Proof. If r 1 r 1 * = 0, then r −1 1 r 0 ∈ S is the unique root of R. Hence, we assume that r 1 r 1 * = 0. Moreover, we assume that r 0 and r 1 are linearly independent, that is, R parameterizes a straight line in P(S). In order to show that is a null line, we show that there are at least three intersection points between N and . One of them is [ . As shown at the beginning of this subsection, deg R = 1 and independence of r 1 and r 0 implies that this point is a regular point of the rational curve P and is its tangent. We conclude that is also tangent to N in [R(t 1 )] = [R(t 2 )]. Since it also intersects N in one further point [r 1 ], it is a null line. Remark 3.10. If P has a real linear factor t − r ∈ R[t], then M = (t − r) 2 is a quadratic factor of P P * and t − r is a linear factor of the corresponding remainder polynomial R. In this case, the coefficients r 1 and r 0 in Lemma 3.9 are linearly dependent. Conversely, linear dependency of r 1 and r 0 in Lemma 3.9 is equivalent to R having a real root r ∈ R. If r is also a root of M , then P has the real factor t − r ∈ R[t]. In this case, factorizability is obvious whence we exclude it in the following. Proof. Without loss of generality we assume that the remainder polynomial R 12 has degree one and its coefficients are linearly independent. If the leading coefficient of R 12 is invertible, R 12 has a unique root and then the generic factorization algorithm yields a factorization of P . If the leading coefficient is not invertible then R 12 parameterizes a null line by Lemma 3.9. Provided that R 12 parameterizes a right ruling of N , then we have seen in the proof of Theorem 3.7 that P admits a factorization. If R 12 parameterizes a left ruling of N , the complementary remainder polynomial R 34 parameterizes, again by the proof of Theorem 3.7, a right ruling and P once more admits a factorization.
Conversely assume that P admits a factorization, that is P * is a quadratic factor of the norm polynomial P P * . We compute the according remainder polynomial R ∈ S[t] such that , it is also a right factor of R = P − M . Hence, there exists a split quaternion r ∈ S such that R = r(t − h 2 ). If r = 0, we have P = M which contradicts the assumption that P has no real factor. Thus, R has degree one. In order to show independence of its coefficients we assume the opposite, i.e. there exists a real number α ∈ R such that 0 = αr − rh 2 = r(α − h 2 ). Obviously α is a root of R and [α − Consequently, P (α) = M (α) + R(α) = 0 and P has the real factor t − α by Lemma 3.1.

Remark 3.12.
In our proof of Theorem 3.11 we appeal to the proof of Theorem 3.7 whose assumptions are slightly different. This is admissible: The assumed independence of coefficients in Theorem 3.7 implies independence of the coefficients of the remainder polynomial R. In Theorem 3.11, this is not a conclusion but an assumption.
The considerations on remainder polynomials above allow to translate the condition in Theorem 3.11, that there be a remainder polynomial of degree one, to the possibility to find an interpolation data set {(t i , P (t i )), (t j , P (t j ))} such that the according interpolation polynomial parameterizes a real line. This is not possible precisely if each interpolation polynomial parameterizes a point or a non-real line and yields a profound geometrical interpretation of the equality and inequality conditions in Theorems 3.5 and 3.6, respectively. It also clarifies the cause of non-factorizability in these theorems.
• Similar as in Theorem 3.5, the sign of bb * = Im(b)Im(b) * distinguishes between lines or line segments with supporting line that lies on the null quadric's asymptotic cone or in the cone's interior/exterior. • The case bb * > 0 is identical to the case Im(c) Im(c) * > 0 in Theorem 3.5. • If bb * = 0 or bb * < 0, then [P 1 ] and [P 2 ] are real. The respective conditions λ < 0 or bb * + 4λ ≤ 0 and bb * + 4λ ≤ 4μ √ −bb * ≤ −(bb * + 4λ) ensures that t 1 , t 2 , t 3 and t 4 are real as well whence there exists an interpolation polynomial parameterizing a real line. Otherwise, the parameter values t 1 , t 2 , t 3 , t 4 are non-real and all interpolation polynomials parameterize non-real lines or points.
• Because 1 and b are linearly independent, the condition λ + μ 2 = 0 is necessary and sufficient for the existence of a real zero of P . This is equivalent to P being a linear parametrization of the line multiplied with a linear real polynomial. This is a trivial case which we have excluded.
Based on these considerations we can state a simple geometric criterion for the existence of factorizations in case of monic polynomials with dependent coefficients. This covers all polynomials P = at 2 +bt+c in (3.1) where a, b and c are linearly dependent and the leading coefficient a is invertible since multiplication with a −1 yields a monic polynomial. Moreover, if a, b and c are linearly dependent so are 1, a −1 b and a −1 c and vice versa. In fact we even covered those cases where the leading coefficient a of P is not invertible but the curve parameterized by P is not contained in the null quadric N , i.e. the norm polynomial does not vanish. As long as there is a point on the curve which is not contained in N , one can apply a proper parameter transformation to P such that the leading coefficient becomes invertible. Factorizability of the thus obtained polynomial guarantees factorizability of the initial one. The content of Theorem 3.13 is visualized in Fig. 1. Images in the first and second row refer to the geometric interpretation of Theorem 3.5, the last row refers to Theorem 3.6. Images in the first row and the first and second image in the last row correspond to cases that admit factorizations. All other images correspond to cases that don't.
Geometric Interpretation of Theorem 3.7. In this, the coefficients of P are independent whence it parameterizes a (regular) conic section C in P(S). It  Nonetheless, a suitable choice of a remainder polynomial (which corresponds to a suitable choice of a line) is always possible: We may connect a generic pair of distinct real intersection points, a pair of conjugate complex intersection points or pick the tangent in a real intersection point of multiplicity at least two. The most interesting case is that of C lying in a tangent plane of N . In this case, the intersection of C and N will always contain a left and a right ruling. In the proof of Theorem 3.7 we have shown that right ruling is always a suitable choice. This is illustrated in Fig. 2. In the first and second row, we assume that C is not in a tangent plane of N so that we actually look at the intersection of two regular conics, C and the intersection conic D of N with the plane of C. The bottom row illustrates cases where C is in a tangent plane of N . Thus, the plane of C intersects N in a left ruling and a right ruling r. Once again, suitable choices of lines are drawn in bold and potentially invalid lines in dotted line style.

Factorization of Polynomials with Non-invertible Leading Coefficient
So far, we considered polynomials P = at 2 +bt+c in (3.1) with invertible leading coefficient and non-vanishing norm polynomial. Taking into account the already explained possibility of re-parameterization just before Theorem 3.13, the only missing case in our discussion so far is that the curve parameterized by P is contained in N . This is the case if and only if the norm polynomial vanishes: P P * = aa * t 4 + (ab * + ba * )t 3 + (ac * + ca * + bb * )t 2 + (bc * + cb * )t + cc * = 0. (3.5) It will turn out that factorizations always exist. In our investigation, we distinguish two cases: • a, b, c ∈ S linearly dependent Theorem 3.14 11 Page 20 of 23 Theorem 3.14. The polynomial P = at 2 + bt + c ∈ S[t] with P P * = 0 and linearly dependent coefficients admits a factorization.
In the ensuing proof of Theorem 3.14 it is possible that the coefficients b or c ∈ S vanish whence the points [b] and [c] ∈ P(S) become undefined. For the sake of readability, we do not always take into account this possibility in our proof which, nonetheless, is also valid for these special cases. i such that c = ah whence P = a(t 2 + αt + h). By a suitable parameter transformation, we can eliminate the coefficient of t in t 2 +αt+h while preserving the vector part Im(h) of the constant coefficient. Existence of a factorization is once more guaranteed by Theorem 3.5.
If [a] = [b], we chose, again according to Theorem 2.8, h = h 0 + h 1 i such that b = ah. Moreover, there exist α, β ∈ R such that c = αa + βb due to linear dependency of a, b and c. We can write P = a(t 2 + ht + α + βh) and since hh * > 0, the polynomial t 2 + ht + α + βh fulfills the condition of Theorem 3.6 to be factorizable.

Remark 3.15.
In the proof of Theorem 3.14, we set the two real parameters λ and μ equal to zero. But there are infinitely many possible choices for these parameters according to Theorem 2.8. The crucial ingredient in the proof is that the norm of h or Im h is strictly positive. Since these norms depend continuously on λ and μ, strict positivity is preserved for infinitely many choices of λ and μ. Hence, there are infinitely many factorizations for the Finally, we present the missing factorization result for split quaternion polynomials with vanishing norm polynomial and independent coefficients. Theorem 3.16. The polynomial P = at 2 + bt + c ∈ S[t] with P P * = 0, a = 0 and linearly independent coefficients admits a factorization.
Proof. The condition P P * = 0 implies that each coefficient in Eq. (3.5) vanishes. In particular, we have 0 = ba * + ab * = 2 q(b, a) = 2 q(b * , a * ) = b * a + a * b, By Lemma 3.1, t − h is a right factor of P and a factorization exists. Theorem 3.16 in combination with Theorems 3.7 or 3.14 implies a corollary each.

Future Research
We have presented a complete discussion of factorizability of quadratic polynomials over the split quaternions and provided a geometric interpretation in the (oriented) projective space over the split quaternions. A natural next step is, of course, factorizability questions for higher degree polynomials. We expect to be able to re-use ideas and techniques of this paper. One thing that is already clear is existence of non-factorizable polynomials of arbitrary degree.
Other questions of interest include factorization results for different algebras. One obstacle to generalizations is the lack of a suitable substitute of quaternion conjugation, that is, a linear map that gives inverse elements up to scalar multiples. Existence of such a map and its exploitation for factorization on suitable and interesting sub-algebras are on our research agenda as well. Preliminary results in Conformal Geometric Algebra already exist.