REVIEW 4 major objections 5 minor 12 references
On the minimum number of Toeplitz factors of a matrix
T0 review · 4 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash
Pith's one-line read There exist $3\times 3$ complex matrices, such as $\operatorname{diag}(1,2,3)$, that cannot be written as a product of two Toeplitz matrices; hence the maximal Toeplitz number of order 3 is at least 3 and at most 4.
desk verdict Solid n=3 counterexample and diagonal classification, but the Toep_4≤9 proof has real holes and the advertised antisymmetric classification is missing. 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 mechanism is an algebraic translation of factorization into polynomial equations. A Toeplitz matrix has only $2n-1$ independent entries (one per diagonal), so a product of $s$ Toeplitz factors is determined by $(2n-1)s$ variables, and the condition $M=T_1\cdots T_s$ becomes $n^2$ quadratic equations in those variables. Hilbert's Nullstellensatz converts the absence of solutions into an ideal-membership statement: $1$ must lie in the ideal generated by the entry differences. The counterexample is carried by an explicit certificate: nine polynomials $q_i$ such that $\sum_{i=1}^9 q_i p_i = e(d-e)(f-d)(f-e)$, an expression that cannot vanish for a solution when $d,e,f$ are distinct and $e\neq 0$. For the upper bounds, the proof mechanism is rank stratification: rank-one matrices, rank-$(n-1)$ matrices, and rank-two $3\times 3$ and $4\times 4$ matrices are each decomposed into Toeplitz factors case by case.
What would settle it
Ask a computer algebra system to solve the nine quadratic equations defining $\operatorname{diag}(1,2,3)=T_1T_2$ for $3\times 3$ Toeplitz factors; a simultaneous complex solution would refute the paper's disproof of the two-factor conjecture. For the upper bounds, symbolically multiply the candidate Toeplitz factors in each rank-two subcase of Propositions 4.5 and 4.7; any mismatch of entries would falsify the corresponding bound.
Extended reading notes
Core claim
The central discovery is that two Toeplitz factors are not always enough for $3\times 3$ complex matrices. For $M_3=\operatorname{diag}(1,2,3)$, the equalities $M_3=T_1T_2$ have no solution; the proof is an explicit algebra certificate, an identity $1=\sum_{i=1}^9 q_i p_i$ where the $p_i$ are the entries of $T_1T_2-M_3$. The same technique classifies diagonal matrices: a diagonal $3\times 3$ matrix has Toeplitz number exactly $3$ precisely when its entries are pairwise distinct and the middle entry is nonzero, and all other diagonal cases factor into two Toeplitz factors. The paper also proves $3\le \mathrm{Toep}_4\le 9$ by a rank-two case analysis, and shows every rank-one matrix uses at most three Toeplitz factors. The lower bound $3\le \mathrm{Toep}_3$ follows from the counterexample, so the remaining question for $n=3$ is whether every matrix fits in three factors or some need four.
Load-bearing premise
The load-bearing premise is that the rank-two case analyses in the upper-bound proofs are exhaustive and that every matrix displayed in each subcase really is Toeplitz; the counterexample part of the paper does not depend on this premise and stands on an explicit polynomial identity instead.
Editorial extensions
If this is right
- For every $3\times 3$ complex matrix, four Toeplitz factors always suffice, and $\operatorname{diag}(1,2,3)$ shows two do not; the exact value of $\mathrm{Toep}_3$ is therefore either $3$ or $4$.
- For every $4\times 4$ complex matrix, nine Toeplitz factors always suffice, so $3\le \mathrm{Toep}_4\le 9$.
- A generic diagonal $3\times 3$ matrix cannot be written as a product of two Toeplitz matrices, while a generic antisymmetric $3\times 3$ matrix can; the two-factor failure is generic in one natural family and exceptional in another.
- Every rank-one $n\times n$ matrix factors into three Toeplitz matrices, and every rank-$(n-1)$ matrix becomes a product of two Toeplitz matrices after multiplication by an invertible matrix, giving $\mathrm{Toep}(M)\le 2\lfloor n/2\rfloor+4$ for the latter.
- For fixed $n$ and $s$, deciding whether a matrix is a product of $s$ Toeplitz matrices is algorithmically decidable through Gröbner bases.
Reading between the lines
- Editorial inference: the explicit-certificate method used for $\operatorname{diag}(1,2,3)$ is reusable: once a certificate $\sum_i q_i p_i\neq 0$ is found, it machine-checks non-factorizability without solving the system, so the same route can certify other structured counterexamples.
- Editorial inference: the dimension count in the paper's final section suggests odd dimensions may be where the old conjecture fails systematically; a concrete next test is whether $\operatorname{diag}(1,2,3,4,5)$ admits a four-factor Toeplitz decomposition.
- Editorial inference: the chessboard constructions that factor generic $4\times 4$ diagonal matrices in three Toeplitz factors suggest a general block-orthogonal ansatz for diagonal matrices; classifying such ansätze could give exact values for $n\ge 5$ more efficiently than brute-force Gröbner bases.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the minimal number of Toeplitz factors needed to represent complex n×n matrices. Its main claims are: (i) a disproof of the Ye–Lim conjecture for n=3, via an explicit Nullstellensatz certificate showing that M3=diag(1,2,3) is not a product of two Toeplitz matrices; (ii) upper bounds Toep_3≤4 and Toep_4≤9 obtained by stratifying matrices by rank; (iii) a classification of diagonal and (claimed) antisymmetric 3×3 counterexamples; and (iv) an algorithmic reduction of Toeplitz factorization to polynomial ideal membership. The central counterexample is supported by a direct polynomial identity, while the upper-bound results are proved by case-by-case explicit factorizations.
Significance. The disproof of Conjecture 1.2 for n=3 is a real and checkable result: Theorem 3.2 provides explicit q_i with Σ q_i p_i = e(d−e)(f−d)(f−e), so for diag(1,2,3) no two-Toeplitz factorization can exist, while the three-factor decomposition (2) proves Toep=3. This settles a natural conjecture negatively and identifies a concrete witness. The paper also gives a useful algorithmic perspective via Proposition 3.1. However, the advertised improvements on Toep_n are not fully supported as written: Proposition 4.7 contains a substantive gap in Case 1(b), and Proposition 4.5 has a wrong case assignment in its final subcase, so the bounds Toep_3≤4 and Toep_4≤9 are not established by the submitted proofs. The abstract also promises a complete antisymmetric classification that §3.2 explicitly declines to provide.
major comments (4)
- [§4.2, Proposition 4.7, Case 1(b)] In Case 1(b) of Proposition 4.7, the displayed target matrix with first row (0,0,c',1) and fourth row (1,0,a,b) is not row-equivalent to the rref with rows (1,0,a,b) and (0,1,c,0): any row obtained by an invertible left multiplication lies in the span of those two rows, and matching the first two coordinates of the target's first row forces both coefficients to be zero, contradicting the third coordinate c'≠0. Moreover, the displayed factorization of M1=E_{1,3}+E_{4,1} as A·B gives A·B=E_{1,1}+E_{4,3}, not M1. Since no alternative two-Toeplitz certificate is supplied for this subcase, Proposition 4.7 as written does not prove Toep_4≤9.
- [§4.1, Proposition 4.5, final paragraph] In the final paragraph of Proposition 4.5, after reducing to M=[[0,b,0],[d,e,f],[0,h,0]], the matrix B'=[[0,b,b],[d,d+e,f+e],[0,h,h]] is said to fall in Case (a), but Case (a) requires both B'_{1,3}≠0 and B'_{3,1}≠0, whereas B'_{3,1}=0. The factorization M=B'·T1' is correct, but the proof that B' is a product of three Toeplitz matrices is missing. The gap appears repairable—B'^T satisfies the conditions of Case (e)—but as written the proof of Toep_3≤4 is incomplete.
- [§3.2 and Abstract] The abstract states that the paper gives a complete description of all the diagonal and all the antisymmetric matrices that contradict the conjecture for n=3. Section 3.2, however, explicitly withholds the full proof and the full classification: it refers to a degree-28 polynomial without displaying it and ends with two representative examples. Thus a stated deliverable of the paper is absent, and the antisymmetric part of the claim is not verifiable from the manuscript.
- [§4, Proposition 4.3] Proposition 4.3, which is used for rank n−1 matrices and hence for the rank-3 case in the proof of Theorem 4.8, constructs T2 by saying that one replaces Row r+1 with an adequate vector (0_{1×r},1,(a^{(r)})') without giving the vector or proving that such a choice is consistent with the Toeplitz condition while preserving T1·T2=A. The construction needs to be made explicit for Corollary 4.4 and the n=4 rank-3 case to be checkable.
minor comments (5)
- [§3.1, Theorem 3.2] In the proof of Theorem 3.2, the case f=e is not listed among the demonstrated factorizations, although it can be obtained by transposing the d=e case; please state this explicitly.
- [§3.2] The phrase 'a polynomial of degree 28' gives the reader no information about which polynomial is meant; either display the polynomial and its factorization or omit this claim.
- [§4.1, Case (e)] The displayed matrices in Proposition 4.5, Case (e), are typeset in a way that is hard to parse, especially the entries involving 'hd/i' and 'gd/i'; please reformat them clearly.
- [§5.3] In Section 5.3, 'we loose' should be 'we lose', and the counting argument should be explicitly labelled as a heuristic, since it does not by itself prove the existence of matrices attaining the proposed bounds.
- [§5.1] The inference from the displayed Gröbner basis computation to the conclusion that every diagonal matrix with the stated nonvanishing conditions is a product of three chessboard Toeplitz matrices relies on the extension theorem; a sentence identifying the leading coefficients used would make the argument checkable.
Circularity Check
No significant circularity: the counterexample rests on a direct polynomial identity and the bounds use explicit factorizations or external Ye–Lim bounds.
full rationale
The central claim, disproof of Conjecture 1.2 for n=3, is self-contained. Theorem 3.2 explicitly constructs polynomials q1,...,q9 satisfying sum q_i p_i = e(d-e)(f-d)(f-e), where p_i are the entries of T1T2 - M. This is a direct algebraic certificate that the displayed diagonal matrix M3 cannot be written as a product of two Toeplitz matrices; it does not fit any parameter, cite the authors' own prior results, or assume the conjecture. The upper bounds Toep3 <= 4 and Toep4 <= 9 are supported by explicit decompositions in Propositions 4.5 and 4.7 (rank-2 cases), by Proposition 4.1 (rank-1), and by the external theorem of Ye and Lim for invertible matrices. The only external load-bearing input is Theorem 1.1, which is a published result by different authors used as an upper bound, not as a hidden premise for the counterexample. Self-citations to the authors' own work occur in the motivational discussion of optimal approximants and Dirichlet spaces (Sections 2 and 5), but they are not used to justify the algebraic derivation; they only provide context for why the matrix M3 is interesting. The possible technical flaw in Proposition 4.7 Case 1(b) noted in the skeptical review is a correctness question about whether the displayed row-equivalent target and the claimed two-Toeplitz factorization multiply correctly, not a circularity: the proposition's conclusion does not reduce to its input by definition or by self-citation. Accordingly, no circular step meeting the quoted-evidence standard is present.
Assumptions & free parameters
assumptions (3)
- standard math Hilbert's Nullstellensatz over C: a polynomial system has a solution if and only if 1 is not in the generated ideal.
- domain assumption Ye-Lim Theorem 1.1: Toep_n is bounded by 4 floor(n/2)+5, with an invertible-matrix bound of 2 floor(n/2)+2.
- standard math Elimination and extension theorems from Cox, Little, and O'Shea are valid for the Gröbner-basis computation in Section 5.1.
Cite this review
Pith. "Pith review of On the minimum number of Toeplitz factors of a matrix." pith.science (2026). https://pith.science/paper/E2QI3F65
@misc{pith2026250616432,
author = {Pith},
title = {Pith review of: On the minimum number of Toeplitz factors of a matrix},
year = {2026},
howpublished = {\url{https://pith.science/paper/E2QI3F65}},
note = {Machine review of arXiv:2506.16432}
}
abstract
We disprove a conjecture by Ye and Lim, by showing that there are $3 \times 3$ complex matrices which can't be expressed as the product of two Toeplitz matrices of the same size. We also improve previous estimates by Ye and Lim on the minimum number of Toeplitz matrices needed to factor any $n \times n$ matrix, for low values of $n$.
Reference graph
Works this paper leans on
-
[1]
B\'en\'eteau, C., Condori, A., Liaw, C., Seco, D. and Sola, A. , Cyclicity in Dirichlet-type spaces and extremal polynomials, J. Anal. Math. 126 (2015), 259--286
work page 2015
-
[2]
B\'en\'eteau, C., Khavinson, D., Liaw, C., Seco, D. , and Sola, A.A. , Orthogonal polynomials, reproducing kernels, and zeros of optimal approximants, J. Lond. Math. Soc. (2) 94 (2016), no. 3, 726--746
work page 2016
-
[3]
Bitmead, R. B. , and Anderson, B.D.O. , Asymptotically fast solution of Toeplitz and related systems of linear equations, Linear Algebra Appl. 34 (1980), 103--116
work page 1980
-
[4]
Brown, L. and Shields, A. L. , Cyclic vectors in the Dirichlet space, Trans. Amer. Math. Soc. 285 , No. 1 (1984), 269--304
work page 1984
-
[5]
Cox, D. A., Little, J., O'Shea, D.. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (4th ed.). Springer, 2015
work page 2015
-
[6]
El-Fallah, O., Kellay, K., Mashreghi, J. , and Ransford, T. , A primer on the Dirichlet space, Cambridge Tracts in Math. 203 , Cambridge University Press, 2014
work page 2014
-
[7]
Fricain, E., Mashreghi, J. and Seco, D. , Cyclicity in Reproducing Kernel Hilbert Spaces of Analytic Functions, Comput. Methods Funct. Theory 14 (2014), 665--680
work page 2014
-
[8]
Garnett, J. B. , Bounded Analytic Functions, in: Pure and Applied Mathematics 96 , Academic Press, New York-London, 1981
work page 1981
Show all 12 references
-
[9]
, and Rost, H
Heinig, G. , and Rost, H. , Fast algorithms for Toeplitz and Hankel matrices, Lin. Alg. Appl. 435 (2011) 1--59
2011
-
[10]
SageMath, the Sage Mathematics Software System (Version 10.2), The Sage Developers, 2024, https://www.sagemath.org
2024
-
[11]
, Some problems on optimal approximants
Seco, D. , Some problems on optimal approximants. In Recent progress on operator theory and approximation in spaces of analytic functions, Contemp. Math. 679 (2017), 193--205, American Mathematical Society
2017
-
[12]
, and Lim, L.-H
Ye, K. , and Lim, L.-H. , Every Matrix is a Product of Toeplitz Matrices, Found. Comput. Math. 16 (3) (2016) 577--598
2016
Reviewed August 15, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.