The Kronecker-product conjecture for persistent tensors
The Kronecker-product conjecture for persistent tensors
Let and be persistent tensors, where and are vector spaces with and , respectively. Kronecker-product conjecture. Their Kronecker product is persistent, and hence
Persistent tensors provide lower bounds for tensor rank, with potential applications to tensor complexity and quantum information. The source says that many examples have been checked but leaves the proof as an open problem.
Progress summary
The conjecture is false in general: Shitov found a counterexample without symmetry, while a newer paper proves the corresponding symmetric statement.
Introduced in earlier work and presented as open in 2022, the conjecture asserted that the Kronecker product of any two persistent tensors remains persistent, with the stated lower bound on tensor rank.
2026 counterexample and symmetric theorem
A 2026 paper reports that Shitov constructed a nonsymmetric counterexample, so the unrestricted conjecture is false. The same paper proves that Kronecker products of symmetric persistent tensors remain persistent, including iterated products and powers; this is a theorem for the symmetric analogue, not for the original statement.
Current status (as of August 2026): The unrestricted conjecture is settled negatively by a reported nonsymmetric counterexample, while the symmetric analogue is proved.
Sources
Sources & referencesView supporting material
Primary source
Masoud Gharahi, “Classifying Entanglement by Algebraic Geometry”, arXiv:2408.12265 (2025).
Additional references
2 papers in this index state this conjecture (2022–2024). The statement above is taken from the most recent of them; the others are arXiv:2211.00652.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.