Schubert decomposition of a Grassmannian












4












$begingroup$


I'm going through Sheldon Katz's Enumerative Geometry and String Theory, and a few things regarding the Grassmannian $G(2,4)$ (lines in projective space) are bothering me:




  1. How can I compute the subspaces of $mathbb{C}^4$ that correspond to lines disjoint from a given line in $mathbb{P}^3$? For example, using coordinates $[x_0:x_1:x_2:x_3]$ for $mathbb{P}^3$, let $ell$ be the line given by $x_0 = x_1 = 0$. The book says that the lines disjoint from $ell$ are given by $langle (1,0,a,b), (0,1,c,d) rangle$.


I can see that $ell$ corresponds to $langle (0,0,1,0),(0,0,0,1) rangle$ and I've tried showing that, given a subspace $langle (a,b,c,d),(e,f,g,h) rangle$, there is no non-trivial linear combination of $(a,b,c,d)$ and $(e,f,g,h)$ that is of the form $(0,0,alpha,beta)$, but I end up having to check a few cases and it's definitely not straightforward.




  1. The book goes on to compute the general form of elements of the Schubert cycle $sigma_1(L) = {ell in G(2,4) mid ell cap L neq emptyset}$, which apparently is given by $langle (1,a,0,b),(0,0,1,c) rangle$. How so?


Again this is me encountering difficulties working with the projectivization of subspaces, so a few tips would be much appreciated.




  1. The book then says that the elements $langle (1,a,0,b), (0,0,1,c) rangle$ form a cell whose closure is $sigma_1(L)$. How is this a cell (a cell is the difference of two consecutive strata in a cellular decomposition), and how is it not the whole $sigma_1(L)$, from the above consideration?










share|cite|improve this question











$endgroup$

















    4












    $begingroup$


    I'm going through Sheldon Katz's Enumerative Geometry and String Theory, and a few things regarding the Grassmannian $G(2,4)$ (lines in projective space) are bothering me:




    1. How can I compute the subspaces of $mathbb{C}^4$ that correspond to lines disjoint from a given line in $mathbb{P}^3$? For example, using coordinates $[x_0:x_1:x_2:x_3]$ for $mathbb{P}^3$, let $ell$ be the line given by $x_0 = x_1 = 0$. The book says that the lines disjoint from $ell$ are given by $langle (1,0,a,b), (0,1,c,d) rangle$.


    I can see that $ell$ corresponds to $langle (0,0,1,0),(0,0,0,1) rangle$ and I've tried showing that, given a subspace $langle (a,b,c,d),(e,f,g,h) rangle$, there is no non-trivial linear combination of $(a,b,c,d)$ and $(e,f,g,h)$ that is of the form $(0,0,alpha,beta)$, but I end up having to check a few cases and it's definitely not straightforward.




    1. The book goes on to compute the general form of elements of the Schubert cycle $sigma_1(L) = {ell in G(2,4) mid ell cap L neq emptyset}$, which apparently is given by $langle (1,a,0,b),(0,0,1,c) rangle$. How so?


    Again this is me encountering difficulties working with the projectivization of subspaces, so a few tips would be much appreciated.




    1. The book then says that the elements $langle (1,a,0,b), (0,0,1,c) rangle$ form a cell whose closure is $sigma_1(L)$. How is this a cell (a cell is the difference of two consecutive strata in a cellular decomposition), and how is it not the whole $sigma_1(L)$, from the above consideration?










    share|cite|improve this question











    $endgroup$















      4












      4








      4


      1



      $begingroup$


      I'm going through Sheldon Katz's Enumerative Geometry and String Theory, and a few things regarding the Grassmannian $G(2,4)$ (lines in projective space) are bothering me:




      1. How can I compute the subspaces of $mathbb{C}^4$ that correspond to lines disjoint from a given line in $mathbb{P}^3$? For example, using coordinates $[x_0:x_1:x_2:x_3]$ for $mathbb{P}^3$, let $ell$ be the line given by $x_0 = x_1 = 0$. The book says that the lines disjoint from $ell$ are given by $langle (1,0,a,b), (0,1,c,d) rangle$.


      I can see that $ell$ corresponds to $langle (0,0,1,0),(0,0,0,1) rangle$ and I've tried showing that, given a subspace $langle (a,b,c,d),(e,f,g,h) rangle$, there is no non-trivial linear combination of $(a,b,c,d)$ and $(e,f,g,h)$ that is of the form $(0,0,alpha,beta)$, but I end up having to check a few cases and it's definitely not straightforward.




      1. The book goes on to compute the general form of elements of the Schubert cycle $sigma_1(L) = {ell in G(2,4) mid ell cap L neq emptyset}$, which apparently is given by $langle (1,a,0,b),(0,0,1,c) rangle$. How so?


      Again this is me encountering difficulties working with the projectivization of subspaces, so a few tips would be much appreciated.




      1. The book then says that the elements $langle (1,a,0,b), (0,0,1,c) rangle$ form a cell whose closure is $sigma_1(L)$. How is this a cell (a cell is the difference of two consecutive strata in a cellular decomposition), and how is it not the whole $sigma_1(L)$, from the above consideration?










      share|cite|improve this question











      $endgroup$




      I'm going through Sheldon Katz's Enumerative Geometry and String Theory, and a few things regarding the Grassmannian $G(2,4)$ (lines in projective space) are bothering me:




      1. How can I compute the subspaces of $mathbb{C}^4$ that correspond to lines disjoint from a given line in $mathbb{P}^3$? For example, using coordinates $[x_0:x_1:x_2:x_3]$ for $mathbb{P}^3$, let $ell$ be the line given by $x_0 = x_1 = 0$. The book says that the lines disjoint from $ell$ are given by $langle (1,0,a,b), (0,1,c,d) rangle$.


      I can see that $ell$ corresponds to $langle (0,0,1,0),(0,0,0,1) rangle$ and I've tried showing that, given a subspace $langle (a,b,c,d),(e,f,g,h) rangle$, there is no non-trivial linear combination of $(a,b,c,d)$ and $(e,f,g,h)$ that is of the form $(0,0,alpha,beta)$, but I end up having to check a few cases and it's definitely not straightforward.




      1. The book goes on to compute the general form of elements of the Schubert cycle $sigma_1(L) = {ell in G(2,4) mid ell cap L neq emptyset}$, which apparently is given by $langle (1,a,0,b),(0,0,1,c) rangle$. How so?


      Again this is me encountering difficulties working with the projectivization of subspaces, so a few tips would be much appreciated.




      1. The book then says that the elements $langle (1,a,0,b), (0,0,1,c) rangle$ form a cell whose closure is $sigma_1(L)$. How is this a cell (a cell is the difference of two consecutive strata in a cellular decomposition), and how is it not the whole $sigma_1(L)$, from the above consideration?







      algebraic-geometry algebraic-topology homology-cohomology grassmannian schubert-calculus






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 2 at 0:48









      Matt Samuel

      38.7k63769




      38.7k63769










      asked Jan 3 '16 at 1:47









      Augusto PereiraAugusto Pereira

      1197




      1197






















          2 Answers
          2






          active

          oldest

          votes


















          1












          $begingroup$

          A line in $mathbb{P}^3$ corresponds to a two-dimensional subspace of $mathbb{C}^4$.



          Given two two-dimensional subspaces $V, W subset mathbb{C}^4$, there are three possibilities for $dim V cap W$: it is either 0 (the two lines are disjoint), 1 (the two lines meet in a point), or 2 (the two lines are in fact the same line).



          These correspond to three possibilities for $dim(V + W)$: it is either 4, 3, or 2, respectively.



          How do we calculate the dimension of $V+W$? Well, if $V$ is spanned by $e_3$ and $e_4$ and $W$ is spanned by $w_1$ and $w_2$ then



          $$dim(V + W) = operatorname{rank}begin{pmatrix}
          0 & 0 & 1 & 0 \
          0 & 0 & 0 & 1 \
          w_{11} & w_{12} & w_{13} & w_{14} \
          w_{21} & w_{22} & w_{23} & w_{24}
          end{pmatrix}.$$



          If $V$ and $W$ represent lines that don't meet, then this matrix has rank 4.



          Now if the matrix has rank 4 then $w_{11}$ and $w_{21}$ can't both vanish. Changing the basis for $W$ by row operations if necessary, we can make $w_{11} = 1$ and $w_{21} = 0$. Proceeding in a similar fashion, we can arrange for $w_{12} = 0$ and $w_{22} = 1$. At this point all our choices are made, and so the matrix looks like



          $$begin{pmatrix}
          0 & 0 & 1 & 0 \
          0 & 0 & 0 & 1 \
          1 & 0 & a & b \
          0 & 1 & c & d
          end{pmatrix}$$



          for some $a,b,c,d$. And we see indeed that this matrix has rank four for any choice of $a,b,c,d$ whatsoever.



          You can do all similar problems the same way by Gaussian elimination. Just take into account that a matrix has rank less than $r$ iff all its $r times r$ minors vanish.





          In the last problem, be careful about what the word "general" means in algebraic geometry. It does not mean "in full generality," but rather "for most points" (to be precise, it means "on a dense open set.")



          So a general point of $sigma_1(L)$ is a line of the form



          $$begin{bmatrix}
          1 & ast & 0 &ast \
          0& 0& 1 &ast end{bmatrix}$$



          But of course $L$ meets itself, i.e. $L in sigma_1(L)$. And $L$ is not a line of this form.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            How to compute the form of a general point of $sigma_1(L)$ with this interpretation of "general"?
            $endgroup$
            – Augusto Pereira
            Jan 3 '16 at 18:43










          • $begingroup$
            Well, you need the matrix above to have rank 3. So think about what that means in terms of the minors.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 18:50










          • $begingroup$
            Shouldn't the matrix be allowed to have rank 3 or 2, the latter representing the line $L$? Also, wouldn't this give me all lines that intersect $L$? If not, then how would I detect that I'm only getting "general elements", and not all of them?
            $endgroup$
            – Augusto Pereira
            Jan 3 '16 at 18:59










          • $begingroup$
            The Schubert cell is the locus where the matrix has rank exactly 3. The Schubert variety is the locus where the matrix has rank 3 or lower. The reason for considering them both is that Schubert cells are always isomorphic to $mathbb{A}^n$ for some $n$, but are only locally closed, whereas Schubert varieties are closed but can have more problematic geometry, e.g. singularities.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 19:01










          • $begingroup$
            Since the locus where a polynomial (or set of polynomials) doesn't vanish is a dense open set, you see that a general element of the Schubert variety lies in the Schubert cell.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 19:02



















          0












          $begingroup$

          Note two matrices have the same row space iff they are row equivalent iff they have the same reduced echelon form. So there is a one one correspondence between 2 dimensional subspaces of C^4 and (2 by 4) rank 2 matrices in reduced echelon form. The six schubert cells correspond precisely to the 6 choices of the 2 pivot columns. the pivot columns are by definition the lexicographically earliest pair of axes that span a coordinate 2 plane to which the given row space projects isomorphically. Since projection is an isomorphism iff the row space misses the center of the projection, this has a characterization in terms of the row space not intersecting the given center. E.g the 1st two columns are pivots iff the row space projects isomorphically to the (X0,X1) coordinate space iff the row space has trivial intersection with X0=X1=0.



          In more detail (but different coordinates: (X,Y,Z,W)): if two matrices are row equivalent then they have the same row space, the span of their rows. The reduced echelon form reduces the original sequence of rows to a sequence which is independent, hence forms a basis for the row space. So one point of view is that finding the reduced echelon form amounts to choosing an especially nice or simple basis for the row space.



          From this perspective the process is very simple. If the rank is r, then there must exist some coordinate subspace of rank r onto which the row space projects isomorphically. If we find one, we can pull back the standard basis for this coordinate subspace to a basis of the row space via this isomorphism. This provides at most “m choose r” distinguished bases for the row space of an n by m matrix of rank r.



          The only one in echelon form is the one whose choice of r coordinates among the m possible coordinates, is lexicographically minimal. This provides a unique choice of ordered basis for the row space, hence the reduced echelon form of a given matrix is unique. I.e. its pivots correspond to the unique lexicographically minimal choice of coordinate subspace onto which the row space projects isomorphically.



          (It follows that the row space can also be viewed as the graph of a linear map from the coordinate space of pivot variables to that of non pivot variables, whose matrix is the transpose of the matrix of non pivot columns.)



          Grassmannian point of view for G(2,4) = planes in 4 space.
          G(2,4) = all planes in 4 space ≈ all possible 2 dimensional row spaces for 2 by 4 matrices ≈ all possible 2 by 4, rank 2, reduced echelon forms.



          Since projection onto a given coordinate subspace is isomorphic if and only if the center of projection does not meet the row space, this has an interpretation in terms of incidence relations as discussed previously. E.g. for a 2 by 4 matrix of rank 2, we can choose as a “flag” of subspaces the spaces X=0, X=Y=0 and X=Y=Z=0.



          Then projection onto the coordinate subspace of the first 2 coordinates, the X,Y subspace, is isomorphic if and only if the row space does not meet the subspace X=Y=0 non trivially, iff the first two columns are pivots. (4 parameters.) (your case #1.)



          Thus the row space does meet X=Y=0 non trivially iff the first two columns are not both pivots. If the row space does not meet the line X=Y=Z=0 then the 4th column is not a pivot. If the row space does not lie in the space X=0 then the first column is a pivot, so if all three of these hold, the pivots are the 1st and 3rd columns. (3 parameters.) (your case #2.)



          If the row space does lie in the space X=0 but does not contain the line X=Y=Z=0 then the row space does not have the 1st column as pivot, and does not have the 4th column as pivot, so must have the 2nd and 3rd columns as pivots. (2 parameters.)



          If the row space does contain the line X=Y=Z=0 but does not lie in the space X=0, then the 1st column and also the 4th column is a pivot. (2 parameters.)



          If the row space does contain the line X=Y=Z=0 and also lies in the space X=0, then the 1st column is not a pivot but the 4th is. If also the row space does not equal X=Y=0 then the 3rd and 4th column are not both pivots, so the pivots are the are the 2nd and 4th. (1 parameter.)



          If the row space is X=Y=0 then the pivots are the 3rd and 4th columns. (0 parameters.)






          share|cite|improve this answer











          $endgroup$













            Your Answer





            StackExchange.ifUsing("editor", function () {
            return StackExchange.using("mathjaxEditing", function () {
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            });
            });
            }, "mathjax-editing");

            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%2f1597837%2fschubert-decomposition-of-a-grassmannian%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









            1












            $begingroup$

            A line in $mathbb{P}^3$ corresponds to a two-dimensional subspace of $mathbb{C}^4$.



            Given two two-dimensional subspaces $V, W subset mathbb{C}^4$, there are three possibilities for $dim V cap W$: it is either 0 (the two lines are disjoint), 1 (the two lines meet in a point), or 2 (the two lines are in fact the same line).



            These correspond to three possibilities for $dim(V + W)$: it is either 4, 3, or 2, respectively.



            How do we calculate the dimension of $V+W$? Well, if $V$ is spanned by $e_3$ and $e_4$ and $W$ is spanned by $w_1$ and $w_2$ then



            $$dim(V + W) = operatorname{rank}begin{pmatrix}
            0 & 0 & 1 & 0 \
            0 & 0 & 0 & 1 \
            w_{11} & w_{12} & w_{13} & w_{14} \
            w_{21} & w_{22} & w_{23} & w_{24}
            end{pmatrix}.$$



            If $V$ and $W$ represent lines that don't meet, then this matrix has rank 4.



            Now if the matrix has rank 4 then $w_{11}$ and $w_{21}$ can't both vanish. Changing the basis for $W$ by row operations if necessary, we can make $w_{11} = 1$ and $w_{21} = 0$. Proceeding in a similar fashion, we can arrange for $w_{12} = 0$ and $w_{22} = 1$. At this point all our choices are made, and so the matrix looks like



            $$begin{pmatrix}
            0 & 0 & 1 & 0 \
            0 & 0 & 0 & 1 \
            1 & 0 & a & b \
            0 & 1 & c & d
            end{pmatrix}$$



            for some $a,b,c,d$. And we see indeed that this matrix has rank four for any choice of $a,b,c,d$ whatsoever.



            You can do all similar problems the same way by Gaussian elimination. Just take into account that a matrix has rank less than $r$ iff all its $r times r$ minors vanish.





            In the last problem, be careful about what the word "general" means in algebraic geometry. It does not mean "in full generality," but rather "for most points" (to be precise, it means "on a dense open set.")



            So a general point of $sigma_1(L)$ is a line of the form



            $$begin{bmatrix}
            1 & ast & 0 &ast \
            0& 0& 1 &ast end{bmatrix}$$



            But of course $L$ meets itself, i.e. $L in sigma_1(L)$. And $L$ is not a line of this form.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              How to compute the form of a general point of $sigma_1(L)$ with this interpretation of "general"?
              $endgroup$
              – Augusto Pereira
              Jan 3 '16 at 18:43










            • $begingroup$
              Well, you need the matrix above to have rank 3. So think about what that means in terms of the minors.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 18:50










            • $begingroup$
              Shouldn't the matrix be allowed to have rank 3 or 2, the latter representing the line $L$? Also, wouldn't this give me all lines that intersect $L$? If not, then how would I detect that I'm only getting "general elements", and not all of them?
              $endgroup$
              – Augusto Pereira
              Jan 3 '16 at 18:59










            • $begingroup$
              The Schubert cell is the locus where the matrix has rank exactly 3. The Schubert variety is the locus where the matrix has rank 3 or lower. The reason for considering them both is that Schubert cells are always isomorphic to $mathbb{A}^n$ for some $n$, but are only locally closed, whereas Schubert varieties are closed but can have more problematic geometry, e.g. singularities.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 19:01










            • $begingroup$
              Since the locus where a polynomial (or set of polynomials) doesn't vanish is a dense open set, you see that a general element of the Schubert variety lies in the Schubert cell.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 19:02
















            1












            $begingroup$

            A line in $mathbb{P}^3$ corresponds to a two-dimensional subspace of $mathbb{C}^4$.



            Given two two-dimensional subspaces $V, W subset mathbb{C}^4$, there are three possibilities for $dim V cap W$: it is either 0 (the two lines are disjoint), 1 (the two lines meet in a point), or 2 (the two lines are in fact the same line).



            These correspond to three possibilities for $dim(V + W)$: it is either 4, 3, or 2, respectively.



            How do we calculate the dimension of $V+W$? Well, if $V$ is spanned by $e_3$ and $e_4$ and $W$ is spanned by $w_1$ and $w_2$ then



            $$dim(V + W) = operatorname{rank}begin{pmatrix}
            0 & 0 & 1 & 0 \
            0 & 0 & 0 & 1 \
            w_{11} & w_{12} & w_{13} & w_{14} \
            w_{21} & w_{22} & w_{23} & w_{24}
            end{pmatrix}.$$



            If $V$ and $W$ represent lines that don't meet, then this matrix has rank 4.



            Now if the matrix has rank 4 then $w_{11}$ and $w_{21}$ can't both vanish. Changing the basis for $W$ by row operations if necessary, we can make $w_{11} = 1$ and $w_{21} = 0$. Proceeding in a similar fashion, we can arrange for $w_{12} = 0$ and $w_{22} = 1$. At this point all our choices are made, and so the matrix looks like



            $$begin{pmatrix}
            0 & 0 & 1 & 0 \
            0 & 0 & 0 & 1 \
            1 & 0 & a & b \
            0 & 1 & c & d
            end{pmatrix}$$



            for some $a,b,c,d$. And we see indeed that this matrix has rank four for any choice of $a,b,c,d$ whatsoever.



            You can do all similar problems the same way by Gaussian elimination. Just take into account that a matrix has rank less than $r$ iff all its $r times r$ minors vanish.





            In the last problem, be careful about what the word "general" means in algebraic geometry. It does not mean "in full generality," but rather "for most points" (to be precise, it means "on a dense open set.")



            So a general point of $sigma_1(L)$ is a line of the form



            $$begin{bmatrix}
            1 & ast & 0 &ast \
            0& 0& 1 &ast end{bmatrix}$$



            But of course $L$ meets itself, i.e. $L in sigma_1(L)$. And $L$ is not a line of this form.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              How to compute the form of a general point of $sigma_1(L)$ with this interpretation of "general"?
              $endgroup$
              – Augusto Pereira
              Jan 3 '16 at 18:43










            • $begingroup$
              Well, you need the matrix above to have rank 3. So think about what that means in terms of the minors.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 18:50










            • $begingroup$
              Shouldn't the matrix be allowed to have rank 3 or 2, the latter representing the line $L$? Also, wouldn't this give me all lines that intersect $L$? If not, then how would I detect that I'm only getting "general elements", and not all of them?
              $endgroup$
              – Augusto Pereira
              Jan 3 '16 at 18:59










            • $begingroup$
              The Schubert cell is the locus where the matrix has rank exactly 3. The Schubert variety is the locus where the matrix has rank 3 or lower. The reason for considering them both is that Schubert cells are always isomorphic to $mathbb{A}^n$ for some $n$, but are only locally closed, whereas Schubert varieties are closed but can have more problematic geometry, e.g. singularities.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 19:01










            • $begingroup$
              Since the locus where a polynomial (or set of polynomials) doesn't vanish is a dense open set, you see that a general element of the Schubert variety lies in the Schubert cell.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 19:02














            1












            1








            1





            $begingroup$

            A line in $mathbb{P}^3$ corresponds to a two-dimensional subspace of $mathbb{C}^4$.



            Given two two-dimensional subspaces $V, W subset mathbb{C}^4$, there are three possibilities for $dim V cap W$: it is either 0 (the two lines are disjoint), 1 (the two lines meet in a point), or 2 (the two lines are in fact the same line).



            These correspond to three possibilities for $dim(V + W)$: it is either 4, 3, or 2, respectively.



            How do we calculate the dimension of $V+W$? Well, if $V$ is spanned by $e_3$ and $e_4$ and $W$ is spanned by $w_1$ and $w_2$ then



            $$dim(V + W) = operatorname{rank}begin{pmatrix}
            0 & 0 & 1 & 0 \
            0 & 0 & 0 & 1 \
            w_{11} & w_{12} & w_{13} & w_{14} \
            w_{21} & w_{22} & w_{23} & w_{24}
            end{pmatrix}.$$



            If $V$ and $W$ represent lines that don't meet, then this matrix has rank 4.



            Now if the matrix has rank 4 then $w_{11}$ and $w_{21}$ can't both vanish. Changing the basis for $W$ by row operations if necessary, we can make $w_{11} = 1$ and $w_{21} = 0$. Proceeding in a similar fashion, we can arrange for $w_{12} = 0$ and $w_{22} = 1$. At this point all our choices are made, and so the matrix looks like



            $$begin{pmatrix}
            0 & 0 & 1 & 0 \
            0 & 0 & 0 & 1 \
            1 & 0 & a & b \
            0 & 1 & c & d
            end{pmatrix}$$



            for some $a,b,c,d$. And we see indeed that this matrix has rank four for any choice of $a,b,c,d$ whatsoever.



            You can do all similar problems the same way by Gaussian elimination. Just take into account that a matrix has rank less than $r$ iff all its $r times r$ minors vanish.





            In the last problem, be careful about what the word "general" means in algebraic geometry. It does not mean "in full generality," but rather "for most points" (to be precise, it means "on a dense open set.")



            So a general point of $sigma_1(L)$ is a line of the form



            $$begin{bmatrix}
            1 & ast & 0 &ast \
            0& 0& 1 &ast end{bmatrix}$$



            But of course $L$ meets itself, i.e. $L in sigma_1(L)$. And $L$ is not a line of this form.






            share|cite|improve this answer











            $endgroup$



            A line in $mathbb{P}^3$ corresponds to a two-dimensional subspace of $mathbb{C}^4$.



            Given two two-dimensional subspaces $V, W subset mathbb{C}^4$, there are three possibilities for $dim V cap W$: it is either 0 (the two lines are disjoint), 1 (the two lines meet in a point), or 2 (the two lines are in fact the same line).



            These correspond to three possibilities for $dim(V + W)$: it is either 4, 3, or 2, respectively.



            How do we calculate the dimension of $V+W$? Well, if $V$ is spanned by $e_3$ and $e_4$ and $W$ is spanned by $w_1$ and $w_2$ then



            $$dim(V + W) = operatorname{rank}begin{pmatrix}
            0 & 0 & 1 & 0 \
            0 & 0 & 0 & 1 \
            w_{11} & w_{12} & w_{13} & w_{14} \
            w_{21} & w_{22} & w_{23} & w_{24}
            end{pmatrix}.$$



            If $V$ and $W$ represent lines that don't meet, then this matrix has rank 4.



            Now if the matrix has rank 4 then $w_{11}$ and $w_{21}$ can't both vanish. Changing the basis for $W$ by row operations if necessary, we can make $w_{11} = 1$ and $w_{21} = 0$. Proceeding in a similar fashion, we can arrange for $w_{12} = 0$ and $w_{22} = 1$. At this point all our choices are made, and so the matrix looks like



            $$begin{pmatrix}
            0 & 0 & 1 & 0 \
            0 & 0 & 0 & 1 \
            1 & 0 & a & b \
            0 & 1 & c & d
            end{pmatrix}$$



            for some $a,b,c,d$. And we see indeed that this matrix has rank four for any choice of $a,b,c,d$ whatsoever.



            You can do all similar problems the same way by Gaussian elimination. Just take into account that a matrix has rank less than $r$ iff all its $r times r$ minors vanish.





            In the last problem, be careful about what the word "general" means in algebraic geometry. It does not mean "in full generality," but rather "for most points" (to be precise, it means "on a dense open set.")



            So a general point of $sigma_1(L)$ is a line of the form



            $$begin{bmatrix}
            1 & ast & 0 &ast \
            0& 0& 1 &ast end{bmatrix}$$



            But of course $L$ meets itself, i.e. $L in sigma_1(L)$. And $L$ is not a line of this form.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Jan 3 '16 at 10:44

























            answered Jan 3 '16 at 10:34









            Daniel McLauryDaniel McLaury

            15.7k32980




            15.7k32980












            • $begingroup$
              How to compute the form of a general point of $sigma_1(L)$ with this interpretation of "general"?
              $endgroup$
              – Augusto Pereira
              Jan 3 '16 at 18:43










            • $begingroup$
              Well, you need the matrix above to have rank 3. So think about what that means in terms of the minors.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 18:50










            • $begingroup$
              Shouldn't the matrix be allowed to have rank 3 or 2, the latter representing the line $L$? Also, wouldn't this give me all lines that intersect $L$? If not, then how would I detect that I'm only getting "general elements", and not all of them?
              $endgroup$
              – Augusto Pereira
              Jan 3 '16 at 18:59










            • $begingroup$
              The Schubert cell is the locus where the matrix has rank exactly 3. The Schubert variety is the locus where the matrix has rank 3 or lower. The reason for considering them both is that Schubert cells are always isomorphic to $mathbb{A}^n$ for some $n$, but are only locally closed, whereas Schubert varieties are closed but can have more problematic geometry, e.g. singularities.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 19:01










            • $begingroup$
              Since the locus where a polynomial (or set of polynomials) doesn't vanish is a dense open set, you see that a general element of the Schubert variety lies in the Schubert cell.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 19:02


















            • $begingroup$
              How to compute the form of a general point of $sigma_1(L)$ with this interpretation of "general"?
              $endgroup$
              – Augusto Pereira
              Jan 3 '16 at 18:43










            • $begingroup$
              Well, you need the matrix above to have rank 3. So think about what that means in terms of the minors.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 18:50










            • $begingroup$
              Shouldn't the matrix be allowed to have rank 3 or 2, the latter representing the line $L$? Also, wouldn't this give me all lines that intersect $L$? If not, then how would I detect that I'm only getting "general elements", and not all of them?
              $endgroup$
              – Augusto Pereira
              Jan 3 '16 at 18:59










            • $begingroup$
              The Schubert cell is the locus where the matrix has rank exactly 3. The Schubert variety is the locus where the matrix has rank 3 or lower. The reason for considering them both is that Schubert cells are always isomorphic to $mathbb{A}^n$ for some $n$, but are only locally closed, whereas Schubert varieties are closed but can have more problematic geometry, e.g. singularities.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 19:01










            • $begingroup$
              Since the locus where a polynomial (or set of polynomials) doesn't vanish is a dense open set, you see that a general element of the Schubert variety lies in the Schubert cell.
              $endgroup$
              – Daniel McLaury
              Jan 3 '16 at 19:02
















            $begingroup$
            How to compute the form of a general point of $sigma_1(L)$ with this interpretation of "general"?
            $endgroup$
            – Augusto Pereira
            Jan 3 '16 at 18:43




            $begingroup$
            How to compute the form of a general point of $sigma_1(L)$ with this interpretation of "general"?
            $endgroup$
            – Augusto Pereira
            Jan 3 '16 at 18:43












            $begingroup$
            Well, you need the matrix above to have rank 3. So think about what that means in terms of the minors.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 18:50




            $begingroup$
            Well, you need the matrix above to have rank 3. So think about what that means in terms of the minors.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 18:50












            $begingroup$
            Shouldn't the matrix be allowed to have rank 3 or 2, the latter representing the line $L$? Also, wouldn't this give me all lines that intersect $L$? If not, then how would I detect that I'm only getting "general elements", and not all of them?
            $endgroup$
            – Augusto Pereira
            Jan 3 '16 at 18:59




            $begingroup$
            Shouldn't the matrix be allowed to have rank 3 or 2, the latter representing the line $L$? Also, wouldn't this give me all lines that intersect $L$? If not, then how would I detect that I'm only getting "general elements", and not all of them?
            $endgroup$
            – Augusto Pereira
            Jan 3 '16 at 18:59












            $begingroup$
            The Schubert cell is the locus where the matrix has rank exactly 3. The Schubert variety is the locus where the matrix has rank 3 or lower. The reason for considering them both is that Schubert cells are always isomorphic to $mathbb{A}^n$ for some $n$, but are only locally closed, whereas Schubert varieties are closed but can have more problematic geometry, e.g. singularities.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 19:01




            $begingroup$
            The Schubert cell is the locus where the matrix has rank exactly 3. The Schubert variety is the locus where the matrix has rank 3 or lower. The reason for considering them both is that Schubert cells are always isomorphic to $mathbb{A}^n$ for some $n$, but are only locally closed, whereas Schubert varieties are closed but can have more problematic geometry, e.g. singularities.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 19:01












            $begingroup$
            Since the locus where a polynomial (or set of polynomials) doesn't vanish is a dense open set, you see that a general element of the Schubert variety lies in the Schubert cell.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 19:02




            $begingroup$
            Since the locus where a polynomial (or set of polynomials) doesn't vanish is a dense open set, you see that a general element of the Schubert variety lies in the Schubert cell.
            $endgroup$
            – Daniel McLaury
            Jan 3 '16 at 19:02











            0












            $begingroup$

            Note two matrices have the same row space iff they are row equivalent iff they have the same reduced echelon form. So there is a one one correspondence between 2 dimensional subspaces of C^4 and (2 by 4) rank 2 matrices in reduced echelon form. The six schubert cells correspond precisely to the 6 choices of the 2 pivot columns. the pivot columns are by definition the lexicographically earliest pair of axes that span a coordinate 2 plane to which the given row space projects isomorphically. Since projection is an isomorphism iff the row space misses the center of the projection, this has a characterization in terms of the row space not intersecting the given center. E.g the 1st two columns are pivots iff the row space projects isomorphically to the (X0,X1) coordinate space iff the row space has trivial intersection with X0=X1=0.



            In more detail (but different coordinates: (X,Y,Z,W)): if two matrices are row equivalent then they have the same row space, the span of their rows. The reduced echelon form reduces the original sequence of rows to a sequence which is independent, hence forms a basis for the row space. So one point of view is that finding the reduced echelon form amounts to choosing an especially nice or simple basis for the row space.



            From this perspective the process is very simple. If the rank is r, then there must exist some coordinate subspace of rank r onto which the row space projects isomorphically. If we find one, we can pull back the standard basis for this coordinate subspace to a basis of the row space via this isomorphism. This provides at most “m choose r” distinguished bases for the row space of an n by m matrix of rank r.



            The only one in echelon form is the one whose choice of r coordinates among the m possible coordinates, is lexicographically minimal. This provides a unique choice of ordered basis for the row space, hence the reduced echelon form of a given matrix is unique. I.e. its pivots correspond to the unique lexicographically minimal choice of coordinate subspace onto which the row space projects isomorphically.



            (It follows that the row space can also be viewed as the graph of a linear map from the coordinate space of pivot variables to that of non pivot variables, whose matrix is the transpose of the matrix of non pivot columns.)



            Grassmannian point of view for G(2,4) = planes in 4 space.
            G(2,4) = all planes in 4 space ≈ all possible 2 dimensional row spaces for 2 by 4 matrices ≈ all possible 2 by 4, rank 2, reduced echelon forms.



            Since projection onto a given coordinate subspace is isomorphic if and only if the center of projection does not meet the row space, this has an interpretation in terms of incidence relations as discussed previously. E.g. for a 2 by 4 matrix of rank 2, we can choose as a “flag” of subspaces the spaces X=0, X=Y=0 and X=Y=Z=0.



            Then projection onto the coordinate subspace of the first 2 coordinates, the X,Y subspace, is isomorphic if and only if the row space does not meet the subspace X=Y=0 non trivially, iff the first two columns are pivots. (4 parameters.) (your case #1.)



            Thus the row space does meet X=Y=0 non trivially iff the first two columns are not both pivots. If the row space does not meet the line X=Y=Z=0 then the 4th column is not a pivot. If the row space does not lie in the space X=0 then the first column is a pivot, so if all three of these hold, the pivots are the 1st and 3rd columns. (3 parameters.) (your case #2.)



            If the row space does lie in the space X=0 but does not contain the line X=Y=Z=0 then the row space does not have the 1st column as pivot, and does not have the 4th column as pivot, so must have the 2nd and 3rd columns as pivots. (2 parameters.)



            If the row space does contain the line X=Y=Z=0 but does not lie in the space X=0, then the 1st column and also the 4th column is a pivot. (2 parameters.)



            If the row space does contain the line X=Y=Z=0 and also lies in the space X=0, then the 1st column is not a pivot but the 4th is. If also the row space does not equal X=Y=0 then the 3rd and 4th column are not both pivots, so the pivots are the are the 2nd and 4th. (1 parameter.)



            If the row space is X=Y=0 then the pivots are the 3rd and 4th columns. (0 parameters.)






            share|cite|improve this answer











            $endgroup$


















              0












              $begingroup$

              Note two matrices have the same row space iff they are row equivalent iff they have the same reduced echelon form. So there is a one one correspondence between 2 dimensional subspaces of C^4 and (2 by 4) rank 2 matrices in reduced echelon form. The six schubert cells correspond precisely to the 6 choices of the 2 pivot columns. the pivot columns are by definition the lexicographically earliest pair of axes that span a coordinate 2 plane to which the given row space projects isomorphically. Since projection is an isomorphism iff the row space misses the center of the projection, this has a characterization in terms of the row space not intersecting the given center. E.g the 1st two columns are pivots iff the row space projects isomorphically to the (X0,X1) coordinate space iff the row space has trivial intersection with X0=X1=0.



              In more detail (but different coordinates: (X,Y,Z,W)): if two matrices are row equivalent then they have the same row space, the span of their rows. The reduced echelon form reduces the original sequence of rows to a sequence which is independent, hence forms a basis for the row space. So one point of view is that finding the reduced echelon form amounts to choosing an especially nice or simple basis for the row space.



              From this perspective the process is very simple. If the rank is r, then there must exist some coordinate subspace of rank r onto which the row space projects isomorphically. If we find one, we can pull back the standard basis for this coordinate subspace to a basis of the row space via this isomorphism. This provides at most “m choose r” distinguished bases for the row space of an n by m matrix of rank r.



              The only one in echelon form is the one whose choice of r coordinates among the m possible coordinates, is lexicographically minimal. This provides a unique choice of ordered basis for the row space, hence the reduced echelon form of a given matrix is unique. I.e. its pivots correspond to the unique lexicographically minimal choice of coordinate subspace onto which the row space projects isomorphically.



              (It follows that the row space can also be viewed as the graph of a linear map from the coordinate space of pivot variables to that of non pivot variables, whose matrix is the transpose of the matrix of non pivot columns.)



              Grassmannian point of view for G(2,4) = planes in 4 space.
              G(2,4) = all planes in 4 space ≈ all possible 2 dimensional row spaces for 2 by 4 matrices ≈ all possible 2 by 4, rank 2, reduced echelon forms.



              Since projection onto a given coordinate subspace is isomorphic if and only if the center of projection does not meet the row space, this has an interpretation in terms of incidence relations as discussed previously. E.g. for a 2 by 4 matrix of rank 2, we can choose as a “flag” of subspaces the spaces X=0, X=Y=0 and X=Y=Z=0.



              Then projection onto the coordinate subspace of the first 2 coordinates, the X,Y subspace, is isomorphic if and only if the row space does not meet the subspace X=Y=0 non trivially, iff the first two columns are pivots. (4 parameters.) (your case #1.)



              Thus the row space does meet X=Y=0 non trivially iff the first two columns are not both pivots. If the row space does not meet the line X=Y=Z=0 then the 4th column is not a pivot. If the row space does not lie in the space X=0 then the first column is a pivot, so if all three of these hold, the pivots are the 1st and 3rd columns. (3 parameters.) (your case #2.)



              If the row space does lie in the space X=0 but does not contain the line X=Y=Z=0 then the row space does not have the 1st column as pivot, and does not have the 4th column as pivot, so must have the 2nd and 3rd columns as pivots. (2 parameters.)



              If the row space does contain the line X=Y=Z=0 but does not lie in the space X=0, then the 1st column and also the 4th column is a pivot. (2 parameters.)



              If the row space does contain the line X=Y=Z=0 and also lies in the space X=0, then the 1st column is not a pivot but the 4th is. If also the row space does not equal X=Y=0 then the 3rd and 4th column are not both pivots, so the pivots are the are the 2nd and 4th. (1 parameter.)



              If the row space is X=Y=0 then the pivots are the 3rd and 4th columns. (0 parameters.)






              share|cite|improve this answer











              $endgroup$
















                0












                0








                0





                $begingroup$

                Note two matrices have the same row space iff they are row equivalent iff they have the same reduced echelon form. So there is a one one correspondence between 2 dimensional subspaces of C^4 and (2 by 4) rank 2 matrices in reduced echelon form. The six schubert cells correspond precisely to the 6 choices of the 2 pivot columns. the pivot columns are by definition the lexicographically earliest pair of axes that span a coordinate 2 plane to which the given row space projects isomorphically. Since projection is an isomorphism iff the row space misses the center of the projection, this has a characterization in terms of the row space not intersecting the given center. E.g the 1st two columns are pivots iff the row space projects isomorphically to the (X0,X1) coordinate space iff the row space has trivial intersection with X0=X1=0.



                In more detail (but different coordinates: (X,Y,Z,W)): if two matrices are row equivalent then they have the same row space, the span of their rows. The reduced echelon form reduces the original sequence of rows to a sequence which is independent, hence forms a basis for the row space. So one point of view is that finding the reduced echelon form amounts to choosing an especially nice or simple basis for the row space.



                From this perspective the process is very simple. If the rank is r, then there must exist some coordinate subspace of rank r onto which the row space projects isomorphically. If we find one, we can pull back the standard basis for this coordinate subspace to a basis of the row space via this isomorphism. This provides at most “m choose r” distinguished bases for the row space of an n by m matrix of rank r.



                The only one in echelon form is the one whose choice of r coordinates among the m possible coordinates, is lexicographically minimal. This provides a unique choice of ordered basis for the row space, hence the reduced echelon form of a given matrix is unique. I.e. its pivots correspond to the unique lexicographically minimal choice of coordinate subspace onto which the row space projects isomorphically.



                (It follows that the row space can also be viewed as the graph of a linear map from the coordinate space of pivot variables to that of non pivot variables, whose matrix is the transpose of the matrix of non pivot columns.)



                Grassmannian point of view for G(2,4) = planes in 4 space.
                G(2,4) = all planes in 4 space ≈ all possible 2 dimensional row spaces for 2 by 4 matrices ≈ all possible 2 by 4, rank 2, reduced echelon forms.



                Since projection onto a given coordinate subspace is isomorphic if and only if the center of projection does not meet the row space, this has an interpretation in terms of incidence relations as discussed previously. E.g. for a 2 by 4 matrix of rank 2, we can choose as a “flag” of subspaces the spaces X=0, X=Y=0 and X=Y=Z=0.



                Then projection onto the coordinate subspace of the first 2 coordinates, the X,Y subspace, is isomorphic if and only if the row space does not meet the subspace X=Y=0 non trivially, iff the first two columns are pivots. (4 parameters.) (your case #1.)



                Thus the row space does meet X=Y=0 non trivially iff the first two columns are not both pivots. If the row space does not meet the line X=Y=Z=0 then the 4th column is not a pivot. If the row space does not lie in the space X=0 then the first column is a pivot, so if all three of these hold, the pivots are the 1st and 3rd columns. (3 parameters.) (your case #2.)



                If the row space does lie in the space X=0 but does not contain the line X=Y=Z=0 then the row space does not have the 1st column as pivot, and does not have the 4th column as pivot, so must have the 2nd and 3rd columns as pivots. (2 parameters.)



                If the row space does contain the line X=Y=Z=0 but does not lie in the space X=0, then the 1st column and also the 4th column is a pivot. (2 parameters.)



                If the row space does contain the line X=Y=Z=0 and also lies in the space X=0, then the 1st column is not a pivot but the 4th is. If also the row space does not equal X=Y=0 then the 3rd and 4th column are not both pivots, so the pivots are the are the 2nd and 4th. (1 parameter.)



                If the row space is X=Y=0 then the pivots are the 3rd and 4th columns. (0 parameters.)






                share|cite|improve this answer











                $endgroup$



                Note two matrices have the same row space iff they are row equivalent iff they have the same reduced echelon form. So there is a one one correspondence between 2 dimensional subspaces of C^4 and (2 by 4) rank 2 matrices in reduced echelon form. The six schubert cells correspond precisely to the 6 choices of the 2 pivot columns. the pivot columns are by definition the lexicographically earliest pair of axes that span a coordinate 2 plane to which the given row space projects isomorphically. Since projection is an isomorphism iff the row space misses the center of the projection, this has a characterization in terms of the row space not intersecting the given center. E.g the 1st two columns are pivots iff the row space projects isomorphically to the (X0,X1) coordinate space iff the row space has trivial intersection with X0=X1=0.



                In more detail (but different coordinates: (X,Y,Z,W)): if two matrices are row equivalent then they have the same row space, the span of their rows. The reduced echelon form reduces the original sequence of rows to a sequence which is independent, hence forms a basis for the row space. So one point of view is that finding the reduced echelon form amounts to choosing an especially nice or simple basis for the row space.



                From this perspective the process is very simple. If the rank is r, then there must exist some coordinate subspace of rank r onto which the row space projects isomorphically. If we find one, we can pull back the standard basis for this coordinate subspace to a basis of the row space via this isomorphism. This provides at most “m choose r” distinguished bases for the row space of an n by m matrix of rank r.



                The only one in echelon form is the one whose choice of r coordinates among the m possible coordinates, is lexicographically minimal. This provides a unique choice of ordered basis for the row space, hence the reduced echelon form of a given matrix is unique. I.e. its pivots correspond to the unique lexicographically minimal choice of coordinate subspace onto which the row space projects isomorphically.



                (It follows that the row space can also be viewed as the graph of a linear map from the coordinate space of pivot variables to that of non pivot variables, whose matrix is the transpose of the matrix of non pivot columns.)



                Grassmannian point of view for G(2,4) = planes in 4 space.
                G(2,4) = all planes in 4 space ≈ all possible 2 dimensional row spaces for 2 by 4 matrices ≈ all possible 2 by 4, rank 2, reduced echelon forms.



                Since projection onto a given coordinate subspace is isomorphic if and only if the center of projection does not meet the row space, this has an interpretation in terms of incidence relations as discussed previously. E.g. for a 2 by 4 matrix of rank 2, we can choose as a “flag” of subspaces the spaces X=0, X=Y=0 and X=Y=Z=0.



                Then projection onto the coordinate subspace of the first 2 coordinates, the X,Y subspace, is isomorphic if and only if the row space does not meet the subspace X=Y=0 non trivially, iff the first two columns are pivots. (4 parameters.) (your case #1.)



                Thus the row space does meet X=Y=0 non trivially iff the first two columns are not both pivots. If the row space does not meet the line X=Y=Z=0 then the 4th column is not a pivot. If the row space does not lie in the space X=0 then the first column is a pivot, so if all three of these hold, the pivots are the 1st and 3rd columns. (3 parameters.) (your case #2.)



                If the row space does lie in the space X=0 but does not contain the line X=Y=Z=0 then the row space does not have the 1st column as pivot, and does not have the 4th column as pivot, so must have the 2nd and 3rd columns as pivots. (2 parameters.)



                If the row space does contain the line X=Y=Z=0 but does not lie in the space X=0, then the 1st column and also the 4th column is a pivot. (2 parameters.)



                If the row space does contain the line X=Y=Z=0 and also lies in the space X=0, then the 1st column is not a pivot but the 4th is. If also the row space does not equal X=Y=0 then the 3rd and 4th column are not both pivots, so the pivots are the are the 2nd and 4th. (1 parameter.)



                If the row space is X=Y=0 then the pivots are the 3rd and 4th columns. (0 parameters.)







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Feb 19 '17 at 4:36

























                answered Feb 17 '17 at 19:03









                roy smithroy smith

                919711




                919711






























                    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%2f1597837%2fschubert-decomposition-of-a-grassmannian%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

                    Bressuire

                    Cabo Verde

                    Gyllenstierna