Written-proof claim

FPRD-T95

Claim FPRD-T95

Exact statement

If the source and cover carriers of an FPRD-T94 stationary principal derivative cover are finite and its frontier language is X, then X reversed belongs to PEL. Equivalently, to obtain a PEG for L by this route, construct the finite stationary cover for L reversed.

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 docs/notes/stationary-principal-derivative-cover-proof.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

  • Finite source control, input and stack alphabets, cover control, basis index, and slot set make the compiler's tuple-valued scaffold alphabet and state set finite. FPRD-T94 supplies a scaffold for X. Substituting K=X reversed in the sufficient direction of LMR Theorem 16 yields an ordinary complete-match PEG for K because K reversed equals X. The reversal, finiteness specialization, and LMR application are ordinary source-based mathematics rather than Lean theorems.

Open work

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

Notes

Finite source control, input and stack alphabets, cover control, basis index, and slot set make the compiler's tuple-valued scaffold alphabet and state set finite. FPRD-T94 supplies a scaffold for X. Substituting K=X reversed in the sufficient direction of LMR Theorem 16 yields an ordinary complete-match PEG for K because K reversed equals X. The reversal, finiteness specialization, and LMR application are ordinary source-based mathematics rather than Lean theorems.