The Setting
A deterministic table applied to reports on a sign cube can single out a failing leaf, while the Fourier degrees of the report cells measure the input cost.
For a finite set and a function , the uniform mean is the real number given by (1), with value zero when is empty: (1) For a finite coordinate set , the sign cube is .✦ For and , the Fourier character is a function, the real Fourier-Walsh coefficient is a real number, and the ordinary real multilinear Fourier degree is a nonnegative integer, each given by (2): (2) This degree is distinct from polynomial threshold degree and degree over a finite field.
Let be a label set, and let denote the real indicator of a condition , equal to when holds and otherwise. For any map and label , the cell indicator is the fiber indicator in (3): (3)✦
Let be a finite leaf index set and a finite label set. A selector is a map that chooses a leaf from the distinguished label. Let be the Boolean indicator of the th leaf test, with value for true and for false. For a table point , the unique failing leaf event is defined by (4): (4)✦
For real selector weights and leaf weights , the soft event weight is the function in (5): (5)✦
The Claim
Theorem 1. Let and define the event in (4), and let . For every , the event indicator satisfies (6): (6)✦ Let and for be reports, and let . Suppose and for every label and leaf . The induced event on the cube satisfies the degree bound (7): (7)✦
In the paper, the result reads: for intervals and a selector with finitely many cut points, on inputs the events , and satisfy (8), with each summand using at most coordinates and the refined report returning only a tag on , all leaves on , and together with the unselected leaves on : (8)
What Is Checked
The statements concern deterministic finite tables with a selector and Boolean leaf tests; the degree statement concerns reports from a finite sign cube whose cell indicators have a common Fourier degree bound.