The Setting
Reveal burgers and orders backwards from a boundary, prepending each new letter to the front of the revealed word and reducing it with freshest-first burger stacks. One tracks the cumulative burger-minus-order sum along the natural filtration and waits for the first step at which the reduced word retains a surviving burger. The question is what reduced state emerges at that time and how the remaining pending orders relate to the stopped burger-minus-order count.
Inventory Words and Backward Reduction
Let index the two burger types. The set of inventory orders consists of the flexible order and fixed orders of boolean type .✦ The finite burger-order alphabet is the set consisting of burger tokens for and order tokens for . The letter increment is the map that assigns to every burger token and to every order token.✦
An inventory stack evaluation state consists of a finite list of pending orders in and a finite list of boolean burger types in stored freshest-first. The word evaluation of a finite word of letters in on an inventory stack evaluation state is the evaluation state obtained by processing on : on the empty word it returns , and on a word with leading letter and suffix it recursively evaluates from the state obtained by applying the single-step transition on to , in which an order consumes the freshest eligible burger. The word reduction of is the evaluation state obtained from empty pending orders and an empty burger stack.✦
For an infinite sequence and an integer , the revealed word is the reversal of , with .✦ On the product measurable space , the natural filtration generated by the coordinate process is given by (1): (1)✦ For an infinite sequence and an integer , the letter increment sum is given by (2): (2)✦
The survivor indicator , for an infinite sequence and an integer , is the indicator variable equal to if and otherwise. Given an integer-valued process on a sample space and an element , the first hitting time of zero is the least at which , and if no such exists.
The Claim
Definition 1. Let . The first backward survivor time is the first hitting time of zero of the survivor indicator process . For an infinite sequence , the survivor order count is the non-negative integer equal to when , and to the length of otherwise. For , the stopped defect process is the process stopped at . If satisfies , then there exists a burger type (with opposite type ) such that (3) holds: (3)✦ Moreover, if satisfies , then (4) holds: (4)✦
In the paper, the result reads: letters are revealed backwards from a fixed boundary by prepending one letter at each step, is the burger-minus-order sum with , , and at time the reduction consists of one burger and fixed orders of the opposite type, with . The zero-based time shifts by one (), so (3) and (4) capture the reduced shape and in stopped form.
What Is Checked
The claim is stated over infinite sequences in the finite burger-order alphabet (with order type and letter increment ), evaluated via inventory stack states and word reduction on backward-revealed prefixes , together with the natural filtration (1), the letter increment sum (2), the survivor indicator , the first hitting time of zero , the first backward survivor time , the survivor order count , the stopped defect process , and indices satisfying or .