Proof of `Formal ordered product bits realize symmetric corrections`
groundedproofs/Lax342547Proofs/BinaryPrescriptions.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
Order the finite atom indices. For the increasing order of each distinct pair choose one allowed term, with factors one and the desired correction. All other factors are zero. Exactly one ordered sum contributes; binary addition cancels the old entry. Diagonal entries are unchanged.