Hall's Marriage Theorem

From ProofWiki
Jump to navigation Jump to search

Theorem

Finite Indexed Family of Finite Sets

Let $\SS = \family {S_k}_{k \mathop \in I}$ be a finite indexed family of finite sets.

For each $F \subseteq I$, let $\ds Y_F = \bigcup_{k \mathop \in F} S_k$.

Let $Y = Y_I$.


Then the following are equivalent:

$(1): \quad \SS$ satisfies the marriage condition: for each finite subset $F \subseteq I : \card F \le \card {Y_F}$.
$(2): \quad$ There exists an injection $f: I \to Y$ such that $\forall k \in I: \map f k \in S_k$.


General Indexed Family of Finite Sets

Let $\SS = \family {S_k}_{k \mathop \in I}$ be an indexed family of finite sets.

For each $F \subseteq I$, let $\ds Y_F = \bigcup_{k \mathop \in F} S_k$.

Let $Y = Y_I$.


Then the following are equivalent:

$(1): \quad \SS$ satisfies the marriage condition: for each finite subset $F \subseteq I : \card F \le \card {Y_F}$.
$(2): \quad$ There exists an injection $f: I \to Y$ such that $\forall k \in I: \map f k \in S_k$.


Explanation

This Hall's Marriage Theorem is so called for the following reason:

Let $I$ be a set of women.

Suppose that each woman $k$ is romantically interested in a finite set $S_k$ of men.

Suppose also that:

each woman would like to marry exactly one of these men

and:

each man in $\ds \bigcup_{k \mathop \in I} S_k$ would like to marry at most one woman in $I$.

Then this theorem gives a condition under which it is possible to match every woman to a man.





Source of Name

This entry was named for Philip Hall.