In mathematics, the lattice theorem, sometimes referred to as the fourth isomorphism theorem, states that there exists a bijection from the set of all subgroups of a group G containing a normal subgroupN onto the set of all subgroups of the quotient groupG/N. This means that the structure of the subgroups of G/N is exactly the same as the structure of the subgroups of G containing N, with N collapsed to the identity element.
Specifically, for a group G and a normal subgroup N of G, there exists a bijection from the set of all subgroups A of G containing N onto the set of subgroups A′ of G/N that maps a subgroup A of G to a subgroup A′ = A/N of G/N. For all A,B ≤ G containing N, and subgroups of G/NA′ = A/N and B′ = B/N, the following hold:
A ≤ B if and only if A′ ≤ B′,
if A ≤ B, then the index of A in B equals the index of A′ in B′,
<A,B>/N = <A′,B′>, where <A,B> is the subgroup of Ggenerated by A ∪ B,
(A ∩ B)/N = (A′) ∩ (B′), and
A G if and only if A' G'.
This list is far from inclusive. In fact, most properties of subgroups are preserved in their images under the bijection onto subgroups of a quotient group.
Let G be the group of 322,560 permutations of these 16 tiles generated by arbitrarily mixing random permutations of rows and of columns with random permutations of the four 2x2 quadrants.
Some of the patterns resulting from the action of G on D have been known for thousands of years.
For a discussion of other cases of the theorem, click here.