Mathematics Operations Research From Rs Or Method Count

The count of five

Operations research is the discipline of making better decisions under constraints, and its textbooks usually organize the field around a handful of core methods. The Recognition Science framework's library, a machine-checked collection of formal theorems, contains a declaration named orMethodCount that pins that handful to exactly five: linear programming, dynamic programming, game theory, queuing theory, and simulation. The theorem states that the cardinality of the set of these five methods is 5, and the proof is a single computational step, by decide, which means the Lean kernel checked the finite enumeration directly. This is a THEOREM in the framework's taxonomy: it is proved in the machine-checked library with zero axioms beyond the ambient type theory's standard three.

The declaration does not claim that these five are the only possible methods, nor that they are the best, nor that they exhaust some mathematical classification. It merely records a definitional choice: the framework's inductive type ORMethod has exactly these five constructors, and the count follows from that choice. The theorem is true by construction, not by discovery. It is a MODEL dressed as a THEOREM: the underlying inductive type is a definition, and the count is a consequence of that definition. The framework's own docstring says these five are the canonical methods, which is a choice, not a proof about the world.

What the declaration does establish, beyond the count, is a bridge to the framework's central object, the cost function. The same file contains a theorem that the cost function J evaluated at 1 equals 0, which the framework glosses as the optimal solution: minimum recognition cost. The certificate structure bundles the count and the optimality claim into one package. So the page's real content is not the number 5, which any textbook could supply, but the fact that the framework's formal library has a clean, machine-checked statement of both the count and the optimality condition, and that the count is a definitional artifact rather than an empirical finding.

theorem orMethodCount : Fintype.card ORMethod = 5 := by decide

/-- Optimal solution: J = 0. -/
theorem optimal_solution : Jcost 1 = 0 := Jcost_unit0

What this page does not claim

The five methods are not claimed to be the only possible operations research methods. The count is not claimed to be an empirical discovery about the field; it is a definitional consequence. The theorem does not claim that Jcost 1 = 0 is the unique optimum for all decision spaces.

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