Determinant is linear as a function of each of the rows of the matrix.












2












$begingroup$


Today I heard in a lecture (some video on YouTube) that the determinant is linear as a function of each of the rows of the matrix.



I am not able to understand the above statement. I know that determinant is a special function which assign to each $x$ in $mathbb K^{n times n}$ a scalar. This is the intuitive idea. And this map is not linear as well. One way to see this is to consider the fact that determinant of $cA$ is $c^ndet(A)$



Can someone please explain what did the person mean by saying that the determinant is linear as a function of each of the rows of matrix?






linear-algebra matrices determinant







share|cite|improve this question











$endgroup$












  • $begingroup$
    I got it. It means that elementary row operations have a linear effect on determinant. Say $A=(r1,r2,...,r_n)$ is a matrix then det of $(r_1,..,cr_j +r_i,..,r_n)$ is nothing but determinant of $(r_1,..,cr_j,..,r_n)$ plus determinant of $(r_1,..,r_i,..,r_n)$.Am I right?
    $endgroup$
    – StammeringMathematician
    1 hour ago










  • $begingroup$
    Yes. The fact that is is linear in each row separately gives rise to the combinatorial formula for the determinant.
    $endgroup$
    – copper.hat
    1 hour ago


















2












$begingroup$


Today I heard in a lecture (some video on YouTube) that the determinant is linear as a function of each of the rows of the matrix.



I am not able to understand the above statement. I know that determinant is a special function which assign to each $x$ in $mathbb K^{n times n}$ a scalar. This is the intuitive idea. And this map is not linear as well. One way to see this is to consider the fact that determinant of $cA$ is $c^ndet(A)$



Can someone please explain what did the person mean by saying that the determinant is linear as a function of each of the rows of matrix?






linear-algebra matrices determinant







share|cite|improve this question











$endgroup$












  • $begingroup$
    I got it. It means that elementary row operations have a linear effect on determinant. Say $A=(r1,r2,...,r_n)$ is a matrix then det of $(r_1,..,cr_j +r_i,..,r_n)$ is nothing but determinant of $(r_1,..,cr_j,..,r_n)$ plus determinant of $(r_1,..,r_i,..,r_n)$.Am I right?
    $endgroup$
    – StammeringMathematician
    1 hour ago










  • $begingroup$
    Yes. The fact that is is linear in each row separately gives rise to the combinatorial formula for the determinant.
    $endgroup$
    – copper.hat
    1 hour ago
















2












2








2





$begingroup$


Today I heard in a lecture (some video on YouTube) that the determinant is linear as a function of each of the rows of the matrix.



I am not able to understand the above statement. I know that determinant is a special function which assign to each $x$ in $mathbb K^{n times n}$ a scalar. This is the intuitive idea. And this map is not linear as well. One way to see this is to consider the fact that determinant of $cA$ is $c^ndet(A)$



Can someone please explain what did the person mean by saying that the determinant is linear as a function of each of the rows of matrix?






linear-algebra matrices determinant







share|cite|improve this question











$endgroup$




Today I heard in a lecture (some video on YouTube) that the determinant is linear as a function of each of the rows of the matrix.



I am not able to understand the above statement. I know that determinant is a special function which assign to each $x$ in $mathbb K^{n times n}$ a scalar. This is the intuitive idea. And this map is not linear as well. One way to see this is to consider the fact that determinant of $cA$ is $c^ndet(A)$



Can someone please explain what did the person mean by saying that the determinant is linear as a function of each of the rows of matrix?






linear-algebra matrices determinant




linear-algebra matrices determinant






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 1 hour ago









Rodrigo de Azevedo

13.2k41961




13.2k41961










asked 1 hour ago









StammeringMathematicianStammeringMathematician

2,8121324




2,8121324












  • $begingroup$
    I got it. It means that elementary row operations have a linear effect on determinant. Say $A=(r1,r2,...,r_n)$ is a matrix then det of $(r_1,..,cr_j +r_i,..,r_n)$ is nothing but determinant of $(r_1,..,cr_j,..,r_n)$ plus determinant of $(r_1,..,r_i,..,r_n)$.Am I right?
    $endgroup$
    – StammeringMathematician
    1 hour ago










  • $begingroup$
    Yes. The fact that is is linear in each row separately gives rise to the combinatorial formula for the determinant.
    $endgroup$
    – copper.hat
    1 hour ago




















  • $begingroup$
    I got it. It means that elementary row operations have a linear effect on determinant. Say $A=(r1,r2,...,r_n)$ is a matrix then det of $(r_1,..,cr_j +r_i,..,r_n)$ is nothing but determinant of $(r_1,..,cr_j,..,r_n)$ plus determinant of $(r_1,..,r_i,..,r_n)$.Am I right?
    $endgroup$
    – StammeringMathematician
    1 hour ago










  • $begingroup$
    Yes. The fact that is is linear in each row separately gives rise to the combinatorial formula for the determinant.
    $endgroup$
    – copper.hat
    1 hour ago


















$begingroup$
I got it. It means that elementary row operations have a linear effect on determinant. Say $A=(r1,r2,...,r_n)$ is a matrix then det of $(r_1,..,cr_j +r_i,..,r_n)$ is nothing but determinant of $(r_1,..,cr_j,..,r_n)$ plus determinant of $(r_1,..,r_i,..,r_n)$.Am I right?
$endgroup$
– StammeringMathematician
1 hour ago




$begingroup$
I got it. It means that elementary row operations have a linear effect on determinant. Say $A=(r1,r2,...,r_n)$ is a matrix then det of $(r_1,..,cr_j +r_i,..,r_n)$ is nothing but determinant of $(r_1,..,cr_j,..,r_n)$ plus determinant of $(r_1,..,r_i,..,r_n)$.Am I right?
$endgroup$
– StammeringMathematician
1 hour ago












$begingroup$
Yes. The fact that is is linear in each row separately gives rise to the combinatorial formula for the determinant.
$endgroup$
– copper.hat
1 hour ago






$begingroup$
Yes. The fact that is is linear in each row separately gives rise to the combinatorial formula for the determinant.
$endgroup$
– copper.hat
1 hour ago












2 Answers
2






active

oldest

votes


















3












$begingroup$

If $r_1, ldots r_n$ are the rows of the matrix and $r_i = sa+tb$, where $s,t$ are scalars and $a,b$ are row vectors, then you have



$$detbegin{pmatrix}r_1 \ vdots \r_i \ vdots \ r_nend{pmatrix} = detbegin{pmatrix}r_1 \ vdots \ sa+tb \ vdots \ r_nend{pmatrix} = sdetbegin{pmatrix}r_1 \ vdots \ a \ vdots \ r_nend{pmatrix} + tdetbegin{pmatrix}r_1 \ vdots \ b \ vdots \ r_nend{pmatrix}$$



This holds for any row $i=1,ldots , n$. And similarly this also applies to columns.






share|cite|improve this answer









$endgroup$





















    2












    $begingroup$

    Let $M$ be an $ntimes n$ matrix with rows $mathbf{r}_1,dots,mathbf{r}_n$. Then we may think of the determinant as a function of the rows
    $$
    det(M)=det(mathbf{r}_1,dots,mathbf{r}_n).
    $$
    To say that $det$ is a linear function of the rows means that if we scale a single row by $c$, the result is scaled by $c$; that is,
    $$
    det(mathbf{r}_1,dots,mathbf{r}_{i-1},cmathbf{r}_i,mathbf{r}_{i+1}dotsmathbf{r}_n)=cdet(mathbf{r}_1,dots,mathbf{r}_n).
    $$
    Similarly if we fix all but one row (say the first), we obtain
    $$
    det(mathbf{x}+mathbf{r}_1,mathbf{r}_2,dots,mathbf{r}_n)=det(mathbf{x},dots,mathbf{r}_n)+det(mathbf{r}_1,dots,mathbf{r}_n).
    $$
    Your mistake was that you scale all the rows at once; to be linear, you can only do things "one at a time"






    share|cite|improve this answer









    $endgroup$














      Your Answer








      StackExchange.ready(function() {
      var channelOptions = {
      tags: "".split(" "),
      id: "69"
      };
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function() {
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled) {
      StackExchange.using("snippets", function() {
      createEditor();
      });
      }
      else {
      createEditor();
      }
      });

      function createEditor() {
      StackExchange.prepareEditor({
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: true,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      imageUploader: {
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      },
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      });


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3189406%2fdeterminant-is-linear-as-a-function-of-each-of-the-rows-of-the-matrix%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      3












      $begingroup$

      If $r_1, ldots r_n$ are the rows of the matrix and $r_i = sa+tb$, where $s,t$ are scalars and $a,b$ are row vectors, then you have



      $$detbegin{pmatrix}r_1 \ vdots \r_i \ vdots \ r_nend{pmatrix} = detbegin{pmatrix}r_1 \ vdots \ sa+tb \ vdots \ r_nend{pmatrix} = sdetbegin{pmatrix}r_1 \ vdots \ a \ vdots \ r_nend{pmatrix} + tdetbegin{pmatrix}r_1 \ vdots \ b \ vdots \ r_nend{pmatrix}$$



      This holds for any row $i=1,ldots , n$. And similarly this also applies to columns.






      share|cite|improve this answer









      $endgroup$


















        3












        $begingroup$

        If $r_1, ldots r_n$ are the rows of the matrix and $r_i = sa+tb$, where $s,t$ are scalars and $a,b$ are row vectors, then you have



        $$detbegin{pmatrix}r_1 \ vdots \r_i \ vdots \ r_nend{pmatrix} = detbegin{pmatrix}r_1 \ vdots \ sa+tb \ vdots \ r_nend{pmatrix} = sdetbegin{pmatrix}r_1 \ vdots \ a \ vdots \ r_nend{pmatrix} + tdetbegin{pmatrix}r_1 \ vdots \ b \ vdots \ r_nend{pmatrix}$$



        This holds for any row $i=1,ldots , n$. And similarly this also applies to columns.






        share|cite|improve this answer









        $endgroup$
















          3












          3








          3





          $begingroup$

          If $r_1, ldots r_n$ are the rows of the matrix and $r_i = sa+tb$, where $s,t$ are scalars and $a,b$ are row vectors, then you have



          $$detbegin{pmatrix}r_1 \ vdots \r_i \ vdots \ r_nend{pmatrix} = detbegin{pmatrix}r_1 \ vdots \ sa+tb \ vdots \ r_nend{pmatrix} = sdetbegin{pmatrix}r_1 \ vdots \ a \ vdots \ r_nend{pmatrix} + tdetbegin{pmatrix}r_1 \ vdots \ b \ vdots \ r_nend{pmatrix}$$



          This holds for any row $i=1,ldots , n$. And similarly this also applies to columns.






          share|cite|improve this answer









          $endgroup$



          If $r_1, ldots r_n$ are the rows of the matrix and $r_i = sa+tb$, where $s,t$ are scalars and $a,b$ are row vectors, then you have



          $$detbegin{pmatrix}r_1 \ vdots \r_i \ vdots \ r_nend{pmatrix} = detbegin{pmatrix}r_1 \ vdots \ sa+tb \ vdots \ r_nend{pmatrix} = sdetbegin{pmatrix}r_1 \ vdots \ a \ vdots \ r_nend{pmatrix} + tdetbegin{pmatrix}r_1 \ vdots \ b \ vdots \ r_nend{pmatrix}$$



          This holds for any row $i=1,ldots , n$. And similarly this also applies to columns.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 1 hour ago









          trancelocationtrancelocation

          14.1k1829




          14.1k1829























              2












              $begingroup$

              Let $M$ be an $ntimes n$ matrix with rows $mathbf{r}_1,dots,mathbf{r}_n$. Then we may think of the determinant as a function of the rows
              $$
              det(M)=det(mathbf{r}_1,dots,mathbf{r}_n).
              $$
              To say that $det$ is a linear function of the rows means that if we scale a single row by $c$, the result is scaled by $c$; that is,
              $$
              det(mathbf{r}_1,dots,mathbf{r}_{i-1},cmathbf{r}_i,mathbf{r}_{i+1}dotsmathbf{r}_n)=cdet(mathbf{r}_1,dots,mathbf{r}_n).
              $$
              Similarly if we fix all but one row (say the first), we obtain
              $$
              det(mathbf{x}+mathbf{r}_1,mathbf{r}_2,dots,mathbf{r}_n)=det(mathbf{x},dots,mathbf{r}_n)+det(mathbf{r}_1,dots,mathbf{r}_n).
              $$
              Your mistake was that you scale all the rows at once; to be linear, you can only do things "one at a time"






              share|cite|improve this answer









              $endgroup$


















                2












                $begingroup$

                Let $M$ be an $ntimes n$ matrix with rows $mathbf{r}_1,dots,mathbf{r}_n$. Then we may think of the determinant as a function of the rows
                $$
                det(M)=det(mathbf{r}_1,dots,mathbf{r}_n).
                $$
                To say that $det$ is a linear function of the rows means that if we scale a single row by $c$, the result is scaled by $c$; that is,
                $$
                det(mathbf{r}_1,dots,mathbf{r}_{i-1},cmathbf{r}_i,mathbf{r}_{i+1}dotsmathbf{r}_n)=cdet(mathbf{r}_1,dots,mathbf{r}_n).
                $$
                Similarly if we fix all but one row (say the first), we obtain
                $$
                det(mathbf{x}+mathbf{r}_1,mathbf{r}_2,dots,mathbf{r}_n)=det(mathbf{x},dots,mathbf{r}_n)+det(mathbf{r}_1,dots,mathbf{r}_n).
                $$
                Your mistake was that you scale all the rows at once; to be linear, you can only do things "one at a time"






                share|cite|improve this answer









                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  Let $M$ be an $ntimes n$ matrix with rows $mathbf{r}_1,dots,mathbf{r}_n$. Then we may think of the determinant as a function of the rows
                  $$
                  det(M)=det(mathbf{r}_1,dots,mathbf{r}_n).
                  $$
                  To say that $det$ is a linear function of the rows means that if we scale a single row by $c$, the result is scaled by $c$; that is,
                  $$
                  det(mathbf{r}_1,dots,mathbf{r}_{i-1},cmathbf{r}_i,mathbf{r}_{i+1}dotsmathbf{r}_n)=cdet(mathbf{r}_1,dots,mathbf{r}_n).
                  $$
                  Similarly if we fix all but one row (say the first), we obtain
                  $$
                  det(mathbf{x}+mathbf{r}_1,mathbf{r}_2,dots,mathbf{r}_n)=det(mathbf{x},dots,mathbf{r}_n)+det(mathbf{r}_1,dots,mathbf{r}_n).
                  $$
                  Your mistake was that you scale all the rows at once; to be linear, you can only do things "one at a time"






                  share|cite|improve this answer









                  $endgroup$



                  Let $M$ be an $ntimes n$ matrix with rows $mathbf{r}_1,dots,mathbf{r}_n$. Then we may think of the determinant as a function of the rows
                  $$
                  det(M)=det(mathbf{r}_1,dots,mathbf{r}_n).
                  $$
                  To say that $det$ is a linear function of the rows means that if we scale a single row by $c$, the result is scaled by $c$; that is,
                  $$
                  det(mathbf{r}_1,dots,mathbf{r}_{i-1},cmathbf{r}_i,mathbf{r}_{i+1}dotsmathbf{r}_n)=cdet(mathbf{r}_1,dots,mathbf{r}_n).
                  $$
                  Similarly if we fix all but one row (say the first), we obtain
                  $$
                  det(mathbf{x}+mathbf{r}_1,mathbf{r}_2,dots,mathbf{r}_n)=det(mathbf{x},dots,mathbf{r}_n)+det(mathbf{r}_1,dots,mathbf{r}_n).
                  $$
                  Your mistake was that you scale all the rows at once; to be linear, you can only do things "one at a time"







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 1 hour ago









                  TomGrubbTomGrubb

                  11.2k11639




                  11.2k11639






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Mathematics Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid …



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3189406%2fdeterminant-is-linear-as-a-function-of-each-of-the-rows-of-the-matrix%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      -

                      Popular posts from this blog

                      Bundesstraße 106

                      Image
                      Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück ...
                      Read more

                      Verónica Boquete

                      Image
                      Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl ...
                      Read more

                      Ida-Boy-Ed-Garten

                      Image
                      Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich ...
                      Read more