Four Order-Five Austin Laws and Their Duals: Explicit Countably Infinite Tree Models

We settle the infinite-model status of four single equational laws of order five, numbered 21714, 21864, 21865 and 21866 in the Equational Theories Project, together with their four duals (24200, 24199, 24197 and 24201). In a preceding preprint (DOI: 10.5281/zenodo.24294129), we proved that every finite magma satisfying any of these laws has at most one element. Here we construct explicit nontrivial countably infinite models for all eight equations. For Equation 21866, the construction uses finite ordered binary trees with two distinguished leaves. A decidable four-rule reachability relation defines a total binary operation, and a two-step transport invariant establishes the defining identity for arbitrary trees. The other three equations follow by specialization, while their duals are obtained by reversing the multiplication. The construction also exhibits an injective but nonsurjective canonical map on ordered pairs, in contrast with the bijectivity forced by finiteness in the preceding proof. Consequently, all eight equations are Austin laws. Furthermore, the complete nonempty cardinality spectrum of each equation consists of cardinality one and every infinite cardinality, by the upward Löwenheim–Skolem theorem. The explicit infinite models and their main structural properties have been checked in Lean 4.29.1 against the Equational Theories Project's Lean environment (commit 8b87204d5b201e1cf6c69b8dcabb0558109bee00). The supplementary archive ("Order5_Austin_Infinite_Lean_Certificates_ElKhatibi.zip") contains ten Lean 4 proof modules, the verification script ("VERIFY.sh"), a README with reproduction instructions, and a SHA-256 manifest. The cardinality-spectrum corollary uses the classical upward Löwenheim–Skolem theorem and is not separately formalized in the archive.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24310725
Primary Topic
Advanced Algebra and Logic
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Four Order-Five Austin Laws and Their Duals: Explicit Countably Infinite Tree Models

Walid EL KHATIBI EL HANANA
2 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Algebra and Logic
preprint

Four Order-Five Austin Laws and Their Duals: Explicit Countably Infinite Tree Models

Walid EL KHATIBI EL HANANA
preprint en

Abstract

We settle the infinite-model status of four single equational laws of order five, numbered 21714, 21864, 21865 and 21866 in the Equational Theories Project, together with their four duals (24200, 24199, 24197 and 24201). In a preceding preprint (DOI: 10.5281/zenodo.24294129), we proved that every finite magma satisfying any of these laws has at most one element. Here we construct explicit nontrivial countably infinite models for all eight equations. For Equation 21866, the construction uses finite ordered binary trees with two distinguished leaves. A decidable four-rule reachability relation defines a total binary operation, and a two-step transport invariant establishes the defining identity for arbitrary trees. The other three equations follow by specialization, while their duals are obtained by reversing the multiplication. The construction also exhibits an injective but nonsurjective canonical map on ordered pairs, in contrast with the bijectivity forced by finiteness in the preceding proof. Consequently, all eight equations are Austin laws. Furthermore, the complete nonempty cardinality spectrum of each equation consists of cardinality one and every infinite cardinality, by the upward Löwenheim–Skolem theorem. The explicit infinite models and their main structural properties have been checked in Lean 4.29.1 against the Equational Theories Project's Lean environment (commit 8b87204d5b201e1cf6c69b8dcabb0558109bee00). The supplementary archive ("Order5_Austin_Infinite_Lean_Certificates_ElKhatibi.zip") contains ten Lean 4 proof modules, the verification script ("VERIFY.sh"), a README with reproduction instructions, and a SHA-256 manifest. The cardinality-spectrum corollary uses the classical upward Löwenheim–Skolem theorem and is not separately formalized in the archive.

Zenodo (CERN European Organization for Nuclear Research)
Université Clermont Auvergne (FR), Institut Supérieur d’Informatique, de Modélisation et de leurs Applications (FR)
Advanced Algebra and Logic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon