What was already known
Mikhail Kurkov posed this identity in 2018; earlier computations gave examples but no general proof in the reviewed account.
AI involvement
Claude agents developed the proof in John Erlbacher’s directed Demonstrandum campaign. Erlbacher audited its verification gates.
Claude agents supplied the proof in a human-directed campaign; result-specific autonomy is not documented.
Importance
Gives a general proof of a specific identity between two counting sequences.
Limitations
Exact enumeration covers block-minima classes through n=8, and the identity is compared through n=20. A completed rigorous check of the general proof is not documented.
Technical verification
The release reports exact enumeration through n=8 and recurrence checks through n=20, but no complete check of the general proof.
- Supporting source (raw.githubusercontent.com) — Documented check of the assessed claim
Independent checking
Exact generation of ordered set partitions by block-minima class and independent recurrence evaluation
- Checker
- Demonstrandum checker.py as reported by the paper and release
- Scope
- Refined block-minima count for n≤8, plus numerical identity through n=20
- Basis
- Reported by the linked checker
Human understanding
No named person is documented explaining the central insertion argument; Few is the evidence default.
Correction and publication history
The general identity remains supported by finite checks and an unverified proof argument.
Read this published revision