FPRD LabShare an approach

← Claims

Mechanically checked result

FPRD-T96

Claim FPRD-T96

Exact statement

A causal resolver emits one call, return, or local tag in the same round as each observed input letter. Its one-stack product with a deterministic visible-stack machine has exactly the resolver state and tagged-machine configuration after every prefix. A fixed finite family of such products executes on parallel stacks and accepts exactly their finite disjunction. If the family is complete for every accepted tagged lift, its executor and the scaffold produced by the verified compiler decide exactly the forgotten-action projection, including at epsilon.

Statusmechanically checked
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 formalizations/frontier-derivative/FrontierDerivative/ResolverCover.lean. The matrix has not yet rewritten that source into a self-contained public proof summary.

formalizations/frontier-derivative/FrontierDerivative/ResolverCover.lean →

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

  • Lean 4.30.0 checks annotation length and input projection, resolve_run_exact, same-prefix acceptance, componentwise parallel runs, finite disjunctive readout, resolver soundness, complete-cover recognition, and compiler preservation. The theorem also defines and checks the zero-policy case, which rejects every word. A two-policy all-words calibration proves completeness while showing that either policy alone misses a one-letter word. Lean does not prove that every deterministic VPA projection has a finite complete resolver family.

Open work

Expose the formal/checker scope, reproducibility instructions, and the gap to a complete mathematical proof.

Notes

Lean 4.30.0 checks annotation length and input projection, resolve_run_exact, same-prefix acceptance, componentwise parallel runs, finite disjunctive readout, resolver soundness, complete-cover recognition, and compiler preservation. The theorem also defines and checks the zero-policy case, which rejects every word. A two-policy all-words calibration proves completeness while showing that either policy alone misses a one-letter word. Lean does not prove that every deterministic VPA projection has a finite complete resolver family.