Encyclopedia Mathematics Mathematics Elementary Regular Number Systems Number System Cert
ARTICLE 3 claims 3 theorems
Mathematics Elementary Regular Number Systems Number System Cert
A machine-checked certificate records that there are exactly five canonical number systems, no more and no fewer.
The five-system certificate
Mathematics recognizes a ladder of number systems: the natural numbers for counting, the integers for differences, the rationals for ratios, the reals for continuous measurement, and the complex numbers for solving every polynomial equation. Each step adds one kind of closure. The integers let you subtract, the rationals let you divide, the reals fill the gaps, and the complex numbers provide roots for all polynomials. This ladder is a standard and well-known structure, taught in every mathematics curriculum.
In Recognition Science, the machine-checked library of formal theorems records this ladder as a certificate. The declaration NumberSystemCert is a formal object that carries exactly one fact: the count of these canonical systems is five. It does not prove why there are five, nor does it derive them from deeper principles. It simply records, in a form the machine can verify, that the list has five members and the count is five.
The certificate is built from a theorem that the count is five, and that theorem is checked by direct computation. The whole development is free of unproved assumptions and free of axioms beyond the standard logical ones. This means the certificate is not a conjecture or a hope; it is a verified statement about the formal definition of the number systems. The five systems are named explicitly, so there is no ambiguity about what is being counted.
What the certificate does not claim is just as important. It does not claim that these are the only possible number systems, nor that the ladder is complete in any philosophical sense. It does not claim that the count five is forced by the nature of mathematics. It only claims that, within this particular formal library, the defined list of canonical systems has exactly five entries. A different formalization might choose a different list, and the certificate would not apply to it.
THEOREM NumberSystemCert · numberSystem_count · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.lean
structure NumberSystemCert where
five_systems : Fintype.card NumberSystem = 5
theorem numberSystem_count : Fintype.card NumberSystem = 5 := by decide
THEOREM numberSystem_count · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.lean
theorem numberSystem_count : Fintype.card NumberSystem = 5 := by decide
THEOREM numberSystemCert · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.lean
def numberSystemCert : NumberSystemCert where
five_systems := numberSystem_count
What this page does not claim
The certificate does not prove that there are exactly five number systems in all of mathematics. The certificate does not derive the five systems from the Recognition Science forcing chain. The certificate does not claim that the five systems are the only possible ones.
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/ElementaryRegularNumberSystems.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:
- What deeper principle, if any, forces the number of canonical number systems to be exactly five?
- How does the formal definition of each number system in this library compare with the standard set-theoretic constructions?
- Could a different choice of canonical number systems lead to a different certificate count?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM NumberSystemCert · numberSystem_count · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.lean
structure NumberSystemCert where five_systems : Fintype.card NumberSystem = 5theorem numberSystem_count : Fintype.card NumberSystem = 5 := by decideThe declaration NumberSystemCert is a formal object that carries exactly one fact: the count of these canonical systems is five. NumberSystemCert · numberSystem_count · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.leanTHEOREM numberSystem_count · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.lean
theorem numberSystem_count : Fintype.card NumberSystem = 5 := by decideThe certificate is built from a theorem that the count is five, and that theorem is checked by direct computation. numberSystem_count · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.leanTHEOREM numberSystemCert · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.lean
def numberSystemCert : NumberSystemCert where five_systems := numberSystem_countThe whole development is free of unproved assumptions and free of axioms beyond the standard logical ones. numberSystemCert · IndisputableMonolith/Mathematics/ElementaryRegularNumberSystems.lean