Lax Lean Archive

Proof of `Corollary 4`

groundedproofs/Lax496464Proofs/Corollary4.lean · lax-496464

What this proof establishes

no assumptions

thm✓Lax496464.Corollary4

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

Description

The construction of Section 8, written as a word RAM program, is an fpt-reduction from Hitting Set. Its correctness is Section8.constructcorrectSection8.construct_correct carried to words; its running time is a polynomial of degree four in the length of the word, and the values it computes stay below a bound that the concept's two admissibility clauses provide.