Context
FPRD-T150 gives per-execution replay supports and FPRD-T152 gives exact future-response quotients. This theorem supplies the missing semantic coordinate layer and proves how all three compare.
Hypotheses and scope
- The source is a finite product of nonempty coordinate alphabets.
- The demanded answer can be scalar or a finite vector of future responses.
- Replay supports used in the operational comparison are stable under agreement on their named coordinates.
Proof or evidence
Sufficient coordinate sets are exactly the supersets of the essential coordinates. The answer map itself gives the minimum quotient. The checker exhausts 65,814 scalar Boolean maps and 65,812 two-component maps, for 131,626 maps total and 1,576,046 support-subset checks.
Verification notes
The proof was checked for empty essential support, redundant coordinates, vector-valued answers, equality in the carrier bound, over-querying traces, parity compression, and tight coordinate selectors.
Limitations
- The theorem compares static memories at one cut; it does not bound the work needed to update them over time.
- Semantic support is coordinate-dependent, while quotient memory is invariant under source recoding.
- The ingredients are standard finite-function support and quotient facts, organized here as an FPRD bridge; no literature-priority claim is made.
- No external or specialist review is recorded.