Foundation Primitive Recognition Calculus Hard Problem Certificate Audits Navier

A finite audit, not a solution

The Navier-Stokes equations describe how fluids flow, from smoke curling in air to water moving through a pipe. One of the deepest open questions in mathematics asks whether these equations can develop a singularity, a point where the flow becomes infinitely violent, or whether a smooth solution always exists. The declaration navierStokesEnergy_finiteReduction does not answer that question. It proves something narrower and more structural: the question can be recast as a finite audit of certificates, a discrete record of evidence that can be checked step by step.

In the Recognition Science framework, hard problems are studied through ledgers, discrete records of events. The declaration proves that the Navier-Stokes energy problem has a finite reduction: its possible outcomes can be encoded as a finite set of certificate types, each a concrete piece of evidence. The certificates are named finiteCellDecomposition, energyTransferLedger, and blowupObstructionWitness. The first records a finite division of space into cells, the second tracks how energy moves between those cells, and the third would be a witness that a blowup, a singularity, is impossible. The proof shows that a complete audit of these certificates is equivalent to the original problem's structure.

This is a theorem about the shape of the problem, not a solution to it. The declaration does not prove that smooth solutions always exist, nor that a blowup occurs. It does not compute any fluid flow or bound any energy. It establishes that the problem can be organized as a finite bookkeeping task, which is a step toward making the problem tractable for machine-checked reasoning. The same pattern appears for other hard problems in the framework's library, including the prime critical line and the Yang-Mills gap.

What the declaration changes is the kind of question being asked. Instead of a direct attack on the Navier-Stokes equations, the framework asks whether the problem's possible answers can be listed in advance. The proof says yes, they can. That is a real result, but it leaves the original question untouched. The finite audit is a scaffold, not a solution.

theorem navierStokesEnergy_finiteReduction : HasFiniteReduction navierStokesEnergyAudit :=
  problemAudit_finiteReduction navierStokesEnergyAudit

/-- Finite certificate inventory for the Navier-Stokes energy-transfer audit. -/
inductive NavierStokesEnergyCert where
  | finiteCellDecomposition
  | energyTransferLedger
  | blowupObstructionWitness
  deriving DecidableEq, Repr

What this page does not claim

The Navier-Stokes equations are solved or a singularity is ruled out. Any specific fluid flow is computed or any energy bound is derived. The finite reduction is a proof that the original problem is decidable.

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/Foundation/PrimitiveRecognitionCalculus/HardProblemCertificateAudits.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: