bill's blog

Writeup: Putnam 2007 A2

Problem Statement

Find the least possible area of a convex set in the plane that intersects both branches of the hyperbola xy=1 and both branches of the hyperbola xy=1.

My Solution

Note that the convexity requirement makes this problem a lot easier. Let our convex set be S. Then note that S must contain at least 4 points: 2 on the branches of xy=1, and 2 on the branches of xy=1. In any clockwise order, let these points be A,B,C,D.

Let |A| denote the area of a set A

Then note that the convex hull of ABCD=H satisfies |H||A| since H must be contained within A.

Let the points A,B,C,D be (x1,y1),(x2,y2),(x3,y3),(x4,y4), and let x1y1=1, x3y3=1, x2y2=1, x4y4=1. Then by the shoelace theorem, we must have

|H|=12|x1y2+x2y3+x3y4+x4y1x2y1x3y2x4y3x1y4|

By AM-GM this quantity is at least 4.

We can achieve this by using the corners (1,1),(1,1),(1,1),(1,1).