Logical matrix: Difference between revisions

Revision as of 18:55, 29 June 2022

Revision as of 19:01, 29 June 2022

Line 69:

A re-ordering of the rows and columns of such a matrix can assemble all the ones into a rectangular part of the matrix.<ref name=GS>{{cite book | doi=10.1017/CBO9780511778810 | isbn=9780511778810 | author=Gunther Schmidt | page=91 | title=Relational Mathematics | chapter=6: Relations and Vectors | publisher=Cambridge University Press | year=2013 | author-link=Gunther Schmidt }}</ref>

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'''.<ref name=GS/> A particular instance is the universal relation ''h h''<supmath>hh^{\operatorname{T}}</supmath>.

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 [[heterogeneous relation#Induced concept lattice|induced concept lattice]].

{{Group-like structures}}

Consider the table of group-like structures, where "unneeded" can be denoted 0, and "required" denoted by 1, forming a logical matrix ''R''. To calculate elements of ''R R''<supmath>RR^{\operatorname{T}}</supmath>, 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, semigroup is orthogonal to loop, small category is orthogonal to quasigroup, and groupoid is orthogonal to magma. Consequently there are zeros in ''R R''<supmath>RR^{\operatorname{T}}</supmath>, and it fails to be a [[universal relation]].

==Row and column sums==