FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T30

Claim FPRD-T30

Exact statement

Every capacity-witnessed fixed-envelope recoding induces a constant length injective homomorphism tau that sends each matching source pair to reversed matching envelope blocks, preserves and reflects Dyck membership on encoded words, and commutes with the fixed projection readout; for every source trace language K, direct block readout of K and fixed projection readout of tau of K have identical exact suffix behaviors, and whenever source languages K and H agree through floor of N over m, their decoded output suffix behaviors agree through length N.

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.

OPEN_PROBLEMS.md →

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

  • Crespi Reghizzi and San Pietro prove the language-level coding claims. M19 supplies the typed executable recoder, exact remaining-suffix identity, scaled finite-observation theorem, and adversarial finite evidence while preserving the source attribution.

Open work

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

Notes

Crespi Reghizzi and San Pietro prove the language-level coding claims. M19 supplies the typed executable recoder, exact remaining-suffix identity, scaled finite-observation theorem, and adversarial finite evidence while preserving the source attribution.