Draft — mutable and not usable as a dependency; its citation marks the draft state.

Proof of `Locality theorem for distance logic`

groundedproofs/Lax3Proofs/Assembly.lean · lax-3

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

Description

The locality theorem (Theorem 1 of arXiv:2606.23180): every formula of distance rank (k,q)(k, q) is equivalent to a boolean combination of local formulas and scatter sentences, all of distance rank (k,q)(k, q).

Proof strategy

Structural induction on the formula, the rank read off by inverting the DRankDRank derivation at each step. Atoms are their own combinations, boolean connectives compose the combinations of their parts, and both quantifiers first apply the induction hypothesis to the body and then pull the scatter sentences — being sentences, they do not see the bound variable — outside the quantifier, leaving one local formula per truth pattern of them. A local quantifier is then simply put back in front of that formula. An unrestricted quantifier is the source's real case: over an empty context it becomes a scatter sentence with a single witness, and otherwise the witness is split into a near one, which is a local quantification guarded over the whole tuple, and a far one, which the separation lemma and the far-quantification lemma turn into local formulas and scatter sentences. See the module docstring for the map of the imported pieces.