Context
The theorem closes a tempting optimization route. Splitting the guard range into more bands cannot improve the best single-threshold estimate when every disorder count is only an unconditional marginal bound.
Definitions
- The guard bands have widths .
- bounds the entire corresponding disorder sublevel without conditioning on the guard band.
Hypotheses and scope
- .
- Every is nonnegative and unconditional; no joint distributional information is available.
Proof or evidence
Induct on . Put . If , the final correction equals , so . If , discard the earlier nonnegative corrections to get . Either way .
Verification notes
This run independently rederived the induction, checked the base case and both last-band cases, and confirmed that the claim does not assume independence. A new exhaustive falsification audit passed 532,700 small integer instances. The written induction remains the proof; no external review is recorded.
Limitations
- The theorem applies only to envelopes built from unconditional marginal sublevel counts.
- It does not rule out an improvement from a genuinely joint guard–disorder estimate.
- It yields no Collatz or finiteness conclusion.
Notes
The proof is an elementary induction splitting on whether the final threshold gap is at most its disorder bound. This theorem is abstract and reusable beyond Collatz. It does not rule out gains from joint, conditional, or dynamically correlated guard--disorder information.