Comment by paulddraper

Comment by paulddraper a day ago

9 replies

The first time I saw the Pigeonhole Principle was in the following:

Problem: A plane has every point colored red, blue, or yellow. Prove that there exists a rectangle whose vertices are the same color.

Solution: Consider a grid of points, 4 rows by 82 columns. There are 3^4=81 possible color patterns of columns, so by the Pigeonhole Principle, at least two columns have the same color pattern. Also by the Pigeonhole Principle, each column of 4 points must have at least two points of the same color. The two repeated points in the two repeated columns form a rectangle of the same color. QED.

The Pigeonhole Principle is very neat. It would be hard not to use it for the proof.

Partly that article argues against proof by contradiction which does seem to be overused.

[removed] 10 hours ago
[deleted]
moi2388 a day ago

Unless by plane they mean airplane, since in curved 3d surface this is not automatically given to be true.

  • layer8 a day ago

    Even if it was talking about airplanes, it doesn’t mention “surface”. So it would still hold, given that airplane parts aren’t infinitely thin.

    • MarkusQ 19 hours ago

      Though if you fly economy it seems like they're bent on approaching it as a limit.

      • layer8 17 hours ago

        As long as they don’t actually reach the limit, the proof still holds.

  • IAmBroom a day ago

    Topologically, an airplane is identical to a universe of curvature=+1. Since the size of the grid versus the airplane/universe is not given, I will assume there are infinitely many grid points.