Cycle lemma (${\sum }_i{b}_i=1$)

For an integer sequence with total sum one, exactly one cyclic starting position has every nonempty partial sum strictly positive. Starting after the last minimum of the proper partial sums proves existence. Two good starts would divide the sequence into two positive integer arc sums adding to one, proving uniqueness. This form counts cyclic prefix constraints in the cyclic Turán covering construction.