Find the least possible area of a convex set in the plane that intersects both branches of the hyperbola xy\equal1 and both branches of the hyperbola xy\equal\minus1. (A set S in the plane is called convex if for any two points in S the line segment connecting them is contained in S.)
A number or a short expression. Spacing, $ signs and \frac vs / are all fine.
Official solution
1. Identify the problem and the constraints: We need to find the least possible area of a convex set in the plane that intersects both branches of the hyperbolas xy=1 and xy=−1. A convex set is defined such that for any two points in the set, the line segment connecting them is also contained in the set.
2. Determine the points of intersection: The convex set must contain at least one point on each of the four branches of the hyperbolas. Let these points be: (x1,y1),(−x2,y2),(−x3,−y3),(x4,−y4) where x1,x2,x3,x4,y1,y2,y3,y4 are positive numbers and satisfy the hyperbola equations: x1y1=1,x2y2=1,x3y3=1,x4y4=1
3. Calculate the area of the convex hull: The smallest convex set containing these points is the convex hull, which in this case is a quadrilateral. The area A of a quadrilateral with vertices (x1,y1),(−x2,y2),(−x3,−y3),(x4,−y4) can be calculated using the shoelace formula: A=21∣x1y2+(−x2)y3+(−x3)(−y4)+x4y1−(y1(−x2)+y2(−x3)+y3x4+y4x1)∣
4. Simplify the area expression: Substitute yi=xi1 for i=1,2,3,4: A=21x1x21+(−x2)x31+(−x3)x41+x4x11−(x11(−x2)+x21(−x3)+x31x4+x41x1) =21x2x1−x3x2−x4x3+x1x4−(−x1x2−x2x3+x3x4+x4x1) =21x2x1+x1x2+x3x2+x2x3+x4x3+x3x4+x1x4+x4x1
5. Apply the AM-GM inequality: For any positive u, we have u+u1≥2. Applying this to each term: x2x1+x1x2≥2,x3x2+x2x3≥2,x4x3+x3x4≥2,x1x4+x4x1≥2 Summing these inequalities: x2x1+x1x2+x3x2+x2x3+x4x3+x3x4+x1x4+x4x1≥8
6. Determine the minimum area: Therefore, the minimum area is: A≥21×8=4 Equality holds when x1=x2=x3=x4, meaning the quadrilateral is a rectangle with sides parallel to the axes.
The final answer is 4.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.