Editing Ham sandwich theorem

{{Short description|Theorem that any three objects in space can be simultaneously bisected by a plane}}
{{distinguish|text=the [[squeeze theorem]] (sometimes called the "sandwich theorem")}}

In [[mathematics|mathematical]] [[measure theory]], for every positive integer {{mvar|n}} the '''ham sandwich theorem''' states that given {{mvar|n}} [[measurable]] "objects" in {{mvar|n}}-[[dimension]]al [[Euclidean space]], it is possible to divide each one of them in half (with respect to their [[Measure (mathematics)|measure]], e.g. volume) with a single {{math|(''n'' − 1)}}-dimensional [[hyperplane]]. This is possible even if the objects overlap.

It was proposed by [[Hugo Steinhaus]] and proved by [[Stefan Banach]] (explicitly in dimension 3, without stating the theorem in the {{mvar|n}}-dimensional case), and also years later called the '''Stone–Tukey theorem''' after [[Arthur Harold Stone|Arthur H. Stone]] and [[John Tukey]].

==Naming==
[[File:Ham sandwich.jpg|thumb|right|A ham sandwich]]

The ham sandwich theorem takes its name from the case when {{math|1=''n'' = 3}} and the three objects to be bisected are the ingredients of a [[ham sandwich]]. Sources differ on whether these three ingredients are two slices of bread and a piece of ham {{harv|Peters|1981}}, bread and cheese and ham {{harv|Cairns|1963}}, or bread and butter and ham {{harv|Dubins|Spanier|1961}}. In two dimensions, the theorem is known as the '''pancake theorem''' to refer to the flat nature of the two objects to be bisected by a line {{harv|Cairns|1963}}.

==History==
According to {{harvtxt|Beyer|Zardecki|2004}}, the earliest known paper about the ham sandwich theorem, specifically the {{math|1=''n'' = 3}} case of bisecting three solids with a plane, is a 1938 note in a Polish mathematics journal {{harv|Editors|1938}}.  Beyer and Zardecki's paper includes a translation of this note, which attributes the posing of the problem to [[Hugo Steinhaus]], and credits [[Stefan Banach]] as the first to solve the problem, by a reduction to the [[Borsuk–Ulam theorem]].  The note poses the problem in two ways: first, formally, as "Is it always possible to bisect three solids, arbitrarily located, with the aid of an appropriate plane?" and second, informally, as "Can we place a piece of ham under a meat cutter so that meat, bone, and fat are cut in halves?"  The note then offers a proof of the theorem.

A more modern reference is {{harvtxt|Stone|Tukey|1942}}, which is the basis of the name "Stone–Tukey theorem".  This paper proves the {{mvar|n}}-dimensional version of the theorem in a more general setting involving measures.  The paper attributes the {{math|1=''n'' = 3}} case to [[Stanislaw Ulam]], based on information from a referee; but {{harvtxt|Beyer|Zardecki|2004}} claim that this is incorrect, given the note mentioned above, although "Ulam did make a fundamental contribution in proposing" the [[Borsuk–Ulam theorem]].

==Two-dimensional variant: proof using a rotating-knife==
[[File:ham_sandwich_theorem_2d.png|thumb|A two-dimensional ham sandwich theorem example with noncontiguous regions: lines at 5° increments bisect the similarly coloured region (pink ham and green vegetable) into two equal areas, the black line denoting the common bisector of both regions]]
The two-dimensional variant of the theorem (also known as the '''pancake theorem''') can be proved by an argument which appears in the [[fair cake-cutting]] literature (see e.g. [[Robertson–Webb rotating-knife procedure]]).

For each angle <math>\alpha\in[0,180^\circ]</math>, a straight line ("knife") of angle <math>\alpha</math> can bisect pancake #1.  To see this, translate along its [[Normal (geometry)|normal]] a straight line of angle <math>\alpha</math> from <math>-\infty</math> to <math>\infty</math>; the fraction of pancake #1 covered by the line changes continuously from 0 to 1, so by the [[intermediate value theorem]] it must be equal to 1/2 somewhere along the way. It is possible that an entire range of translations of our line yield a fraction of 1/2; in this case, it is a canonical choice to pick the middle one of all such translations.

When the knife is at angle 0, it also cuts pancake #2, but the pieces are probably unequal (if we are lucky and the pieces are equal, we are done). Define the 'positive' side of the knife as the side in which the fraction of pancake #2 is larger. We now turn the knife, and translate it as described above. When the angle is <math>\alpha</math>, define <math>p(\alpha)</math> as the fraction of pancake #2 at the positive side of the knife. Initially <math>p(0) > 1/2</math>. The function <math>p</math> is continuous, since small changes in the angle lead to small changes in the position of the knife.

When the knife is at angle 180, the knife is upside-down, so  <math>p(180) < 1/2</math>. By the [[intermediate value theorem]], there must be an angle in which <math>p(\alpha)=1/2</math>. Cutting at that angle bisects both pancakes simultaneously.

==''n''-dimensional variant: proof using the Borsuk–Ulam theorem==

The ham sandwich theorem can be proved as follows using the [[Borsuk–Ulam theorem]].  This proof follows the one described by Steinhaus and others (1938), attributed there to [[Stefan Banach]], for the {{math|1=''n'' = 3}} case. In the field of [[Equivariant topology]], this proof would fall under the configuration-space/tests-map paradigm.

Let {{math|''A''<sub>1</sub>, ''A''<sub>2</sub>, ..., ''A''<sub>''n''</sub>}} denote the {{mvar|n}} [[Compact space|compact]] (or more generally [[Bounded set|bounded]] and [[Lebesgue measure|Lebesgue-measurable]]) subsets of <math>\mathbb{R}^n</math> that we wish to simultaneously bisect.  Let <math>S=\{v=(v_1,\ldots,v_n)\in\mathbb{R}^n\colon v_1^2+\ldots+v_n^2=1\}</math> be the [[unit sphere|unit]] [[n-sphere|{{math|(''n'' − 1)}}-sphere]] in <math>\mathbb{R}^n</math>.  For each point {{mvar|v}} on {{mvar|S}}, we can define a [[Linear continuum|continuum]] <math>(E_{v,c})_{c\in\mathbb{R}}</math> of affine [[hyperplane]]s with [[Surface normal|normal vector]] {{mvar|v}}: <math>E_{v,c}=\{x\in\mathbb{R}^n\colon x_1v_1+\ldots+x_nv_n=c\}</math> for <math>c\in\mathbb{R}</math>. For each <math>c\in\mathbb{R}</math>, we call the space <math>E^+_{v,c}=\{x\in\mathbb{R}^n\colon x_1v_1+\ldots+x_nv_n>c\}</math> the "positive side" of <math>E_{v,c}</math>, which is the side pointed to by the vector {{mvar|v}}. By the [[intermediate value theorem]], every family of such hyperplanes contains at least one hyperplane that bisects the bounded set {{math|''A''<sub>''n''</sub>}}: at one extreme translation, no volume of {{math|''A''<sub>''n''</sub>}} is on the positive side, and at the other extreme translation, all of {{math|''A''<sub>''n''</sub>}}'s volume is on the positive side, so in between there must be a closed interval {{math|''I''<sub>''v''</sub>}} of possible values of <math>c\in\mathbb{R}</math>, for which <math>E_{v,c}</math> bisects the volume of {{math|''A''<sub>''n''</sub>}}. If {{math|''A''<sub>''n''</sub>}} has volume zero, we pick <math>c=0</math> for all <math>v\in S</math>. Otherwise, the interval {{math|''I''<sub>''v''</sub>}} is compact and we can canonically pick <math>c=\frac12(\inf I_v+\sup I_v)</math> as its midpoint for each <math>v\in S</math>. Thus we obtain a continuous function <math>\alpha\colon S\to\mathbb{R}</math> such that for each point {{mvar|v}} on the sphere {{mvar|S}} the hyperplane <math>E_{v,\alpha(v)}</math> bisects {{math|''A''<sub>''n''</sub>}}. Note further that we have <math>I_{-v}=-I_v</math> and thus <math>\alpha(-v)=-\alpha(v)</math> for all <math>v\in S</math>.

Now we define a function <math>f\colon S\to\mathbb{R}^{n-1}</math> as follows:
:<math>f(v)=(vol(A_1\cap E^+_{v,\alpha(v)}),\ldots,vol(A_{n-1}\cap E^+_{v,\alpha(v)}))</math>.
This function {{mvar|f}} is [[continuous function|continuous]] (which can be proven with the [[dominated convergence theorem]]).  By the [[Borsuk–Ulam theorem]], there are [[antipodal points]] <math>v</math> and <math>-v</math> on the sphere {{mvar|S}} such that <math>f(v)=f(-v)</math>.  Antipodal points correspond to hyperplanes <math>E_{v,\alpha(v)}</math> and <math>E_{-v,\alpha(-v)}=E_{-v,-\alpha(v)}</math> that are equal except that they have opposite positive sides.  Thus, <math>f(v)=f(-v)</math> means that the volume of {{math|''A''<sub>''i''</sub>}} is the same on the positive and negative side of <math>E_{v,\alpha(v)}</math>, for <math>i=1,\ldots,n</math>.  Thus, <math>E_{v,\alpha(v)}</math> is the desired ham sandwich cut that simultaneously bisects the volumes of {{math|''A''<sub>1</sub>, ..., ''A''<sub>''n''</sub>}}.

==Measure theoretic versions==

In [[measure theory]], {{harvtxt|Stone|Tukey|1942}} proved two more general forms of the ham sandwich theorem.  Both versions concern the bisection of {{mvar|n}} [[subset]]s {{math|''X''<sub>1</sub>, ''X''<sub>2</sub>, ..., ''X''<sub>''n''</sub>}} of a common set {{mvar|X}}, where {{mvar|X}} has a [[Carathéodory]] [[outer measure]] and each {{math|''X''<sub>''i''</sub>}} has finite outer measure.

Their first general formulation is as follows: for any continuous real [[function (mathematics)|function]] <math>f \colon S^n \times X \to \mathbb{R}</math>, there is a point {{mvar|p}} of the {{mvar|n}}-[[sphere]] {{math|''S''<sup>''n''</sup>}} and a real number ''s''<sub>0</sub> such that the surface {{math|1=''f''(''p'',''x'') = ''s''<sub>0</sub>}} divides {{mvar|X}} into {{math|''f''(''p'',''x'') < ''s''<sub>0</sub>}} and {{math|''f''(''p'',''x'') > ''s''<sub>0</sub>}} of equal measure and simultaneously bisects the outer measure of {{math|''X''<sub>1</sub>, ''X''<sub>2</sub>, ..., ''X''<sub>''n''</sub>}}.  The proof is again a reduction to the Borsuk-Ulam theorem.  This theorem generalizes the standard ham sandwich theorem by letting {{math|1=''f''(''s'',''x'') = ''s''<sub>1</sub>''x''<sub>1</sub> + ... + ''s''<sub>''n''</sub>''x''<sub>''n''</sub>}}.

Their second formulation is as follows: for any {{math|''n'' + 1}} measurable functions {{math|''f''<sub>0</sub>, ''f''<sub>1</sub>, ..., ''f''<sub>''n''</sub>}} over {{mvar|X}} that are [[linearly independent]] over any subset of {{mvar|X}} of positive measure, there is a [[linear combination]] {{math|1=''f'' = ''a''<sub>0</sub>''f''<sub>0</sub> + ''a''<sub>1</sub>''f''<sub>1</sub> + ... + ''a''<sub>''n''</sub>''f''<sub>''n''</sub>}} such that the surface {{math|1=''f''(''x'') = 0}}, dividing {{mvar|X}} into {{math|''f''(''x'') < 0}} and {{math|''f''(''x'') > 0}}, simultaneously bisects the outer measure of {{math|''X''<sub>1</sub>, ''X''<sub>2</sub>, ..., ''X''<sub>''n''</sub>}}.  This theorem generalizes the standard ham sandwich theorem by letting {{math|1=''f''<sub>0</sub>(''x'') = 1}} and letting {{math|''f''<sub>''i''</sub>(''x'')}}, for {{math|''i'' > 0}}, be the {{mvar|i}}-th coordinate of {{mvar|x}}.

==Discrete and computational geometry versions==

[[Image:Discrete ham sandwich cut.svg|thumb|right|A ham-sandwich cut of eight red points and seven blue points in the plane]]

In [[discrete geometry]], the ham sandwich theorem usually refers to the special case in which each of the sets being divided is a [[finite set]] of [[point (geometry)|point]]s.  Here the relevant measure is the [[counting measure]], which simply counts the number of points on either side of the hyperplane.  In two dimensions, the theorem can be stated as follows:

:For a finite set of points in the plane, each colored "red" or "blue", there is a [[line (mathematics)|line]] that simultaneously bisects the red points and bisects the blue points, that is, the number of red points on either side of the line is equal and the number of blue points on either side of the line is equal.

There is an exceptional case when points lie on the line.  In this situation, we count each of these points as either being on one side, on the other, or on neither side of the line (possibly depending on the point), i.e. "bisecting" in fact means that each side contains less than half of the total number of points.  This exceptional case is actually required for the theorem to hold, of course when the number of red points or the number of blue is odd, but also in specific configurations with even numbers of points, for instance when all the points lie on the same line and the two colors are separated from each other (i.e. colors don't alternate along the line). A situation where the numbers of points on each side cannot match each other is provided by adding an extra point out of the line in the previous configuration.

In [[computational geometry]], this ham sandwich theorem leads to a computational problem, the '''ham sandwich problem'''.  In two dimensions, the problem is this: given a finite set of {{mvar|n}} points in the plane, each colored "red" or "blue", find a ham sandwich cut for them.  First, {{harvtxt|Megiddo|1985}} described an algorithm for the special, separated case. Here all red points are on one side of some line and all blue points are on the other side, a situation where there is a unique ham sandwich cut, which Megiddo could find in linear time. Later, {{harvtxt|Edelsbrunner|Waupotitsch|1986}} gave an algorithm for the general two-dimensional case; the running time of their algorithm is {{math|''O''(''n'' log ''n'')}}, where the symbol {{mvar|O}} indicates the use of [[Big O notation]]. Finally, {{harvtxt|Lo|Steiger|1990}} found an optimal {{math|''O''(''n'')}}-time [[algorithm]]. This algorithm was extended to higher dimensions by {{harvtxt|Lo|Matoušek|Steiger|1994}} where the running time is <math>o(n^{d-1})</math>. Given {{mvar|d}} sets of points in general position in {{mvar|d}}-dimensional space, the algorithm computes a {{math|(''d''−1)}}-dimensional hyperplane that has an equal number of points of each of the sets in both of its half-spaces, i.e., a ham-sandwich cut for the given points. If {{mvar|d}} is a part of the input, then no polynomial time algorithm is expected to exist, as if the points are on a [[moment curve]], the problem becomes equivalent to [[Necklace splitting problem|necklace splitting]], which is [[PPA (complexity)|PPA-complete]].

A linear-time algorithm that area-bisects two disjoint convex polygons
is described by
{{harvtxt|Stojmenovíc|1991}}.

==Generalization to algebraic surfaces==
The original theorem works for at most {{mvar|n}} collections, where {{mvar|n}} is the number of dimensions. To bisect a larger number of collections without going to higher dimensions, one can use, instead of a hyperplane, an [[algebraic surface]] of [[degree of an algebraic variety|degree]] {{mvar|k}}, i.e., an ({{math|''n''−1}})–dimensional surface defined by a polynomial function of degree {{mvar|k}}:

Given <math>\binom{k+n}{n}-1</math> measures in an {{mvar|n}}–dimensional space, there exists an algebraic surface of degree {{mvar|k}} which bisects them all. ({{harvtxt|Smith|Wormald|1998}}).

This generalization is proved by mapping the {{mvar|n}}–dimensional plane into a <math>\binom{k+n}{n}-1</math> dimensional plane, and then applying the original theorem. For example, for {{math|1=''n'' = 2}} and {{math|1=''k'' = 2}}, the 2–dimensional plane is mapped to a 5–dimensional plane via:

:{{math|(''x'', ''y'') → (''x'', ''y'', ''x''<sup>2</sup>, ''y''<sup>2</sup>, ''xy'')}}.

== See also ==
* [[Exact division]]

==References==
*{{citation
 | doi = 10.2307/4145019
 | last1 = Beyer | first1 = W. A.
 | last2 = Zardecki | first2 = Andrew
 | issue = 1
 | journal = [[American Mathematical Monthly]]
 | pages = 58–61
 | title = The early history of the ham sandwich theorem
 | volume = 111
 | year = 2004
 | jstor = 4145019| url = https://zenodo.org/record/1235195 | id = {{ProQuest|203746537}} }}.
*{{citation
 | last = Cairns | first = Stewart S.
 | date = Spring 1963
 | issue = 8
 | journal = Pi Mu Epsilon Journal
 | jstor = 24338222
 | pages = 389–403
 | title = Networks, ham sandwiches, and putty
 | volume = 3}}.
*{{citation
 | last1 = Dubins | first1 = L. E. | author1-link = Lester Dubins
 | last2 = Spanier | first2 = E. H. | author2-link = Edwin Spanier
 | date = January 1961
 | doi = 10.1080/00029890.1961.11989615
 | issue = 1P1
 | journal = [[American Mathematical Monthly]]
 | pages = 1–17
 | title = How to cut a cake fairly
 | volume = 68}}
*{{citation
 | doi = 10.1016/S0747-7171(86)80020-7
 | last1 = Edelsbrunner | first1 = Herbert | author1-link = Herbert Edelsbrunner
 | last2 = Waupotitsch | first2 = R.
 | journal = Journal of Symbolic Computation
 | pages = 171–178
 | title = Computing a ham sandwich cut in two dimensions
 | volume = 2
 | issue = 2 | year = 1986| doi-access = free
 }}.
*{{citation
 | last1 = Lo | first1 = Chi-Yuan
 | last2 = Steiger | first2 = W. L.
 | contribution = An optimal time algorithm for ham-sandwich cuts in the plane
 | pages = 5–9
 | title = Proceedings of the Second Canadian Conference on Computational Geometry
 | year = 1990}}.
*{{citation
 | last1 = Lo | first1 = Chi-Yuan
 | last2 = Matoušek | first2 = Jiří | author2-link = Jiří Matoušek (mathematician)
 | last3 = Steiger | first3 = William L.
 | doi = 10.1007/BF02574017
 | journal = [[Discrete & Computational Geometry]]
 | pages = 433–452
 | title = Algorithms for Ham-Sandwich Cuts
 | volume = 11
 | issue = 4
 | year = 1994| doi-access = free
 }}.
*{{citation
 | doi = 10.1016/0196-6774(85)90011-2
 | last = Megiddo | first = Nimrod
 |authorlink= Nimrod Megiddo
 | journal = Journal of Algorithms
 | pages = 430–433
 | title = Partitioning with two lines in the plane
 | volume = 6
 | issue = 3 | year = 1985}}.
*{{citation
 | last = Peters | first = James V.
 | date = Summer 1981
 | issue = 3
 | journal = The Rocky Mountain Journal of Mathematics
 | jstor = 44236614
 | pages = 473–482
 | title = The ham sandwich theorem and some related results
 | volume = 11| doi = 10.1216/RMJ-1981-11-3-473
 | doi-access = free
 }}.
*{{citation
| last1 = Smith | first1 = W. D. 
| last2 = Wormald | first2 = N. C. 
| doi = 10.1109/sfcs.1998.743449 
| chapter = Geometric separator theorems and applications 
| title = Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280) 
| pages = 232 
| year = 1998 
| isbn = 0-8186-9172-7 
| pmid =  
| pmc = 
| s2cid = 17962961 
}}
*{{citation
 | author = ((Editors))
 | journal = Mathesis Polska
 | pages = 26–28
 | title= Notatki: Z topologii
 | volume = 11
 | issue=1–2
 | year = 1938
 | language=pl}}.
*{{citation
 | doi = 10.1215/S0012-7094-42-00925-6
 | last1 = Stone | first1 = Arthur H.| author1-link = Arthur Harold Stone
 | last2 = Tukey | first2 = John W. | author2-link = John Tukey
 | journal = [[Duke Mathematical Journal]]
 | pages = 356–359
 | title = Generalized "sandwich" theorems
 | volume = 9
 | issue = 2 | year = 1942}}.
*{{citation
 | last = Stojmenovíc | first = Ivan
 | author-link = Ivan Stojmenović
 | journal = [[Information Processing Letters]]
 | pages = 15–21
 | title = Bisections and ham-sandwich cuts of convex polygons and polyhedra
 | volume = 38
 | number = 1
 | year = 1991| doi = 10.1016/0020-0190(91)90209-Z
 }}.

==External links==
* {{MathWorld|title=Ham Sandwich Theorem|urlname=HamSandwichTheorem|mode=cs2}}
*[http://jeff560.tripod.com/h.html ham sandwich theorem] on the [http://jeff560.tripod.com/mathword.html Earliest known uses of some of the words of mathematics] 
*[http://cgm.cs.mcgill.ca/~athens/cs507/Projects/2002/DanielleMacNevin/index.htm Ham Sandwich Cuts] by Danielle MacNevin
*[http://gfredericks.com/sandbox/ham_sandwich An interactive 2D demonstration]

[[Category:Theorems in measure theory]]
[[Category:Articles containing proofs]]
[[Category:Theorems in topology]]