Validity Boundary Scan¶
Boundary mapping — instantiates Solvable Baseline Decomposition
Sweeps the parameters to find where the small-departure assumption stops holding — mapping the edge of the region in which the baseline-plus-correction approximation is defensible.
An approximation that works at one operating point is not licensed everywhere, and the dangerous failures happen exactly where a team wanders past the edge without noticing. Validity Boundary Scan finds that edge. It sweeps the problem's parameters — dose, load, speed, temperature, concentration — recomputing the smallness of the departures (and the size of the residual) across the range, and locates the surface where the small-departure assumption stops holding and the approximation ceases to be defensible. Its defining move is varying the parameters to trace a boundary, not evaluating a single configuration: it produces a validity range — "trust this model for inputs inside here; outside it, don't" — that travels with the result. Where the small-parameter check gives a yes/no verdict at one point, this scan turns that point check into a map. It marks the edge; it does not decide what to do at the edge.
Example¶
A clinical pharmacologist has a one-compartment linear pharmacokinetic model: drug concentration in the blood is the baseline, and clearance is assumed proportional to concentration, which makes the model solvable in closed form and valid for ordinary doses. The question is: over what dose range can the clinic trust it? Validity Boundary Scan sweeps the dose upward, recomputing at each level whether the linearity assumption still holds. At low and moderate doses the departures from linear clearance stay small and the model tracks reality. But as the dose climbs, the liver's metabolizing enzymes begin to saturate — clearance follows Michaelis–Menten kinetics,[n1] flattening toward a maximum rate — and the "small departure from linear" assumption breaks down: above a threshold dose the drug accumulates far faster than the linear model predicts. The scan reports the boundary: the linear model is defensible up to roughly this dose; beyond it, clearance saturates and the approximation under-predicts accumulation dangerously. That mapped edge is the deliverable — a validity range stamped on the model.
How it works¶
- Choose the sweep parameters. Identify the inputs whose variation could push the departures out of the small regime.
- Recompute smallness across the range. At each point in the sweep, re-evaluate whether the departures remain small and whether the residual stays within budget.
- Locate the crossing. Find where smallness fails — the parameter values at which the departure stops being a gentle correction.
- Report the range as a boundary. State the region of validity explicitly, so the result carries the conditions under which it may be trusted.
Tuning parameters¶
- Sweep resolution — how finely the parameter range is sampled. Fine sampling pins the boundary precisely but multiplies computation; coarse sampling risks stepping over a sharp transition.
- Sweep dimensions — how many parameters are varied, singly or jointly. Joint sweeps catch interaction effects that mark a boundary neither parameter crosses alone, at combinatorial cost.
- Failure criterion — what counts as leaving validity: a smallness threshold crossed, a residual budget breached, or both. A stricter criterion draws a conservative boundary well inside the true edge.
- Margin — how far inside the located edge the declared "safe" range is drawn. A wider safety margin guards against a mis-located boundary at the cost of usable range.
When it helps, and when it misleads¶
Its strength is that it makes the validity range travel with the result, which is the archetype's core honesty requirement: an approximation quoted without its boundary invites exactly the extrapolation that gets people hurt. A mapped edge also tells a team where refinement is worthwhile (inside the range) and where no amount of correction will save the method (outside it).
Its failure mode is validity-range creep: the boundary is mapped once, then quietly assumed to hold as the system, inputs, or regime drift beyond where it was drawn. Boundaries can also be sharper or more multidimensional than a coarse sweep reveals — a model can pass every sampled point yet fail in an unswept corner where two parameters interact. The classic misuse is extrapolating just past the mapped edge because the model "was fine right up to here," ignoring that the whole point of the boundary is that behavior changes across it. The discipline is to re-scan when conditions shift, sweep interacting parameters jointly, and draw the trusted range with a margin inside the located edge rather than right up against it.
How it implements the components¶
validity_range_boundary— its primary output: the mapped edge of the region where the approximation is defensible, stamped onto the result.smallness_or_validity_assumption— it re-evaluates this assumption across the parameter range, tracing where smallness holds and where it fails.
It maps the boundary but does not build the dimensionless ratio at a single point — that scale_normalization_reference belongs to Dimensionless Small-Parameter Check, its nearest twin, which certifies smallness at one operating point where this scan sweeps to find the edge. Nor does it decide what to do once the edge is crossed: the nonperturbative_fallback_path is Fallback Trigger Rule's job.
Related¶
- Instantiates: Solvable Baseline Decomposition — supplies the validity range that travels with the approximate result.
- Consumes: Dimensionless Small-Parameter Check supplies the single-point smallness verdict this scan extends into a boundary across parameter space.
- Sibling mechanisms: Zeroth-Order Model Selection · Delta Term Isolation · Dimensionless Small-Parameter Check · First-Order Correction Pass · Successive-Order Refinement · Convergence or Asymptotic Behavior Check · Benchmark Backtest · Fallback Trigger Rule · Residual Comparison Test
Editorial Notes¶
Form Classification¶
Form family: Analysis, Modeling & Optimization
Rationale: Validity Boundary Scan operates as an analytical, modeling, inference, comparison, or optimization procedure that derives insight or a solution because it sweeps the parameters to find where the small-departure assumption stops holding — mapping the edge of the region in which the baseline-plus-correction approximation is defensible.
Independent corroboration: The frozen evidence defines Validity Boundary Scan as 'Sweeps the parameters to find where the small-departure assumption stops holding — mapping the edge of the region in which the baseline-plus-correction approximation is defensible', so its operative form is Analysis, Modeling & Optimization.
Nearest alternative: Experiment, Test & Rehearsal — Validity Boundary Scan includes features of an active test, trial, simulation, drill, or rehearsal that generates evidence through a deliberate attempt or perturbation, but its defining operation is an analytical, modeling, inference, comparison, or optimization procedure that derives insight or a solution.
Review outcome: Independent reviewer agreement; medium confidence.
Origin Attribution¶
Primary origin: Statistics & Experimental Design
Origin pattern: Single lineage
Present-day reach: Specialized
Rationale: Both independent reviews identify statistics experimental design as the historical home of the operation—Sweeps the parameters to find where the small-departure assumption stops holding — mapping the edge of the region in which the baseline-plus-correction approximation is defensible.. The retained alternates document formative adjacent traditions; the reach field, not the origin field, carries later applicability.
Related originating lineages:
- Data Science & Analytics — Data science's modeling, validation, and monitoring tradition contributes a separate formative lineage to the mechanism's validity boundary scan logic.
- Engineering & Design — Engineering design, reliability, and systems-safety practice supplies a parallel or contributing lineage for the mechanism's defining operation: sweeps the parameters to find where the small-departure assumption stops holding — mapping the edge of the region in which the baseline-plus-correction approximation is defensible.
- Mathematics — Mathematical modeling, proof, and abstract-structure practice supplies a parallel or contributing lineage for the mechanism's defining operation: sweeps the parameters to find where the small-departure assumption stops holding — mapping the edge of the region in which the baseline-plus-correction approximation is defensible.
Review resolution: Both blind reviewers independently place the defining operation—Sweeps the parameters to find where the small-departure assumption stops holding — mapping the edge of the region in which the baseline-plus-correction approximation is defensible.—in statistics experimental design. Their queued differences are secondary: alternate_origin_disagreement, origin_mode_disagreement, domain_reach_disagreement, encyclopedia_synthesis_disagreement. Reviewer A uniquely contributes no additional alternate; reviewer B uniquely contributes ['engineering_design', 'mathematics']. I preserve the full evidence-supported union of 3 alternate domain(s), without a numeric cap. origin_mode=single_lineage reflects the more specific lineage judgment in reviewer B's evidence, while domain_reach=specialized separately records present-day portability. The affirmative encyclopedia-synthesis finding is preserved, and confidence=high uses the more conservative reviewer level.
Encyclopedia synthesis: The exact catalogued form synthesizes established practice rather than reproducing a single standard historical label.
Review outcome: Reconciled after independent review; high confidence.
Notes¶
[n1] Michaelis–Menten kinetics describes an enzyme-mediated rate that rises with substrate concentration then saturates toward a maximum — the mechanism by which drug clearance stops being proportional to dose at high concentrations, marking where a linear pharmacokinetic baseline leaves its region of validity. ↩