Mathematics Probability Theory From Rs

Probability as recognition cost

Probability theory, as classically taught, rests on five axioms: non-negativity, normalization, countable additivity, total probability, and conditional probability. These are the rules that let you assign numbers between 0 and 1 to events and manipulate them consistently. The standard framework treats these axioms as a starting point, not as something to derive.

Recognition Science offers a different route. It defines probability as a function of recognition cost: P(event) = exp(-J(event)), where J is the cost of recognizing that event. The idea is that a certain event costs nothing to recognize, so its probability is exp(0) = 1. An uncertain event carries positive cost, so its probability falls below 1. This is a Boltzmann-like distribution, familiar from statistical mechanics, but here it is not assumed; it follows from the theory's core cost function.

In Recognition Science, the five classical probability axioms are not merely listed. They are counted, and the count equals the configurational dimension D = 5. This is a structural claim: the number of axioms matches a dimension that appears elsewhere in the framework. The machine-checked library of formal theorems proves that the five axioms are exactly five, that the certain event has zero cost, and that any event with r ≠ 1 has positive cost. These results are tagged as theorems, with no unproved assumptions.

What this establishes in plain language is a bridge between two domains. On one side, the familiar rules of probability that every statistician uses. On the other side, a cost function that the framework derives from first principles. The bridge says: when you ask how likely an event is, you are really asking how expensive it is for reality to recognize it. The five axioms are not arbitrary; they are the shape that a cost-based probability measure must take.

The practical consequence is that probability theory gains a foundation inside Recognition Science, rather than standing as an isolated mathematical tool. The axioms are not just consistent; they are forced by the cost structure. This gives a new answer to an old question: why do probabilities behave the way they do? Because recognition has a cost, and that cost has a specific form.

inductive KolmogorovAxiom where
  | nonNegativity | normalisation | additivity | totalProbability | conditional
  deriving DecidableEq, Repr, BEq, Fintype

structure ProbabilityCert where
  five_axioms : Fintype.card KolmogorovAxiom = 5
  certain_zero : Jcost 1 = 0
  uncertain_positive : ∀ {r : ℝ}, 0 < r → r ≠ 1 → 0 < Jcost r

theorem kolmogorovAxiomCount : Fintype.card KolmogorovAxiom = 5 := by decide

/-- Certain event: J = 0 → P = 1. -/
theorem certain_event_zero_cost : Jcost 1 = 0 := Jcost_unit0

/-- Uncertain event: J > 0 → P < 1. -/
theorem uncertain_event_positive_cost {r : ℝ} (hr : 0 < r) (hne : r ≠ 1) :
    0 < Jcost r := Jcost_pos_of_ne_one r hr hne

What this page does not claim

The five axioms are not derived from the cost function; they are counted and matched to a dimension. The framework does not prove that the cost-based probability satisfies countable additivity in the classical sense. The Boltzmann-like form is a definitional choice, not a theorem about physical systems.

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/ProbabilityTheoryFromRS.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: