# Bounded homomorphisms and finitely generated fiber products of lattices

## TL;DR

This paper characterizes bounded lattice homomorphisms and explores conditions under which fiber products of finitely generated lattices are finitely generated, providing an algorithm to decide boundedness in these structures.

## Contribution

It introduces a new characterization of bounded lattice homomorphisms onto lattices satisfying Dean's condition (D) and establishes conditions for fiber products to be finitely generated.

## Key findings

- All finitely presented lattices satisfy Dean's condition (D)
- Boundedness of homomorphisms implies finitely generated fiber products for certain lattices
- Provides an exponential time algorithm to decide boundedness in finitely presented lattices

## Abstract

We investigate when fiber products of lattices are finitely generated and obtain a new characterization of bounded lattice homomorphisms onto lattices satisfying a property we call Dean's condition (D) which arises from Dean's solution to the word problem for finitely presented lattices. In particular, all finitely presented lattices and those satisfying Whitman's condition satisfy (D). For lattice epimorphisms $g\colon A\to D$, $h\colon B\to D$, where $A$, $B$ are finitely generated and $D$ satisfies (D), we show the following: If $g$ and $h$ are bounded, then their fiber product (pullback) $C=\{(a,b)\in A\times B\ |\ g(a)=h(b)\}$ is finitely generated. While the converse is not true in general, it does hold when $A$ and $B$ are free. As a consequence we obtain an (exponential time) algorithm to decide boundedness for finitely presented lattices and their finitely generated sublattices satisfying (D). This generalizes an unpublished result of Freese and Nation.