Written-proof claim

FPRD-T33

Claim FPRD-T33

Exact statement

The fixed-block compiler allocates exactly one sink plus one boundary and one state for every distinct nonempty proper code prefix at every source state, has the corresponding exact reachable-state and transition counts, transports every surjective source-controller quotient functorially, and preserves source residual count as a lower bound on image residual count; for the fixed envelope, q at most j to the m is exactly the positional-code capacity condition, yielding explicit minimal width or base, envelope-size, trie-overhead, residual, and observation-lag coordinates.

Statusinformal proof
External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

This row is imported exactly from the governed FPRD claims ledger. The matrix assignment records normalized inventory coverage; it is not a new proof or a promotion of the ledger status.

Proof or evidence

The ledger points to OPEN_PROBLEMS.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

Verification notes

Reviewed on 2026-08-25 for identifier, status, provenance, evidence-link presence, and dependency import only. Mathematical proof audit remains the next action unless separately documented.

Limitations

  • The exact profile makes the M19 representation tradeoff measurable. It does not assert that every internal trie-prefix state is a distinct canonical residual after minimization.

Open work

Audit the proof against its dependencies and publish a self-contained evidence summary before increasing maturity.

Notes

The exact profile makes the M19 representation tradeoff measurable. It does not assert that every internal trie-prefix state is a distinct canonical residual after minimization.