Claim FPRD-T26

Exact statement

For a finite cycle-guarded positive relational presentation with r variables, the occurrence-delay matrix bounds componentwise semantic first differences by min-plus multiplication, some power p at most r of the exact suffix operator is one-half contractive, the original operator has a unique fixed point, and bottom depth p times N plus one is exact on all input rows through length N with coherent inverse-limit recovery.

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

Contractive iterates and guarded recursion are established mechanisms. M17 must prove the recognition-specific delay extraction, tropical locality inequality, cycle bound, and exact suffix reconstruction.

Open work

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

Notes

Contractive iterates and guarded recursion are established mechanisms. M17 must prove the recognition-specific delay extraction, tropical locality inequality, cycle bound, and exact suffix reconstruction.