Claim PUB-direct-palindrome-scaffolding--thm-whole-client-normalization

Exact statement

Theorem 11.3 (Whole-client bounded symbolic normalization). Fix a finite immutable record signature. Let one deterministic strict client transition have a uniform bound on calls, constructor tests, loops, recursion, and retained fresh records. Suppose it observes only finite tags, finite nonpointer data, old records reached by bounded rooted addresses, and constructors of ordinary fresh structural records already known to its symbolic evaluation. It neither observes pointer identity or allocation state nor inspects an unresolved opaque atom, designated fresh payload, or designated fresh owner. Suppose also that every old pointer later read or retained has a bounded rooted provenance, temporary control packages do not escape, and unreachable failure leaves are completed by a fixed finite plan. Then the whole client normalizes to one bounded simultaneous record-transducer plan determined only by finite control, the input letter, and a bounded labelled unfolding of the old roots.

Statusreview publication statement; not independently promoted by this index

External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

This row inventories an exact theorem-like statement extracted from a publication. Publication presence and mathematical maturity are intentionally separate.

Proof or evidence

The proof context is available at the linked publication anchor. This matrix run verified the statement-to-anchor link, not the proof itself.

Persistent receipts and simultaneous records: a direct scaffold for even palindromes, Theorem 11.3 →

Verification notes

Reviewed on 2026-08-25 for stable extraction, publication anchor, and KaTeX validation. No theorem-level hostile proof audit is asserted.

Limitations

This row may overlap a governed FPRD claim; no equivalence is assumed until mapped.
The publication's review-stage label is not external specialist review evidence.

Open work

Map this publication statement to any governed claim, verify its hypotheses and proof dependencies, and remove duplicate inventory rows only after an exact mapping exists.