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.

Read the Lean proof on GitHub

In the paper

  • page 43 of this submission's paper

Description

By induction along the tuple and the triangle inequality, the entry vivᵢ is within ∑i′=1iρ+(k+i′,q−i′)∑_{i'=1}^{i} ρ⁺(k+i', q−i') of v0v₀. A color mentioned in a true atom of rank (k+j,q−j)(k+j, q−j) has a vertex within the radius of the atom, at most ρ+(k+j,q−j)ρ⁺(k+j, q−j), of an entry. The horizon inequality guardSumaddleguardSum_add_le bounds both distances by ρ+(k,q)ρ⁺(k, q).