Composition conjecture for n-dependence
For all positive integers and , if is an -dependent structure, is a relation definable in , and are arbitrary functions with for , then the composed relation defined by is -dependent.
References
Source: arXiv
Progress summary
An unrefereed preprint claims to settle the conjecture and show its numerical bound is sometimes best possible.
The conjecture of Chernikov and Hempel concerns preservation of -dependence under composition with functions of bounded arity. The available sources do not give the conjecture’s original date.
Known results
- Earlier work proves the binary composition case, with arity .
- A later preprint states a general composition lemma for arbitrary finite arity , presenting it as Theorem .
September 1, 2026 claimed confirmation
On September 1, 2026, the preprint The Composition Lemma for -dependence claimed to confirm the Chernikov–Hempel conjecture and to show that the factor cannot generally be improved. This is an unrefereed claim; the retrieved sources contain no independent verification or analysis of the sharpness assertion.
Current status (as of September 2026): The conjecture is claimed proved, and the factor is claimed sharp in general, but both claims remain unverified.
Sources
Solutions 0
No solutions have been posted yet.