C-D21-SEED

Seed completeness THEOREM proved: every bounded global counterexample enters at least one retained seed. At each seed prime it is either applicable, retaining its full 13-multiset signature under complete enumeration, or inapplicable, recording that the prime divides the global speed product against FA-OB. Completeness carries padding, the QR scale orbit, permutation and sign removal by squaring, duplicate-root multiplicity and every projective singular stratum. This is unconditional on the enumeration being affordable

In plain language

It is proved that a real counterexample can never slip past the seeding step: every one leaves a fingerprint that a complete scan would keep.

Exact statement

Seed completeness THEOREM proved: every bounded global counterexample enters at least one retained seed. At each seed prime it is either applicable, retaining its full 13-multiset signature under complete enumeration, or inapplicable, recording that the prime divides the global speed product against FA-OB. Completeness carries padding, the QR scale orbit, permutation and sign removal by squaring, duplicate-root multiplicity and every projective singular stratum. This is unconditional on the enumeration being affordable