TOPICS
Search

Birkhoff-von Neumann Theorem


The Birkhoff-von Neumann theorem states that every n×n doubly stochastic matrix is a convex combination of n×n permutation matrices. Thus, if A is a doubly stochastic matrix, then

 A=sum_(k=1)^mlambda_kP_k,

where the P_k are permutation matrices, lambda_k>=0, and sum_(k=1)^(m)lambda_k=1. The decomposition may be chosen with m<=(n-1)^2+1.

Equivalently, the vertices of the Birkhoff polytope are precisely the permutation matrices. This formulation distinguishes the theorem from the several other results called Birkhoff's theorem.


See also

Birkhoff Polytope, Doubly Stochastic Matrix, Permutation Matrix

Explore with Wolfram|Alpha

References

Birkhoff, G. "Three Observations on Linear Algebra." Univ. Nac. Tucumán. Rev. Ser. A 5, 147-151, 1946.von Neumann, J. "A Certain Zero-Sum Two-Person Game Equivalent to the Optimal Assignment Problem." In Contributions to the Theory of Games, Vol. 2. (Eds. H. W. Kuhn and A. W. Tucker). Princeton, NJ: Princeton University Press, pp. 5-12, 1953. https://doi.org/10.1515/9781400881970-002.

Cite this as:

Weisstein, Eric W. "Birkhoff-von Neumann Theorem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Birkhoff-vonNeumannTheorem.html

Subject classifications