← All papers
First page of Maximality of the Došen-Petrić Boolean Category

Maximality of the Došen-Petrić Boolean Category

Florian Lengyel

math.CT Nov 14, 2026 · v2 math.LO
Lean 4 formalization of the free zero-identity Boolean category, Boolean Coherence, occurrence-coordinate substitution, and both maximality proofs.
We prove that the zero-identity Boolean category of Došen and Petrić, freely generated by a nonempty set of propositional variables, is maximal. Every congruence preserved by the operations on morphisms and by uniform formula substitution either is equality or identifies every pair of parallel morphisms. This disproves their conjecture that the category is not maximal. We give two proofs that use Boolean Coherence and uniform formula substitution to derive equality of the product projections from an identification of distinct parallel morphisms. We also give a Lean formalization of these proofs and their dependencies. It includes Boolean Coherence and the correspondence between substitution on tagged occurrence sets and substitution on finite ordinals.

Došen and Petrić conjectured that their freely generated zero-identity Boolean category is not maximal. The question is whether every congruence preserved by the operations on morphisms and by uniform substitution is either equality or total.

An identification of distinct parallel morphisms is reduced to equality of the product projections. Boolean Coherence isolates an occurrence pair on which the two relations differ, which yields the equation j_A∘π_1 = 0. Uniform substitution, double negation, and certain isomorphisms (or, in a second proof, the mix morphism) then collapse the quotient to a preorder. Formulas and arrow terms are encoded as inductive types in Lean 4, with derivability as a generated relation, and substitution, normalization and the occurrence interpretation are proved to respect it.

The category is maximal, which disproves the conjecture. The Lean development checks both proofs and their dependencies, including Boolean Coherence and the correspondence between tagged-occurrence substitution and finite-ordinal substitution.