Proof of `Theorem 2` (1st statement)

groundedproofs/Lax496464Proofs/Section3.lean · lax-496464

What this proof establishes

no assumptions

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

In the paper

  • page 4 of this submission's paper

Description

The mm smallest indices are thresholds that constrain nothing beyond ∣X∣≤m|X| ≤ m, so a set compatible with them is one that fits on mm machines; and being preprocessable from a nonnegative instant is Condition 1.