The Stromquist–Woodall theorem is a theorem in fair division and measure theory. Informally, it says that, for any cake, for any n people with different tastes, and for any fraction w, there exists a subset of the cake that all people value at exactly a fraction w of the total cake value, and it can be cut using at most 2 n − 2 {\displaystyle 2n-2} cuts. The theorem is about a circular 1-dimensional cake (a "pie"). Formally, it can be described as the interval [0,1] in which the two endpoints are identified. There are n continuous measures over the cake: V 1 , … , V n {\displaystyle V_{1},\ldots ,V_{n}} ; each measure represents the valuations of a different person over subsets of the cake. The theorem says that, for every weight w ∈ [ 0 , 1 ] {\displaystyle w\in [0,1]} , there is a subset C w {\displaystyle C_{w}} , which all people value at exactly w {\displaystyle w} :
∀ i = 1 , … , n : V i ( C w ) = w {\displaystyle \forall i=1,\ldots ,n:\,\,\,\,\,V_{i}(C_{w})=w} , where C w {\displaystyle C_{w}} is a union of at most n − 1 {\displaystyle n-1} intervals. This means that 2 n − 2 {\displaystyle 2n-2} cuts are sufficient for cutting the subset C w {\displaystyle C_{w}} . If the cake is not circular (that is, the endpoints are not identified), then C w {\displaystyle C_{w}} may be the union of up to n {\displaystyle n} intervals, in case one interval is adjacent to 0 and one other interval is adjacent to 1.
Proof sketch Let W ⊆ [ 0 , 1 ] {\displaystyle W\subseteq [0,1]} be the subset of all weights for which the theorem is true. Then:
1 ∈ W {\displaystyle 1\in W} . Proof: take C 1 := C {\displaystyle C_{1}:=C} (recall that the value measures are normalized such that all partners value the entire cake as 1). If w ∈ W {\displaystyle w\in W} , then also 1 − w ∈ W {\displaystyle 1-w\in W} . Proof: take C 1 − w := C ∖ C w {\displaystyle C_{1-w}:=C\smallsetminus C_{w}} . If C w {\displaystyle C_{w}} is a union of n − 1 {\displaystyle n-1} intervals in a circle, then C 1 − w {\displaystyle C_{1-w}} is also a union of n − 1 {\displaystyle n-1} intervals.
W {\displaystyle W} is a closed set. This is easy to prove, since the space of unions of n − 1 {\displaystyle n-1} intervals is a compact set under a suitable topology. If w ∈ W {\displaystyle w\in W} , then also w / 2 ∈ W {\displaystyle w/2\in W} . This is the most interesting part of the proof; see below. From 1-4, it follows that W = [ 0 , 1 ] {\displaystyle W=[0,1]} . In other words, the theorem is valid for every possible weight.
Proof sketch for part 4 Assume that C w {\displaystyle C_{w}} is a union of n − 1 {\displaystyle n-1} intervals and that all n {\displaystyle n} partners value it as exactly w {\displaystyle w} . Define the following function on the cake, f : C → R n {\displaystyle f:C\to \mathbb {R} ^{n}} :
f ( t ) = ( t , t 2 , … , t n ) t ∈ [ 0 , 1 ] {\displaystyle f(t)=(t,t^{2},\ldots ,t^{n})\,\,\,\,\,\,t\in [0,1]}
Define the following measures on R n {\displaystyle \mathbb {R} ^{n}} :
… excerpt ends here. Continue reading the full article.
