c8_protocol_covered
plain-language theorem explainer
The Miller-Span combination satisfies the protocol-falsifiability predicate, requiring an assigned dataset class, predicted observable, and failure mode. Researchers building empirical test queues for the C1-C9 theorems cite this to confirm formal coverage of the c8 item. The proof is a direct one-line application of the general theorem that every combination meets the predicate by construction from its field mappings.
Claim. The Miller-Span combination satisfies protocol-falsifiability: there exist a dataset class $d$, predicted observable $o$, and failure mode $f$ such that the combination maps exactly to these three fields.
background
The module defines a priority queue for empirical tests attached to the C1-C9 cross-domain theorems. It records test order and proves that every queued protocol is already covered by the formal empirical protocol definition, with zero axioms or sorrys in the file. ProtocolFalsifiable for a combination $c$ is the proposition that there exist dataset class $d$, predicted observable $o$, and failure mode $f$ satisfying datasetClass $c = d$, predictedObservable $c = o$, and failureMode $c = f$. The upstream theorem protocolFalsifiable_all establishes that this predicate holds for every combination by taking the three fields directly from the combination record.
proof idea
One-line wrapper that applies the general theorem protocolFalsifiable_all to the Miller-Span combination.
why it matters
This declaration confirms that the Miller-Span item is formally covered in the empirical queue. It supports the module's goal of proving every queued protocol satisfies the falsifiability condition before any testing occurs. The result fills a coverage slot in the foundational layer that prepares empirical checks for the Recognition Science cross-domain theorems.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.