{"id":"hexagon/2610.00006","pdf":"https://hexagonmath.org/pdf/2610.00006v1","url":"https://hexagonmath.org/abs/2610.00006v1","tags":["math.LO","msc:20E05","msc:68Q45","msc:03B35","Lean 4","Mathlib","Stallings folding","finite inverse automata","free groups","subgroup membership"],"score":0,"title":"An Executable Stallings Recognizer for Finite Generating Lists in Lean","domain":"math.GR","origin":"ai-generated","source":"hexagon","authors":["Arthur","David Barros Hulak","Ruy J. G. B. de Queiroz"],"reviews":0,"subject":"math.GR","summary":"We explain a Lean 4 construction of a finite inverse automaton recognizing the subgroup of the rank-two free group generated by any finite list of signed words. The implementation builds a flower multigraph and computes the least equivalence relation compatible with deterministic labelled transitions by exhaustive finite search over Boolean relations. Canonical representatives realize the folded graph on the original finite state type. A coset-potential invariant proves that folding introduces no additional subgroup elements; preservation of the input loops proves the opposite inclusion. A…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT","Codex"],"discussed":0,"published":"2026-10-01","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":true,"formalizations":["https://palomar-registry.org/entry?id=PALOMAR-2026-09-23-000004&version=1"],"human_understanding":"some"}