symmetric monoidal (∞,1)-category of spectra
Over non-commutative rings determinants are not useful invariants of matrices (in fact, various classical formulas for determinants mutually disagree in this case) and other polynomial suggestions were not of much success (in some cases the superdeterminant and Dieudonné determinant are of use, but they can be easily expressed in terms of quasideterminants anyway). Quasideterminants will be noncommutative rational functions, rather than polynomial, expressions.
A quasideterminant generalizes a ratio of -determinant and a minor. Regarding that there are such minors – complementary to each entry– there are quasideterminants, indexed by labels of the complementary entry. Special cases when useful polynomial determinants are defined like the usual determinant, superdeterminant, quantum determinant and Dieudonné determinant can be obtained 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.
Quasideterminants were introduced by I. Gel’fand and V. Retakh around 1990.
I. M. Gel'fand, V. S. Retakh, Determinants of matrices over noncommutative rings, Funct.Anal.Appl. 25 (1991), no.2, pp. 91–102.
engl. transl. 21 (1991), pp. 51–58.
I.M. Gel’fand, V.S. Retakh, A theory of noncommutative determinants and characteristic functions of graphs, Funct.Anal.Appl. 26 (1992), no.4, pp. 231–246.
I.M. Gel’fand, V.S. Retakh, Quasideterminants I, Selecta Mathematica, N. S. 3 (1997) no.4, pp. 517–546; doi
Israel Gelfand, Sergei Gelfand, Vladimir Retakh, Robert Lee Wilson, Quasideterminants, Advances in Mathematics 193 (2005) 56–141 doi
D.Krob, Bernard Leclerc, Minor identities for quasi-determinants and quantum determinants, Comm. Math. Phys. 169 (1995) 1–23 doi arXiv:hep-th/9411194
Chapter 16: Quasideterminants and Cohn localization in Z. Škoda, Noncommutative localization in noncommutative geometry, London Math. Society Lecture Note Series 330, ed. A. Ranicki; pp. 220–313, arXiv:math.QA/0403276)
V. Retakh, R. Wilson, Advanced course on quasideterminants and universal localization (2007) [pdf]
Last revised on July 8, 2024 at 15:09:12. See the history of this page for a list of all contributions to it.