Quasi-Toeplitz row-equivalence conjecture

About 1 year old · traced to

A quasi-Toeplitz matrix is a matrix obtained from a Toeplitz matrix by replacing some of its rows by zero rows. Two matrices are row equivalent when one can be obtained from the other by elementary row operations.

Quasi-Toeplitz row-equivalence conjecture. Every n×nn\times n matrix is row equivalent to a quasi-Toeplitz matrix.

If true, this would provide a systematic reduction of arbitrary matrices to a class that the paper identifies as particularly amenable to decomposition into Toeplitz factors. The paper does not provide a proof or a counterexample.

References

Primary source

Ignacio García-Marco, Irene Márquez-Corbella and Daniel Seco, “On the minimum number of Toeplitz factors of a matrix”, arXiv:2506.16432 (2025).

Progress summary

Refreshed
Claimed progress

A reader claims the conjecture is false in sufficiently large dimensions, but the proposed counterexample has not been independently checked.

The conjecture says every square matrix can be reduced by row operations to a matrix formed from a Toeplitz matrix by zeroing some rows. The original paper presents it as an open problem and gives neither a proof nor a counterexample.

Community submission (unverified)

A submitted argument claims that whenever r(n−r)>2n−2r(n-r)>2n-2, a Zariski-open dense family of rank-rr complex n×nn\times n matrices is not row equivalent to any quasi-Toeplitz matrix. It bounds the attainable rank-rr row spaces by a finite union of images of dimension at most 2n−22n-2, below dim⁡Gr⁡(r,n)=r(n−r)\dim\operatorname{Gr}(r,n)=r(n-r); if valid, this gives counterexamples in every such dimension.

Current status (as of August 2026): The retrieved literature still gives no proof or counterexample, while an unverified community submission claims generic counterexamples whenever r(n−r)>2n−2r(n-r)>2n-2.

Sources

Solutions 1

CounterexampleThis solution needs a summarySee full solutionHide full solution

A dimension obstruction in every sufficiently large dimension

The conjecture is false. More precisely, whenever

r(n−r)>2n−2,r(n-r)>2n-2,

a Zariski-open dense family of rank-rr complex n×nn\times n matrices is not row equivalent to any quasi-Toeplitz matrix.

Index rows and columns by 0,…,n−10,\ldots,n-1. A Toeplitz matrix has the form

T(t)ij=tj−i,−(n−1)≤j−i≤n−1.T(t)_{ij}=t_{j-i}, \qquad -(n-1)\leq j-i\leq n-1.

Its 2n−12n-1 diagonal parameters determine a point

[t−(n−1):⋯:tn−1]∈P2n−2,[t_{-(n-1)}:\cdots:t_{n-1}]\in\mathbb P^{2n-2},

because simultaneous multiplication of all parameters by a nonzero scalar does not change any row space.

Fix an rr-element subset I⊆{0,…,n−1}I\subseteq\{0,\ldots,n-1\}. On the open set where the rows indexed by II are linearly independent, there is a rational map

ϕI:P2n−2⇢Gr⁡(r,n),[t]⟼span⁡{(t−i,t1−i,…,tn−1−i):i∈I}.\begin{aligned} \phi_I:\mathbb P^{2n-2}&\dashrightarrow\operatorname{Gr}(r,n),\\ [t]&\longmapsto \operatorname{span}\{(t_{-i},t_{1-i},\ldots,t_{n-1-i}):i\in I\}. \end{aligned}

Therefore its image closure satisfies

dim⁡im⁡(ϕI)‾≤2n−2.\dim\overline{\operatorname{im}(\phi_I)}\leq 2n-2.

Suppose a rank-rr quasi-Toeplitz matrix is obtained from T(t)T(t) by replacing some rows with zero rows. Even if more than rr nonzero rows remain, one can choose rr linearly independent retained rows. Their index set II satisfies

row⁡(Q)=ϕI([t]).\operatorname{row}(Q)=\phi_I([t]).

Thus all row spaces attainable by rank-rr quasi-Toeplitz matrices belong to

Zn,r=⋃I⊆{0,…,n−1}∣I∣=rim⁡(ϕI)‾.\mathcal Z_{n,r} =\bigcup_{\substack{I\subseteq\{0,\ldots,n-1\}\\|I|=r}} \overline{\operatorname{im}(\phi_I)}.

The Grassmannian is irreducible and has dimension

dim⁡Gr⁡(r,n)=r(n−r).\dim\operatorname{Gr}(r,n)=r(n-r).

When r(n−r)>2n−2r(n-r)>2n-2, every set in the finite union defining Zn,r\mathcal Z_{n,r} is a proper closed subset. Hence

Zn,r⊊Gr⁡(r,n),codim⁡(Zn,r)≥r(n−r)−(2n−2)>0.\mathcal Z_{n,r}\subsetneq\operatorname{Gr}(r,n), \qquad \operatorname{codim}(\mathcal Z_{n,r}) \geq r(n-r)-(2n-2)>0.

Choose any rr-plane outside this union and form an n×nn\times n matrix whose first rr rows are a basis for that plane and whose remaining rows vanish. Row equivalence preserves and is characterized by the row space, so this matrix cannot be row equivalent to any quasi-Toeplitz matrix.

In particular,

n=8,r=4,dim⁡Gr⁡(4,8)=16>14=dim⁡P14.n=8,\qquad r=4,\qquad \dim\operatorname{Gr}(4,8)=16>14=\dim\mathbb P^{14}.

The obstruction occurs in every dimension n≥8n\geq8: taking r=⌊n/2⌋r=\lfloor n/2\rfloor gives

⌊n24⌋>2n−2(n≥8).\left\lfloor\frac{n^2}{4}\right\rfloor>2n-2 \qquad(n\geq8).

Since the construction is defined over Q\mathbb Q and rational points are Zariski dense in the standard affine Grassmannian chart, rational, and hence integer, counterexamples also exist in every such dimension.

An explicit binary counterexample of order eight

In fact, the following matrix already has entries only in {0,1}\{0,1\}:

A=(1000111101001000001010110001101000000000000000000000000000000000).A= \begin{pmatrix} 1&0&0&0&1&1&1&1\\ 0&1&0&0&1&0&0&0\\ 0&0&1&0&1&0&1&1\\ 0&0&0&1&1&0&1&0\\ 0&0&0&0&0&0&0&0\\ 0&0&0&0&0&0&0&0\\ 0&0&0&0&0&0&0&0\\ 0&0&0&0&0&0&0&0 \end{pmatrix}.

Its rank is four. Write

C=(1111100010111010),U=row⁡(A)=row⁡(I4∣C).C= \begin{pmatrix} 1&1&1&1\\ 1&0&0&0\\ 1&0&1&1\\ 1&0&1&0 \end{pmatrix}, \qquad U=\operatorname{row}(A)=\operatorname{row}(I_4\mid C).

A vector y∈C8y\in\mathbb C^8 belongs to UU precisely when

y4+k=∑j=03Cjkyj(0≤k≤3).y_{4+k}=\sum_{j=0}^{3}C_{jk}y_j \qquad(0\leq k\leq3).

Consequently, for a four-element row-index set II, the selected rows of a Toeplitz matrix belong to UU precisely when its diagonal parameters satisfy

t4+k−i−∑j=03Cjktj−i=0(i∈I, 0≤k≤3).t_{4+k-i}-\sum_{j=0}^{3}C_{jk}t_{j-i}=0 \qquad(i\in I,\ 0\leq k\leq3).

Let LIL_I denote this integer coefficient matrix. Its 1616 equations involve exactly

wI=8+max⁡I−min⁡Iw_I=8+\max I-\min I

diagonal parameters. Direct row reduction modulo 55 gives the following complete census of the (84)=70\binom84=70 index sets:

max⁡I−min⁡IwIrank⁡F5(LI)dim⁡ker⁡F5(LI)#I3111105412120125131301861414020715150137151412\begin{array}{c|c|c|c|c} \max I-\min I&w_I&\operatorname{rank}_{\mathbb F_5}(L_I) &\dim\ker_{\mathbb F_5}(L_I)&\#I\\ 3&11&11&0&5\\ 4&12&12&0&12\\ 5&13&13&0&18\\ 6&14&14&0&20\\ 7&15&15&0&13\\ 7&15&14&1&2 \end{array}

For the first 6868 index sets, full column rank modulo 55 implies full column rank over C\mathbb C. Therefore their only possible diagonal parameters are zero, and the selected Toeplitz rows cannot span UU.

The remaining two index sets are

I1={0,1,2,7},I2={0,5,6,7}.I_1=\{0,1,2,7\}, \qquad I_2=\{0,5,6,7\}.

In the diagonal order t−7,…,t7t_{-7},\ldots,t_7, their complex kernels are respectively spanned by

q1=(0,1,0,0,1,0,0,0,0,0,0,0,0,0,0),q_1=(0,1,0,0,1,0,0,0,0,0,0,0,0,0,0),

and

q2=(0,0,0,0,0,0,0,0,0,0,1,1,0,1,0).q_2=(0,0,0,0,0,0,0,0,0,0,1,1,0,1,0).

Indeed, each displayed integer vector solves the corresponding equations, while the modular rank 1414 proves that the complex kernel has dimension exactly one. For I1I_1, the rows indexed by 0,1,20,1,2 vanish, and the only nonzero selected row is

T(q1)7,∗=(0,1,0,0,1,0,0,0).T(q_1)_{7,*}=(0,1,0,0,1,0,0,0).

For I2I_2, the rows indexed by 5,6,75,6,7 vanish, and the only nonzero selected row is

T(q2)0,∗=(0,0,0,1,1,0,1,0).T(q_2)_{0,*}=(0,0,0,1,1,0,1,0).

In both exceptional cases, the selected rows have rank one instead of four. Therefore no four independent rows of any Toeplitz matrix lie in UU, and the binary matrix AA is not row equivalent to any quasi-Toeplitz matrix.

The statement disproved here is Conjecture 5.2 of Ignacio García-Marco, Irene Márquez-Corbella, and Daniel Seco, On the minimum number of Toeplitz factors of a matrix, https://arxiv.org/abs/2506.16432. The distinct factorization conjectures in that paper are not asserted here.