IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i3p360-d1324402.html
   My bibliography  Save this article

Three New Proofs of the Theorem rank f ( M ) + rank g ( M ) = rank ( f , g )( M ) + rank [ f , g ]( M )

Author

Listed:
  • Vasile Pop

    (Department of Mathematics, Technical University of Cluj-Napoca, 400114 Cluj-Napoca, Romania
    These authors contributed equally to this work.)

  • Alexandru Negrescu

    (Department of Mathematical Methods and Models, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
    These authors contributed equally to this work.)

Abstract

It is well known that in C [ X ] , the product of two polynomials is equal to the product of their greatest common divisor and their least common multiple. In a recent paper, we proved a similar relation between the ranks of matrix polynomials. More precisely, the sum of the ranks of two matrix polynomials is equal to the sum of the rank of the greatest common divisor of the polynomials applied to the respective matrix and the rank of the least common multiple of the polynomials applied to the respective matrix. In this paper, we present three new proofs for this result. In addition to these, we present two more applications.

Suggested Citation

  • Vasile Pop & Alexandru Negrescu, 2024. "Three New Proofs of the Theorem rank f ( M ) + rank g ( M ) = rank ( f , g )( M ) + rank [ f , g ]( M )," Mathematics, MDPI, vol. 12(3), pages 1-6, January.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:3:p:360-:d:1324402
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/3/360/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/3/360/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:3:p:360-:d:1324402. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.