What Is the Difference Between an Arbitrary and a Finite Collection?

The difference is about how many members a collection has. A finite collection has a finite number of members. An arbitrary collection has no restriction on its size: it may be finite or infinite. In real analysis, this distinction often appears when taking unions or intersections of sets, because finite operations can preserve a property that arbitrary operations do not.

What “arbitrary” means

Suppose you have a family of sets written as $\{A_i : i \in I\}$. The index set $I$ identifies the members of the family.

• If $I$ has finitely many elements, the indexed family has finitely many entries.
• If $I$ is infinite, the indexed family has infinitely many entries, though some $A_i$ may be equal, so there need not be infinitely many distinct sets. The index set may be countably infinite, as with $I=\mathbb{N}$, or uncountable, as with $I=\mathbb{R}$.
• If the problem says “an arbitrary collection,” it places no restriction on $I$ beyond whatever is stated elsewhere.

So “arbitrary” does not mean “infinite.” It means that you are not assuming a particular size or structure. A finite collection is one possible arbitrary collection.

The distinction in unions and intersections

For a family $\{A_i : i \in I\}$, its union consists of points that belong to at least one member, and its intersection consists of points that belong to every member:

$$\bigcup_{i\in I} A_i = \{x : x\in A_i \text{ for some } i\in I\}, \qquad \bigcap_{i\in I} A_i = \{x : x\in A_i \text{ for every } i\in I\}.$$

If $I$ is finite, these are finite unions and finite intersections. If $I$ is infinite, they are infinite operations. “Arbitrary union” or “arbitrary intersection” allows any index set, not just a finite one.

Worked example: open and closed sets

In the real numbers, every finite union of closed sets is closed. But an arbitrary union of closed sets need not be closed.

Consider the closed singleton sets

$$F_n=\left\{\frac{1}{n}\right\}, \qquad n=1,2,3,\ldots.$$

Each $F_n$ is closed. Any finite union, such as $F_1\cup F_2\cup F_3$, is a finite set and is closed. The union of the whole countable family is

$$\bigcup_{n=1}^{\infty}F_n = \left\{1,\frac12,\frac13,\ldots\right\}.$$

This union is not closed in $\mathbb{R}$: its points approach $0$, but $0$ is not in the union. Thus, replacing “finite union” with “arbitrary union” can change whether a claim is true.

There is a complementary fact for open sets: arbitrary unions of open sets are open, while arbitrary intersections of open sets need not be open. For example, each interval $(-1/n,1/n)$ is open, but

$$\bigcap_{n=1}^{\infty}(-1/n,1/n)=\{0\},$$

which is not open in $\mathbb{R}$. The corresponding standard rules are: arbitrary unions of open sets are open, finite intersections of open sets are open, finite unions of closed sets are closed, and arbitrary intersections of closed sets are closed.

How to tell which meaning a problem needs

Look for the quantifier or index set in the statement. “For any finite collection” means the claim must hold when there are finitely many members, with no fixed upper bound on their number. “For an arbitrary collection” means it must hold regardless of the collection’s size. If the family is written $A_1,\ldots,A_n$, it is finite; if it is written $A_i$ for $i\in I$, check whether $I$ is specified as finite, countable, or unrestricted.

In some contexts, “finite” includes the empty collection, which has zero members; in others, the author may mean a nonempty finite collection. This convention matters for statements involving empty unions or intersections. Unless a text says otherwise, check its definitions when the empty case could affect the result.

Common mistakes

• Treating arbitrary as a synonym for infinite. It includes finite collections too.
• Confusing the number of sets with the size of each set. A finite collection can contain infinite sets; for example, $\{\mathbb{R},\mathbb{Z}\}$ has two members.
• Assuming a finite-operation rule applies to arbitrary operations. The closed-singleton example shows why an infinite union requires a separate check.
• Assuming an infinite collection must be uncountable. A collection indexed by the positive integers is infinite but countable; uncountable families are also possible.

When a proof says “finite,” keep the finiteness hypothesis visible. If you want to use the result for an infinite family, verify that the relevant property is preserved under arbitrary unions or intersections.