What was already known
Cranston, Li, Su, Wang and Xu proved the even-order and even-k cases and conjectured the full threshold of 4.
AI involvement
Goel reports that Claude and ChatGPT did most of the mathematical work under his supervision.
- Dave Goel’s proof of the flow reconfiguration conjectureAI disclosure and provenance
Importance
Goel settles both parts of the conjecture. The proof reduces the graph by joining an incoming and outgoing edge that carry the same flow value.
Technical verification
The paper reports Lean 4 Comparator checking of its theorems, including the two flow-connectivity results, using only Lean’s standard axioms.
Formal checking
The paper reports Lean 4 Comparator checking of its theorems, including the two flow-connectivity results, using only Lean’s standard axioms.
- Checker
- Lean 4 Comparator
- Scope
- On a finite graph whose vertex degrees are all even, any two nowhere-zero flows over a finite abelian group of order at least 4 are connected by cycle moves. The same holds for integer flows with absolute edge values between 1 and for each integer .
- Basis
- Reported by the linked checker
- Versioned Lean proof and Comparator filesProof and documented checking scope
Human understanding
The paper explains the balanced-pair induction. Its disclosure credits the mathematical work predominantly to the models and gives no separately attributed human account of the key argument.
Correction and publication history
Published a scoped research advance with primary evidence of central AI work.
Read this published revision