Pseudo-finite Limits: Partition Lattices

• The paper establishes a continuous logic framework for finite partition lattices by proving that ultraproduct limits preserve key metric modularity properties.
• It demonstrates that complete metric lattices recover the meet operation and exhibit a definable Boolean core via the selector formalism, linking finite combinatorics to infinite structures.
• The work bridges discrete partition lattices with continuous limits by analyzing ultraproducts, selector geometry, and pseudomodularity to potentially classify pseudofinite models.

Pseudo-finite limits of partition lattices are limit objects obtained by treating finite partition lattices as complete metric lattices in the sense of continuous logic, and then passing to structures satisfying every sentence true in all finite partition lattices. In this framework, developed in "The model theory of metric lattices: pseudofinite partition lattices" (Mantilla et al., 15 Jul 2025), the central structural features are a metric notion of modularity, the recoverability of meet from join and the metric in complete settings, a definable Boolean sublattice of metrically modular elements, and a selector theory that reconstructs the ambient lattice from that Boolean core.

1. Metric-lattice setting

The starting point is a lattice written as

$L=(L,<,+,\cdot,0,1),$

where $+$ is join and $\cdot$ is meet, and the order is induced by

$x\leq y \iff x+y=y \iff xy=x.$

A metric lattice is then

$L=(L,<,+,\cdot,0,1,d)$

with $d$ a metric satisfying

$$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$

The rank function is

$|x|:=d(x,0),$

so the last inequality can be rewritten as

$d(x,y)\leq |x+y|-|xy|.$

The paper calls the metric “semi-modular” when this holds (Mantilla et al., 15 Jul 2025).

From these axioms the theory derives several basic estimates: $$||x|-|y||\leq d(x,y),\qquad d(x,y)=|y|-|x| \text{ whenever } x<y,$$ and

$+$0

It also introduces the symmetrized metric

$+$1

with

$+$2

A further derived quantity is

$+$3

which is symmetric in $+$4 and bounds the distances among the three points. The strengthened semi-modularity estimate

$+$5

supplies additional control over triples of elements.

Metric modularity is defined at the level of pairs. A pair $+$6 is metrically modular if

$+$7

equivalently,

$+$8

A metric lattice is metrically modular if every pair is so. The paper shows that in any metric lattice, metric modularity implies ordinary lattice modularity. This makes the metric formalism a strengthening of familiar lattice-theoretic modularity rather than a replacement for it.

2. Continuous logic and definability

The model-theoretic framework uses continuous logic with a language $+$9 having one sort $\cdot$0, constants $\cdot$1, and a binary function symbol $\cdot$2 interpreted as a contraction for the $\cdot$3-metric on $\cdot$4. The axioms $\cdot$5 assert the metric and semilattice laws together with the metric-lattice inequalities, and an $\cdot$6-structure is a model of $\cdot$7 iff it is a complete metric lattice. For metrically modular lattices, an additional sentence $\cdot$8 yields

$\cdot$9

while distributive metrically modular lattices are axiomatized by adjoining $x\leq y \iff x+y=y \iff xy=x.$0, giving $x\leq y \iff x+y=y \iff xy=x.$1. Boolean metric lattices are treated via a theory $x\leq y \iff x+y=y \iff xy=x.$2 obtained by adding weak complementation and the requirement $x\leq y \iff x+y=y \iff xy=x.$3 (Mantilla et al., 15 Jul 2025).

Completeness is structurally decisive. The paper proves that if $x\leq y \iff x+y=y \iff xy=x.$4 is a complete metric semilattice, then every subset has a least upper bound, and if the set is closed under join, that supremum lies in its closure. From this it follows that a complete metric semilattice is in fact a complete metric lattice: the meet of $x\leq y \iff x+y=y \iff xy=x.$5 is the maximal common lower bound, obtained as the least upper bound of the set of all common lower bounds in the order-dual picture. Accordingly, in complete metric lattices the meet is canonically recovered from the join and the metric.

This recoverability is sharpened by a definability theorem. In a complete metric lattice, a pair $x\leq y \iff x+y=y \iff xy=x.$6 is metrically modular iff for every $x\leq y \iff x+y=y \iff xy=x.$7 there is $x\leq y \iff x+y=y \iff xy=x.$8 with

$x\leq y \iff x+y=y \iff xy=x.$9

Using this characterization together with uniform continuity estimates,

$L=(L,<,+,\cdot,0,1,d)$0

whenever $L=(L,<,+,\cdot,0,1,d)$1 and $L=(L,<,+,\cdot,0,1,d)$2 are metrically modular, the paper applies Beth definability in continuous logic to show that

$L=(L,<,+,\cdot,0,1,d)$3

is definable in $L=(L,<,+,\cdot,0,1,d)$4. This is the key step by which meet, distributivity, and Booleanity become expressible inside the metric-lattice language.

3. Finite partition lattices and pseudofinite models

For a finite set $L=(L,<,+,\cdot,0,1,d)$5, $L=(L,<,+,\cdot,0,1,d)$6 denotes the lattice of partitions of $L=(L,<,+,\cdot,0,1,d)$7, ordered by refinement, with metric

$L=(L,<,+,\cdot,0,1,d)$8

For $L=(L,<,+,\cdot,0,1,d)$9, the notation $d$0 is used. The paper defines a pseudofinite partition lattice as a model of the theory $d$1, namely a complete metric lattice satisfying every sentence true in all finite partition lattices. In continuous logic this is expressed by

$d$2

Every ultraproduct of finite partition lattices is therefore a pseudofinite partition lattice (Mantilla et al., 15 Jul 2025).

The role of ultraproducts is not merely existential. The paper’s main message is that finite partition lattices can be treated as metric structures, their salient properties can be axiomatized in continuous logic, and their limits can then be analyzed through ultraproducts and definability. This gives a precise notion of “pseudofinite” limit object, distinct from but related to earlier “continuous” limit constructions.

The framework is designed to isolate those features of finite partition lattices that survive logical limiting processes. A plausible implication is that the theory is less tied to a specific embedding scheme than direct-limit constructions, because the definition of pseudofiniteness is sentence-by-sentence and ultraproduct-based.

4. Modular elements, singular partitions, and the Boolean core

A central combinatorial input is that the modular elements of a finite partition lattice are exactly the singular partitions. A partition $d$3 is singular if it has at most one block of size $d$4. The paper proves a quantitative estimate showing that the distance to the singular partitions controls the degree of modularity, where the modularity defect is defined by

$d$5

As a consequence, in a finite partition lattice,

$d$6

This characterization is preserved in ultraproducts: in an ultraproduct of finite partition lattices, the metrically modular elements are exactly ultraproducts of singular partitions (Mantilla et al., 15 Jul 2025).

For a pseudofinite partition lattice $d$7, the set $d$8 of metrically modular elements is the “Boolean core.” One of the paper’s central structural theorems states that

$d$9

The paper also shows that $$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$0 is definable in $$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$1, so quantification over modular elements is legitimate in that theory.

This Boolean core plays the role of an internal coordinate system for the ambient pseudofinite partition lattice. The paper’s formulation suggests that modularity is not an ancillary regularity condition but the organizing principle of the limit object. In particular, the identification of metrically modular elements with ultraproducts of singular partitions gives the Boolean core a direct finite-combinatorial origin.

5. Selectors and reconstruction

For $$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$2, a selector is a modular complement: an element $$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$3 such that

$$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$4

In finite partition lattices, selectors are exactly singular partitions whose main block meets each block of $$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$5 in exactly one element. The paper proves the corresponding pseudofinite result: every element of every pseudofinite partition lattice admits a selector. Moreover, the set of selectors of an element is definable, and the theory supplies quantitative control through the Hausdorff-distance estimate

$$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$6

for all $$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$7 in any pseudofinite partition lattice. A stronger estimate is also proved: $$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$8 These estimates make the selector sets robust invariants rather than merely existential witnesses (Mantilla et al., 15 Jul 2025).

The selector formalism yields a representation theorem for infinite pseudofinite partition lattices: the lattice can be reconstructed as a meet-subsemilattice of the lattice of closed subsets of its Boolean core. This reconstructive role is part of the paper’s basic analogy with ordinary partitions, where one recovers a partition from chosen representatives of its blocks.

This suggests that the Boolean core plus selector geometry captures a substantial amount of the ambient lattice structure. The paper explicitly raises the question whether the modular-core/selector structure axiomatizes all pseudofinite partition lattices, indicating that the reconstruction theorem may be close to a classification principle.

6. Relation to continuous limits and adjacent theories

The paper compares pseudofinite partition lattices with Björner and Lovász’s continuous limit $$d(1,0)=1,\qquad d(x+z,y+z)\leq d(x,y),\qquad d(x,y)\leq d(x+y,0)-d(xy,0).$$9 of partition lattices. Björner’s construction forms a direct limit $|x|:=d(x,0),$0 from the finite partition lattices $|x|:=d(x,0),$1 via refinement maps $|x|:=d(x,0),$2, and then completes it metrically to obtain $|x|:=d(x,0),$3. The paper explains that $|x|:=d(x,0),$4 is a continuous partition lattice in the sense of Björner, but its relation to $|x|:=d(x,0),$5 is subtle. It does not prove that $|x|:=d(x,0),$6, and it emphasizes that the standard embeddings $|x|:=d(x,0),$7 are not elementary. Indeed, formulas are exhibited whose values do not converge uniformly along these embeddings. What is proved is that all $|x|:=d(x,0),$8-sentences true in every finite partition lattice remain true in $|x|:=d(x,0),$9. Thus $d(x,y)\leq |x+y|-|xy|.$0 satisfies a nontrivial fragment of the pseudofinite theory, but not necessarily the whole theory as presented (Mantilla et al., 15 Jul 2025).

The paper also develops two additional conceptual connections. First, for a semilattice $d(x,y)\leq |x+y|-|xy|.$1, a function $d(x,y)\leq |x+y|-|xy|.$2 is positive semidefinite if the matrix $d(x,y)\leq |x+y|-|xy|.$3 is positive semidefinite for every finite tuple, and on finite semilattices such functions are exactly those arising as measures of principal up-sets $d(x,y)\leq |x+y|-|xy|.$4. A conditionally negative definite function $d(x,y)\leq |x+y|-|xy|.$5 produces a pseudo-metric semilattice via

$d(x,y)\leq |x+y|-|xy|.$6

and $d(x,y)\leq |x+y|-|xy|.$7 is a genuine semilattice metric iff $d(x,y)\leq |x+y|-|xy|.$8 is positive definite. The paper links this to Lovász’s work on submodular set functions. Second, it introduces pseudomodularity for metric lattices by requiring that for all $d(x,y)\leq |x+y|-|xy|.$9 the set

$$||x|-|y||\leq d(x,y),\qquad d(x,y)=|y|-|x| \text{ whenever } x<y,$$0

have a unique least element. This is presented as a possible essential ingredient for continuous limit constructions in the style of Björner and Lovász.

Among the open directions are a notion of “property $$||x|-|y||\leq d(x,y),\qquad d(x,y)=|y|-|x| \text{ whenever } x<y,$$1” for metric lattices, modeled on von Neumann algebra theory, and the question whether pseudofinite partition lattices can have it. Another open question asks whether the modular-core/selector structure axiomatizes all pseudofinite partition lattices. These problems indicate that pseudo-finite limits of partition lattices lie at the intersection of model theory of metric structures, combinatorial limit theory, and lattice-theoretic geometry, with the Boolean core and selector apparatus serving as the main organizing devices.