Metraipolis › archive › dc_46b5086846bf
On the Triangle Inequality for the Jaccard Distance in Arbitrary Lattices — arXiv:2608.18194
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18194
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T13:44:23.747Z
- SHA-256 of the archived text
bedd5194ca39ff8099d1cd97e17d1cfe91d1326b834606024d804750d6338b69- Stable URL of this page
https://metraipolis.com/documento/dc_46b5086846bf
How to cite
On the Triangle Inequality for the Jaccard Distance in Arbitrary Lattices — arXiv:2608.18194 — arXiv (en), https://arxiv.org/abs/2608.18194 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_46b5086846bf (Metraipolis archive dc_46b5086846bf, sha256 bedd5194ca39ff8099d1cd97e17d1cfe91d1326b834606024d804750d6338b69)
BibTeX
@misc{dc46b5086846bf,
title = {On the Triangle Inequality for the Jaccard Distance in Arbitrary Lattices — arXiv:2608.18194},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18194},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_46b5086846bf; sha256 bedd5194ca39ff8099d1cd97e17d1cfe91d1326b834606024d804750d6338b69},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18194. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper presents new theoretical results on generalizing the Jaccard distance for lattices and real valuations. We demonstrate that when the valuation is strictly positive, monotone, and modular, the Jaccard distance satisfies the triangle inequality on arbitrary lattices, effectively generalizing earlier results that depended heavily on distributivity. Moving to relatively complemented distributive lattices (which safely drop the requirement for the global bounds found in Boolean algebras), we prove the triangle inequality holds as long as the valuation is positive, monotone, supermodular, and $\log$-submodular. Additionally, we adapt the symmetric-difference Jaccard formulation for submodular valuations to sectionally complemented distributive lattices. Shifting to necessary conditions, we prove that supermodularity is a strict requirement for the standard generalized Jaccard distance to operate as a valid metric. Finally, we map the practical value of relaxing these structural constraints to computational fields like quantum information theory, formal concept analysis, and machine learning, closing with a brief look at open mathematical problems. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-20 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI) ; Discrete Mathematics (cs.DM); Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.18194 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T13:41:17.850Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).