Foundation Pair Kernel Exact Jnonlinear Gauss S13 Exact Jhessian Pairing Eq Two

A nonlinear ledger's second derivative

In Recognition Science, a ledger is a discrete record of events, and its cost is a forced measure of how much recognition those events require. The declaration in question concerns the second derivative of that cost, the mathematical object that describes how the cost curves as the ledger's state changes. It proves that this second derivative, when paired with a perturbation, equals twice the sum of that perturbation multiplied by a linearized version of the ledger's governing equation.

The linearized equation, called the tangent Laplacian, is built from a graph whose edge weights are the hyperbolic cosine of the differences between background field values. This makes the tangent graph symmetric and nonnegative, and the theorem exactJHessianPairing shows that the second derivative of the cost is exactly twice the inner product of the perturbation with this tangent Laplacian. This is a precise, machine-checked statement in the framework's library of formal theorems.

The result matters because it connects two different ways of studying the ledger. The first variation, which is the derivative of the cost, gives the nonlinear Gauss equation that governs the ledger's static states. The second variation, which is the Hessian, tells you how the cost responds to small changes around a background. The declaration proves that these two perspectives are linked by a factor of two, a relationship that is not an approximation but an exact identity.

This identity is what allows the framework to study stability and response. Because the Hessian is nonnegative, the cost is convex in the relevant directions, and the tangent Laplacian provides a linear system whose Green function gives the response to a small source. At zero background, the tangent graph reduces to the original graph, recovering the standard linear response. The declaration is a theorem, proved in the library with no unproven assumptions.

What the declaration does not claim is that this linearized picture is the whole story. The full cost is nonlinear, and the tangent Laplacian is only a local approximation around a chosen background. The declaration also does not assert that a constant-curvature background can be realized by a global state; that remains a separate predicate. It does not make any claim about event action, electromagnetic interpretation, SI conversion, or length, all of which are explicitly not asserted in the module.

/-- Bilinear Hessian pairing of the exact action. -/
def exactJHessianPairing
    {n : ℕ}
    (G : WeightedLedgerGraph n)
    (background left right : Fin n → ℝ) : ℝ :=
  ∑ i, ∑ j,
    G.weight i j *
      Real.cosh (background i - background j) *
      (left i - left j) *
      (right i - right j)

theorem exactJHessianAction_nonneg
    {n : ℕ}
    (G : WeightedLedgerGraph n)
    (background perturbation : Fin n → ℝ) :
    0 ≤ exactJHessianAction G background perturbation := by
  unfold exactJHessianAction action
  apply mul_nonneg
  · norm_num
  · apply Finset.sum_nonneg
    intro i _
    apply Finset.sum_nonneg
    intro j _
    exact mul_nonneg
      ((exactJTangentGraph G background).weight_nonneg i j)
      (sq_nonneg _)

theorem exactJTangentGraph_zero_weight
    {n : ℕ}
    (G : WeightedLedgerGraph n)
    (i j : Fin n) :
    (exactJTangentGraph G (fun _ => 0)).weight i j =
      G.weight i j := by
  simp [exactJTangentGraph]

What this page does not claim

The declaration does not prove that a constant-curvature background can be realized by a global state. It does not assert any electromagnetic interpretation, SI conversion, or length for the framework's constants. It does not claim that the linearized tangent Laplacian captures the full nonlinear dynamics of the ledger.

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