Helly family¶

A set family in which global intersection follows whenever every sufficiently small subfamily has nonempty intersection.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4854
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Combinatorics → Mathematics

Core Idea¶

The Helly number or order and finite-versus-infinite assumptions must be stated, pairwise intersection suffices only for order two and geometric convex-set theorems are important instances rather than the general definition. Minimal subfamilies with empty intersection have bounded size; equivalently, testing all subfamilies up to the Helly number certifies a common member for the entire family. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Small Groups Tell All

Imagine lots of kids, each standing in their own chalk circle on the playground. In a Helly family there is a magic number. If every small group of circles, up to that number, always has a spot they all cover, then there is one spot that every single circle covers.

Check Small Groups, Know All

A Helly family is a collection of sets that has a special shortcut. There is a number k such that if every group of k sets has something in common, then all the sets have something in common. For stretches along a line, k is 2: if every pair overlaps, they all overlap at one place. For other kinds of collections, k can be bigger. So checking pairs is not always enough. You have to know the collection's own number k.

Bounded-Order Intersection Property

A family of subsets of a ground set is a Helly family of order k when this holds: whenever every k (or at most k) members of the family have a common element, the whole family has a common element. Equivalently, any smallest sub-collection with an empty intersection has at most k sets. This means testing all small sub-collections certifies that the entire family shares a point. Pairwise intersection is enough only when the order is 2. Famous geometry results about convex sets are examples of Helly families, but they are not the definition itself. The definition is about any family of sets, as long as the order and conventions (finite or infinite, and so on) are stated.

A Helly family is defined relative to a ground set X, a family F of subsets of X, and the intersection operation. F has Helly order k if every subfamily in which all k-member (or at-most-k-member) subfamilies intersect has a nonempty total intersection. Equivalently, every minimal subfamily with empty intersection has size at most k. The Helly number is the least such k. Practically, intersection checks on bounded-size subfamilies certify a common member for the whole family. The definition is sensitive to conventions, which must be stated: whether F is finite, whether the property is hereditary, and whether conditions apply to exactly k or at most k sets. Only order two reduces to pairwise intersection. Convex sets in Euclidean space, convexity hypergraphs, and clique families are standard instances. The geometric convex-set theorem is an instance, not the general definition.

Scope of Application¶

Helly family belongs to combinatorics and is useful where the analyst can specify the typed combinatorics carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the ground set and family of subsets, intersection operation, Helly number or order k, quantified condition on all k-member or at-most-k subfamilies, equivalent bound on minimal empty-intersection subfamilies, finite and hereditary conventions, global common intersection and examples in convexity hypergraphs and clique families are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the ground set and family of subsets, intersection operation, Helly number or order k, quantified condition on all k-member or at-most-k subfamilies, equivalent bound on minimal empty-intersection subfamilies, finite and hereditary conventions, global common intersection and examples in convexity hypergraphs and clique families are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Helly family. Helly family compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed combinatorics carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the ground set and family of subsets, intersection operation, Helly number or order k, quantified condition on all k-member or at-most-k subfamilies, equivalent bound on minimal empty-intersection subfamilies, finite and hereditary conventions, global common intersection and examples in convexity hypergraphs and clique families are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of combinatorics because they reuse the typed combinatorics carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Minimal subfamilies with empty intersection have bounded size; equivalently, testing all subfamilies up to the Helly number certifies a common member for the entire family., and type the carrier, state every parameter and convention in the definition, test that the ground set and family of subsets, intersection operation, Helly number or order k, quantified condition on all k-member or at-most-k subfamilies, equivalent bound on minimal empty-intersection subfamilies, finite and hereditary conventions, global common intersection and examples in convexity hypergraphs and clique families are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Helly family Domain-specific

Parents (1) — outgoing typed relations

Helly family is a kind of Aggregation Prime

It remains its own entry because its identity is fixed by the ground set and family of subsets, intersection operation, Helly number or order k, quantified condition on all k-member or at-most-k subfamilies, equivalent bound on minimal empty-intersection subfamilies, finite and hereditary conventions, global common intersection and examples in convexity hypergraphs and clique families.

Hierarchy path (1) — routes to 1 parentless root

Helly family → is a kind of Aggregation → is a kind of Transformation → is a kind of, typical Function (Mapping)

Neighborhood in Abstraction Space¶

Helly family sits in a crowded region of the domain-specific corpus (12^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Combinatorial Set Systems & Counting (9 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25