##  [Ham Sandwich Theorem](/ham-sandwich-theorem-0) 

 Definition

A measure-partition result that in R^n, given n finite, absolutely continuous measures (or measurable 'objects'), there exists an oriented hyperplane that simultaneously bisects all n measures (each half-space determined by the hyperplane has equal measure for each object). Also known as the Stone–Tukey theorem.

 

 

 

 

 

 





## Principle

Principle

By matching dimensions of parameter space and degrees of freedom (a hyperplane in R^n has n parameters modulo scale), one can use continuity and the Borsuk–Ulam-type arguments to find a single hyperplane that balances n independent mass distributions simultaneously.

 

 

 

 

 





## Demonstration

Demonstration

In R^2 (the plane), given two measurable regions of finite area, there exists a line that cuts both regions into equal-area halves. In R^3, three solids (with absolutely continuous mass distributions) can be simultaneously bisected by a single plane. One constructs a continuous map from sphere of directions to R^n recording signed imbalances and finds a zero by topological fixed-point or antipodal arguments.

 

 

 

 

## Misapplication

Misapplication

Assuming the theorem gives unique bisecting hyperplanes or that it applies without the necessary measurability/continuity hypotheses. For example, attempting to bisect more than n measurable objects in R^n with a single hyperplane without additional structure is invalid.

 

 

 

 

 





## Consequence

Consequence

Guarantees the existence (but not uniqueness) of fair divisions and underpins fair-splitting algorithms and ham-sandwich cuts in computational geometry; it provides constructive directions for dividing resources, loads, or data sets in balanced ways.

 

 

 

 

## Reversal

Reversal

Inverting the statement yields no general guarantee: a hyperplane that bisects many measures does not imply those measures are related or that bisectors are unique. Also, when fewer than n measures are present, infinitely many bisecting hyperplanes typically exist.

 

 

 

 

 





## Boundary

Boundary

Requires n measures in R^n (or comparable finite measures with no atomic concentration and measurability); fails if measures are purely atomic in pathological configurations or if one asks to bisect more than n arbitrary measures without extra constraints.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension exists between existence and constructibility: topological proofs give existence but not always efficient constructive methods; also between the combinatorial desire to split many objects and the dimensional limit n that the theorem enforces.

 

 

 

 

 





## Synthesis

Synthesis

The Ham Sandwich Theorem ties a simple fairness desideratum — cut n measurable objects in R^n into equal halves — to a topological existence argument: using continuity and antipodal symmetry one finds an oriented hyperplane that simultaneously bisects each measure, providing a foundational existence result for fair division in n-dimensional space.