Proof of `Locality of type trees`
groundedproofs/Lax185574Proofs/TreeLocality.lean · lax-185574
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.
In the paper
- page 43 of this submission's paper
Description
By induction along the tuple and the triangle inequality, the entry is within of . A color mentioned in a true atom of rank has a vertex within the radius of the atom, at most , of an entry. The horizon inequality bounds both distances by .