Skip to content

Doubly stochastic matrix

A square nonnegative matrix whose every row and column sums to one, equivalently a convex combination of permutation matrices and a point in the Birkhoff polytope.

Version
v2 · 2026-09-19 · History
Domain-specific #
4260
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Matrix Theory, Stochastic and Convex Matrices → Mathematics
Aliases
Bistochastic matrix

Core Idea

A doubly or bistochastic matrix has nonnegative entries and unit sum in each row and each column. The 2n−1 independent affine constraints define the Birkhoff polytope; the Birkhoff-von Neumann theorem makes permutation matrices its extreme points, so every doubly stochastic matrix is their convex mixture. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of matrix theory. It is simultaneous row-and-column stochasticity and its convex-permutation geometry, majorization, and assignment consequences.

How would you explain it like I'm…

Every Line Adds to One

Imagine some kids sharing juice. Each kid pours out exactly one full cup, split up among the others however they like, and each kid ends up getting exactly one full cup back. A table showing who poured how much to whom is like a doubly stochastic matrix: every row and every column adds up to one.

Every Row and Column Adds to One

A matrix is a square grid of numbers. A doubly stochastic matrix is a square grid where every number is zero or positive, every row adds up to 1, and every column adds up to 1. A special example is a grid of 0s and 1s with exactly one 1 in each row and column, which describes a perfect pairing or shuffle. A famous theorem says every doubly stochastic matrix is a blend, like a weighted average, of those perfect pairing grids.

Mixtures of Permutation Matrices

A doubly stochastic (or bistochastic) matrix is a square matrix with nonnegative entries in which every row and every column sums to 1. Permutation matrices, which have exactly one 1 in each row and column and 0s elsewhere, are the simplest examples. The set of all n-by-n doubly stochastic matrices forms a convex shape called the Birkhoff polytope. The Birkhoff-von Neumann theorem says its corners are exactly the permutation matrices, so every doubly stochastic matrix is a weighted average of permutation matrices. This connects it to assignment problems, where you match items one-to-one, and to majorization, a way of comparing how spread out lists of numbers are.

 

A doubly stochastic matrix is a square matrix with nonnegative entries in which every row sum and every column sum equals one, so it is simultaneously row-stochastic and column-stochastic. For n-by-n matrices the row and column sum conditions give 2n - 1 independent affine constraints, which together with nonnegativity carve out the Birkhoff polytope. The Birkhoff-von Neumann theorem identifies the extreme points of this polytope as the permutation matrices, so every doubly stochastic matrix is a convex combination of permutation matrices. This convex-permutation geometry has consequences for majorization and for assignment problems, where one-to-one matchings correspond to permutation matrices. Verification requires a square matrix, nonnegative entries, and exact unit row and column sums within stated numerical tolerance; a matrix that is only row-stochastic is a neighboring but different object.

Scope of Application

Doubly stochastic matrix belongs to matrix theory and is useful where the analyst can specify an n-by-n real matrix with nonnegative entries, row and column sum constraints, permutation matrices, and convex weights, then evaluate the matrix is square, every entry is nonnegative, and each row and column sums exactly to one within stated numerical tolerance. The scope is broad within that domain but bounded by the need for the matrix is square, every entry is nonnegative, and each row and column sums exactly to one within stated numerical tolerance. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the matrix is square, every entry is nonnegative, and each row and column sums exactly to one within stated numerical tolerance the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Doubly stochastic matrix can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Doubly stochastic matrix. Doubly stochastic matrix compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

  1. Identify the carrier. State what the elements, states, objects, or observations are: an n-by-n real matrix with nonnegative entries, row and column sum constraints, permutation matrices, and convex weights. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express the matrix is square, every entry is nonnegative, and each row and column sums exactly to one within stated numerical tolerance independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of matrix theory because they reuse an n-by-n real matrix with nonnegative entries, row and column sum constraints, permutation matrices, and convex weights, The 2n−1 independent affine constraints define the Birkhoff polytope; the Birkhoff-von Neumann theorem makes permutation matrices its extreme points, so every doubly stochastic matrix is their convex mixture., and type the carrier, state every parameter and convention in the definition, test that the matrix is square, every entry is nonnegative, and each row and column sums exactly to one within stated numerical tolerance, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for Doubly stochastic matrixParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Doublystochastic matrixDOMAINPrime abstraction: Constraint — is a kind ofConstraintPRIME

Current abstraction Doubly stochastic matrix Domain-specific

Parents (1) — outgoing typed relations

  • Doubly stochastic matrix is a kind of Constraint Prime

    The class is defined by simultaneous nonnegativity and two sets of linear sum constraints.

Hierarchy path (1) — routes to 1 parentless root

  • Doubly stochastic matrix → is a kind of Constraint

Neighborhood in Abstraction Space

Doubly stochastic matrix sits in a crowded region of the domain-specific corpus (19th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Structured Matrices & Linear Maps (43 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25