Written-proof claim

FPRD-T21

Claim FPRD-T21

Exact statement

For every labeled positive relational presentation, distributive CFG normalization induces a finite origin relation on call occurrences, and at every exact and bounded observation level each normalization-surviving source right-success frame behavior is the relational union of the frame behaviors of its normalized call clones; split, merge, and elimination witnesses show that raw presentation dynamics need not be invariant.

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

  • Normalization survival is syntactic, not runtime activation. No equation is asserted for eliminated labels, and union refinement is not an isomorphism, conjugacy, bisimulation, minimization, or language-canonical dynamic theorem.

Open work

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

Notes

Normalization survival is syntactic, not runtime activation. No equation is asserted for eliminated labels, and union refinement is not an isomorphism, conjugacy, bisimulation, minimization, or language-canonical dynamic theorem.