Mathematics Information Theory From Rs Information Theory Cert

The certification

In Recognition Science, the framework that derives physical structure from a forced cost of recognition, the declaration InformationTheoryCert is a compact, machine-checked certificate. It records three facts about the framework's central cost function J, the function that measures the price of a recognition event. First, the number of axioms in Shannon's classical characterization of entropy is exactly five. Second, the cost of a certain outcome, the event with probability 1, is zero. Third, the cost of any uncertain outcome, any probability strictly between 0 and 1, is strictly positive. These three statements are the entire content of the certificate.

The certificate is a theorem in the framework's machine-checked library of formal theorems, meaning every step of its proof has been verified by a computer. It is built from two smaller theorems: one that counts the five Shannon axioms and one that proves the cost function is zero at certainty and positive at uncertainty. The certificate itself is a structure, a bundle that packages these three proofs together under a single name. It is not a new discovery about information theory; it is a formal record that the framework's own cost function satisfies the basic, non-negotiable requirements of an entropy.

In Recognition Science, the framework models Shannon entropy H = −Σ pᵢ log pᵢ as the average J-cost of a probability distribution. The certificate does not prove that this identification is correct; it proves that the cost function has the right shape to serve as an entropy. It establishes that the framework's notion of cost is consistent with the classical axioms that define what entropy is, at least in the minimal sense of having the correct number of axioms and the correct behavior at the extremes of certainty and uncertainty.

What the certificate does not claim is just as precise. It does not claim that the framework's cost function is identical to Shannon entropy in all respects, nor does it claim that the identification with entropy is a derived theorem of the framework. The certificate is a consistency check, not a derivation. It also does not claim anything about the Shannon capacity theorem, the famous formula C = B × log₂(1 + S/N) for the maximum rate of error-free communication over a noisy channel. That theorem is mentioned in the surrounding documentation as a separate, unformalized observation, not as part of the certificate's content.

The practical consequence is that a reader can trust the certificate's three claims absolutely, because they are machine-checked, while knowing exactly where the framework's engagement with information theory stops. The certificate is a small but solid foundation stone: it says that whatever else the framework does, its central cost function is at least a legitimate candidate for the role of entropy, in the classical sense of the term.

theorem shannonAxiomCount : Fintype.card ShannonAxiom = 5 := by decide

/-- Minimum entropy: J = 0 (certain outcome). -/
theorem min_entropy : Jcost 1 = 0 := Jcost_unit0

/-- Positive entropy: J > 0 (uncertain outcome). -/
theorem pos_entropy {r : ℝ} (hr : 0 < r) (hne : r ≠ 1) :
    0 < Jcost r := Jcost_pos_of_ne_one r hr hne

def informationTheoryCert : InformationTheoryCert where
  five_axioms := shannonAxiomCount
  min_H := min_entropy
  pos_H := pos_entropy

What this page does not claim

The certificate does not prove that the framework's cost function is identical to Shannon entropy in all respects. The certificate does not claim that the identification of cost with entropy is a derived theorem of the framework. The certificate does not claim anything about the Shannon capacity theorem.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Mathematics/InformationTheoryFromRS.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: