REVIEW 4 major objections 3 minor 14 references
Quadratic Split Quaternion Polynomials: Factorization and Geometry
T0 review · 4 major / 3 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Quadratic split quaternion polynomials either factor explicitly or provably cannot; the test is geometric.
desk verdict Genuinely new degenerate-case results, but the claimed complete classification is false as stated: the §3.3 reduction is contradicted by a simple counterexample. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the null quadric $N$ defined by $hh^*=0$ in the projective space $\mathbb{P}(S)$, together with its two rulings: the left rulings $L=\{[r]: rh^*=0\}$ and right rulings $R=\{[r]: h^*r=0\}$. Remainder polynomials $R_{ij}=P-M_{ij}$, for real quadratic factors $M_{ij}$ of the norm polynomial $PP^*$, parameterize lines through the points where the curve $P$ meets $N$; a root of such a remainder gives a linear factor. Theorem 2.8 supplies explicit parametrizations of the affine two-planes solving $g=xh$, which is used to construct zeros and factorizations in null-line cases.
What would settle it
The most direct falsifier is to search symbolically for a factorization of $P=t^2+bt+\lambda+\mu b$ with $bb^*=0$, $\lambda+\mu^2\ne0$, and $\lambda\ge0$; Theorem 3.6 says none exists, so any factorization found would collapse the classification. Independently, a non-invertible-leading-coefficient polynomial whose norm does not vanish but that resists the Section 3.3 re-parameterization would expose the unproved gap.
Extended reading notes
Core claim
The central claim is that factorizability of a quadratic split quaternion polynomial $P=at^2+bt+c$ is fully characterized. After normalization to $P=t^2+bt+c$ with $\operatorname{Re}(b)=0$, factorizability is equivalent to existence of a right zero (Lemma 3.1) and is decided by explicit inequalities when $1,b,c$ are dependent, while independent coefficients always factor (Theorem 3.7). Geometrically, $P$ parameterizes a line segment or conic in the projective space over the split quaternions; a degree-one remainder polynomial obtained from a real quadratic factor of the norm polynomial has a root exactly when the corresponding interpolation line is real. The vanishing-norm case always factorizes (Corollary 3.19), and non-invertible leading coefficients are handled by a parameter reduction whenever the curve is not contained in the null quadric.
Load-bearing premise
For polynomials whose norm polynomial does not vanish, the classification assumes a parameter change can make the leading coefficient invertible; if any such polynomial resists that change, the non-invertible-leading-coefficient cases are not fully covered.
Editorial extensions
If this is right
- Corollary 3.18: every quadratic split quaternion polynomial with linearly independent coefficients admits a factorization.
- Corollary 3.19: every quadratic split quaternion polynomial with vanishing norm admits a factorization.
- For monic polynomials with dependent coefficients, factorizability reduces to checking the inequalities in Theorems 3.5 and 3.6.
- Geometrically, a monic quadratic without a real factor factorizes exactly when one of its remainder polynomials is a real line with independent coefficients (Theorem 3.12).
- The geometric criterion unifies cases that require separate inequality conditions, and extends to polynomials with non-invertible leading coefficient whose curve is not contained in the null quadric.
Reading between the lines
- The same line-intersection picture should extend to higher-degree split quaternion polynomials: factorizability is likely tied to the existence of a real linear factor among the remainders obtained from real factors of the norm polynomial.
- A practical algorithm can be read off the geometric criterion: factor the real norm polynomial into quadratics, compute the corresponding remainder lines, and test whether any has independent coefficients and a real zero, avoiding the case distinctions of the inequalities.
- The vanishing-norm corollary suggests that zero-divisor structure alone does not obstruct factorization for quadratics; the obstructions all live in the non-vanishing-norm dependent-coefficient cases.
- The unproved reduction before Theorem 3.14 can likely be closed by a fractional-linear re-parameterization sending any parameter value with $P(t)\notin N$ to infinity, since the new leading coefficient is then proportional to $P(t)$ and hence invertible.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies factorization of quadratic left polynomials P=at^2+bt+c over the split quaternions into products a(t-h1)(t-h2). After reductions to monic polynomials with zero real part of the linear coefficient, it gives inequality criteria for factorizability in the dependent-coefficient case (Theorems 3.5 and 3.6), recalls and expands a proof for independent coefficients (Theorem 3.7), develops a geometric interpretation via remainder polynomials, interpolation lines, and the null quadric (Theorem 3.12 and Theorem 3.14), and treats polynomials with vanishing norm or non-invertible leading coefficient (Theorems 3.15 and 3.17, Corollaries 3.18 and 3.19). The paper claims in Section 4 to have presented a complete discussion of factorizability of quadratic split quaternion polynomials.
Significance. If the classification were correct, it would be a useful complete algebraic-geometric characterization, with direct applications to mechanism science and hyperbolic kinematics. The paper has real strengths: the proofs are mostly constructive, the generic factorization algorithm is used transparently, and the remainder-polynomial viewpoint is elegant and gives a unified interpretation for the invertible-leading-coefficient cases. However, the central completeness claim is false as stated: the reduction in Section 3.3 for non-invertible leading coefficients is invalid, and the explicit counterexample below contradicts Corollary 3.18. The geometric interpretation for monic polynomials with invertible leading coefficient remains valuable, but the claimed coverage of all quadratic split quaternion polynomials is not established.
major comments (4)
- [Section 3.3, just before Theorem 3.14] The reduction to an invertible leading coefficient is invalid. The paper asserts that whenever the norm polynomial does not vanish and the curve has a point not on the null quadric, a parameter transformation can make the leading coefficient invertible and that factorizability of the transformed polynomial implies factorizability of the original. This is false. Consider P=(i+j)t^2+t+i. Here a=i+j has aa*=0, and a direct computation gives PP*=3t^2+1, so P is not contained in N. The substitution t=1/s gives Q(s)=s^2P(1/s)=i s^2+s+i+j, whose leading coefficient i is invertible; after left multiplication by i^{-1} the polynomial becomes s^2-i s+1-k=(s+i-j)(s-2i+j), so Q is factorable. But P itself is not factorable in the paper's sense: if P=(i+j)(t-h1)(t-h2), the coefficient of t is -(i+j)(h1+h2), which lies in S(i+j)={x+y i+y j-x k : x,y∈R}. The coefficient of t in P is 1, and 1 is not in S(i+j) because an element of S(i+j) with zero i- and j-coefficients has the form x-x k and hence is never 1. Thus the asserted preservation of factorizability under re-parametrization is false, and Corollary 3.18 is contradicted by this example. The claimed completeness of the classification for non-invertible leading coefficients therefore collapses.
- [Theorem 3.14] Theorem 3.14 is stated without proof. The text only says that its content is visualized in Figure 1 and then discusses the figure qualitatively. Since the theorem is presented as the geometric unification of the dependent-coefficient cases and is used in the completeness discussion, a proof is required. Moreover, if the intended proof relies on the reduction criticized in the previous comment, the theorem is not sound for non-invertible leading coefficients.
- [Theorem 3.6, third bullet (bb* < 0)] The necessity direction for the case bb*<0 is not proved. After presenting a candidate factorization under the stated inequalities, the proof says only that 'a detailed inspection of the equation system (10)' shows that no solutions exist when the conditions are violated. This is a load-bearing step in an iff statement. The omitted verification must be supplied, or the theorem must be weakened to a one-directional statement.
- [Corollary 3.18 and Section 4] Corollary 3.18 claims that every quadratic split quaternion polynomial with linearly independent coefficients admits a factorization. The counterexample from the first comment has linearly independent coefficients (i+j, 1, and i are independent over R) and does not admit a factorization in the paper's sense. Hence the corollary as stated is false, and the Section 4 claim of a 'complete discussion of factorizability of quadratic polynomials over the split quaternions' is not supported.
minor comments (3)
- [Theorem 3.7 and references] Theorem 3.7 is attributed to [10], but the surrounding text says 'In [8] the authors showed...' and discusses an improved proof of the statement. The citation should be checked and made consistent with the bibliography.
- [Section 3.3, Figure 1 and Figure 2] The figures would be easier to verify if each row had a short caption explicitly identifying which theorem or inequality case it illustrates; currently the reader must infer the correspondence from surrounding text.
- [Section 2.1, notation] The paper uses 'vectorial' for Re(h)=0 but later speaks of the 'vector part'; these terms should be used consistently, and the definition of Im(h) could be cross-referenced when first used.
Circularity Check
No significant circularity: the factorization criteria are derived by explicit algebra; self-citations are ancillary. The §3.3 non-invertible-leading-coefficient reduction is an unproved correctness risk, not a circular derivation.
full rationale
The paper's derivation chain is largely self-contained. The factorizability criteria in Sections 3.1, 3.2, and 3.4 are obtained by solving the explicit real system (8), by constructing factorizations (e.g., Theorems 3.5, 3.6, 3.15, 3.17), and by using the right-factor/right-zero correspondence; no fitted parameter is renamed as a prediction. The geometric Theorem 3.12 is derived from the algebraic remainder-polynomial construction and is used as an interpretation, not as an independent source of the algebraic results. The main self-citations are [8] for the generic factorization algorithm and Lemma 3.1, and [10] for Theorem 3.7; Theorem 3.7 is proved in the present text, and Lemma 3.1 is a standard elementary correspondence rather than the paper's completeness claim, so these citations are not load-bearing in a circular way. The serious concern is the unproved reduction in Section 3.3 just before Theorem 3.14: the paper asserts, '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.' This assertion is load-bearing for the claimed coverage of non-invertible leading coefficients, and if the reviewer's counterexample is correct, the completeness claim fails. However, this is a correctness or falsification issue: factorizability of the transformed polynomial is not built into the definition of factorizability of P by construction, so the step is not circular. I therefore assign score 1: minor self-citation is present, but the central derivation does not reduce to its own inputs.
Assumptions & free parameters
assumptions (5)
- domain assumption The indeterminate t commutes with all split quaternion coefficients, so S[t] is a polynomial ring with central t.
- standard math A line [r0]∨[r1] is a null line if and only if the polynomial R = r1 t + r0 satisfies RR* = 0 (Lemma 2.2).
- standard math A split quaternion h is a right zero of P if and only if t - h is a right factor of P (Lemma 3.1).
- standard math Generic factorization algorithm: if P = M + R for a real quadratic factor M of PP* and RR* ≠ 0, then R has a unique root that yields a right factor of P.
- ad hoc to paper If PP* ≠ 0 and the leading coefficient is non-invertible, a parameter transformation can be applied so that the leading coefficient of P becomes invertible.
Cite this review
Pith. "Pith review of Quadratic Split Quaternion Polynomials: Factorization and Geometry." pith.science (2026). https://pith.science/paper/GF42PFE7
@misc{pith2026190805093,
author = {Pith},
title = {Pith review of: Quadratic Split Quaternion Polynomials: Factorization and Geometry},
year = {2026},
howpublished = {\url{https://pith.science/paper/GF42PFE7}},
note = {Machine review of arXiv:1908.05093}
}
read the original abstract
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.
Figures
Reference graph
Works this paper leans on
-
[1]
Quadratic formulas for generalized quaternions
Abrate, M., 2009. Quadratic formulas for generalized quaternions. J. Algebra Appl. 8, 289–306
work page 2009
-
[2]
Quadratic formulas for split quaternions
Cao, W., 2019. Quadratic formulas for split quaternions. ArXiv: 1905.08153. 20 QUADRATIC SPLIT QUATERNION POLYNOMIALS
work page Pith review arXiv 2019
-
[3]
Casas-Alvero, E., 2014. Analytic Projective Geometry. European Mathemati- cal Society
work page 2014
-
[4]
On the zeros of polynomials over division rings
Gordon, B., Motzkin, T.S., 1965. On the zeros of polynomials over division rings. Trans. Amer. Math. Soc. 116, 218–226
work page 1965
-
[5]
Factorizationofrationalcurves in the Study quadric and revolute linkages
Hegedüs, G., Schicho, J., Schröcker, H.P., 2013. Factorizationofrationalcurves in the Study quadric and revolute linkages. Mech. Mach. Theory 69, 142–152. doi:10.1016/j.mechmachtheory.2013.05.010
-
[6]
Quadratic formulas for quaternions
Huang, L., So, W., 2002. Quadratic formulas for quaternions. Appl. Math. Lett. 15, 533–540
work page 2002
-
[7]
Beyond the celestial sphere: Oriented projective geometry and computer graphics
Kirby, K.G., 2002. Beyond the celestial sphere: Oriented projective geometry and computer graphics. Math. Mag. 75, 351–366
work page 2002
-
[8]
Li, Z., Scharler, D.F., Schröcker, H.P., 2019a. Factorization results for left polynomials in some associative real algebras: State of the art, applications, and open questions. J. Comput. Appl. Math. 349, 508–522. doi:10.1016/j. cam.2018.09.045
Show all 14 references
-
[9]
Spatial straight-line linkages by factorization of motion polynomials
Li, Z., Schicho, J., Schröcker, H.P., 2015. Spatial straight-line linkages by factorization of motion polynomials. ASME J. Mechanisms Robotics 8. doi:10. 1115/1.4031806
2015
-
[10]
Kempe’s universality theorem for rational space curves
Li, Z., Schicho, J., Schröcker, H.P., 2018. Kempe’s universality theorem for rational space curves. Found. Comput. Math. 18, 509–536. doi: 10.1007/ s10208-017-9348-x
2018
-
[11]
Factorization of motion polynomi- als
Li, Z., Schicho, J., Schröcker, H.P., 2019b. Factorization of motion polynomi- als. J. Symbolic Comput. 92, 190–202. doi:10.1016/j.jsc.2018.02.005
2018 doi
-
[12]
The geometry of quadratic quater- nion polynomials in Euclidean and non-Euclidean planes, in: Cocchiarella, L
Li, Z., Schicho, J., Schröcker, H.P., 2019c. The geometry of quadratic quater- nion polynomials in Euclidean and non-Euclidean planes, in: Cocchiarella, L. (Ed.), ICGG 2018 – Proceedings of the 18th International Conference on Ge- ometry and Graphics, Springer International Pu...
2018
-
[13]
Equations in quaternions
Niven, I., 1941. Equations in quaternions. Amer. Math. Monthly 48, 654–661
1941
-
[14]
Oriented projective geometry, in: Proceedings of the 3rd ACM Symposium on Computational Geometry, pp
Stolfi, J., 1987. Oriented projective geometry, in: Proceedings of the 3rd ACM Symposium on Computational Geometry, pp. 76–85
1987
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.