pith. machine review for the scientific record. sign in
theorem proved term proof high

every_priority_has_protocol

show as:
view Lean formalization →

Every combination identifier from the Option A registry satisfies the protocol-falsifiability condition by construction, possessing matching dataset class, predicted observable, and failure mode entries. Researchers validating cross-domain theorems C1-C9 would cite this result to confirm that all queued empirical tests are formally covered. The proof is a direct one-line application of the universal protocol theorem.

claimFor every combination identifier $c$ in the Option A registry, there exist a dataset class, predicted observable, and failure mode such that the registry entries for $c$ match them exactly.

background

The module establishes a priority queue for empirical tests attached to the C1-C9 cross-domain theorems. It records test ordering and proves formal coverage by the empirical protocol without supplying data. ProtocolFalsifiable holds for a combination when it possesses a dataset class, predicted observable, and failure mode with exact registry agreement. The upstream theorem protocolFalsifiable_all states that this property holds for every combination identifier by direct construction using the three registry fields.

proof idea

The proof is a one-line wrapper that applies the universal protocol falsifiability theorem to the supplied combination identifier.

why it matters in Recognition Science

This result feeds the empirical queue certification definition, which assembles immediate and high priorities such as C3, C8, and C5. It closes coverage in the foundation layer, ensuring every queued item carries a falsification protocol. The declaration aligns with the Recognition Science emphasis on formal empirical interfaces before data collection.

scope and limits

formal statement (Lean)

  68theorem every_priority_has_protocol (c : CombinationID) :
  69    ProtocolFalsifiable c :=

proof body

Term-mode proof.

  70  protocolFalsifiable_all c
  71
  72/-- The two immediate tests are C3 and C8. -/

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (6)

Lean names referenced from this declaration's body.