Math 2.0

Combinatorics Proof

Proof of Hall's marriage theorem by induction on the number of sets

Builds on Strong induction

Proof

We prove a slightly more general form, for families indexed by any finite set, by strong induction on the number of sets.

Setup.

  1. Let II be a finite set and (Si)i∈I(S_i)_{i \in I} a family of finite sets. For J⊆IJ \subseteq I, write S(J)=⋃i∈JSiS(J) = \bigcup_{i \in J} S_i. A transversal is an injective function ff on II with f(i)∈Sif(i) \in S_i for all i∈Ii \in I.
  2. Say that the family satisfies Hall's condition if ∣S(J)∣≥∣J∣\abs{S(J)} \ge \abs{J} for all J⊆IJ \subseteq I. For I={1,…,n}I = \set{1, \dots, n} this is the condition of the statement.

The condition is necessary.

  1. Let ff be a transversal and J⊆IJ \subseteq I. Then f(J)⊆S(J)f(J) \subseteq S(J), since f(i)∈Sif(i) \in S_i for each i∈Ji \in J.
  2. As ff is injective, ∣f(J)∣=∣J∣\abs{f(J)} = \abs{J}. So ∣S(J)∣≥∣J∣\abs{S(J)} \ge \abs{J}.

The condition is sufficient.

  1. We prove by strong induction on ∣I∣\abs{I} that a family with Hall's condition has a transversal. If I=∅I = \varnothing, the empty function is a transversal.
  2. Let ∣I∣=n≥1\abs{I} = n \ge 1, and suppose the claim holds for all index sets with fewer than nn elements. Call J⊆IJ \subseteq I critical if J≠∅J \ne \varnothing, J≠IJ \ne I and ∣S(J)∣=∣J∣\abs{S(J)} = \abs{J}.

Case 1: no subset of II is critical.

  1. Then ∣S(J)∣≥∣J∣+1\abs{S(J)} \ge \abs{J} + 1 for every JJ with ∅≠J⊊I\varnothing \ne J \subsetneq I.
  2. Fix i0∈Ii_0 \in I. By Hall's condition for J={i0}J = \set{i_0}, the set Si0S_{i_0} is not empty. Choose x∈Si0x \in S_{i_0}.
  3. Let I′=I∖{i0}I' = I \setminus \set{i_0} and Ti=Si∖{x}T_i = S_i \setminus \set{x} for i∈I′i \in I'. Write T(J)=⋃i∈JTiT(J) = \bigcup_{i \in J} T_i.
  4. The family (Ti)i∈I′(T_i)_{i \in I'} satisfies Hall's condition. For J=∅J = \varnothing this is clear. For ∅≠J⊆I′\varnothing \ne J \subseteq I', the set JJ is a proper subset of II, so ∣T(J)∣≥∣S(J)∣−1≥∣J∣\abs{T(J)} \ge \abs{S(J)} - 1 \ge \abs{J} by Step 7.
  5. Since ∣I′∣=n−1\abs{I'} = n - 1, the induction hypothesis gives a transversal gg of (Ti)i∈I′(T_i)_{i \in I'}. Its values differ from xx, since x∉Tix \notin T_i.
  6. Define f=gf = g on I′I' and f(i0)=xf(i_0) = x. Then f(i)∈Sif(i) \in S_i for all ii, and ff is injective. So ff is a transversal.

Case 2: some J0⊆IJ_0 \subseteq I is critical.

  1. Let A=S(J0)A = S(J_0), so ∣A∣=∣J0∣\abs{A} = \abs{J_0}. The subfamily (Si)i∈J0(S_i)_{i \in J_0} satisfies Hall's condition, because subsets of J0J_0 are subsets of II.
  2. Since ∣J0∣<n\abs{J_0} < n, the induction hypothesis gives a transversal gg of (Si)i∈J0(S_i)_{i \in J_0}. All its values lie in AA.
  3. Let K0=I∖J0K_0 = I \setminus J_0 and Ui=Si∖AU_i = S_i \setminus A for i∈K0i \in K_0. Write U(K)=⋃i∈KUiU(K) = \bigcup_{i \in K} U_i.
  4. Let K⊆K0K \subseteq K_0. Then S(K∪J0)=S(K)∪A=U(K)∪AS(K \cup J_0) = S(K) \cup A = U(K) \cup A, and U(K)U(K) is disjoint from AA. So ∣S(K∪J0)∣=∣U(K)∣+∣A∣\abs{S(K \cup J_0)} = \abs{U(K)} + \abs{A}.
  5. Since KK and J0J_0 are disjoint, Hall's condition gives ∣U(K)∣+∣A∣≥∣K∣+∣J0∣\abs{U(K)} + \abs{A} \ge \abs{K} + \abs{J_0}. As ∣A∣=∣J0∣\abs{A} = \abs{J_0}, we get ∣U(K)∣≥∣K∣\abs{U(K)} \ge \abs{K}.
  6. So (Ui)i∈K0(U_i)_{i \in K_0} satisfies Hall's condition. Since J0≠∅J_0 \ne \varnothing, we have ∣K0∣<n\abs{K_0} < n, and the induction hypothesis gives a transversal hh of it. All its values lie outside AA.
  7. Define f=gf = g on J0J_0 and f=hf = h on K0K_0. Then f(i)∈Sif(i) \in S_i for all i∈Ii \in I.
  8. The map ff is injective: gg and hh are injective, values of gg lie in AA, and values of hh lie outside AA. So ff is a transversal.

Conclusion.

  1. By induction, every finite family with Hall's condition has a transversal. With Steps 3 and 4, a family (S1,…,Sn)(S_1, \dots, S_n) has a transversal if and only if ∣⋃i∈ISi∣≥∣I∣\abs{\bigcup_{i \in I} S_i} \ge \abs{I} for every I⊆{1,…,n}I \subseteq \set{1, \dots, n}.

Idea

If every proper subfamily has room to spare, choose any representative for one set and delete it from the others; the condition survives. If some subfamily J0J_0 is tight, its union AA must be used up exactly by J0J_0. Solve J0J_0 inside AA and the rest outside AA, and both smaller problems still satisfy the condition.

Reading path

To understand this page from the ground up, read these 12 pages in order. The foundations come first. The path takes the proof Proof of strong induction from ordinary induction.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Definition by recursion concept
  2. Mathematical induction concept
  3. Natural numbers object
  4. Peano axioms concept
  5. Successor function definition
  6. Addition of natural numbers definition
  7. The successor function is injective statement
  8. Zero is not a successor statement
  9. Order on the natural numbers definition
  10. Proof of strong induction from ordinary induction proof
  11. Strong induction statement
  12. Proof of Hall's marriage theorem by induction on the number of sets proof

Where this leads

4 pages build on this one.

Further reading

  1. Web https://www.mscs.dal.ca/~janssen/4370/slides/hallstheorem.pdf
About this page
TagNGB06K7WKZ
URIm2://NGB06K7WKZ
Kindproof
WritingW0 stub
MSC05D15
ProvesHall's marriage theorem
UsesStrong induction
MethodsMathematical induction, Proof by cases
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.