Lax Lean Archive

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

Proof of `Symmetric ABPs for bounded-pathwidth patterns`

groundedproofs/Lax461425Proofs/Section6ABPForPatterns.lean · lax-461425

What this proof establishes

no assumptions

thm✓Lax461425.ABPsForPatterns

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

Every pattern of pathwidth at most kk has a symmetric affine ABP with vertex-orbit size at most n(k+1)n^(k+1).