Written-proof claim

FPRD-T04

Claim FPRD-T04

Exact statement

Every finite strongly input-guarded deterministic prioritized recognition equation system induces a contractive operator on a specified suffix-behavior ultrametric and therefore has a unique denotational fixed point.

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 proof defines dedicated terminal-prefix guards, proves completeness, constructor nonexpansiveness, exact prefix contraction, and a structural guard-depth Lipschitz bound before applying Banach. It does not extend to arbitrary Ford-well-formed syntax.

Open work

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

Notes

The proof defines dedicated terminal-prefix guards, proves completeness, constructor nonexpansiveness, exact prefix contraction, and a structural guard-depth Lipschitz bound before applying Banach. It does not extend to arbitrary Ford-well-formed syntax.