Library / Foundational Thinking DPF Suite Reference
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-02 23:06:08 UTC · snapshot created 2026-10-03 01:38:24 UTC · last check 2026-10-03 03:10:20 UTC

3.4. Obtain a result under limits

State the consequence to retain → derive what removed detail contributes → obtain a replacement or bound → interpret the result at its supported reach.

MMP.9 develops this operation for evolution laws. FPF C.29.2 connects a question with an obtaining process; C.29.3 connects that process to physical means. Use the MMP Readme’s reduction entry when the removed detail is the difficulty.

Small use. Suppose two nonnegative populations satisfy x’=-x and y’=-2y, with x(0)+y(0)=1. Retain only z=x+y. Its derivative is -x-2y, which z alone does not determine: at z=1 it can be -1 or -2. Yet the source laws give e^(-2t) ≤ z(t) ≤ e^(-t) for t≥0. At t=3 the upper bound is below 0.05. A question asking whether the remaining total is below 0.1 is settled without recovering the initial split. At t=1, a changed threshold of 0.2 lies between the two bounds, so deciding whether the total is below that threshold requires more about the initial split.

A smaller model can therefore be sufficient for one decision while lacking a complete evolution law in the retained quantity. New interventions or a different time horizon can require the missing distinction again. FPF’s ordinary comparison and improvement methods can retain several complementary models.

MATH.20 now supplies the general bounding method: derive a comparison covering all admitted cases, carry it through the needed operation, and tighten it only if the answer needs more. MATH.21 constructs limits and justifies the operations performed on them. Physical Thinking supplies PHY.3 for limits derived from permitted physical transformations, and PHY.5 for choosing which effects must be retained. CMP.8 constructs an effective approximation and finite return condition; CMP.9 constructs sampling and estimation. Numerical procedures are one application of these algorithmic methods. MMP.17 constructs a cheaper supplier of the responses the receiving operation needs. MMP.18 combines models through compatible exchanges and joint assumptions, retaining consequential approximation and dependence.

The replacement-and-coupling example sums two distinct amounts with their error bounds. A tighter decision threshold makes one coarse response insufficient; replacing that response can settle the decision without refining the other model. Asking when the threshold was crossed requires temporal information that the final amounts do not contain.

The full MMP-SUFFICIENT-ANSWER example works this connection across MMP, MATH and FPF. Its changed-time question derives the particular initial-state distinction worth recovering.