Quasideterminant

In mathematics, the quasideterminant is a replacement for the determinant for matrices with noncommutative entries. Example 2 × 2 quasideterminants are as follows:

: $\left, \begin a_ & a_ \\ a_ & a_ \end \_ = a_ - a_^a_ \qquad \left, \begin a_ & a_ \\ a_ & a_ \end \_ = a_ - a_^a_.$

In general, there are ''n''² quasideterminants defined for an ''n'' × ''n'' matrix (one for each position in the matrix), but the presence of the inverted terms above should give the reader pause: they are not always defined, and even when they are defined, they do not reduce to determinants when the entries commute. Rather,

: $\left, A\_ = (-1)^ \frac ,$
where $A^$ means delete the ''i''th row and ''j''th column from ''A''.

The $2\times2$ examples above were introduced between 1926 and 1928 by Richardson and Heyting, but they were marginalized at the time because they were not polynomials in the entries of $A$. These examples were rediscovered and given new life in 1991 by Israel Gelfand and Vladimir Retakh. There, they develop quasideterminantal versions of many familiar determinantal properties. For example, if $B$ is built from $A$ by rescaling its $i$-th row (on the left) by $\left.\rho\right.$, then $\left, B\_ = \rho \left, A\_$.
Similarly, if $B$ is built from $A$ by adding a (left) multiple of the $k$-th row to another row, then $\left, B\_ = \left, A\_ \,\, (\forall j; \forall k\neq i)$. They even develop a quasideterminantal
version of Cramer's rule.

Definition

Let $A$ be an $n\times n$ matrix over a (not necessarily commutative)
ring $R$ and fix $1\leq i,j\leq n$. Let $a_$
denote the ($i,j$)-entry of $A$, let $r_i^j$ denote the $i$-th row of $A$ with column $j$ deleted, and let $c_j^i$ denote the $j$-th column of $A$ with row $i$ deleted. The ($i,j$)-quasideterminant of $A$ is defined if the submatrix $A^$ is invertible over $R$. In this case,
::$\left, A\_ = a_ - r_i^j\, \bigl(A^\bigr)^\, c_j^i .$
Recall the formula (for commutative rings) relating $A^$ to the determinant, namely $(A^)_ = (-1)^ \frac$. The above definition is a generalization in that (even for noncommutative rings) one has
::$\bigl(A^\bigr)_ = \left, A\_^$
whenever the two sides makes sense.

Identities

One of the most important properties of the quasideterminant is what Gelfand and Retakh
call the "heredity principle". It allows one to take a quasideterminant in
stages (and has no commutative counterpart). To illustrate, suppose
::$\left(\begin A_ & A_ \\ A_ & A_ \end \right)$
is a block matrix decomposition of an $n\times n$ matrix $A$ with
$A_$ a $k \times k$ matrix. If the ($i,j$)-entry of $A$ lies within $A_$, it says that
:$\left, A\_ = \left, A_ - A_\,^\,A_\_.$
That is, the quasideterminant of a quasideterminant is a quasideterminant. To put it less succinctly: UNLIKE determinants, quasideterminants treat matrices with block-matrix entries no differently than ordinary matrices (something determinants cannot do since block-matrices generally don't commute with one another). That is, while the precise form of the above identity is quite surprising, the existence of ''some'' such identity is less so.
Other identities from the papers are (i) the so-called "homological relations", stating that two quasideterminants in a common row or column are closely related to one another, and (ii) the Sylvester formula.

(i) Two quasideterminants sharing a common row or column satisfy
::$\left, A\_ , A^, _^ = - \left, A\_ , A^, _^$
or
::$, A^, _^ \left, A\_ = - , A^, _^ \left, A\_ ,$
respectively, for all choices $i\neq k$, $j\neq l$ so that the
quasideterminants involved are defined.

(ii) Like the heredity principle, the Sylvester identity is a way to recursively compute a quasideterminant. To ease notation, we display a special case. Let
$A_0$ be the upper-left $k \times k$ submatrix of an
$n \times n$ matrix $A$ and fix a coordinate ($i,j$) in
$A_0$. Let $B=(b_)$ be the $(n-k)\times(n-k)$ matrix, with $b_$ defined as the ($p,q$)-quasideterminant of the $(k+1)\times(k+1)$ matrix formed by adjoining to $A_0$ the first $k$ columns of row $p$, the first $k$ rows of column $q$, and the entry $a$_$pq$. Then one has
::$\left, B\_ = \left, A\_ .$

Many more identities have appeared since the first articles of Gelfand and Retakh on the subject, most of them being analogs of classical determinantal identities. An important source is Krob and Leclerc's 1995 article. To highlight one, we consider the row/column expansion identities. Fix a row $i$ to expand along. Recall the determinantal formula
$\det A = \sum_l (-1)^ a_ \cdot \det A^$.
Well, it happens that quasideterminants satisfy
::$\left, A\_ = a_ - \sum_ a_\cdot , A^, _^ , A^, _$
(expansion along column $j$), and
::$\left, A\_ = a_ - \sum_ , A^, _ , A^, _^ \cdot a_$
(expansion along row $i$).

Connections to other determinants

The quasideterminant is certainly not the only existing determinant analog for noncommutative settings—perhaps the most famous examples are the Dieudonné determinant and quantum determinant. However, these are related to the quasideterminant in some way. For example,
::$_q A = \bigl, A\bigr, _\,\left, A^\_\,\left, A^\_ \,\cdots\,, a_, _ ,$
with the factors on the right-hand side commuting with each other. Other famous examples, such as Berezinians, Moore and Study determinants, Capelli determinants, and Cartier-Foata-type determinants are also expressible in terms of quasideterminants. Gelfand has been known to define a (noncommutative) determinant as "good" if it may be expressed as products of quasiminors.

Applications

Paraphrasing their 2005 survey article with Sergei Gelfand and Robert Wilson
,
Israel Gelfand and Vladimir Retakh advocate for the adoption of quasideterminants as "a main organizing tool in noncommutative algebra, giving them the same role determinants play in commutative algebra." Substantive use has been made of the quasideterminant in such fields of mathematics as integrable systems, representation theory,A. Molev, Yangians and their applications, in ''Handbook of algebra, Vol. 3,'' North-Holland, Amsterdam, 2003.
eprint
algebraic combinatorics, the theory of ''noncommutative symmetric functions'', the theory of ''polynomials over division rings'',Israel Gelfand, Vladimir Retakh, Noncommutative Vieta theorem and symmetric functions. ''The Gelfand Mathematical Seminars, 1993–1995.'' and noncommutative geometry.Zoran Škoda, Noncommutative localization in noncommutative geometry, in "Non-commutative localization in algebra and topology", ''London Math. Soc. Lecture Note Ser., 330,'' Cambridge Univ. Press, Cambridge, 2006.
eprint

Several of the applications above make use of ''quasi-Plücker coordinates,'' which parametrize noncommutative Grassmannians and flags in much the same way as Plücker coordinates do Grassmannians and flags over commutative fields. More information on these can be found in the survey article.

See also

* MacMahon Master theorem

References

{{reflist

Matrix theory
Determinants