Foundation Pair Kernel Delta Spatial Bridge S5 J Minimal Generated Global Green

The spatial bridge

In the Recognition Science framework, a ledger is a discrete record of events, and a recognition is a single event that changes the ledger's state. The framework's central result, the minimum-J theorem, proves that the cheapest possible recognition step, the one that minimizes the forced cost function J, changes exactly one account's parity. The declaration jMinimalGenerated_globalGreen_consumer is a theorem in the framework's machine-checked library of formal theorems. It establishes that these minimum-cost steps, when interpreted as moves on a three-dimensional torus grid, generate the standard isotropic spatial operator: the discrete Laplacian. The theorem proves this for any choice of axis labeling, and it proves that the Laplacian, when applied to a scaled dipole Green response, exactly reproduces the scaled dipole source.

The theorem's content is best understood in three parts. First, it proves that the minimum-J posting steps are bounded: each step moves to a neighboring grid site at most one unit away. Second, it proves that the framed torus Laplacian, which is the sum of second differences along the three paired axes, is frame-independent. This means the operator is exactly the same whether you label the three axes x, y, z or any permutation of them. Third, it proves the Green response property: the Laplacian applied to the scaled dipole Green response equals the scaled dipole source. This is the defining property of a Green's function, and it is the property that makes the operator useful for solving field equations on the grid.

In Recognition Science, the theorem acts as a bridge. The minimum-J ledger theorem selects exactly one account coordinate per posting, and dimension forcing supplies exactly three spatial generator axes. The bridge connects these two results: a minimum-J posting has a unique account-axis incidence, and an arbitrary axis frame transports that incidence to one periodic three-dimensional translation generator. The theorem proves that opposite translations are inverse and distinct-axis translations commute, and that the sum over all three paired axes is independent of the chosen frame. The bridge is target-blind: its definitions mention neither finite range, Green behavior, nor any coupling obligation. The theorem is a pure structural result about the ledger and the grid.

The theorem does not claim that the canonical Gray clock, a fixed cycle through eight of the twelve edges of the three-dimensional cube, generates the spatial operator. In fact, a separate theorem proves that a valid minimum-J posting can traverse a cube edge absent from that fixed cycle. The operator comes from the complete family of one-coordinate postings, with axis labels quotiented by frame invariance. The theorem also does not claim that the global production support model, which accepts every pair of sites, is the canonical one. Two distinct support models are proved to disagree, and only the canonical one selects the minimum-J steps. The theorem's scope is the operator on the torus, not the physical interpretation of the ledger as space.

What the theorem changes is the status of the spatial operator within the framework. It is not an assumption or a choice; it is a consequence of the minimum-J posting rule together with the three-axis structure. The operator is forced, and it is the standard one. This is a concrete, checkable result: the same operator that appears in conventional lattice physics emerges from the ledger's own dynamics. The theorem gives the framework a firm foothold in three dimensions, and it does so without any new axioms or unproved assumptions.

/-- The same consumer stated on the support relation generated directly by
the complete family of minimum-J posting possibilities. This transports the
ledger theorem through the frame quotient to the canonical local operator,
while leaving actual production support selection as the explicit
`ProductionSelectsMinimumJSupport3` premise above. -/
theorem jMinimalGenerated_globalGreen_consumer
    {N : ℕ} [NeZero N]
    (σ : Equiv.Perm (Fin 3))
    (sourceScale : ℂ) (a b p : TorusSite3 N) :
    BoundedRecognitionRelationOn
        (@JMinimalGeneratedStep N σ) (@framedStepDistance N σ) 1 ∧
      framedTorusLaplacian σ
          (scaledDipoleGreenResponse sourceScale a b) p =
        scaledTorusDipole sourceScale a b p := by
  refine ⟨?_, (framedRecognitionGenerator_globalGreen_consumer
    σ sourceScale a b p).2⟩
  intro x y hxy
  exact framedAxisStep_bounded σ x y
    ((jMinimalGeneratedStep_iff_framedAxisStep σ x y).mp hxy)

/-- **S5 operator bridge.** Every account-axis frame gives exactly the same
operator, namely the canonical periodic D=3 six-neighbor Laplacian. Thus no
preferred account-to-axis MODEL identification survives in the operator. -/
theorem framedTorusLaplacian_eq_torusLaplacian {N : ℕ}
    (σ : Equiv.Perm (Fin 3))
    (ψ : TorusSite3 N → ℂ) (p : TorusSite3 N) :
    framedTorusLaplacian σ ψ p = torusLaplacian ψ p := by
  unfold framedTorusLaplacian torusLaplacian framedForward framedBackward
  exact Equiv.sum_comp σ
    (fun i : Fin 3 =>
      (2 : ℂ) * ψ p -
        ψ (torusShift p i 1) -
        ψ (torusShift p i (-1)))

/-- The same consumer stated on the support relation generated directly by
the complete family of minimum-J posting possibilities. This transports the
ledger theorem through the frame quotient to the canonical local operator,
while leaving actual production support selection as the explicit
`ProductionSelectsMinimumJSupport3` premise above. -/
theorem jMinimalGenerated_globalGreen_consumer
    {N : ℕ} [NeZero N]
    (σ : Equiv.Perm (Fin 3))
    (sourceScale : ℂ) (a b p : TorusSite3 N) :
    BoundedRecognitionRelationOn
        (@JMinimalGeneratedStep N σ) (@framedStepDistance N σ) 1 ∧
      framedTorusLaplacian σ
          (scaledDipoleGreenResponse sourceScale a b) p =
        scaledTorusDipole sourceScale a b p := by
  refine ⟨?_, (framedRecognitionGenerator_globalGreen_consumer
    σ sourceScale a b p).2⟩
  intro x y hxy
  exact framedAxisStep_bounded σ x y
    ((jMinimalGeneratedStep_iff_framedAxisStep σ x y).mp hxy)

/-- A concrete minimum-J posting exists on an edge omitted by the fixed Gray
clock. This is the ledger-level separator, not merely a graph observation. -/
theorem jMinimalPosting_can_escape_grayClock :
    ∃ A B : LedgerPostingAdjacency.LedgerState 3,
      JMinimalPostingStep A B ∧
        parity 3 A = zeroPattern3 ∧
        parity 3 B = axisOnePattern3 ∧
        ¬ GrayClockEdge (parity 3 A) (parity 3 B) := by
  let A : LedgerPostingAdjacency.LedgerState 3 :=
    { debit := fun _ => 0
      credit := fun _ => 0 }
  let k : Fin 3 := 1
  let B : LedgerPostingAdjacency.LedgerState 3 := post A k Side.debit
  have hpost : PostingStep A B := ⟨k, Side.debit, rfl⟩
  have hneq : A ≠ B := by
    intro h
    have hk := congrArg
      (fun S : LedgerPostingAdjacency.LedgerState 3 => S.debit k) h
    simp [A, B, post] at hk
  have hmin : JMinimalPostingStep A B :=
    postingStep_is_jMinimal hpost hneq
  have hA : parity 3 A = zeroPattern3 := by
    funext i
    simp [A, zeroPattern3, parity, parityPattern, phiVec, Recognition.phi]
  have hB : parity 3 B = axisOnePattern3 := by
    funext i
    by_cases hi : i = k
    · subst i
      simp [A, B, k, post, axisOnePattern3, parity, parityPattern,
        phiVec, Recognition.phi]
    · simp [A, B, k, post, axisOnePattern3, parity, parityPattern,
        phiVec, Recognition.phi, hi]
  refine ⟨A, B, hmin, hA, hB, ?_⟩
  rw [hA, hB]
  exact zero_axisOne_not_grayClockEdge

What this page does not claim

The theorem does not claim that the physical recognition-to-linking bridge is established; that bridge remains open. The theorem does not claim that the Gray clock cycle generates the full spatial operator; it proves the opposite. The theorem does not claim that the global production support model is the canonical one; two models are proved to disagree.

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