Problem 11 - Applied Abstract Algebra

Question

Let \(f\) be a monomorphism from the lattice \(L\) into the lattice \(M\). Show that \(L\) is isomorphic to a sublattice of \(\underline{M}\).

Step-by-Step Solution

Answer

We defined \(f(L)\) to be the image of the lattice \(L\) under the monomorphism \(f\). We then showed that \(f(L)\) is a sublattice of \(M\) because it is closed under the join and meet operations. Finally, we showed that \(L\) is isomorphic to the sublattice \(f(L)\), because there exists a bijective function that preserves the lattice operations between them.

Step 1 Definition of Monomorphism

A monomorphism from a lattice \(L\) to a lattice \(M\) is a function \(f: L \rightarrow M\) that preserves the lattice operations. This means that for all elements \(x, y\) in \(L\), \(f(x \vee y) = f(x) \vee f(y)\) and \(f(x \wedge y) = f(x) \wedge f(y)\).

Step 2 Defining the sublattice

Let us denote the image of \(L\) under \(f\) as \(f(L)\), it is a subset of \(M\). We will show that \(f(L)\) is a sublattice by verifying that it is closed under the lattice operations. To show that it is closed under the join operation \(\vee\), let us take any two elements \(a, b\) in \(f(L)\). Because these are in the image of \(f\), there exists elements \(x, y\) in \(L\) such that \(f(x) = a\) and \(f(y) = b\). So \(a \vee b = f(x) \vee f(y) = f(x \vee y)\). Since \(x \vee y\) is in \(L\), their image under \(f\) is in \(f(L)\). Hence, \(f(L)\) is closed under join. Similarly, we can show that it is closed under meet.

Step 3: Verifying Isomorphism

To verify that \(L\) is isomorphic to \(f(L)\), we need to show that there exists a bijective function \(g: L \rightarrow f(L)\) that preserves the lattice operations. The function \(g\) is the restriction of \(f\) to \(f(L)\), so \(g = f|_{f(L)}: L \rightarrow f(L)\). It is clear that \(g\) is bijective, because we have defined \(f\) is an injection and \(f(L)\) is just the image of \(L\) under \(f\). As we have proved above, \(g\) also preserves the lattice operations. Hence, \(L\) is isomorphic to \(f(L)\), a sublattice of \(M\).

Key Concepts

Monomorphisms

First, let's discuss the concept of monomorphisms in lattice theory. A monomorphism is essentially a special kind of function between two lattices that holds some crucial properties. Specifically, it is a function that maintains the structure of the lattice. This means if you have two lattices, say \(L\) and \(M\), and a monomorphism \(f:L \rightarrow M\), then the function \(f\) must preserve the operations typical to lattice structures, which are the join (\(\vee\)) and meet (\(\wedge\)) operations.

• For any two elements \(x\) and \(y\) in \(L\), applying the join operation to them and then \(f\) should give the same result as applying \(f\) to \(x\) and \(y\) individually, then performing the join: \(f(x \vee y) = f(x) \vee f(y)\).
• Similarly, applying the meet operation is maintained by \(f\): \(f(x \wedge y) = f(x) \wedge f(y)\).

These properties ensure that the mapping \(f\) respects the internal structure of the input lattice \(L\), embedding it like a pattern or an image into the larger lattice \(M\). This preservation occupies a critical role because it keeps the relational characteristics of elements intact through the mapping.

Sublattices

Now that we have a monomorphism, its next role is to help define a sublattice within our target lattice \(M\). The term "sublattice" refers to a subset of a lattice that itself forms a lattice with respect to the same operations defined in the original lattice. In our case, the image of \(L\) under the monomorphism \(f\), denoted as \(f(L)\), becomes a sublattice of \(M\). This essentially means

• For any elements \(a, b\) belonging to \(f(L)\), the join \(a \vee b\) and the meet \(a \wedge b\) both exist in \(f(L)\).
• This closure under join and meet operations is a necessary condition to call \(f(L)\) a sublattice.

To achieve closure, each operation must result within \(f(L)\). Since \(f\) is a function respecting these operations, any join or meet in \(L\) under \(f\) lands neatly within \(f(L)\), making \(f(L)\) self-sustaining for lattice operations and thereby a sublattice of \(M\). In effect, this sublattice mirrors the structure of the original lattice \(L\) within \(M\).

Isomorphism

Finally, let’s discuss the concept of isomorphism in the context of lattices. An isomorphism is like a perfect mapping between two structures, ensuring not just a correspondence but a perfect one-to-one relationship that respects the operations at play. In our case, we see that \(L\) is isomorphic to the sublattice \(f(L)\) of \(M\) through the monomorphism \(f\).

• This essentially means there exists a function \(g: L \rightarrow f(L)\), often the same as our function \(f\), but restricted to \(f(L)\) so that it is bijective — meaning that every element of \(L\) has a unique image in \(f(L)\) and vice-versa.
• Moreover, \(g\) will preserve the lattice structure in both directions of the mapping, ensuring it is truly an isomorphic relation.

Hence, with this perfect mapping \(g\), every structural detail of the lattice \(L\), encoded through its elements and their relationships via join and meet, has a counterpart in \(f(L)\). This congruence forms a bridge where lattice \(L\) can be navigated as if it were literally inside \(M\), thanks to the clear and structure-preserving mapping inherent in \(f\). Thus, \(L\) and the sublattice \(f(L)\) are, for all intents and purposes, identical in their structure, even while residing in two different places.