Doubly Stochastic Matrix — Definition, Formula & Examples
A doubly stochastic matrix is a square matrix whose entries are all nonnegative and whose rows and columns each sum to 1. It combines the properties of a row-stochastic matrix and a column-stochastic matrix.
A square matrix of order is doubly stochastic if for all , and for every row and for every column .
How It Works
To verify that a matrix is doubly stochastic, check three conditions: every entry is nonnegative, each row sums to exactly 1, and each column sums to exactly 1. The simplest example is the identity matrix. Another classic example is the matrix where every entry equals . The Birkhoff–von Neumann theorem states that every doubly stochastic matrix is a convex combination of permutation matrices, meaning it can be written as a weighted average of matrices that have exactly one 1 in each row and column.
Worked Example
Problem: Determine whether the following matrix is doubly stochastic: .
Check nonnegativity: Every entry is 0.25 or 0.5, both nonnegative.
Check row sums: Each row sums to .
Check column sums: Each column sums to .
Answer: All three conditions are satisfied, so is doubly stochastic.
Why It Matters
Doubly stochastic matrices appear in optimization, combinatorics, and Markov chain theory. The Birkhoff polytope — the set of all doubly stochastic matrices — is a fundamental object in linear programming and the assignment problem. They also arise in quantum information and economics when modeling fair allocation or mixing processes.
Common Mistakes
Mistake: Assuming any stochastic matrix is doubly stochastic.
Correction: A row-stochastic matrix only requires row sums equal to 1. For a matrix to be doubly stochastic, both row sums and column sums must equal 1. Always verify both conditions.
