In mathematics, and in particular the necklace splitting problem, the Hobby–Rice theorem is a result that is useful in establishing the existence of certain solutions. It was proved in 1965 by Charles R. Hobby and John R. Rice;[1] a simplified proof was given in 1976 by A. Pinkus.[2]
Define a partition of the interval [0,1] as a division of the interval into
n+1
n
0=z0<\underbrace{z1<...b<zn}<zn+1=1
Define a signed partition as a partition in which each subinterval
i
\deltai
\delta1,...c,\deltak+1\in\left\{+1,-1\right\}
The Hobby–Rice theorem says that for every n continuously integrable functions:
g1,...c,gn\colon[0,1]\longrightarrowR
there exists a signed partition of [0,1] such that:
n+1 | |
\sum | |
i=1 |
\deltai\int
zi | |
zi-1 |
gj(z)dz=0for1\leqj\leqn.
(in other words: for each of the n functions, its integral over the positive subintervals equals its integral over the negative subintervals).
The theorem was used by Noga Alon in the context of necklace splitting[3] in 1987.
Suppose the interval [0,1] is a cake. There are n partners and each of the n functions is a value-density function of one partner. We want to divide the cake into two parts such that all partners agree that the parts have the same value. This fair-division challenge is sometimes referred to as the consensus-halving problem.[4] The Hobby–Rice theorem implies that this can be done with n cuts.