For a separated angular net, two translated unit rectangles of width intersect in area at most a constant times , where is their unoriented angular distance. Each row of their intersection matrix therefore has sum at most . Applying the Schur test to the adjoint averaging operator gives the displayed bound. A wider-tube comparison extends it from the net to all directions. Since , this proves the planar version of the Kakeya maximal conjecture.
Articles by others on the same topic
There are currently no matching articles.