totalFalsifierRows
plain-language theorem explainer
Fixes the size of the quantum-gravity master-plan §7 falsifier register at ten rows. Verification and Track-6 sensitivity certificates cite this constant when stating coverage fractions (likelihood-upgraded versus dataset-only). The body is a bare natural-number definition, not a derived count.
Claim. The total number of rows in the §7 falsifier register is $10$.
background
The module is the likelihood/status layer over the quantum-gravity master-plan §7 falsifier register. Session 106 attached named datasets and positive sensitivity scales to every row; Sessions 107–115 then upgraded a subset to likelihood-style or status-style reproducibility artifacts (ΩΛ/Planck, Cassini, GRAVITY S2, EHT M87*, NANOGrav, EPTA, dark-energy $w$, GWTC-3 ringdown/echo/QNM).
Coverage accounting in the module doc splits the register into six rows upgraded beyond dataset-only and four still dataset-only/future (BMV, Hawking temperature, leading-log entropy coefficient, Page curve), with eight individual likelihood/status artifacts in total. This definition simply names the denominator of that split.
Upstream status strings from RS-native units, discrete Lichnerowicz convergence, and alignment protocols appear only as imported module furniture; they do not compute the row count.
proof idea
Definitional constant: the natural number ten is assigned directly. No lemmas, tactics, or arithmetic are involved. Downstream theorems unfold this name and discharge equalities by decide.
why it matters
Supplies the fixed register size used by the one-statement coverage theorem (individualLikelihoodArtifacts = 8, rowsWithLikelihoodOrStatus = 6, datasetOnlyRows = 4, and the partition identity summing to this total) and by the aggregate FalsifierLikelihoodRegisterCert.
Track-6 falsifier sensitivity re-exports the same constant as the count of rows with named dataset attachments and folds it into Track6FalsifierSensitivityCert, the Fork F handoff that demands dataset attachments plus likelihood/status coverage beside theorem-grade discriminators.
Within Recognition Science this is bookkeeping for the verification lane, not a forcing-chain step (T0–T8) or a mass/ladder claim. It records how much of the §7 falsifier surface has reproducible likelihood structure versus remaining open (BMV, Hawking $T$, entropy coefficient, Page curve).
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.