Logical matrix

If R is a binary relation between the finite indexed sets X and Y (so R ⊆ X ×Y), then R can be represented by the logical matrix M whose row and column indices index the elements of X and Y, respectively, such that the entries of M are defined by

${\displaystyle m_{i,j}={\begin{cases}1&(x_{i},y_{j})\in R,\\0&(x_{i},y_{j})\not \in R.\end{cases}}}$

In order to designate the row and column numbers of the matrix, the sets X and Y are indexed with positive integers: i ranges from 1 to the cardinality (size) of X, and j ranges from 1 to the cardinality of Y. See the article on indexed sets for more detail.

The transpose ${\displaystyle R^{T}}$ of the logical matrix ${\displaystyle R}$ of a binary relation corresponds to the converse relation.^[1]

The binary relation R on the set {1, 2, 3, 4} is defined so that aRb holds if and only if a divides b evenly, with no remainder. For example, 2R4 holds because 2 divides 4 without leaving a remainder, but 3R4 does not hold because when 3 divides 4, there is a remainder of 1. The following set is the set of pairs for which the relation R holds.

{(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 4), (3, 3), (4, 4)}.

The corresponding representation as a logical matrix is

${\displaystyle {\begin{pmatrix}1&1&1&1\\0&1&0&1\\0&0&1&0\\0&0&0&1\end{pmatrix}},}$

which includes a diagonal of ones, since each number divides itself.

• A permutation matrix is a (0, 1)-matrix, all of whose columns and rows each have exactly one nonzero element.
  • A Costas array is a special case of a permutation matrix.
• An incidence matrix in combinatorics and finite geometry has ones to indicate incidence between points (or vertices) and lines of a geometry, blocks of a block design, or edges of a graph.
• A design matrix in analysis of variance is a (0, 1)-matrix with constant row sums.
• A logical matrix may represent an adjacency matrix in graph theory: non-symmetric matrices correspond to directed graphs, symmetric matrices to ordinary graphs, and a 1 on the diagonal corresponds to a loop at the corresponding vertex.
• The biadjacency matrix of a simple, undirected bipartite graph is a (0, 1)-matrix, and any (0, 1)-matrix arises in this way.
• The prime factors of a list of m square-free, n-smooth numbers can be described as an m × π(n) (0, 1)-matrix, where π is the prime-counting function, and a_ij is 1 if and only if the jth prime divides the ith number. This representation is useful in the quadratic sieve factoring algorithm.
• A bitmap image containing pixels in only two colors can be represented as a (0, 1)-matrix in which the zeros represent pixels of one color and the ones represent pixels of the other color.
• A binary matrix can be used to check the game rules in the game of Go.^[2]
• The four valued logic of two bits, transformed by 2 × 2 logical matrices, forms a transition system.
• A recurrence plot and its variants are matrices that shows which pairs of points are closer than a certain vicinity threshold in a phase space.

The matrix representation of the equality relation on a finite set is the identity matrix I, that is, the matrix whose entries on the diagonal are all 1, while the others are all 0. More generally, if relation R satisfies I ⊆ R, then R is a reflexive relation.

If the Boolean domain is viewed as a semiring, where addition corresponds to logical OR and multiplication to logical AND, the matrix representation of the composition of two relations is equal to the matrix product of the matrix representations of these relations. This product can be computed in expected time O(n²).^[3]

Frequently, operations on binary matrices are defined in terms of modular arithmetic mod 2—that is, the elements are treated as elements of the Galois field ${\displaystyle {\mathbf {GF}}(2)=\mathbb {Z} _{2}}$. They arise in a variety of representations and have a number of more restricted special forms. They are applied e.g. in XOR-satisfiability.

The number of distinct m-by-n binary matrices is equal to 2^mn, and is thus finite.

Let n and m be given and let U denote the set of all logical m × n matrices. Then U has a partial order given by

${\displaystyle \forall A,B\in U,\quad A\leq B\quad {\text{when}}\quad \forall i,j\quad A_{ij}=1\implies B_{ij}=1.}$

In fact, U forms a Boolean algebra with the operations and & or between two matrices applied component-wise. The complement of a logical matrix is obtained by swapping all zeros and ones for their opposite.

Every logical matrix A = (A_ij) has a transpose A^T = (A_ji). Suppose A is a logical matrix with no columns or rows identically zero. Then the matrix product, using Boolean arithmetic, ${\displaystyle A^{\operatorname {T} }A}$ contains the m × m identity matrix, and the product ${\displaystyle AA^{\operatorname {T} }}$ contains the n × n identity.

As a mathematical structure, the Boolean algebra U forms a lattice ordered by inclusion; additionally it is a multiplicative lattice due to matrix multiplication.

Every logical matrix in U corresponds to a binary relation. These listed operations on U, and ordering, correspond to a calculus of relations, where the matrix multiplication represents composition of relations.^[4]

If m or n equals one, then the m × n logical matrix (m_ij) is a logical vector or bit string. If m = 1, the vector is a row vector, and if n = 1, it is a column vector. In either case the index equaling 1 is dropped from denotation of the vector.

Suppose ${\displaystyle (P_{i}),\,i=1,2,\ldots ,m}$ and ${\displaystyle (Q_{j}),\,j=1,2,\ldots ,n}$ are two logical vectors. The outer product of P and Q results in an m × n rectangular relation

${\displaystyle m_{ij}=P_{i}\land Q_{j}.}$

A reordering of the rows and columns of such a matrix can assemble all the ones into a rectangular part of the matrix.^[5]

Let h be the vector of all ones. Then if v is an arbitrary logical vector, the relation R = v h^T has constant rows determined by v. In the calculus of relations such an R is called a vector.^[5] A particular instance is the universal relation ${\displaystyle hh^{\operatorname {T} }}$.

For a given relation R, a maximal rectangular relation contained in R is called a concept in R. Relations may be studied by decomposing into concepts, and then noting the induced concept lattice.

Consider the table of group-like structures, where "unneeded" can be denoted 0, and "required" denoted by 1, forming a logical matrix ${\displaystyle R.}$ To calculate elements of ${\displaystyle RR^{\operatorname {T} }}$, it is necessary to use the logical inner product of pairs of logical vectors in rows of this matrix. If this inner product is 0, then the rows are orthogonal. In fact, small category is orthogonal to quasigroup, and groupoid is orthogonal to magma. Consequently there are zeros in ${\displaystyle RR^{\operatorname {T} }}$, and it fails to be a universal relation.

Adding up all the ones in a logical matrix may be accomplished in two ways: first summing the rows or first summing the columns. When the row sums are added, the sum is the same as when the column sums are added. In incidence geometry, the matrix is interpreted as an incidence matrix with the rows corresponding to "points" and the columns as "blocks" (generalizing lines made of points). A row sum is called its point degree, and a column sum is the block degree. The sum of point degrees equals the sum of block degrees.^[6]

An early problem in the area was "to find necessary and sufficient conditions for the existence of an incidence structure with given point degrees and block degrees; or in matrix language, for the existence of a (0, 1)-matrix of type v × b with given row and column sums".^[6] This problem is solved by the Gale–Ryser theorem.

• List of matrices
• Binatorix (a binary De Bruijn torus)
• Bit array
• Disjunct matrix
• Redheffer matrix
• Truth table
• Three-valued logic