Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 18 min ago
PreprintarXiv licencearXiv

The Composition Lemma for n-dependence

Abstract

We prove that a relation obtained by composing arbitrary functions of arity ≤ k with a relation definable in an n-dependent structure is kn-dependent. This confirms a conjecture of Chernikov and Hempel. We also demonstrate optimality of the result.

Related

  1. The Kaplansky-Walker Lemma for additive categories
    Simion Breaz, Cristian Rafiliu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. A Lê number addendum to the Morse Splitting Lemma
    David B. Massey
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. An equivariant version of Gabber's lemma
    Filippo Belfiori
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Data-Driven Control in Infinite-Dimensional Spaces: Fundamental Lemma and Applications
    Daniel López-Montero
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. No Connectedness Lemma for Alexandrov spaces
    Jan Nienhaus, Dennis Wulle
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
BibTeX
@misc{chernikov2026composition,
  title = {{The Composition Lemma for $n$-dependence}},
  author = {Artem Chernikov and Yuyan He},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.01230},
  eprint = {2609.01230},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.01230},
}
RIS
TY  - UNPB
TI  - The Composition Lemma for n-dependence
AU  - Artem Chernikov
AU  - Yuyan He
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.01230
UR  - https://arxiv.org/abs/2609.01230
AB  - We prove that a relation obtained by composing arbitrary functions of arity ≤ k with a relation definable in an n-dependent structure is kn-dependent. This confirms a conjecture of Chernikov and Hempel. We also demonstrate optimality of the result.
ER  -