fpf.tools
Library / Mathematical Thinking DPF
Jump to passage
In this reading
Source · lines 3128–3142

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 10:39:28 UTC · snapshot created 2026-10-03 10:40:04 UTC · last check 2026-10-03 10:39:56 UTC

MATH.11:7 - Conformance Checklist

For the construction and use at hand:

  1. The state set, initial condition and every allowed transformation are recoverable.
  2. The candidate expression family and its value arithmetic are stated.
  3. The preservation equations cover all allowed rules, with any stronger polynomial-identity requirement visible.
  4. The constructed expression satisfies those equations and gives the stated initial value.
  5. The finite-sequence argument supplies the reach of the conclusion.
  6. An impossibility claim separates invariant values; a reachability claim also has its sequence or sufficient theorem.
  7. A failed invariant search retains the family and scope actually searched.
  8. Changes to initial data, target, transformations or arithmetic reopen the corresponding calculation.

Recognition can begin with one rule and a useful candidate expression. Assurance of a general consequence examines the preservation and sequence argument on which that consequence depends.