Generative Structures Proof Audit

This appendix keeps the theorem-card trail for the Generative Structures lesson. The lesson explains seed-rule provenance and exact regeneration; this page is for checking the finite proof family.

These theorem cards prove finite regeneration, orbit, equality, and bounded-search facts. They do not prove global minimality, universal compression, or that a generator record is always smaller or more meaningful than explicit storage.