While this submission is a draft, it cannot be used by other submissions.

Proof of `Integer coefficients of recursive separating cuts` (1st statement)

groundedproofs/Lax263307Proofs/ComponentCutEncoding.lean · lax-263307

What this proof establishes

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 positive contribution counts at most ∣C∣≤n|C| ≤ n terms, each equal to one. The negative contribution is either zero or u≤nu ≤ n. Their difference lies between −n-n and nn, even when inserted coordinates repeat.