Is the intersection of a set of cardinals contained in the set?

130 Views Asked by At

Given a set $\mathcal{C}$ of Cardinals, does $$D:=\bigcap_{C\in\mathcal{C}} C \in \mathcal{C}$$ hold? If $\mathcal{C}$ is finite or contains a finite cardinal, the answer is positive even for ordinals instead of cardinals because of elementary ordinal properties. The infinite case however does not seem so obvious.

Assuming the contrary, one could construct an infinite sequence of proper descreasing cardinals $C_0 \supsetneq C_1 \supsetneq C_2 \supsetneq \ldots \supsetneq D$ with all $C_k\in\mathcal{C}$. Intuitively I don't believe that's possible, not even for ordinals. I tried applying Zorn's lemma using $\supseteq$ for $\leq$ to give $D$ a proper structure, but using D as an upper limit with respect to this relation doesn't seem to work because the lemma seems to require $D\in\mathcal{C}$ to work, which is what I want to show. So that's a dead end for me.

I'm hardly used to ordinals and cardinals and grateful for help.

Background: I'm trying to do some formalization of (Multi)Graph theory in Mizar and given graphs with arbitrary vertex degree, I was wondering if it makes sense do differ between the concept of the infinum of all vertex degrees (i.e. their intersection) and the minimum (if present, smallest vertex degree).

1

There are 1 best solutions below

0
On BEST ANSWER

Right after posting an idea came to mind. I didn't find anything about this topic on stack exchange or anything intersection related in the ORDINAL or CARD articles of the Mizar Mathematical Library, but I remembered the concept of minimum for sets of natural numbers and voila, found out that an equivalent holds for ordinals. (As Henning Makholm commented, this is because Cardinals are well-ordered.)

Therefore as long as the set $\mathcal{C}$ is not empty, it contains a minimum ordinal $E$, which therefore must equal the intersection of all cardinals for elementary ordinal properties: $D\subseteq E$ because $E\in\mathcal{C}$. On the other hand, for any $e\in E$ and $C\in\mathcal{C}$ holds $e\in C$ because $E\subseteq C$, hence $e\in D$ and $E\subseteq D$. Since $\mathcal{C}$ was required to contain only cardinals, $E=D$ must be a cardinal too.

So the answer is yes. Sometimes it really helps to think out loud :)