Logical matrix: Difference between revisions

Revision as of 18:02, 3 November 2022

Revision as of 18:03, 3 November 2022

Line 52:

==Lattice==

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

:<math>\forall A,B \in U \quad Am \leqsubset Bn \quad \text{when} \quad \forall i,j \quad A_m_{ij} = 1 \implies B_n_{ij} = 1 .</math>

In fact, ''U'' forms a [[Boolean algebra]] with the operations [[and (logic)|and]] & [[or (logic)|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 {{nowrap|1=Aa = ( Aa _{i j} )}} has a transpose {{nowrap|1=Aa^T = ( Aa _{j i} ).}} Suppose ''Aa'' is a logical matrix with no columns or rows identically zero. Then the matrix product, using Boolean arithmetic, <math>Aa^{\operatorname{T}}Aa</math> contains the ''m'' × ''m'' [[identity matrix]], and the product <math>AAaa^{\operatorname{T}}</math> contains the ''n'' × ''n'' identity.

As a mathematical structure, the Boolean algebra ''U'' forms a [[lattice (order)|lattice]] ordered by [[inclusion (logic)|inclusion]]; additionally it is a multiplicative lattice due to matrix multiplication.