Structure Theorem for Unions

• The structure theorem for unions is a framework that organizes union-closed families by element frequencies and canonical ladder sets, enabling precise frequency analysis.
• Falgas-Ravry’s theorem constructs a canonical ladder of sets that exposes frequency order and guarantees lower bounds for highly frequent elements within separating families.
• The small-family theorem and generalized union conjectures extend the framework with sharp bounds and structural insights that incrementally support Frankl’s conjecture.

In extremal set theory, the expression structure theorem for unions commonly refers to structural descriptions of finite union-closed families that convert closure under unions into explicit frequency constraints on the ground elements. The central motivating problem is Frankl’s union-closed sets conjecture: every finite, nontrivial union-closed family should contain an element that belongs to at least half of its member sets. A decisive structural ingredient is the theorem of Falgas-Ravry for separating families, which organizes the family by element frequencies and produces canonical sets containing the most frequent elements; this framework is the basis of the small-family result of Bruhn and Schaudt, which verifies the conjecture for separating families up to an explicit threshold slightly above $2m$, where $m$ is the size of the universe (Maßberg, 2015).

1. Foundational framework

A family of sets $\mathcal{A}$ is union-closed if for any $A,B \in \mathcal{A}$, the union $A \cup B$ also belongs to $\mathcal{A}$. Its universe is

$U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$

For $x \in U(\mathcal{A})$, the frequency of $x$ is the number of sets of $\mathcal{A}$ containing $m$0. A union-closed family is separating if for any two distinct elements $m$1, there exists a set in $m$2 containing exactly one of $m$3 or $m$4 (Maßberg, 2015).

Frankl’s conjecture asserts that every finite, nontrivial union-closed family has an element of frequency at least $m$5. The restriction to separating families is structurally natural because separation forces the family to distinguish every pair of ground elements through its member sets. In the small-family regime, this added rigidity is strong enough to produce canonical configurations and sharp counting arguments.

Later work broadened the framework around the conjecture by introducing notation that isolates containment and avoidance patterns. For $m$6,

$m$7

so that one can compare how many member sets contain a prescribed block $m$8 and how many avoid it. This notation is central in generalized versions of the conjecture (Bouchard, 2023).

2. Falgas-Ravry’s structural theorem

The basic structure theorem begins by labeling the elements of the universe

$m$9

in increasing order of frequency. Falgas-Ravry’s theorem states that there exist sets

$\mathcal{A}$0

such that

$\mathcal{A}$1

and

$\mathcal{A}$2

Thus each $\mathcal{A}$3 contains all sufficiently frequent elements while excluding a designated less frequent one (Maßberg, 2015).

This theorem supplies a canonical ladder of sets indexed by the frequency order. Its significance is twofold. First, it makes the frequency distribution visible inside the family itself: the tail $\mathcal{A}$4 must already occur as a common core of a member set. Second, it yields immediate lower bounds for highly frequent elements, because the most frequent elements appear across many of the sets $\mathcal{A}$5.

An important corollary is that any separating union-closed family on $\mathcal{A}$6 elements with at most $\mathcal{A}$7 member sets satisfies Frankl’s conjecture. In that form, the theorem functions as a structural certificate: if a counterexample exists among separating families, then its size must lie beyond the $\mathcal{A}$8 threshold.

3. The small-family theorem

Bruhn and Schaudt proved that the conjecture holds for separating union-closed families $\mathcal{A}$9 with universe size $A,B \in \mathcal{A}$0 whenever

$A,B \in \mathcal{A}$1

Equivalently, every separating union-closed family in that range contains an element appearing in at least half of its member sets (Maßberg, 2015).

The proof combines the frequency-ordered structure above with a counting argument inspired by Knill. One constructs a minimal subset $A,B \in \mathcal{A}$2 of the universe that touches every nonempty set of $A,B \in \mathcal{A}$3, and then shows the existence of $A,B \in \mathcal{A}$4 sets corresponding to all intersections with subsets of $A,B \in \mathcal{A}$5. This produces a lower-complexity core inside the family. The argument is then balanced against frequency estimates coming from the separating structure.

The resulting threshold emerges from optimizing between an increasing term $A,B \in \mathcal{A}$6 and a decreasing term $A,B \in \mathcal{A}$7, where $A,B \in \mathcal{A}$8 is related to the size of such a minimal touching set. The significance of the theorem is precise but limited: it pushes the verified range beyond the classical $A,B \in \mathcal{A}$9 barrier, yet the extra logarithmic term shrinks slowly as $A \cup B$0. The supplied summary explicitly notes that this slow convergence toward $A \cup B$1 indicates that substantially stronger bounds will require new ideas rather than a straightforward continuation of the same counting scheme (Maßberg, 2015).

4. Equivalent structural formalisms

A different structural direction replaces frequency counting by algebraic and order-theoretic descriptions of union-closed families. One basic duality is that $A \cup B$2 is union-closed if and only if

$A \cup B$3

is intersection-closed. Another is that $A \cup B$4 is union-closed if and only if its complement in $A \cup B$5 is simply rooted (Nagel, 2022).

A particularly useful cryptomorphic description uses interior operators. If $A \cup B$6 is union-closed and $A \cup B$7, define

$A \cup B$8

Then $A \cup B$9 satisfies exclusivity $\mathcal{A}$0, monotonicity, and idempotence $\mathcal{A}$1, and

$\mathcal{A}$2

Conversely, every such interior operator determines a union-closed family. This establishes a bijection between union-closed families containing $\mathcal{A}$3 and interior operators on $\mathcal{A}$4.

The same viewpoint yields congruence partitions of $\mathcal{A}$5: define $\mathcal{A}$6 if $\mathcal{A}$7. An equivalence relation is of this type exactly when

$\mathcal{A}$8

for all $\mathcal{A}$9. Each congruence class is intersection-closed, and whenever $U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$0 lie in the same class with $U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$1, the whole interval

$U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$2

lies in that class as well. These reformulations do not resolve Frankl’s conjecture, but they replace the raw family by more rigid closure data, which is often more amenable to induction and decomposition.

5. Frequency hierarchies and generalized union conjectures

The structural program has also generated conjectural hierarchies extending Frankl’s original statement. If the ground set is ordered so that

$U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$3

then an iterated use of Frankl’s conjecture would imply

$U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$4

Nagel asked whether the stronger bound

$U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$5

might hold for every union-closed family, and established partial structural evidence through fiber-counting lemmas and weak forms of the conjecture (Nagel, 2022).

A second hierarchy is given by the conjectures

$U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$6

The extremal case $U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$7 is exactly Frankl’s conjecture, because then $U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$8 is a singleton. This family of statements interpolates between larger witness sets $U(\mathcal{A})=\bigcup_{A\in\mathcal{A}} A.$9 and the original single-element claim. One structural implication proved in this framework is

$x \in U(\mathcal{A})$0

showing that a two-element witness statement would already force the classical conjecture (Bouchard, 2023).

The same paper develops strengthenings centered on separating families and the extremal role of power sets. In particular, it formulates the principle that in a separating union-closed family that is not a power set, the maximum element frequency should be strictly larger than $x \in U(\mathcal{A})$1. This places power sets at the boundary of equality and treats them as the natural rigid models against which nontrivial families should be compared.

6. Weak structure theorems, implications, and limits

Even when the full conjecture remains out of reach, structural reformulations yield weaker but nontrivial substitutes. One example is the existence of large up-sets inside the ambient Boolean lattice that intersect a union-closed family in a controlled way: for every nontrivial union-closed $x \in U(\mathcal{A})$2, there exists an up-set $x \in U(\mathcal{A})$3 with

$x \in U(\mathcal{A})$4

More generally, for every $x \in U(\mathcal{A})$5, there exists an up-set $x \in U(\mathcal{A})$6 with

$x \in U(\mathcal{A})$7

These results do not identify an element of frequency $x \in U(\mathcal{A})$8, but they isolate systematically large monotone regions of the Boolean lattice that must meet the family densely (Nagel, 2022).

Another weak substitute concerns intersecting subfamilies. Nagel formulates the question whether every nontrivial union-closed family contains an intersecting subfamily of size at least a universal positive fraction of the whole family, and proves a quantitative frequency statement for arbitrary intersecting families: $x \in U(\mathcal{A})$9 for some $x$0, whenever $x$1 is intersecting of size $x$2. Such statements suggest that part of the difficulty of Frankl’s conjecture lies in extracting intersecting or monotone substructure from a general union-closed family rather than in analyzing those substructures once found (Nagel, 2022).

The present structural picture is therefore asymmetric. On one side, separating families admit rigid canonical sets, interior-operator descriptions, congruence partitions, and generalized witness conjectures. On the other, the strongest explicit small-family theorem in the supplied literature remains only slightly beyond $x$3 for separating families. A plausible implication is that future advances will depend on blending these two viewpoints: the counting methods of the small-family theorem will likely need to interact with the more global closure structures revealed by interior operators, congruence classes, and the $x$4 hierarchy (Maßberg, 2015).