There is a nice result due to Santaló that says that if a (finite) collection of axis-parallel rectangles is such that any small subcollection is aligned, then the whole collection is aligned. This is kind of surprising at first, because the condition only says that there is a line, but this line might be different for any choice of subcollection. The precise statement is as follows:

Theorem.Let be a collection of rectangles with sides parallel to the axes (possibly intersecting). If for every choice of 6 rectangles of there exists a line intersecting all of them, then there exists a line intersecting all rectangles of at once.

To be precise, I should clarify that by line intersection it is meant *intersection with the interior of the rectangle* – so a line touching only the boundary is not allowed. The number 6 doesn’t have any special esoteric meaning here, to the best of my understanding – it just makes the argument work.

The proof of this result is by induction on the number of rectangles. If then the result trivially holds, so let and suppose the theorem is true for any collection of rectangles satisfying the property that for every choice of rectangles of there exists a line intersecting all of them.

We let . For every rectangle , by inductive hypothesis there exists a line that intersects every rectangle in the collection . If one of these intersects itself then we are done, so we assume that each does not intersect (but it intersects every other rectangle; in particular, it intersects rectangles of ). We will argue by a bit of convexity that there must be a line (in general distinct from the lines ) that crosses everyone of the rectangles at once.

We assume for simplicity that none of the lines are horizontal (if there are horizontal ones, just add a small perturbation to their slope). In this case we can write down the equation of each line as

Select four distinct indices such that all have the same sign (thus the corresponding lines are either all pointing upward or all pointing downward). Notice that you can do this because there are at least 7 lines – here is where that number in the statement comes from. The two cases are treated in the same way, so assume that the lines are all pointing downward – that is are all positive. Now consider a non-trivial solution to the system of equations

Some of the will be positive, some will be negative (some might be 0 – deal with that case separately). Assume for simplicity that are positive and are negative – the other cases being all similar. We claim that the line of equation

intersects all rectangles of at once.

Observe that the equation of can be rewritten in terms of , namely

Now, let be the index of a rectangle in . intersects every line with , so for every such we can find a point in (the interior of) , of coordinates , such that ; in coordinate terms, for every

Now, the index cannot belong to both sets , at once; let’s assume that does not belong to . Consider then point given by the following convex combination of coordinates of and :

Notice how the weights have been chosen. Because the coordinates are convex combinations of the coordinates of two points in , the point itself belongs to (however, they are convex combinations with *distinct* weights for the two coordinates; thus this is only true if the set is a rectangle, and not just a convex set more in general!). Moreover, it’s immediate to see by substitution that satisfies equation (1), and therefore intersects (the interior of) . Repeat the argument for all ‘s to conclude (notice, if had belonged to we would have used and equation (2) to reach the same conclusion).