---
title: Matrix Schubert Varieties
url: https://www.emergentmind.com/topics/matrix-schubert-varieties
type: topic
---

# Matrix Schubert Varieties

Matrix Schubert varieties are affine degeneracy loci attached to permutations and partial permutations. For \(w\in S_n\), they can be defined either as the Zariski closure of the \((B_-\times B_+)\)-orbit of the permutation matrix \(M_w\) in \(M_n\), or as the locus of matrices whose northwest submatrices satisfy the rank bounds
\[
r_w(i,j)=\#\{\,k\le i:\, w(k)\le j\,\},\qquad 
X_w=\left\{M\in M_{n\times n}:\operatorname{rank}(M_{[1..i],[1..j]})\le r_w(i,j)\ \text{for all }i,j\right\}.
\]
Their defining ideals are Schubert determinantal ideals generated by minors, and they provide the affine model underlying much of the Gröbner geometry, equivariant geometry, and combinatorics of Schubert polynomials [2306.03006, 2003.13719].

## 1. Foundational construction

Let \(Z=(z_{ij})\) be the generic \(n\times n\) matrix and \(R=k[Z]\). The Schubert determinantal ideal associated to \(w\in S_n\) is
\[
I_w=\left\langle\text{all minors of size }r_w(i,j)+1\text{ of }Z_{[1..i],[1..j]}\text{ for all }i,j\right\rangle.
\]
Equivalently, \(X_w=\operatorname{Spec}(R/I_w)\) is the affine scheme cut out by the northwest rank conditions. In orbit-theoretic language, if \(B_-\) and \(B_+\) are the lower- and upper-triangular groups, then \(X_w=\overline{(B_-\times B_+)\cdot M_w}\subset M_n\) [2306.03006].

The combinatorics is organized by the Rothe diagram
\[
D(w)=\{(i,j)\in[n]^2: w(i)>j,\ w^{-1}(j)>i\},
\]
and by the essential set \(\operatorname{Ess}(w)\), consisting of southeast corners of connected components of \(D(w)\). Fulton showed that one may generate \(I_w\) using only essential positions:
\[
I_w=
\left\langle
\text{minors of size }r_w(i,j)+1\text{ of }Z_{[1..i],[1..j]}:(i,j)\in \operatorname{Ess}(w)
\right\rangle.
\]
He also showed that \(I_w\) is prime, so \(X_w\) is reduced and irreducible [2003.13719].

For permutations, the codimension is \(|D(w)|=\ell(w)\), the Coxeter length, and hence
\[
\dim X_w=n^2-\ell(w).
\]
The same rank-inequality formalism extends to partial permutations in rectangular matrix spaces; after extending a partial permutation \(w\) to a genuine permutation \(\widetilde w\), one has \(X_{\widetilde w}\cong X_w\times K^{n^2-lm}\). This reduction places many structural questions for partial permutations inside the square case [1310.6473].

## 2. Determinantal ideals and minimal equations

Fulton’s essential generators are generally not minimal. Gao and Yong introduced a finer selection rule based on three notions for an essential minor \(m_{I,J}\): it belongs to an essential position \(e=(i,j)\) if \(I\subseteq[i]\), \(J\subseteq[j]\), and \(|I|=|J|=r_w(i,j)+1\); it attends a lower-rank essential position if its row and column sets force vanishing by cofactor expansion against smaller essential conditions; and it is elusive if it does not attend any lower-rank essential position. Their main theorem states that \(I_w\) is minimally generated by the elusive minors [2201.06522].

This description produces canonical generators indexed by boxes of the Rothe diagram. If \(b=(i,j)\in D(w)\) and \(r=r_w(i,j)\), then the “corner minor”
\[
\Delta_{[\,i-r,\,i\,],\,[\,j-r,\,j\,]}(X)
\]
is elusive. In particular, there is always at least one minimal generator attached to each Rothe-diagram box. In the Grassmannian case, where \(\operatorname{Ess}(w)\) has a single element, every essential minor is automatically elusive, so Fulton’s list is already minimal [2201.06522].

Under any antidiagonal term order, Gao–Yong’s minimal generating set remains a Gröbner basis. Stelzer showed that if a degree-\(d\) element occurs in the reduced Gröbner basis under such a term order, then it has at least \(2^{d-1}\) terms; this lower bound is sharp. The same paper proved that \(I_w\) is binomial if and only if \(w\) avoids the patterns \(1243\) and \(2143\), and that Gao–Yong’s minimal Gröbner basis is reduced if and only if \(w\) is vexillary, i.e. \(2143\)-avoiding [2306.03006].

## 3. Antidiagonal Gröbner geometry and Schubert polynomials

The foundational Gröbner picture uses antidiagonal term orders: for every minor, the initial term is the antidiagonal monomial. Knutson and Miller proved that under any such order the Fulton generators form a Gröbner basis for \(I_w\). Consequently, \(\operatorname{in}_\prec(I_w)\) is squarefree, and the initial scheme is a union of coordinate subspaces [2003.13719].

These irreducible components are indexed by ordinary pipe dreams, or RC-graphs, for \(w\), each with multiplicity \(1\). This converts the geometry of matrix Schubert varieties into the pipe-dream formula for double Schubert polynomials:
\[
\mathfrak{S}_w(\mathbf{x};\mathbf{y})
=
\sum_D
\prod_{(i,j)\in \mathrm{crosses}(D)}(x_i-y_j).
\]
Setting \(\mathbf y=0\) gives the single Schubert polynomial. The identification proceeds through \(T\times T\)-equivariant classes: the class of \(X_w\) equals the class of its antidiagonal initial scheme, and additivity over coordinate components recovers the combinatorial expansion [2003.13719].

This antidiagonal geometry also supports alternative positive models. The prism tableau model expresses \(\mathfrak S_w\) as a weight generating function over minimal prism tableaux without unstable triples, and its proof proceeds by comparing antidiagonal Gröbner degenerations, plus diagrams, and overlays of biGrassmannian pieces. In the Grassmannian case, the construction reduces to semistandard Young tableaux and recovers the Schur polynomial [1509.02545].

## 4. Diagonal degenerations, bumpless pipe dreams, and fine multidegrees

Diagonal term orders are defined dually: for every minor, the initial term is the main diagonal monomial. In contrast with the antidiagonal case, Fulton generators are not a Gröbner basis in general under diagonal orders, and the initial ideals can be nonreduced and depend on the specific diagonal order [2003.13719].

To repair this, Hamaker, Pechenik, and Weigandt introduced the CDG generators. Writing
\[
\operatorname{Dom}(w)=\{(i,j)\in D(w): r_w(i,j)=0\},
\]
one first sets \(z_{ij}=0\) on \(\operatorname{Dom}(w)\), and then takes minors only in the specialized northwest submatrices attached to \(\operatorname{Ess}(w)\setminus \operatorname{Dom}(w)\). For banner permutations, these CDG generators form a diagonal Gröbner basis, and the diagonal initial ideal becomes
\[
\operatorname{in}_\prec(I_w)
=
\bigcap_{P\in \mathrm{BPD}(w)}
\langle z_{ij}:(i,j)\in D(P)\rangle,
\]
where \(\mathrm{BPD}(w)\) denotes the set of bumpless pipe dreams for \(w\). The same description holds for vexillary and predominant families, linking diagonal degenerations to Lam–Lee–Shimozono’s bumpless formula and to Lascoux’s \(6\)-vertex ice model [2003.13719].

Klein proved the full pattern-avoidance characterization conjectured in that work: the CDG generators form a diagonal Gröbner basis under every diagonal term order if and only if \(w\) avoids eight explicit patterns, namely
\[
13254,\ 21543,\ 214635,\ 215364,\ 215634,\ 241635,\ 315264,\ 4261735.
\]
This identifies the precise CDG class and extends the bumpless-pipe-dream description from banner permutations to all permutations in that avoidance class [2008.01717].

A further refinement is provided by fine multidegrees. Embedding \(A^{n^2}\) into \((\mathbb P^1)^{n^2}\) and taking the closure \(\overline{X_w}\), one obtains a squarefree homogeneous polynomial \(\mathfrak F_w(z_{ij})\), the fine Schubert polynomial, recording the multidegree of \(\overline{X_w}\). A general criterion then yields universal Gröbner bases from fine multidegrees: for permutations whose Schubert polynomials and inverse Schubert polynomials both have only \(0\)–\(1\) coefficients, an explicitly enlarged set \(\mathcal R_w\), built from CDG generators and merge relations, is a universal Gröbner basis for \(I_w\), and every initial ideal is reduced and squarefree [2410.02135].

## 5. Torus actions, toric factors, and complexity

Matrix Schubert varieties admit a canonical splitting into a nontrivial torus-geometric factor and a free affine factor. In the northwest conventions of Escobar and Mészáros, one writes
\[
X_\pi \cong Y_\pi\times \mathbb C^q,
\qquad
q=n^2-|\mathrm{NW}(\pi)|,
\qquad
\dim Y_\pi=|L'(\pi)|,
\]
where \(L'(\pi)\) is obtained from the northwest region by deleting the Rothe diagram. The factor \(Y_\pi\) is toric with respect to the effective \((\mathbb C^*)^{2n-1}\)-action if and only if \(L'(\pi)\) is a union of disjoint hooks that do not share a row or a column [1508.03445].

When \(Y_\pi\) is toric, its moment polytope is a type-\(A\) root polytope associated to a bipartite graph \(G_{L(\pi)}\), and its noncrossing alternating triangulation gives a geometric realization of a family of subword complexes. Portakal further identified toric \(Y_\pi\) with edge-ideal toric varieties of bipartite graphs and proved that \(Y_\pi\) is rigid if and only if every \(3\)-dimensional face of the associated cone \(\sigma_\pi\) is simplicial; this criterion can be reformulated directly in terms of the essential boxes of the Rothe diagram [2001.11949].

For the usual diagonal torus action, the complexity of the essential factor is
\[
c(Y_w)=\dim(Y_w)-\dim(\sigma_w),
\]
where \(\sigma_w\) is the weight cone generated by the weights \(e_i-f_j\) on the surviving coordinates. Recent work determines the full range of possibilities: for fixed \(n\), the complexity of \(Y_w\) can be any integer in
\[
\{0,2,3,\dots,(n-1)(n-3)\},
\]
and complexity \(1\) does not occur. The maximum \((n-1)(n-3)\) is achieved uniquely by \(w=w_0s_{n-1}\) [2510.00131].

The same graph-cone formalism has been extended to Fulton’s opposite conventions and to Kazhdan–Lusztig varieties. In that setting one again isolates a factor \(Y_w\), studies how the weight cone changes under multiplication by simple reflections, and tracks complexity along Bruhat chains for Kazhdan–Lusztig varieties via cyclomatic numbers of associated graphs [2510.00250].

## 6. Homological, singularity, and conormal properties

Matrix Schubert varieties are normal and Cohen–Macaulay, and their local geometry is closely tied to that of ordinary Schubert varieties. Hsiao gave a direct proof that matrix Schubert varieties are \(F\)-rational, avoiding Bott–Samelson resolutions. In characteristic \(0\), this yields rational singularities. The same paper also characterized complete intersections: \(X_w\) is a complete intersection if and only if, for every positive-rank box \((p,q)\in D(w)\), the associated northwest block \(w_{(p,q)}\) is a permutation matrix and the smaller matrix Schubert variety \(X_{w_{(p,q)}}\) is itself a complete intersection [1310.6473].

Castelnuovo–Mumford regularity is governed by Grothendieck polynomials. Rajchgot, Robichaux, and Weigandt proved
\[
\operatorname{reg}(X_w)=\operatorname{raj}(w)-\operatorname{inv}(w),
\]
where \(\operatorname{raj}(w)\), the Rajchgot index, is the degree of the highest-degree homogeneous part of the Grothendieck polynomial \(G_w\). They further identified the leading term of the corresponding Castelnuovo–Mumford polynomial with the Rajchgot code of \(w\) and established weak-order and major-index characterizations of \(\operatorname{raj}(w)\) [2111.10681].

For covexillary permutations, Singh constructed an open embedding of a covexillary matrix Schubert variety into a Grassmannian Schubert variety. This yields an algebraic criterion for the conormal variety of a covexillary matrix Schubert variety in terms of rank conditions on an explicit block matrix built from a point \(x\) and a cotangent vector \(y\), and it implies that characteristic cycles of covexillary Schubert varieties are irreducible. The same embedding gives a new proof of Lascoux’s Grassmannian model for Kazhdan–Lusztig polynomials in the covexillary setting [2203.14407].

## 7. Variants, representation theory, and related models

Matrix Schubert varieties also support richer group actions than the diagonal torus. Under suitable Levi subgroups, their coordinate rings become bicrystalline representations. Using antidiagonal standard monomials and a filtered version of the Robinson–Schensted–Knuth correspondence, one obtains an explicit multiplicity formula for the irreducible decomposition of \( \mathbb C[X_w]\); in the torus specialization this recovers the multigraded Hilbert-series formula of Knutson and Miller [2403.09938].

Several structured variants have been developed. In the symmetric and upper-triangular settings, one obtains Schubert-type determinantal ideals compatible with diagonal Gröbner bases, and these models connect directly to Gaussian conditional independence and graphical models. In particular, certain “north-east” Gaussian conditional independence ideals and generalized Markov-chain models are realized as symmetric matrix Schubert varieties, which leads to combinatorial primary decomposition procedures via Bruhat order [1510.04124].

There is also a skew-symmetric analogue. Skew-symmetric matrix Schubert varieties are defined as nonempty intersections of ordinary matrix Schubert varieties with the subspace of skew-symmetric matrices. Their defining ideals are generated by Pfaffians rather than minors, and under graded reverse lexicographic order they admit Gröbner bases whose squarefree initial ideals decompose over fixed-point-free involution pipe dreams. This gives a geometric proof of explicit formulas for symplectic Grothendieck polynomials [2010.00653].

At the level of intersections, Weigandt’s ASM varieties are arbitrary intersections of matrix Schubert varieties indexed by alternating sign matrices. They retain determinantal presentations and radical antidiagonal initial ideals, but irreducibility, equidimensionality, and Cohen–Macaulayness become subtler. Recent work proves codimension additivity under direct sum and formulates a stabilization conjecture for Cohen–Macaulayness under the operation \(A\mapsto 1\oplus A\) [2505.10480].

A final extension moves to real geometry. For real matrix Schubert varieties, vexillarity is a necessary condition for the open dense regular locus to be minimal as a submanifold. Among vexillary partial permutations, minimality is proved for Grassmannian-type Rothe diagrams with at most two connected components, recovering all determinantal varieties and producing additional minimal cones [2512.03480].

Source: https://www.emergentmind.com/topics/matrix-schubert-varieties