linear algebra, higher linear algebra
(…)
Over ground rings which are not commutative, the notion of determinants does not provide useful invariants of matrices (in fact, various classical formulas for determinants mutually disagree in this case).
The notion of quasideterminants is meant to fix this: these are noncommutative rational functions of the given matrix entries rather than polynomials.
Given an matrix, its quasideterminants may be thought of as generalized ratios of an -determinant by an minor. Since there are such minors – one complementary to each entry – there are quasideterminants.
Ordinary determinants, but also superdeterminants, quantum determinants and Dieudonné determinants can be expressed as products of quasideterminants.
Let be an matrix over an arbitrary noncommutative (but unital and associative) ring . In fact it makes sense to work with many objects (see horizontal categorification): having, say, an abelian category where is a morphism from the object to the object . Let us choose a row label and a column label . By we’ll denote the matrix obtained from by removing the -th row and the -th column. The -th quasideterminant is
provided the right-hand side is defined (the corresponding inverses exist).
Up to quasideterminants of a given may be defined. If all the quasideterminants exist and are invertible then the inverse matrix of exists in and
Quasideterminants for a matrix with entries in a commutative ring are, up to a sign, ratios of the determinant of the matrix and the determinant of the appropriate submatrix, as one can see by remembering the formula for matrix inverse in terms of the cofactor matrices. For systems of linear equations with coefficients (from one side) in a noncommutative ring, there are solution formulas involving quasideterminants and generalizing Cramer’s rule (hence left and right Cramer’s rule). Quasideterminants with generic entries (entries in a free skewfield) satisfy generalizations of many classical identities: Muir’s law of extensionality, Silvester’s law, etc., and a new “heredity” principle and so-called “homological identities”. Furthermore, for polynomial equations over noncommutative rings, noncommutative Viete’s formulas have been found and used in applications.
The original articles:
Israel M. Gel'fand, Vladimir S. Retakh: Determinants of matrices over noncommutative rings, Funct. Anal. Appl. 25 2 (1991) 91–102 [doi:10.1007/BF01079588]
Israel M. Gel'fand, Vladimir S. Retakh: A theory of noncommutative determinants and characteristic functions of graphs, Funct. Anal. Appl. 26 4 (1992) 231–246 [doi:10.1007/BF01075044]
Israel M. Gel'fand, Vladimir S. Retakh: Quasideterminants I, Selecta Mathematica, N. S. 3 4 (1997) 517–546 [doi:10.1007/s000290050019]
Review:
Israel M. Gelfand, Sergei Gelfand, Vladimir S. Retakh, Robert Lee Wilson: Quasideterminants, Advances in Mathematics 193 (2005) 56–141 [doi:10.1016/j.aim.2004.03.018]
Vladimir S. Retakh, Robert Lee Wilson: Advanced course on quasideterminants and universal localization, CRM Barcelona, (2007) [pdf]
See also:
Further discussion:
Israel Gelfand, Daniel Krob, Alain Lascoux, Bernard Leclerc, Vladimir S. Retakh, J.-Y. Thibon: Noncommutative symmetric functions, Adv. in Math. 112 2 (1995) 218–348 [arXiv:hep-th/9407124, doi:10.1006/aima.1995.1032]
Daniel Krob, Bernard Leclerc: Minor identities for quasi-determinants and quantum determinants, Comm. Math. Phys. 169 (1995) 1-23 [doi:10.1007/BF02101594, arXiv:hep-th/9411194]
Zoran Škoda: Quasideterminants and Cohn localization, Chapter 16 in: Noncommutative localization in noncommutative geometry, London Math. Society Lecture Note Series 330 (2006) 220–310 [arXiv:math.QA/0403276, doi:10.1017/CBO9780511526381.015]
Last revised on October 1, 2025 at 14:15:50. See the history of this page for a list of all contributions to it.