{"schema":"postcutoff/event@1","as_of":"2026-10-13T07:38:00+02:00","url":"https://postcutoff.com/e/2026-10-05-decreasing-diagrams-complete-for-confluence-rta-problem-56/","md":"https://postcutoff.com/e/2026-10-05-decreasing-diagrams-complete-for-confluence-rta-problem-56/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"Adam Bicz","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-05-decreasing-diagrams-complete-for-confluence-rta-problem-56","date":"2026-10-05","date_precision":"day","short_title":"Decreasing diagrams are complete for confluence","deck":"Van Oostrom's 1993 question (RTA open problem 56) settled, machine-checked in Isabelle/HOL and Lean with Claude's help (Endrullis, Ivanov, van Raamsdonk)","takeaway":"Is one proof technique enough to certify every confluent rewriting system? Van Oostrom asked in 1993 and conjectured no. Three researchers prove yes, with only three labels, for systems of any cardinality. The mathematics is theirs; the two formalizations were developed with Anthropic's Claude.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.06368: Decreasing Diagrams are Complete for Confluence","url":"https://arxiv.org/abs/2610.06368","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"Zenodo: Isabelle/HOL and Lean formalizations","url":"https://doi.org/10.5281/zenodo.23160921","type":"code","group":"primary","domain":"doi.org"}],"official":2,"filed":"2026-10-13","updated":"2026-10-13","orgs":["Vrije Universiteit Amsterdam","Taras Shevchenko National University of Kyiv","Anthropic"],"title":"Decreasing diagrams are complete for confluence: van Oostrom's 1993 question (RTA open problem 56) settled, machine-checked in Isabelle/HOL and Lean with Claude's help (Endrullis, Ivanov, van Raamsdonk)","summary":"On 5 Oct 2026 Jörg Endrullis, Ievgen Ivanov and Femke van Raamsdonk posted arXiv 2610.06368: every confluent abstract rewriting system admits a locally decreasing labeling using only three labels, which is optimal. This answers Problem 56 of the RTA List of Open Problems, posed by Vincent van Oostrom in 1993 and previously known only for countable systems and up to cardinality ℵ_1. The abstract says: \"We settle this thirty-three-year-old problem in full.\" The development is machine-checked in both Isabelle/HOL and Lean. The AI role is limited to formalization: \"The mathematical content — the definitions, constructions, and proofs — is the authors' own; the formalizations were developed with the assistance of Anthropic's Claude, under the authors' direction and review.\"","key_facts":["Paper: 'Decreasing Diagrams are Complete for Confluence', arXiv 2610.06368 [cs.LO], 5 Oct 2026; Jörg Endrullis (Vrije Universiteit Amsterdam), Ievgen Ivanov (Taras Shevchenko National University of Kyiv), Femke van Raamsdonk (Vrije Universiteit Amsterdam)","Confluence: a nondeterministic computation 'always yields the same result, regardless of the order in which steps are taken'. Van Oostrom's decreasing diagrams technique reduces it to a local condition: 'a system is confluent whenever its transitions admit a locally decreasing labeling. Essentially all classical confluence criteria arise as corollaries.'","Question (1993, RTA Problem 56): 'Does every confluent transition system admit a locally decreasing labeling?' Known before: yes for countable systems, 'and recently up to the first uncountable cardinal ℵ_1'","Result: 'every confluent transition system admits a locally decreasing labeling using only three labels. This bound is optimal, as two labels do not suffice even at the first uncountable cardinality.'","Paper: 'This outcome was not foregone: van Oostrom conjectured that decreasing diagrams are incomplete … and related questions about uncountable directed sets are independent of ZFC.'","Paper: 'To the best of our knowledge, these are the first unconditional completeness results for methods of proving confluence.'","Verification: 'the entire development is independently machine-checked in two proof assistants, Isabelle/HOL and Lean; both formalizations are archived on Zenodo'. The Isabelle proof shows the result holds in ZFC; the paper notes that 'a Lean proof alone would not give this'","AI disclosure: 'the formalizations were developed with the assistance of Anthropic's Claude, under the authors' direction and review. The authors take full responsibility for the correctness and presentation of this work.' No Claude model is named"],"key_numbers":[],"tags":["computer-science","logic","rewriting","confluence","decreasing-diagrams","isabelle","lean","formalization","claude","ai-assisted-formalization"],"science":{"field":"computer-science","subfield":"logic in computer science (rewriting theory)","problem":"RTA List of Open Problems #56 (van Oostrom 1993): is the decreasing diagrams technique complete, i.e. does every confluent abstract rewriting system admit a locally decreasing labeling?","result":"Yes, for systems of every cardinality, with three labels (optimal).","open_since":"1993","ai_system":["Claude"],"human_role":"Human-led: the definitions, constructions and proofs are the authors'; Claude assisted with the Isabelle/HOL and Lean formalizations under their direction","verification":{"key":"lean","label":"Lean-verified","text":"Machine-checked in Isabelle/HOL and in Lean (two independent formalizations); unrefereed preprint"},"status":"pending","shock":"The author of the technique had conjectured the opposite answer.","short":"Decreasing diagrams complete for confluence (RTA #56)"},"body_md":"## What happened\n\nA rewriting system is confluent if, whenever a computation can branch, the branches can always be brought back together. It is\nthe property that makes the result of a program independent of evaluation order. Van Oostrom's decreasing diagrams method (1990s)\nproves confluence by labeling the steps and checking only small local diagrams, and it subsumes nearly all older criteria. Whether\nit can prove confluence of every confluent system was Problem 56 on the rewriting community's list of open problems. A positive\nanswer was known for countable systems; beyond that the question runs into set theory, and van Oostrom himself conjectured a\nnegative answer.\n\nThe preprint proves completeness at every cardinality by two transfinite constructions (a \"fan\" for regular cofinality and a\n\"double fan\" for the singular case) and shows that three labels always suffice. Because the argument is delicate, the authors\nformalized all of it twice, in Isabelle/HOL and in Lean, and say Claude assisted with both formalizations.\n\n## Why it matters\n\nHere the AI did not find the proof. The entry is in the dataset as a sample of the other common use of models in 2026 mathematics:\nmaking a full machine-checked formalization, in two proof assistants, cheap enough to ship with the first preprint of a\n33-year-old problem's solution.","disputed":[{"label":"Verification","text":"Machine-checked in Isabelle/HOL and in Lean (two independent formalizations); unrefereed preprint","sources":[]}],"related":[{"id":"2026-10-06-multiplier-associativity-hard-for-resolution-gpt-5-6-sol","url":"https://postcutoff.com/e/2026-10-06-multiplier-associativity-hard-for-resolution-gpt-5-6-sol/","date":"2026-10-06","date_precision":"day","short_title":"Why SAT solvers fail on multiplication","deck":"First exponential resolution lower bound for multiplier associativity; 'main ideas and the core proof … are due to GPT-5.6-Sol' (Liew)","takeaway":"SAT solvers are known to choke on multiplication, but nobody had proved that short proofs do not exist. Vincent Liew's preprint proves an exponential lower bound for resolution proofs that n-bit multiplication is associative, resolving an open problem he had posed with Paul Beame. He credits the main ideas and the core proof to GPT-5.6 Sol; a Lean 4 formalization was generated by Claude Fable 5.1.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":2,"official":2,"filed":"2026-10-13","updated":"2026-10-13","orgs":["OpenAI","Anthropic"]},{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":9,"official":4,"filed":"2026-09-30","updated":"2026-10-13","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-13","type":"filed","text":"Created from the arXiv PDF"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-13","run":null,"sources_read":"The arXiv PDF","updated":"2026-10-13","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":158,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":97,"in_training_data":false},{"model_id":"gemini-3-8-flash","name":"Gemini 3.8 Flash","cutoff":"2026-03","days_after":188,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":127,"in_training_data":false}],"short_url":null}