
In mathematics, particularly in order theory, the M3–N5 theorem is a mathematical theorem that characterizes the modularity and distributivity of a lattice by examining only its finite sublattices.
The first part of the theorem, stating that a lattice is modular if and only if it contains no sublattice isomorphic to , was first proved by the German mathematician Richard Dedekind in 1900. The second part, stating that a lattice is distributive if and only if it contains no sublattice isomorphic to either or , was proved by the American mathematician Garrett Birkhoff in 1934. The theorem is also sometimes referred to as the Dedekind–Birkhoff theorem.
A set equipped with two binary operations and is called a lattice if and only if both operations are associative, commutative, and idempotent, and satisfy the absorption identities and . For , one writes if and only if , or equivalently, . The operations and are called the meet and join, respectively.
A lattice is called modular if and only if it satisfies the identity whenever . Furthermore, a lattice is called distributive if and only if it satisfies the identity for all (without any comparability requirement). Every distributive lattice is necessarily modular.
Given a lattice , a subset is called a sublattice if and only if it is closed under meet and join.
Two lattices are called isomorphic if there exists a bijective function such that and for all .
The pentagon lattice is the lattice , where and , and is incomparable with both and .
The diamond lattice is the lattice , where , , and , and the elements , , and are pairwise incomparable.
Let be any lattice. Then:
: Suppose that is a modular lattice, and assume for a contradiction that it contains a sublattice isomorphic to . By modularity,
However, , since otherwise would not be isomorphic to . This is a contradiction, and therefore contains no sublattice isomorphic to .
: We proceed by contraposition. Suppose that is not modular. We must show that it contains a sublattice isomorphic to .
Since is not modular, there exist such that and
Define
It can be shown that these five elements are pairwise distinct, that and , that is incomparable with both and , and that and . Consequently, is a sublattice isomorphic to .
To prove the second statement, we first use the following lemma: a lattice is distributive if and only if, for all ,
Note that the inequality
always holds in any lattice.
Since the first statement establishes that is modular if and only if it contains no sublattice isomorphic to , it suffices to assume that is modular and prove that it is distributive if and only if it contains no sublattice isomorphic to .
: Suppose that is distributive, and assume for a contradiction that it contains a sublattice isomorphic to . By distributivity,
However, , since otherwise would not be isomorphic to . This is a contradiction, and therefore contains no sublattice isomorphic to .
: We proceed by contraposition. Suppose that is modular but not distributive. We must show that it contains a sublattice isomorphic to .
Since is not distributive, there exist such that
Define
It can be shown that these five elements are pairwise distinct, that , , and , that , , and are pairwise incomparable, and that
and
Consequently, is a sublattice of isomorphic to .
This completes the proof.
Let be a vector space, and denote by the set of all its linear subspaces. For any , both and are linear subspaces of and therefore belong to . It follows that forms a lattice under set inclusion, with intersection and subspace sum as the meet and join operations, respectively.
One may ask whether is modular or distributive. It can be shown that, for all , whenever ,
Thus, is modular. However, if the dimension of is at least two, it is not distributive. For example, if , define
It can be shown that is a sublattice isomorphic to . Therefore, is not distributive.
The significance of the M3–N5 theorem lies in its characterization of two fundamental classes of lattices by means of a finite number of forbidden sublattices, rather than by directly verifying the algebraic identities that define them. In particular, although the theorem applies to infinite lattices as well, any failure of modularity or distributivity implies the existence of a five-element sublattice witnessing that failure. Thus, to prove that a lattice is not modular or not distributive, it suffices to find a sublattice isomorphic to one of the corresponding forbidden lattices.
The theorem illustrates the relationship between the algebraic properties of a lattice and the order-theoretic structure of its sublattices. It is a fundamental example of the characterization of classes of mathematical structures by means of forbidden substructures.