# Verification of the compact cubulation

The theorem is a complete proof for the literal frozen ab,bcb formulation,
not for the distinct palindromic aba,bcb workshop example. The full argument
is in main.tex and the accompanying reproducibility/complete_proof.md.

The finite cubical complex has cells (1,7,8,2). Its link has 14 vertices,
32 edges and 16 filled triangles. All nonempty subsets of its link vertices
were checked for the flag condition. All four local link maps are injective
and full, and the cyclic edge complex collapses to the specified circle.
Exact free-group normal forms check every square relation and the stable
letter substitutions. Normal and optimized execution agree on 18,316 checks.

The general written argument, not the finite word regression, proves the
presentation isomorphism and the proper cocompact CAT(0) deck action.
No numerical approximation is used. No outside review or proof-assistant
certification is claimed. The literature comparison is bounded and carries
no absolute-priority guarantee.

Reproduce with Python 3 using reproducibility/verify_construction.py,
then repeat with python3 -O. Compile with tectonic main.tex.
