Proof of `Interpolation of finitely many binary selector labels`
groundedproofs/Lax342547Proofs/SelectorInterpolation.lean · lax-342547
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.
Description
For each label, a product of affine bit functions singles it out among the specified labels. Its degree is at most their number minus one. Applying these separating polynomials to a linear relation recovers every coefficient.