Link to current text
MATH.11:8 - Common Anti-Patterns and How to Avoid Them
| Failure | Repair |
| Assuming an ordinary total is preserved by an exchange with unequal counts | Derive weights from the contribution of each rule. |
| Checking only one branch of a construction | Include every allowed branch in the preservation equations. |
| Inferring reachability from equal invariant values | Supply a sequence or a theorem that also resolves enabling and ordering conditions. |
| Calling a constant-only coefficient result proof that no invariant exists | Retain the exhausted family; change expressions or arithmetic when useful. |
| Treating a polynomial identity search as complete for a restricted reachable set | Check preservation on the stated set using a description of its allowed steps. |
| Using a mathematical identity after changing update order or arithmetic | Substitute the implemented rule and recalculate the affected relation. |