On the Averaging Problem of Ideal Families Related to Frankl's Conjecture with Formal Proof by Lean 4

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Hachimori, Masahiro, Kashiwabara, Kenji
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909584113795072
author Hachimori, Masahiro
Kashiwabara, Kenji
author_facet Hachimori, Masahiro
Kashiwabara, Kenji
contents Frankl's conjecture, also known as the union-closed sets conjecture, can be equivalently expressed in terms of intersection-closed set families by considering the complements of sets. It posits that any family of sets closed under intersections, and containing both the ground set and the empty set, must have a ``rare vertex'' -- a vertex belonging to at most half of the members of the family. The concept of \emph{average rarity} describes a set family where the average degree of all the elements is at most half of the number of its members. Average rarity is a stronger property that implies the existence of a rare vertex. This paper focuses on ideal families, which are set families that are downward-closed (except the ground set) and include the ground set. We present a proof that the normalized degree sum of any ideal family is non-positive, which is equivalent to saying that every ideal family satisfies the average rarity condition. This proof is formalized and verified using the Lean 4 theorem prover.
format Preprint
id arxiv_https___arxiv_org_abs_2504_13454
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On the Averaging Problem of Ideal Families Related to Frankl's Conjecture with Formal Proof by Lean 4
Hachimori, Masahiro
Kashiwabara, Kenji
Combinatorics
05D05
Frankl's conjecture, also known as the union-closed sets conjecture, can be equivalently expressed in terms of intersection-closed set families by considering the complements of sets. It posits that any family of sets closed under intersections, and containing both the ground set and the empty set, must have a ``rare vertex'' -- a vertex belonging to at most half of the members of the family. The concept of \emph{average rarity} describes a set family where the average degree of all the elements is at most half of the number of its members. Average rarity is a stronger property that implies the existence of a rare vertex. This paper focuses on ideal families, which are set families that are downward-closed (except the ground set) and include the ground set. We present a proof that the normalized degree sum of any ideal family is non-positive, which is equivalent to saying that every ideal family satisfies the average rarity condition. This proof is formalized and verified using the Lean 4 theorem prover.
title On the Averaging Problem of Ideal Families Related to Frankl's Conjecture with Formal Proof by Lean 4
topic Combinatorics
05D05
url https://arxiv.org/abs/2504.13454