experimentalStatus
plain-language theorem explainer
The experimentalStatus definition enumerates three candidate falsifiers for the Shannon entropy derivation from J-cost, each paired with a resolution status. Information theorists and physicists working on RS foundations would cite it to confirm alignment with established results. The definition assembles the list through direct record construction with no lemmas or reductions applied.
Claim. The list of verified information theory predictions consists of the pairs (``Compression below entropy'', ``Proven impossible by Shannon''), (``Superluminal communication'', ``Never observed''), and (``Entropy mismatch'', ``Thermodynamic and info entropy agree''), where each pair records a potential falsifier type together with its status.
background
The module INFO-001 derives Shannon entropy from the J-cost structure, where J(x) = ½(x + 1/x) - 1 quantifies recognition effort over probability distributions and yields H = -Σ p_i log(p_i) via total cost minimization. ShannonFalsifier is the structure recording a potential falsification scenario as a string paired with its status string; its documentation states that the derivation would be falsified by compression below entropy, communication above capacity, or mismatch between thermodynamic and information entropy. Upstream results include the definition of entropy as total defect in InitialCondition, which establishes the minimum entropy state at zero defect, together with thermodynamic entropy expressions S = kβ⟨E⟩ + k ln Z from BoltzmannDistribution and PartitionFunction that confirm agreement between the two entropy measures.
proof idea
The definition constructs the list by enumerating three explicit records, each instantiated as a pair of strings for falsifier type and status.
why it matters
This definition supports the module target of deriving Shannon entropy from J-cost and affirms that all listed predictions have been verified. It connects directly to upstream entropy definitions from InitialCondition and the thermodynamic modules, reinforcing consistency with the Recognition Science forcing chain and the RCL. No downstream theorems depend on it, and it touches no open scaffolding questions.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.