Paperlane

no. 17 · Wednesday 18 November 2026

Maximality of the Došen-Petrić Boolean Category

Florian Lengyel

math.CT · v2 · □ lean · 23 pp

Abstract

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.

comments
23 pages. Revised abstract. Lean formalization: https://palomar-registry.org/entry?id=PALOMAR-2026-10-30-000014&version=3
fields
Category Theory, Logic
pdf ↗ page arXiv:2611.19496 ↗