Matrices with normal defect one

Dmitry S. Kaliuzhnyi-Verbovetskyi, Ilya Spitkovsky, Hugo J. Woerdeman

    Research output: Contribution to journalArticle

    Abstract

    A n×n matrix A has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size (n+1)×(n+1). The latter is called a minimal normal completion of A. A construction of all matrices with normal defect one is given. Also, a simple procedure is presented which allows one to check whether a given matrix has normal defect one, and if this is the case - to construct all its minimal normal completions. A characterization of the generic case for each n under the assumption rank(A*A-AA*) = 2 (which is necessary for A to have normal defect one) is obtained. Both the complex and the real cases are considered. It is pointed out how these results can be used to solve the minimal commuting completion problem in the classes of pairs of n×n Hermitian (resp., symmetric, or symmetric/antisymmetric) matrices when the completed matrices are sought of size (n+1)×(n+1). An application to the 2×n separability problem in quantum computing is described.

    Original languageEnglish (US)
    Pages (from-to)401-438
    Number of pages38
    JournalOperators and Matrices
    Volume3
    Issue number3
    DOIs
    StatePublished - Jan 1 2009

    Fingerprint

    Defects
    Normal matrix
    Completion
    Completion Problem
    Quantum Computing
    Antisymmetric
    Separability
    Necessary

    Keywords

    • Commuting completions
    • Complex symmetric operators and matrices
    • Minimal normal completions
    • Normal defect
    • Separability problem
    • Unitary and symmetric extensions

    ASJC Scopus subject areas

    • Analysis
    • Algebra and Number Theory

    Cite this

    Kaliuzhnyi-Verbovetskyi, D. S., Spitkovsky, I., & Woerdeman, H. J. (2009). Matrices with normal defect one. Operators and Matrices, 3(3), 401-438. https://doi.org/10.7153/oam-03-24

    Matrices with normal defect one. / Kaliuzhnyi-Verbovetskyi, Dmitry S.; Spitkovsky, Ilya; Woerdeman, Hugo J.

    In: Operators and Matrices, Vol. 3, No. 3, 01.01.2009, p. 401-438.

    Research output: Contribution to journalArticle

    Kaliuzhnyi-Verbovetskyi, DS, Spitkovsky, I & Woerdeman, HJ 2009, 'Matrices with normal defect one', Operators and Matrices, vol. 3, no. 3, pp. 401-438. https://doi.org/10.7153/oam-03-24
    Kaliuzhnyi-Verbovetskyi DS, Spitkovsky I, Woerdeman HJ. Matrices with normal defect one. Operators and Matrices. 2009 Jan 1;3(3):401-438. https://doi.org/10.7153/oam-03-24
    Kaliuzhnyi-Verbovetskyi, Dmitry S. ; Spitkovsky, Ilya ; Woerdeman, Hugo J. / Matrices with normal defect one. In: Operators and Matrices. 2009 ; Vol. 3, No. 3. pp. 401-438.
    @article{e624b09675224b6e982a6d60d6b4093d,
    title = "Matrices with normal defect one",
    abstract = "A n×n matrix A has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size (n+1)×(n+1). The latter is called a minimal normal completion of A. A construction of all matrices with normal defect one is given. Also, a simple procedure is presented which allows one to check whether a given matrix has normal defect one, and if this is the case - to construct all its minimal normal completions. A characterization of the generic case for each n under the assumption rank(A*A-AA*) = 2 (which is necessary for A to have normal defect one) is obtained. Both the complex and the real cases are considered. It is pointed out how these results can be used to solve the minimal commuting completion problem in the classes of pairs of n×n Hermitian (resp., symmetric, or symmetric/antisymmetric) matrices when the completed matrices are sought of size (n+1)×(n+1). An application to the 2×n separability problem in quantum computing is described.",
    keywords = "Commuting completions, Complex symmetric operators and matrices, Minimal normal completions, Normal defect, Separability problem, Unitary and symmetric extensions",
    author = "Kaliuzhnyi-Verbovetskyi, {Dmitry S.} and Ilya Spitkovsky and Woerdeman, {Hugo J.}",
    year = "2009",
    month = "1",
    day = "1",
    doi = "10.7153/oam-03-24",
    language = "English (US)",
    volume = "3",
    pages = "401--438",
    journal = "Operators and Matrices",
    issn = "1846-3886",
    publisher = "Element d.o.o.",
    number = "3",

    }

    TY - JOUR

    T1 - Matrices with normal defect one

    AU - Kaliuzhnyi-Verbovetskyi, Dmitry S.

    AU - Spitkovsky, Ilya

    AU - Woerdeman, Hugo J.

    PY - 2009/1/1

    Y1 - 2009/1/1

    N2 - A n×n matrix A has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size (n+1)×(n+1). The latter is called a minimal normal completion of A. A construction of all matrices with normal defect one is given. Also, a simple procedure is presented which allows one to check whether a given matrix has normal defect one, and if this is the case - to construct all its minimal normal completions. A characterization of the generic case for each n under the assumption rank(A*A-AA*) = 2 (which is necessary for A to have normal defect one) is obtained. Both the complex and the real cases are considered. It is pointed out how these results can be used to solve the minimal commuting completion problem in the classes of pairs of n×n Hermitian (resp., symmetric, or symmetric/antisymmetric) matrices when the completed matrices are sought of size (n+1)×(n+1). An application to the 2×n separability problem in quantum computing is described.

    AB - A n×n matrix A has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size (n+1)×(n+1). The latter is called a minimal normal completion of A. A construction of all matrices with normal defect one is given. Also, a simple procedure is presented which allows one to check whether a given matrix has normal defect one, and if this is the case - to construct all its minimal normal completions. A characterization of the generic case for each n under the assumption rank(A*A-AA*) = 2 (which is necessary for A to have normal defect one) is obtained. Both the complex and the real cases are considered. It is pointed out how these results can be used to solve the minimal commuting completion problem in the classes of pairs of n×n Hermitian (resp., symmetric, or symmetric/antisymmetric) matrices when the completed matrices are sought of size (n+1)×(n+1). An application to the 2×n separability problem in quantum computing is described.

    KW - Commuting completions

    KW - Complex symmetric operators and matrices

    KW - Minimal normal completions

    KW - Normal defect

    KW - Separability problem

    KW - Unitary and symmetric extensions

    UR - http://www.scopus.com/inward/record.url?scp=79955393957&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=79955393957&partnerID=8YFLogxK

    U2 - 10.7153/oam-03-24

    DO - 10.7153/oam-03-24

    M3 - Article

    VL - 3

    SP - 401

    EP - 438

    JO - Operators and Matrices

    JF - Operators and Matrices

    SN - 1846-3886

    IS - 3

    ER -