Proof of `Restriction of scatter types`

groundedproofs/Lax185574Proofs/ScatterTypeRestriction.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 45 of this submission's paper

Description

Level ii of the domain Dk+1,qD_{k+1,q} is level i+1i + 1 of Dk,q+1D_{k,q+1}, since the ranks and the radius bounds coincide. The values agree because the caps (k+1)+q(k+1) + q and k+(q+1)k + (q+1) coincide and both use the same greedy scattered set.