This article needs more citations. (November 2026) |

In mathematics, particularly in lattice theory, Funayama's lattice is a distributive lattice whose Dedekind–MacNeille completion is not a modular lattice.
The lattice was constructed by the Japanese mathematician Nenosuke Funayama in his 1944 paper, which demonstrated that the Dedekind–MacNeille completion does not necessarily preserve modularity or distributivity. In the same paper, Funayama established a necessary and sufficient condition for the Dedekind–MacNeille completion of a distributive lattice to remain distributive.
In 1872, the German mathematician Richard Dedekind introduced a method for constructing the real numbers from the rational numbers using cuts. Given the set of rational numbers , a cut is a pair of nonempty disjoint sets whose union is , such that every element of is smaller than every element of , and has no greatest element. In this way, all real numbers can be constructed. This method is known as the construction by Dedekind cuts.
In 1937, the American mathematician Holbrook Mann MacNeille generalized Dedekind's construction to arbitrary partially ordered sets. MacNeille showed that, given a partially ordered set , one can construct a complete lattice into which can be order-embedded, by generalizing the idea of Dedekind cuts beyond the rational numbers. Furthermore, MacNeille proved that this completion is the smallest possible completion: if is a complete lattice into which can be order-embedded, then can also be order-embedded into . This construction became known as the Dedekind–MacNeille completion.
In his paper, MacNeille proved that if is a Boolean algebra, then its Dedekind–MacNeille completion is a complete Boolean algebra. MacNeille also raised the questions of whether the Dedekind–MacNeille completion of a modular lattice is necessarily modular, and whether the completion of a distributive lattice is necessarily distributive.
These questions remained open until 1944, when Nenosuke Funayama published a paper providing a counterexample: a distributive lattice whose Dedekind–MacNeille completion is not modular. Since every distributive lattice is modular, this example answered both of MacNeille's questions in the negative. The lattice is known as Funayama's lattice.
Given a partially ordered set and a subset , define:
Additionally, for every , define:
It follows that and .
Finally, denote the Dedekind–MacNeille completion of by . By definition:
The order on is set inclusion. For every , the meet and join are given by:
It can be shown that for every , and that for every .

First, consider the ordinal number , ordered by the usual "less than or equal to" relation. Let denote a copy of with the reverse order (the left-pointing arrows distinguish the elements of from those of ). Define , where denotes the ordinal sum. Since both and are totally ordered sets, is also totally ordered.

Next, define the plane (see product order). This plane is not totally ordered. However, since every totally ordered set is a distributive lattice, and the direct product of distributive lattices is distributive, is a distributive lattice.
In the next step, an additional copy of the plane is introduced, producing two planes. Define the resulting lattice by , where the copy lies below the copy . This lattice is also distributive, being the direct product of a distributive lattice and a totally ordered set.
For , the meet and join are computed coordinatewise:
Finally, define the following sets:

All four sets are subsets of . Define their union by . This is Funayama's lattice.
First, it must be shown that Funayama's lattice is distributive. Since is a subset of , which is a distributive lattice, it is sufficient to prove that is a sublattice. Indeed, every sublattice of a distributive lattice is distributive.
For this purpose, given , we must determine whether and also belong to . This can be verified by considering the components of containing and . The results are summarized in the following tables.
As the tables show, regardless of which components contain and , both their meet and their join belong to . Therefore, is a sublattice of , and hence is distributive.

Consider . Recall that if and only if and . Note that the operations and are taken with respect to , rather than .
Define:
Consider the set . First, it must be shown that .
Observe that and . Therefore, and .
Furthermore, and , implying that .
Since , and is closed under intersections, it follows that .
Finally, it can be shown that
.
Consequently,
,
and hence .
Thus, . Moreover, the five elements satisfy , while is incomparable with both and , and
.
Therefore, is a sublattice isomorphic to the pentagon lattice . By the – theorem, is not modular.
In his paper, Funayama also established a necessary and sufficient condition for the Dedekind–MacNeille completion of a distributive lattice to remain distributive.
Funayama proved that is distributive if and only if, for every , the mapping
is injective, where the meet and join operations are taken in .
In a distributive lattice, two elements having the same meet and the same join with a third element must be equal. Funayama's result shows that, for the Dedekind–MacNeille completion of a distributive lattice to remain distributive, it is sufficient for this property to hold between elements of the original lattice and every element of the completion.
This condition fails for Funayama's lattice. Indeed, and , but and . Therefore, is not distributive.