Mathematics Numerical Analysis From Rs Numerical Method Count

A count of five methods

Numerical analysis is the branch of mathematics that turns continuous problems into step-by-step arithmetic. Its standard toolkit includes Newton's method for solving equations, Euler integration and Runge-Kutta for differential equations, Gaussian elimination for linear systems, and the Fast Fourier Transform for frequency analysis. These five are the classics taught in every introductory course.

The Recognition Science framework, a system that derives structure from a forced cost of recognition, contains a machine-checked library of formal theorems. Within that library, a declaration named numericalMethodCount proves that the set of these five canonical methods has exactly five elements. The proof is a direct computation: the library defines an inductive type with five constructors, one for each method, and then verifies by evaluation that the count is five. This is a theorem in the sense that the library's kernel checked it with no unproved assumptions.

The same library connects this count to the number eight. It defines a discrete Fourier transform with 2^3 modes, which equals 8, and notes that the Fast Fourier Transform performs 8 times 3, or 24, operations per tick. The numbers 8 and 24 echo the framework's derived constants: the recognition cycle has eight ticks, and 24 is 3 times 8. These identities are also machine-checked.

What the declaration does not do is more interesting than what it proves. It does not claim that these five methods are the only numerical methods that exist, nor that they are the best. It does not derive the count from the framework's forcing chain; the count is a definitional choice, not a consequence of the cost function. The declaration simply records a fact about a finite set that the framework's authors chose to call canonical.

The practical upshot is modest but real. A reader who wants to know whether the framework's library can count a small finite set correctly can check this theorem in seconds. The declaration is a sanity check, not a discovery. It shows the library can handle finite arithmetic cleanly, and it ties a familiar list of methods to the framework's preferred numbers, but it leaves the deeper question of why these five methods deserve the label canonical entirely open.

theorem numericalMethodCount : Fintype.card NumericalMethod = 5 := by decide

theorem dft8Modes_8 : dft8Modes = 8 := by decide

theorem fftOps_24 : fftOps = 24 := by decide

What this page does not claim

The count of five is not derived from the framework's cost function or forcing chain. No claim is made that these five methods are the only numerical methods in existence. The declaration does not establish any property of the methods themselves, only the size of the set.

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