Mathematics Partial Differential Equations From Rs Pde Type Count

The count of five

Partial differential equations, or PDEs, are equations that describe how a quantity changes in space and time through its rates of change. They are the language of physics: the flow of heat, the vibration of a string, the pull of gravity. Mathematicians group them into families by their behavior. The elliptic family includes the Laplace equation, which describes steady states. The parabolic family includes the heat equation, which describes diffusion. The hyperbolic family includes the wave equation, which describes propagation. Two further families, mixed and integro-differential, round out the standard classification.

The theorem pdeTypeCount establishes that this classification contains exactly five types. It is a formal statement in a machine-checked library of formal theorems, proved by a direct enumeration: the five families are listed, and the count is verified. The proof is a computation, not a philosophical argument. It says nothing about which equations exist in the world, only that the standard classification, as encoded, has five members.

The Recognition Science framework takes this count as a structural fact. In its account, physical laws are PDEs on a recognition field, a discrete record of events. The Laplace equation appears as a cost potential at equilibrium; the heat equation as cost diffusion; the wave equation as cost propagation. The framework's library shows that the five-type count matches a dimension constant in its own system, configDim D = 5. This is a consistency observation, not a derivation of the classification from first principles.

What the declaration does not claim is broader. It does not prove that these five families are the only possible PDEs, nor that the classification is complete in any mathematical sense. It does not derive the classification from the Recognition Science framework; it encodes the standard classification and counts it. The match with configDim D = 5 is a stated coincidence within the framework, not a theorem about PDEs themselves. The declaration is a small, exact fact: five types, counted, verified.

theorem pdeTypeCount : Fintype.card PDEType = 5 := by decide

inductive PDEType where
  | elliptic | parabolic | hyperbolic | mixed | integroDifferential
  deriving DecidableEq, Repr, BEq, Fintype

theorem pdeTypeCount : Fintype.card PDEType = 5 := by decide

What this page does not claim

The declaration does not prove the five-type classification is complete or exhaustive in mathematics. It does not derive the PDE families from the Recognition Science framework; it counts an encoded list. The match with configDim D = 5 is a stated consistency, not a theorem about PDEs.

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