What was already known
The deque conjecture asks for constant amortized cost. Earlier analyses still incurred a fixed inverse-Ackermann-type factor.
AI involvement
The authors credit Gemini 4 Carbon with discovering the proof under light guidance from Zuzic, Woodruff and Mirrokni. Zuzic and Yingchareonthawornchai edited the manuscript. Zuzic, Woodruff and Mirrokni prepared the Lean check.
- Manuscript AI disclosureManuscript AI disclosure
Importance
The bound improves a longstanding sequence of amortized analyses of splay trees used as double-ended queues.
Technical verification
The repository identifies the precise declarations for the main bound, its auxiliary theorems and its standalone statement.
Formal checking
Checked the main rotation bound and the equivalence of the standalone and project specifications.
- Checker
- Lean 4 kernel
- Scope
- The paper bounds the number of splay rotations used by m deque operations starting with n keys by . Its ordinal inverse-Ackermann factor grows more slowly than every fixed finite iteration of the usual inverse-Ackermann function.
- Basis
- Reported by the linked checker
- Lean proof of the two main statementsLean proof of the two main statements
Human understanding
The disclosure identifies who guided the model, edited the paper and prepared Lean. It leaves a human reconstruction of the model’s main contraction argument undocumented.
Other useful sources
Correction and publication history
Reviewed the primary result and its documented AI and checking scope.
Read this published revision