BIE-VAK Selected Combinatorics Applications
Go to course navigation

1. "Proof" Techniques

At the first seminar, we talked about mathematical proofs. The first part of the seminar was devoted to the importance of the precise formulation of mathematical problems. In the next part, we showed how proofs should NOT look. The final part was dedicated to the issues arising from infinity mathematics.

Presentation

Additional Materials

Top 10 Proof Techniques NOT Allowed

  1. Proof by throwing in the kitchen sink

    The author writes down every theorem or result known to mankind and then adds a few more just for good measure. When questioned later, the author correctly observes that the proof contains all the key facts needed to actually prove the result. Very popular strategy on exams. Known to result in extra credit with sufficient whining.

  2. Proof by example

    The author gives only the case n=2n = 2 and suggests that it contains most of the ideas of the general proof.

  3. Proof by vigorous handwaving

    A faculty favorite. Works well in any classroom or seminar setting.

  4. Proof by cumbersome notation

    Best done with access to at least four alphabets and special symbols. Helps to speak several foreign languages.

  5. Proof by exhaustion

    An issue or two of a journal devoted to your proof is useful. Works well in combination with proof by throwing in the kitchen sink and proof by cumbersome notation.

  6. Proof by omission

    “The reader may easily supply the details.” “The other 253 cases are analogous.” “…​”

  7. Proof by picture

    A more convincing form of proof by example. Combines well with proof by omission.

  8. Proof by vehement assertion

    It is useful to have some kind of authority in relation to the audience.

  9. Proof by appeal to intuition

    Cloud-shaped drawings frequently help here. Can be seen on exams when there was not time to include a complete proof by throwing in the kitchen sink.

  10. Proof by reference to eminent authority

    “I saw Fermat in the elevator and he said he had a proof…​”

References

  1. VELLEMAN, Daniel J. How to Prove It: A Structured Approach. 3rd ed. Cambridge: Cambridge University Press, 2019. ISBN 978-1-108-43953-4.
  2. ŁUKOWSKI, Piotr. Paradoxes. Dordrecht: Springer Netherlands, 2011. ISBN 978-94-007-1475-5. https://doi.org/10.1007/978-94-007-1476-2.
  3. AIGNER, Martin a Günter M. ZIEGLER. Proofs from THE BOOK. 6th ed. Berlin, Heidelberg: Springer, 2018. ISBN 978-3-662-57264-1. https://doi.org/10.1007/978-3-662-57265-8
  4. CANAVAN-MCGRATH, Cathy, Carol SHAW, Hank REINBOLD a Darin TRUFYN. Foundations of Mathematics 11. Kanada: Nelson, 2011. ISBN 978-0-176-51820-2.
  5. LEIGHTON, Tom a Marten VAN DIJK. Top 10 Proof Techniques NOT Allowed in 6.042. Mathematics for Computer Science. Massachusetts, USA: MIT, 2010, 1-3. http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2010/video-lectures/lecture-3-strong-induction/MIT6_042JF10_proof.pdf