JOURNAL ARTICLE

Real identifiability vs. complex identifiability

Elena AngeliniCristiano BocciLuca Chiantini

Year: 2017 Journal:   Linear and Multilinear Algebra Vol: 66 (6)Pages: 1257-1267   Publisher: Taylor & Francis

Abstract

Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it\nhas a unique decomposition in terms of rank $1$ tensors. There are cases in\nwhich the identifiability fails over the complex field, for general tensors of\nrank $r$. This behavior is quite peculiar when the rank $r$ is submaximal.\nOften, the failure is due to the existence of an elliptic normal curve through\ngeneral points of the corresponding Segre, Veronese or Grassmann variety. We\nprove the existence of nonempty euclidean open subsets of some variety of\ntensors of rank $r$, whose elements have several decompositions over $\\mathbb\nC$, but only one of them is formed by real summands. Thus, in the open sets,\ntensors are not identifiable over $\\mathbb C$, but are identifiable over\n$\\mathbb R$.\n We also provide examples of non trivial euclidean open subsets in a whole\nspace of symmetric tensors (of degree $7$ and $8$ in three variables) and of\nalmost unbalanced tensors Segre Product ($\\mathbb P^2\\times \\mathbb P^4\\times\n\\mathbb P^9$) whose elements have typical real rank equal to the complex rank,\nand are identifiable over $\\mathbb R$, but not over $\\mathbb C$. On the\ncontrary, we provide examples of tensors of given real rank, for which real\nidentifiability cannot hold in non-trivial open subsets.\n

Keywords:

Metrics

12
Cited By
1.09
FWCI (Field Weighted Citation Impact)
18
Refs
0.74
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Tensor decomposition and applications
Physical Sciences →  Mathematics →  Computational Mathematics
Advanced Data Compression Techniques
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

JOURNAL ARTICLE

Identifiability of complex networks

Massimiliano ZaninJavier M. Buldú

Journal:   Frontiers in Physics Year: 2023 Vol: 11
BOOK-CHAPTER

Identifiability

Sander Greenland

International Encyclopedia of Statistical Science Year: 2025 Pages: 1157-1158
BOOK-CHAPTER

Identifiability

Andreas RaueJens Timmer

Year: 2013 Pages: 937-937
BOOK-CHAPTER

Identifiability

Sander Greenland

International Encyclopedia of Statistical Science Year: 2011 Pages: 645-645
© 2026 ScienceGate Book Chapters — All rights reserved.