Let each generator be a -element set, with , and let each ground point occur in exactly three generators. Form their bipartite incidence graph, with an edge for membership. If its shortest cycle has length at least 16, every point belongs to at least 0.518208 of the distinct unions. The empty union is included. Omitting it can only increase the frequencies. For it suffices that two different generators intersect in at most one point, and the lower bound improves to 0.657.
Counting unions by tree recursion for small generators
For a union , take the points outside and all generators contained in . They form a maximal independent set of the incidence graph. Conversely, maximality forces every generator avoiding the selected points to be selected itself, and every unselected point to belong to at least one selected generator. These maps are inverse. A point is absent from a uniformly chosen union exactly when it is occupied in the uniform maximal independent set. Bruhn, Charbit, Schaudt and Telle develop this correspondence and prove the existential statement for subcubic bipartite graphs, which includes the cubic case here. Our bound in that case applies separately to each point under the girth hypothesis. Bruhn, Charbit, Schaudt and Telle
Fix a point as root. Its radius-seven ball is a tree, since an extra edge or a second shortest path would give a cycle of length at most 15. Condition on the occupied vertices at distances seven and greater in any configuration that extends to a maximal independent set. A boundary vertex has one of three forced states: occupied, unoccupied and already dominated from outside, or unoccupied and requiring its parent. These correspond respectively to the coordinate rays of . Conditioning also fixes whether every exterior vertex is dominated. Branch counts therefore multiply.
In an interior branch let count the choices with the top vertex occupied, the unoccupied choices dominated by children, and the unoccupied choices that require the parent. If the child triples are , then
At the actual root the probability of occupation is because no parent is available.
Starting with the three boundary rays, propagate cones of possible triples for six levels. Points below the root have two children and generators have . For each child form and multiply these transformed vectors coordinate by coordinate. The product is linear in each input when the others are fixed, so all products are contained in the cone generated by products of extreme rays. Taking the cone after each multiplication preserves this containment. Finally map a product to . The verifier normalizes rays by coordinate sum and finds their planar convex hull using integer determinants.
Let be the resulting generator-side cone at distance one. For each extreme ray take
and let be the maximum. The checker uses positive denominators. This bounds occupation even for three different children: on every ray, . The triangle inequality for the weighted norm extends the inequality to the cone. Hölder's inequality applied to the three two-entry vectors then gives , precisely the bound on root occupation. Averaging over exterior configurations preserves the bound.
For , the upper bounds in millionths, rounded upwards, are 481792, 478679, 461724, 426826, 385225, 343032, 303914, 269665, 240799, 217078, 197903 and 182564. The largest gives the stated lower bound on frequency. Exact cone computation
Counting by canonical generator selections for large generators
Independently select each generator with probability . For a generator let be the event that was omitted but is covered by the selected union. Avoiding all these events makes the selected generators exactly those contained in their union. Each distinct union has precisely one such selection, hence the conditional distribution on unions is uniform.
Suppose different generators meet in at most one point. Conditional on omitting , its points each have two other incident generators and are independently covered with probability . Thus . Give as neighbors the at most events indexed by generators meeting .
For any collection of nonneighbors, conditioning on their avoidance cannot increase . To see this, first fix the bits outside the support of . Nonneighbor avoidance is independent of the bit of and decreases in the other support bits: those bits can cover a nonneighbor but never index one in the collection. After averaging over the bit of , the probability of increases in those same coordinates. Oppositely monotone functions of independent bits have nonpositive covariance (by induction on the coordinates). Integrate over the fixed outside bits, which do not change the unconditional probability of .
If , it follows by induction on the conditioning set that . Indeed first condition on the nonneighbors, bound the numerator by , and lower-bound the probability of also avoiding the neighbors by the product of their conditional avoidance probabilities, each at least by the smaller-set induction. When there are no neighbors in the set, the preceding monotonicity bound applies directly. All conditioning events have positive probability because selecting all generators avoids every bad event.
Take . Bernoulli's inequality gives . The sufficient test holds at by exact arithmetic and decreases thereafter since the ratio is . Before conditioning, a fixed point is absent with probability . Only events reading one of its three incident bits affect this query, at most in total. Condition first on avoiding the remaining events, which are jointly independent of the three bits. Avoiding the events that do read those bits has conditional probability at least by the induction. Dividing gives an absence probability of at most .
Incidence girth at least 16 implies the pairwise intersection condition since two common points give a 4-cycle. The two arguments cover all . Arbitrary union-closed families need not have generators with either of the regularity assumptions used here.