AND distributes over XOR, unsurprisingly both from the left and right, that is:

x & y ^ z & y == (x ^ z) & y x & y ^ x & z == x & (y ^ z) a & c ^ a & d ^ b & c ^ b & d == (a ^ b) & (c ^ d)A somewhat popular explanation for

*why*is,

Conjunction and exclusive or form the multiplication and addition operations of a field GF(2), and as in any field they obey the distributive law.

Which is true and a useful way to think about it, but it is also the type of backwards explanation that relies on a concept that is more advanced than the thing which is being explained.

## Diagrams with crossing lines

Let's represent an expression such as `a & c ^ a & d ^ b & c ^ b & d` by putting the variables on the left of every AND along the top of a grid, and the variables on the right of every AND along the side. Then for example the grid cell on the intersection between the column of `a` and the row of `c` corresponds to the term `a & c`. Further, let's draw lines for variables that are True, in this example all variables are True:

The overall expression `a & c ^ a & d ^ b & c ^ b & d` counts the number of crossings, modulo 2. Rather than counting the crossings one by one, the number of crossings could be computed by counting how many variables along the top are True, how many along the side are True, and taking the product, again modulo 2. A sum modulo 2 is XOR and a product modulo 2 is AND, so this gives the equivalent expression `(a ^ b) & (c ^ d)`.

The simpler cases `x & y ^ z & y` and `x & y ^ x & z` correspond to 1x2 and 2x1 diagrams.

## Diagrams with bites taken out of them

Such a diagram with a section of it missing can be dealt with by completing the grid and subtracting the difference. For example the unwieldy `a & e ^ a & f ^ a & g ^ a & h ^ b & e ^ b & f ^ b & g ^ b & h ^ c & e ^ c & f ^ d & e ^ d & f` (shown in the diagram below) is "incomplete", it misses the 2x2 square that corresponds to `(c ^ d) & (g ^ h)`. Completing the grid and subtracting the difference gives `((a ^ b ^ c ^ d) & (e ^ f ^ g ^ h)) ^ ((c ^ d) & (g ^ h))`, which is correct.

This all has a clear connection to the FOIL method and its generalizations, after all conjunction and exclusive or form the multiplication and addition operations of a field GF(2)

.

The same diagrams also show why AND distributes over OR (the normal, inclusive, OR), which could alternatively be explained in terms of the Boolean semiring.