Canonically Ordered Atomless Boolean Algebra

• The canonically ordered atomless Boolean algebra is a countable, homogeneous structure where finite Boolean algebras are endowed with a natural anti-lexicographic order.
• It is constructed as the Fraïssé limit of all finite naturally ordered Boolean algebras, ensuring the preservation of order on finite substructures and $c9$-categoricity.
• A key result shows that the random ordered graph is a semi-retract of this structure, linking two central objects in homogeneous combinatorics.

Searching arXiv for the specified paper and closely related context. The canonically ordered atomless Boolean algebra is the countable homogeneous structure $(\mathbf B,<)$ obtained as the Fraïssé limit of the class of all finite Boolean algebras equipped with the anti-lexicographic extension of a chosen linear order on their atoms. Its Boolean reduct $\mathbf B=(B;\wedge,\vee,\neg,0,1)$ is the classical countable atomless Boolean algebra, while the added linear order $<$ is the canonical ordering induced on each finite subalgebra by the atom-order. In the 2025 result "The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra" (Pinsker et al., 16 Jul 2025), this structure is used to show that the random ordered graph is a semi-retract of $(\mathbf B,<)$, thereby answering an open question of Bartošová and Scow.

1. Boolean-algebraic basis

A Boolean algebra is a structure

$A = (A; \wedge,\vee,\neg,0,1)$

in the signature $\{\wedge,\vee,\neg,0,1\}$, where $\wedge$ and $\vee$ are binary operations, $\neg$ is a unary operation, and $0,1$ are constant symbols. The abbreviation $\mathbf B=(B;\wedge,\vee,\neg,0,1)$0 means $\mathbf B=(B;\wedge,\vee,\neg,0,1)$1. The Boolean identities required are commutativity, associativity, absorption, distributivity, complementation, and the unit laws: $\mathbf B=(B;\wedge,\vee,\neg,0,1)$2

$\mathbf B=(B;\wedge,\vee,\neg,0,1)$3

$\mathbf B=(B;\wedge,\vee,\neg,0,1)$4

$\mathbf B=(B;\wedge,\vee,\neg,0,1)$5

$\mathbf B=(B;\wedge,\vee,\neg,0,1)$6

$\mathbf B=(B;\wedge,\vee,\neg,0,1)$7

An element $\mathbf B=(B;\wedge,\vee,\neg,0,1)$8 is an atom if $\mathbf B=(B;\wedge,\vee,\neg,0,1)$9 and there is no $<$0 with $<$1. The algebra is atomless if it has no atoms. Equivalently, for every nonzero $<$2 there exists a $<$3 with

$<$4

and hence also

$<$5

Within this setting, the canonically ordered atomless Boolean algebra is not merely an atomless Boolean algebra with an additional arbitrary linear order. The order is defined so that every finite subalgebra carries a specific anti-lexicographic order arising from an order on its atoms (Pinsker et al., 16 Jul 2025).

2. Canonical order on finite Boolean algebras

Every finite Boolean algebra $<$6 is isomorphic to the power set algebra $<$7, whose atoms may be identified with $<$8. After choosing a linear ordering

$<$9

on these atoms, one extends it to an anti-lexicographic order on all of $(\mathbf B,<)$0 as follows. For

$(\mathbf B,<)$1

with $(\mathbf B,<)$2, one sets

$(\mathbf B,<)$3

where the maximum is taken with respect to the chosen atom-order. Equivalently, one scans downwards from the largest atom, and at the first atom which appears in exactly one of the two joins, the element containing that atom is declared larger (Pinsker et al., 16 Jul 2025).

For the four-element Boolean algebra $(\mathbf B,<)$4 with atoms ordered $(\mathbf B,<)$5, the induced anti-lex ordering is

$(\mathbf B,<)$6

More generally, if $(\mathbf B,<)$7 are the atoms of a finite subalgebra $(\mathbf B,<)$8, then the order on all of $(\mathbf B,<)$9 is exactly the anti-lex order on joins of those atoms.

Several structural compatibilities are immediate. The order extends the Boolean lattice order $A = (A; \wedge,\vee,\neg,0,1)$0: if $A = (A; \wedge,\vee,\neg,0,1)$1, then the set of atoms appearing in $A = (A; \wedge,\vee,\neg,0,1)$2 is a subset of those appearing in $A = (A; \wedge,\vee,\neg,0,1)$3, so the maximal differing atom belongs to $A = (A; \wedge,\vee,\neg,0,1)$4, hence $A = (A; \wedge,\vee,\neg,0,1)$5. It is also compatible with subalgebras: if $A = (A; \wedge,\vee,\neg,0,1)$6 is a natural subalgebra, then the induced anti-lex order on $A = (A; \wedge,\vee,\neg,0,1)$7 is the restriction of the order on $A = (A; \wedge,\vee,\neg,0,1)$8. This is the sense in which the order is canonical rather than incidental.

3. Fraïssé-theoretic construction

Let $A = (A; \wedge,\vee,\neg,0,1)$9 be the class of all finite Boolean algebras, each equipped with one of these natural orders on its atoms. The class $\{\wedge,\vee,\neg,0,1\}$0 has the Hereditary, Joint Embedding, and Amalgamation Properties. By Fraïssé’s theorem there is therefore a unique, up to isomorphism, countable homogeneous structure

$\{\wedge,\vee,\neg,0,1\}$1

whose age is exactly $\{\wedge,\vee,\neg,0,1\}$2 (Pinsker et al., 16 Jul 2025).

This Fraïssé limit is called the canonically ordered atomless Boolean algebra. Its reduct

$\{\wedge,\vee,\neg,0,1\}$3

is exactly the countable atomless Boolean algebra. The finite naturally ordered Boolean algebras thus form the local pieces from which the global countable structure is assembled.

A common misunderstanding is to treat the ordering as an external linear extension added after the Boolean algebra has been fixed. In the present setting, the finite configurations already carry a prescribed anti-lexicographic structure, and the countable limit is built from those ordered finite pieces. The order is therefore part of the Fraïssé datum, not an auxiliary decoration.

4. Homogeneity, universality, and $\{\wedge,\vee,\neg,0,1\}$4-categoricity

The structure $\{\wedge,\vee,\neg,0,1\}$5 is homogeneous in the sense that every isomorphism between two finitely generated, equivalently finite, substructures extends to an automorphism of $\{\wedge,\vee,\neg,0,1\}$6. Concretely, for any two finite naturally ordered Boolean subalgebras

$\{\wedge,\vee,\neg,0,1\}$7

and any order- and operation-preserving isomorphism

$\{\wedge,\vee,\neg,0,1\}$8

there exists $\{\wedge,\vee,\neg,0,1\}$9 extending $\wedge$0 (Pinsker et al., 16 Jul 2025).

A corresponding universality statement holds: every countable atomless Boolean algebra $\wedge$1 equipped with any linear ordering that induces a natural order on each of its finite subalgebras embeds into $\wedge$2. The embedding requirement is therefore not arbitrary order-preservation, but preservation of the natural-order condition on finite subalgebras.

Since the reduct $\wedge$3 is the classical countable atomless Boolean algebra, it is well known to be $\wedge$4-categorical and to admit quantifier elimination in the language $\wedge$5. Adding the predicate $\wedge$6 preserves $\wedge$7-categoricity, so $\wedge$8 remains $\wedge$9-categorical. This places the structure simultaneously within the standard model theory of countable homogeneous structures and within the combinatorics of ordered Fraïssé limits.

5. Automorphisms, Ramsey property, and structural consequences

The automorphism group $\vee$0 is extremely well studied. In the unordered case it is a simple–closed group generated by certain involutions. After adding the natural order, $\vee$1 becomes smaller, consisting of those Boolean-algebra automorphisms that preserve the anti-lex order.

The ordered structure $\vee$2 has the Ramsey property: whenever one colours copies of any finite naturally ordered algebra $\vee$3 inside $\vee$4 in finitely many colours, there is an automorphic image of $\vee$5 on which all copies of $\vee$6 receive the same colour (Pinsker et al., 16 Jul 2025). From the Ramsey property together with extreme amenability of the automorphism group one derives structural consequences such as the existence of canonical envelopes for expansions and various topological dynamics results.

These facts situate the canonically ordered atomless Boolean algebra among the prominent ordered Fraïssé limits whose combinatorial regularity is reflected in strong dynamical properties of their automorphism groups. A plausible implication is that its role is not confined to Boolean algebra proper, but extends to the interface of structural Ramsey theory, homogeneous model theory, and topological dynamics.

6. Relation to the random ordered graph

A central 2025 result proves that the random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra, answering an open question of Bartošová and Scow (Pinsker et al., 16 Jul 2025). The statement identifies a direct structural link between two canonical countable ordered homogeneous objects: the random ordered graph and $\vee$7.

The abstracted significance of this result lies in transfer phenomena. The notion of semi-retract expresses a controlled structural relationship between homogeneous ordered structures. This suggests that the canonically ordered atomless Boolean algebra can serve as a source structure from which properties of the random ordered graph may be accessed through this semi-retract connection, although any such further consequences depend on the specific theory of semi-retracts developed in the cited work.

Within the context provided, the result is notable because it does not merely add another description of $\vee$8; it places the structure in a concrete relation to a benchmark object in homogeneous combinatorics. That answers an open question and clarifies the position of the canonically ordered atomless Boolean algebra in the landscape of countable ordered Fraïssé limits.