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.
- Let be a finite set and a family of finite sets. For , write . A transversal is an injective function on with for all .
- Say that the family satisfies Hall's condition if for all . For this is the condition of the statement.
The condition is necessary.
- Let be a transversal and . Then , since for each .
- As is injective, . So .
The condition is sufficient.
- We prove by strong induction on that a family with Hall's condition has a transversal. If , the empty function is a transversal.
- Let , and suppose the claim holds for all index sets with fewer than elements. Call critical if , and .
Case 1: no subset of is critical.
- Then for every with .
- Fix . By Hall's condition for , the set is not empty. Choose .
- Let and for . Write .
- The family satisfies Hall's condition. For this is clear. For , the set is a proper subset of , so by Step 7.
- Since , the induction hypothesis gives a transversal of . Its values differ from , since .
- Define on and . Then for all , and is injective. So is a transversal.
Case 2: some is critical.
- Let , so . The subfamily satisfies Hall's condition, because subsets of are subsets of .
- Since , the induction hypothesis gives a transversal of . All its values lie in .
- Let and for . Write .
- Let . Then , and is disjoint from . So .
- Since and are disjoint, Hall's condition gives . As , we get .
- So satisfies Hall's condition. Since , we have , and the induction hypothesis gives a transversal of it. All its values lie outside .
- Define on and on . Then for all .
- The map is injective: and are injective, values of lie in , and values of lie outside . So is a transversal.
Conclusion.
- By induction, every finite family with Hall's condition has a transversal. With Steps 3 and 4, a family has a transversal if and only if for every .
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 is tight, its union must be used up exactly by . Solve inside and the rest outside , 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
- no evidence level
- Definition by recursion concept
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Successor function definition
- Addition of natural numbers definition
- The successor function is injective statement
- Zero is not a successor statement
- Order on the natural numbers definition
- Proof of strong induction from ordinary induction proof
- Strong induction statement
- 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
About this page
| Tag | NGB06K7WKZ |
|---|---|
| URI | m2://NGB06K7WKZ |
| Kind | proof |
| Writing | W0 stub |
| MSC | 05D15 |
| Proves | Hall's marriage theorem |
| Uses | Strong induction |
| Methods | Mathematical induction, Proof by cases |
| Changed | 4 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.