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

Proof of `Symmetric depth hierarchy` (1st statement)

groundedproofs/Lax461425Proofs/DepthHierarchyUpper.lean · lax-461425

What this proof establishes

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

The tree TΔ,nT_{Δ,n} has a tree decomposition of depth Δ+1Δ + 1 with empty root bag and bags of size ≤2≤ 2 (decompdecomp), so CircuitsForPatterns.existscircuitCircuitsForPatterns.exists_circuit with support size 22 applies.