smokeTestsAfterRefactor
plain-language theorem explainer
Fixes the expected post-refactor smoke-test count at seven for the GWTC-3 ringdown shared guarded-family runner. Verification authors cite it when asserting that the refactor suite still passes in full. The body is a bare natural-number constant, not a derived claim.
Claim. The expected number of smoke tests after the shared-runner refactor equals $7$.
background
The module records a structural refactor of GWTC-3 ringdown controlled-family damping scripts onto one shared guarded runner. That runner calls require_eligible_model before any posterior bytes are read and exposes two mapping labels: direct (damped-sinusoid $f_{t_0}/\tau_{t_0}$) and kerr220 (Kerr 220 $Q(a)$). Four Python scripts were moved onto the shared path; the module asserts safety invariants only and adds no new physics mapping.
Sibling constants track presence of the shared runner, how many family scripts were refactored, and how many mapping labels are supported. The smoke-test count is the yardstick against which the observed pass count is compared.
proof idea
Pure definition: the natural number seven is assigned directly. No lemmas, tactics, or computation are involved.
why it matters
Feeds the equality smokePassesAfterRefactor = smokeTestsAfterRefactor (proved by rfl) and appears in the conjunctive one-statement theorem that packages runner presence, refactored-script count three, mapping count two, full smoke pass, and inhabitation of the master certificate structure. That certificate is the module's closure artifact: structural theorem status, zero sorry, zero new RS axioms. The constant is bookkeeping for the refactor safety invariant, not a physics claim; it sits in the verification layer that guards GWTC-3 ringdown family scripts before any likelihood work.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.