P-matrix

---

title: "P-matrix" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["matrix-theory", "matrices-(mathematics)"] description: "Complex square matrix for which every principal minor is positive" topic_path: "science/mathematics" source: "https://en.wikipedia.org/wiki/P-matrix" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

::summary Complex square matrix for which every principal minor is positive ::

In mathematics, a P-matrix is a complex square matrix with every principal minor is positive. A closely related class is that of P_0-matrices, which are the closure of the class of P-matrices, with every principal minor \geq 0.

Spectra of {{mvar|P}}-matrices

By a theorem of Kellogg, the eigenvalues of P- and P_0- matrices are bounded away from a wedge about the negative real axis as follows:

:If {u_1,...,u_n} are the eigenvalues of an n-dimensional P-matrix, where n1, then ::|\arg(u_i)| :If {u_1,...,u_n}, u_i \neq 0, i = 1,...,n are the eigenvalues of an n-dimensional P_0-matrix, then ::|\arg(u_i)| \leq \pi - \frac{\pi}{n},\ i = 1,...,n

Remarks

The class of nonsingular M-matrices is a subset of the class of P-matrices. More precisely, all matrices that are both P-matrices and Z-matrices are nonsingular M-matrices. The class of sufficient matrices is another generalization of P-matrices.{{cite journal|first1=Zsolt|last1=Csizmadia|first2=Tibor|last2=Illés|title=New criss-cross type algorithms for linear complementarity problems with sufficient matrices|journal=Optimization Methods and Software|volume=21|year=2006|number=2|pages=247–266|doi=10.1080/10556780500095009| url=http://www.cs.elte.hu/opres/orr/download/ORR03_1.pdf|mr=2195759}}

The linear complementarity problem \mathrm{LCP}(M,q) has a unique solution for every vector q if and only if M is a P-matrix. This implies that if M is a P-matrix, then M is a Q-matrix.

If the Jacobian of a function is a P-matrix, then the function is injective on any rectangular region of \mathbb{R}^n.

A related class of interest, particularly with reference to stability, is that of P^{(-)}-matrices, sometimes also referred to as N-P-matrices. A matrix A is a P^{(-)}-matrix if and only if (-A) is a P-matrix (similarly for P_0-matrices). Since \sigma(A) = -\sigma(-A), the eigenvalues of these matrices are bounded away from the positive real axis.

Notes

References

• {{cite journal|first1=Zsolt|last1=Csizmadia|first2=Tibor|last2=Illés|title=New criss-cross type algorithms for linear complementarity problems with sufficient matrices|journal=Optimization Methods and Software|volume=21|year=2006|number=2|pages=247–266|doi=10.1080/10556780500095009| url=http://www.cs.elte.hu/opres/orr/download/ORR03_1.pdf|mr=2195759}}
• David Gale and Hukukane Nikaido, The Jacobian matrix and global univalence of mappings, Math. Ann. 159:81-93 (1965)
• Li Fang, On the Spectra of P- and P_0-Matrices, Linear Algebra and its Applications 119:1-25 (1989)
• R. B. Kellogg, On complex eigenvalues of M and P matrices, Numer. Math. 19:170-175 (1972)

References

1. (April 1972). "On complex eigenvalues ofM andP matrices". Numerische Mathematik.
2. (July 1989). "On the spectra of P- and P0-matrices". Linear Algebra and Its Applications.
3. (January 1972). "On the number of solutions to the complementarity problem and spanning properties of complementary cones". Linear Algebra and Its Applications.
4. (10 December 2013). "The Jacobian matrix and global univalence of mappings". Mathematische Annalen.

::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::