Definition:Set Meeting Set
Jump to navigation
Jump to search
This page is about sets that meet. For other uses, see Meet.
Definition
Let $\family {S_i}_{i \mathop \in I}$ be an family of sets indexed by some indexing set $I$.
The sets in $\family {S_i}$ are said to meet if and only if their intersection is not empty.
That is, if and only if:
- $\ds \bigcap_{i \mathop \in I} \family {S_i} \ne \O$
That is, if and only if $\family {S_i}_{i \mathop \in I}$ is not disjoint.
Sources
- 1965: Claude Berge and A. Ghouila-Houri: Programming, Games and Transportation Networks ... (previous) ... (next): $1$. Preliminary ideas; sets, vector spaces: $1.1$. Sets