Lax Lean Archive

Proof of `Merge sequences with definable stages from chains`

groundedproofs/Lax185574Proofs/BetterMergeSequences.lean · lax-185574

What this proof establishes

lem✓Lax185574.BetterMergeSequences

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 35 of this submission's paper

Description

The statement for graphs and Algorithm.ComputesAlgorithm.Computes, from the version for simple graphs: the algorithm is the program with its exponent, the merge sequence of a graph is that of its simple graph, and the constant stays the same.