In mathematics, a unimodular matrix M is a square integer matrix having determinant +1 or −1. Equivalently, it is an integer matrix that is invertible over the integers: there is an integer matrix N which is its inverse (these are equivalent under Cramer's rule). Thus every equation Mx = b, where M and b are both integer, and M is unimodular, has an integer solution. The unimodular matrices of order n form a group, which is denoted .
Examples of unimodular matrices
- The Kronecker product of two unimodular matrices is also unimodular. This follows since
- where p and q are the dimensions of A and B, respectively.
Concrete examples include:
- Pascal matrices
- Permutation matrices
- the three transformation matrices in the ternary tree of primitive Pythagorean triples
A totally unimodular matrix  (TU matrix) is a matrix for which every square non-singular submatrix is unimodular. A totally unimodular matrix need not be square itself. From the definition it follows that any totally unimodular matrix has only 0, +1 or −1 entries. The opposite is not true, i.e., a matrix with only 0, +1 or −1 entries is not necessarily unimodular.
Totally unimodular matrices are extremely important in polyhedral combinatorics and combinatorial optimization since they give a quick way to verify that a linear program is integral (has an integral optimum, when any optimum exists). Specifically, if A is TU and b is integral, then linear programs of forms like or have integral optima, for any c. Hence if A is totally unimodular and b is integral, every extreme point of the feasible region (e.g. ) is integral and thus the feasible region is an integral polyhedron.
Common totally unimodular matrices
1. The unoriented incidence matrix of a bipartite graph, which is the coefficient matrix for bipartite matching, is totally unimodular (TU). (The unoriented incidence matrix of a non-bipartite graph is not TU.) More generally, in the appendix to a paper by Heller and Tompkins, A.J. Hoffman and D. Gale prove the following. Let be an m by n matrix whose rows can be partitioned into two disjoint sets and . Then the following four conditions together are sufficient for A to be totally unimodular:
- Every column of contains at most two non-zero entries;
- Every entry in is 0, +1, or −1;
- If two non-zero entries in a column of have the same sign, then the row of one is in , and the other in ;
- If two non-zero entries in a column of have opposite signs, then the rows of both are in , or both in .
It was realized later that these conditions define an incidence matrix of a balanced signed graph; thus, this example says that the incidence matrix of a signed graph is totally unimodular if the signed graph is balanced. The converse is valid for signed graphs without half edges (this generalizes the property of the unoriented incidence matrix of a graph).
2. The constraints of maximum flow and minimum cost flow problems yield a coefficient matrix with these properties (and with empty C). Thus, such network flow problems with bounded integer capacities have an integral optimal value. Note that this does not apply to multi-commodity flow problems, in which it is possible to have fractional optimal value even with bounded integer capacities.
3. The consecutive-ones property: if A is (or can be permuted into) a 0-1 matrix in which for every row, the 1s appear consecutively, then A is TU. (The same holds for columns since the transpose of a TU matrix is also TU.)
4. Every network matrix is TU. The rows of a network matrix correspond to a tree T=(V,R), each of whose arcs has an arbitrary orientation (it is not necessary that there exist a root vertex r such that the tree is "rooted into r" or "out of r").The columns correspond to another set C of arcs on the same vertex set V. To compute the entry at row R and column C=st, look at the s-to-t path P in T; then the entry is:
- +1 if arc R appears forward in P,
- -1 if arc R appears backwards in P,
- 0 if arc R does not appear in P.
See more in Schrijver (2003).
5. Ghouila-Houri showed that a matrix is TU iff for every subset R of rows, there is an assignment of signs to rows so that the signed sum (which is a row vector of the same width as the matrix) has all its entries in (i.e. the row-submatrix has discrepancy at most one). This and several other if-and-only-if characterizations are proven in Schrijver (1998).
6. Hoffman and Kruskal proved the following theorem. Suppose is a directed graph without 2-dicycles, is the set of all dipaths in , and is the 0-1 incidence matrix of versus . Then is totally unimodular if and only if every simple arbitrarily-oriented cycle in consists of alternating forwards and backwards arcs.
7. Suppose a matrix has 0-(1) entries and in each column, the entries are non-decreasing from top to bottom (so all -1's are on top, then 0's, then 1's are on the bottom). Fujishige showed that the matrix is TU iff every 2-by-2 submatrix has determinant in .
8. Seymour (1980) proved a full characterization of all TU matrices, which we describe here only informally. Seymour's theorem is that a matrix is TU if and only if it is a certain natural combination of some network matrices and some copies of a particular 5-by-5 TU matrix.
1. The following matrix is totally unimodular:
This matrix arises as the coefficient matrix of the constraints in the linear programming formulation of the maximum flow problem on the following network:
2. Any matrix of the form
is not totally unimodular, since it has a square submatrix of determinant -2.
Abstract linear algebra
Abstract linear algebra considers matrices with entries from any commutative ring, not limited to the integers. In this context, a unimodular matrix is one that is invertible over the ring; equivalently, whose determinant is a unit. This group is denoted .
Over a field, unimodular has the same meaning as non-singular. Unimodular here refers to matrices with coefficients in some ring (often the integers) which are invertible over that ring, and one uses non-singular to mean matrices that are invertible over the field.
- The term was coined by Claude Berge, see Hoffman, A.J.; Kruskal, J. (2010), "Introduction to Integral Boundary Points of Convex Polyhedra", in M. Jünger et al. (eds.), 50 Years of Integer Programming, 1958-2008, Springer-Verlag, pp. 49–50
- Heller, I.; Tompkins, C.B.Gh (1956), "An Extension of a Theorem of Dantzig's", in Kuhn, H.W.; Tucker, A.W., Linear Inequalities and Related Systems, Annals of Mathematics Studies 38, Princeton (NJ): Princeton University Press, pp. 247–254
- T. Zaslavsky (1982), "Signed graphs," Discrete Applied Mathematics 4, pp. 401–406.
- Hoffman, A.J.; Kruskal, J.B. (1956), "Integral Boundary Points of Convex Polyhedra", in Kuhn, H.W.; Tucker, A.W., Linear Inequalities and Related Systems, Annals of Mathematics Studies 38, Princeton (NJ): Princeton University Press, pp. 223–246
- Fujishige, Satoru (1984), "A System of Linear inequalities with a Submodular Function on (0, +/-1 ) Vectors", Linear Algebra and Its Applications 63: 253–266, doi:10.1016/0024-3795(84)90147-2
- Papadimitriou, Christos H.; Steiglitz, Kenneth (1998), "Section 13.2", Combinatorial Optimization: Algorithms and Complexity, Mineola, N.Y.: Dover Publications, p. 316, ISBN 978-0-486-40258-1
- Alexander Schrijver (1998), Theory of Linear and Integer Programming. John Wiley & Sons, ISBN 0-471-98232-6 (mathematical)
- Alexander Schrijver (2003), Combinatorial Optimization: Polyhedra and Efficiency, Springer