Maximal sublattices of convex geometries: four counterexamples

A mix of human-written and AI-generated textHuman understanding: some partsmath.RA — Rings and Algebrasmath.CO — Combinatoricsmath.MG — Metric Geometry

Contributed by Deep Bhattacharjee ↗

Version 1 / Oct 23, 2026 / CC BY 4.0

Abstract

Adaricheva, Mata, Silberger and Zamojska-Dzienio conjectured that in a finite convex geometry, and more generally in a finite join-semidistributive lattice, the complement of a maximal sublattice is a union of intervals with a common least element, and proved this for convex dimension two. We give convex geometries of convex dimension four and three in which such a complement has two and three minimal elements, so their theorem does not extend. The same examples refute their Hypothesis 4 and one half of their Question 2; an eleven-element convex geometry refutes the other half, and a ten-element lattice their Hypothesis 3.

Provenance statement

Deep Bhattacharjee chose the problem and directed the work. Claude (Anthropic), through Claude Code, carried out the searches and computations, wrote the checking programs and the Lean 4 proofs and drafted the paper. Answers Hypotheses 2, 3, 4 and Question 2 of Adaricheva et al. negatively. The proofs are written out in the paper; the programs and their outputs are in the release. The author approved the final version. Code and data: release v1.0.0, https://github.com/creelie/congenial-robot/releases/tag/v1.0.0.

Tools used

Anthropic
Claude CodeVersion Opus 5.5 Ultracode

References

  1. M. E. Adams, R. Freese, J. B. Nation and J. Schmid, Maximal sublattices and Frattini sublattices of bounded lattices , J. Austral. Math. Soc. Ser. A 63 (1997), 110--127. 10.1017/S1446788700000355DOI
  2. K. Adaricheva, A. Mata, S. Silberger and A. Zamojska-Dzienio, Conjecture on maximal sublattices of finite semidistributive lattices and beyond , Discrete Math. Theor. Comput. Sci. 28 :2 (2026). 10.46298/dmtcs.16374DOI
  3. K. Adaricheva and J. B. Nation, Convex geometries , in: G. Grätzer and F. Wehrung (eds.), Lattice Theory: Special Topics and Applications, Vol. 2, Birkhäuser, Cham, 2016, 153--179. 10.1007/978-3-319-44236-5_5DOI
  4. D. Bhattacharjee, Maximal sublattices of convex geometries: paper, Lean 4 development and computations , 2026. 10.5281/zenodo.23343145DOI
  5. G. Brinkmann and B. D. McKay, Posets on up to 16 points , Order 19 (2002), 147--179. 10.1023/A:1016543307592DOI
  6. C. C. Chen, K. M. Koh and S. K. Tan, Frattini sublattices of distributive lattices , Algebra Universalis 3 (1973), 294--303. 10.1007/BF02945131DOI
  7. R. P. Dilworth, Lattices with unique irreducible decompositions , Ann. of Math. (2) 41 (1940), 771--777. 10.2307/1968857DOI
  8. P. H. Edelman and R. E. Jamison, The theory of convex geometries , Geom. Dedicata 19 (1985), 247--270. 10.1007/BF00149365DOI
  9. A. Ignatiev, A. Morgado and J. Marques-Silva, PySAT: a Python toolkit for prototyping with SAT oracles , in: Theory and Applications of Satisfiability Testing (SAT 2018), Lecture Notes in Comput. Sci. 10929 , Springer, Cham, 2018, 428--437. 10.1007/978-3-319-94144-8_26DOI
  10. The mathlib Community, The Lean mathematical library , in: Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020), ACM, New York, 2020, 367--381. 10.1145/3372885.3373824DOI
Show all 14 referencesShow fewer references
  1. B. D. McKay and A. Piperno, Practical graph isomorphism, II , J. Symbolic Comput. 60 (2014), 94--112. 10.1016/j.jsc.2013.09.003DOI
  2. L. de Moura and S. Ullrich, The Lean 4 theorem prover and programming language , in: Automated Deduction -- CADE 28, Lecture Notes in Comput. Sci. 12699 , Springer, Cham, 2021, 625--635. 10.1007/978-3-030-79876-5_37DOI
  3. OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences , sequence A006966 (number of lattices on nn unlabeled nodes). https://oeis.org/A006966link
  4. I. Rival, Maximal sublattices of finite distributive lattices , Proc. Amer. Math. Soc. 37 (1973), 417--420. 10.1090/S0002-9939-1973-0311527-9DOI

Version history

  1. v1Submitted by Deep BhattacharjeeInitial depositCurrentOct 23, 2026