Claim FPRD-D11

Exact statement

The suffix-recognition lift Lambda maps a language L to the set-valued suffix behavior that returns every v for which the input factors as xv with x in L; complete-match readout recovers L, and the lift is intended to preserve empty language, epsilon, union, and language concatenation as relational failure, identity, union, and composition.

Statusdefinition

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 docs/specs/m15-classical-regular-dynamics.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

docs/specs/m15-classical-regular-dynamics.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

Operation preservation and injectivity are proof obligations in M15; the definition itself fixes the exact remaining-suffix interface.

Open work

Add a self-contained definition page with examples, nonexamples, and dependency boundaries.

Notes

Operation preservation and injectivity are proof obligations in M15; the definition itself fixes the exact remaining-suffix interface.