likelihood_or_status_row_count
plain-language theorem explainer
Exactly six falsifier-register rows carry likelihood or status artifacts beyond bare dataset attachment. Track-6 auditors and the Fork F handoff cite this count as the coverage figure for upgraded rows. The proof is reflexivity against the register's compiled Nat constant.
Claim. The number of falsifier-register rows that have been upgraded beyond dataset-only attachment by likelihood or status artifacts equals $6$.
background
Track 6 is the falsifier-sensitivity lane of the Quantum Gravity Discovery Master Plan. This module is its Fork F integration endpoint: a conservative structural certificate that packages already-present Lean surfaces rather than adding a new observational channel.
The count at issue is the number of register rows upgraded past dataset-only status by likelihood or status artifacts. It is defined as the Nat exported by the falsifier likelihood register (FalsifierLikelihoodRegister.rowsWithLikelihoodOrStatus). Sibling counts in the same certificate cover theorem-grade discriminator sectors, rival-row coverage, full dataset attachment (ten rows), and the guarded GWTC-3 ringdown runner.
The module doc stresses that the certificate proves a single Lean-facing sensitivity package with named channels and guarded reproducibility surfaces. It does not claim empirical confirmation, and it does not promote still-structural PTA, strong-field, or ringdown physics into a discovery statement.
proof idea
One-line reflexivity. The left-hand side is the definitional Nat rowsWithLikelihoodOrStatusRecords, which unfolds to the likelihood register's compiled constant; that constant evaluates to 6, so rfl closes the equality.
why it matters
Feeds the Fork F handoff theorem track6_falsifier_sensitivity_one_statement, which conjoins six structural equalities into one Track-6 endpoint: three theorem-grade discriminator sectors, four rival rows covered, ten dataset-attached falsifier rows, six rows upgraded to likelihood/status records, three guarded ringdown families, and two supported observable mappings.
In the Recognition verification stack this is bookkeeping, not new physics: it locks the likelihood-upgrade coverage figure so downstream auditors cannot silently drop or inflate upgraded rows. It sits beside the theorem-grade phi-derived discriminator matrix and the guarded GWTC-3 ringdown runner as part of the conservative Track-6 package. No T0–T8 forcing step or mass-ladder claim is at stake; the open question remains empirical confirmation of the still-structural PTA / strong-field / ringdown lanes.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.