Work

Seeded infinite models of the Austin identities E5093 and E5107

Year: 2026
Type: preprint
Abstract: Version 2. Kisielewicz showed that every finite magma satisfying x = y◇(y◇(y◇(x◇(z◇y)))) (E5093) has at most one element and asked whether the identity has a nontrivial model. A countably infinite model was first announced by vkg on the Lean Zulip in August 2026. We give an independent construction on the natural numbers by completing finite partial tables, and the same argument applies to the companion identity x = y◇(y◇(y◇(z◇(x◇y)))) (E5107). The construction accepts a prescribed finite seed: every admissible finite table extends to a model on the natural numbers that keeps its entries. A single seed with twelve entries thereby refutes five implications from the public SAIR research collections: E5093 ⇒ E10218, E5107 ⇒ E5012, E40951 ⇒ E40070, E40951 ⇒ E4916 and E5107 ⇒ E22818. The premises have only trivial finite models, so finite search cannot refute these implications. All proofs have been checked in Lean 4. Changes from version 1: version 1 described the E5093 question as open; it was first answered by vkg (Lean Zulip, #Equational, topic "A countably infinite model of Equation 5093", 5 August 2026). Version 2 credits that result, adds the companion identity E5107, the seeded completion theorem, and the five SAIR countermodels. Files: the paper (PDF and LaTeX source); E5093.lean, Replay.lean and lean-toolchain (the E5093 model from the empty table, Lean 4.24.0, Std only); SAIR-five-countermodels.zip (Seeded5093.lean, Seeded5107.lean, SAIRCountermodels.lean, ReplayAll.lean, the Python check check_diagram.py, and five standalone certificates for the SAIR stage-2 checker). Axioms reported for all main theorems: propext, Classical.choice, Quot.sound. The five certificates were accepted by a local run of the official checker; this is not a recorded online submission.
Language: English
Open Access status: green
OpenAlex ID: W7236434571
Cites:
Cited by:
Related to: 10