Proof Pearl: The Marriage Theorem
We describe two formal proofs of the finite version of Hall’s Marriage Theorem performed with the proof assistant Isabelle/HOL, one by Halmos and Vaughan and one by Rado. The distinctive feature of our formalisation is that instead of sequences (often found in statements of this theorem) we employ indexed families, thus avoiding tedious reindexing of sequences.
KeywordsInduction Hypothesis Theorem Prover Formal Proof Proof Assistant Marriage Problem
Unable to display preview. Download preview PDF.
- 6.Jiang, D., Nipkow, T.: Hall’s marriage theorem. In: Klein, G., Nipkow, T., Paulson, L. (eds.) The Archive of Formal Proofs (December 2010), http://afp.sf.net/entries/Marriage.shtml; formal proof development
- 9.Romanowicz, E., Grabowski, A.: The Hall marriage theorem. Formalized Mathematics 12(3), 315–320 (2004)Google Scholar
- 10.Wikipedia: Hall’s marriage theorem — wikipedia, the free encyclopedia (2011), en.wikipedia.org/w/index.php?title=Hall%27s_marriage_theorem&oldid=419179777 (accessed September 8, 2011]