Concept understanding — Binary Operations on Boolean Matrices (Join and Meet)
A Boolean matrix is a matrix all of whose entries are 0 or 1 (the "on/off" values used to model electrical switches, adjacency in graph theory, etc.). Two Boolean matrices A=[aij] and B=[bij] of the same order combine via two new binary operations.
Join, A∨B. Entrywise: cij=aij∨bij=max(aij,bij) -- i.e. cij=1 if eitheraij=1 or bij=1, and cij=0 only when both entries are 0.
Meet, A∧B. Entrywise: cij=aij∧bij=min(aij,bij) -- i.e. cij=1 only when bothaij=1 and bij=1.
Which of the five properties do join and meet satisfy? Let B be the set of all Boolean matrices of a fixed order.
Closure: since aij∨bij and aij∧bij are each either 0 or 1, both A∨B and A∧B stay in B -- both are binary operations on B.
Commutative:max and min of two numbers do not care about order, so both ∨ and ∧ are commutative.
Associative: both are associative, entry by entry. …
Join takes the entrywise maximum (a 1 if either matrix has a 1 there) and meet takes the entrywise minimum (a 1 only if both matrices have a 1 there); we compute A∨B and A∧B first, then use them to build the last two answers.
Step 1. Compute A∨B (entrywise max) with A=101010100011, B=011100010101.