Foundation Pair Kernel Local Generator Global Green J Minimal Operational Genera

The local source and its global echo

In the Recognition Science framework, a finite periodic space is modeled as a torus of N³ sites, and a source is a pattern of values placed on those sites. A dipole source is the simplest such pattern: a positive value at one site and an equal negative value at another, so the total source sums to zero. The theorem jMinimalOperationalGenerator_and_canonicalGreen_consumer concerns what happens when a local generator, a rule that assigns weights only between nearby sites, acts on such a dipole.

The classical fact here is that a local rule can have a global effect. The theorem states two things together. First, the generator's weights are finite-range: each site interacts only with sites within a fixed distance, here distance 1 in the encoded metric. Second, the response to the dipole, defined through a normalized spectral inverse that sums over every nonzero Fourier mode, satisfies the source equation at every site. The response is global in the sense that no finite-range predicate is placed on it; it is a sum over all modes, not a local operation.

The theorem is proved in the machine-checked library of formal theorems, with no unproved assumptions and no new axioms. It is a compiling consumer of an earlier interface, meaning it is the first place where the local generator and the global response are brought together and shown to satisfy the equation. The source scale is an explicit input, and the theorem shows that scaling the dipole does not change its neutrality, the fact that its total source is zero.

What the theorem does not claim is as important as what it proves. It does not identify the arbitrary weighted graph G with the canonical local operator. That identification, the bridge between the abstract graph and the specific lattice generator, remains open. The Green equation is proved for the canonical torus Laplacian, not for the arbitrary graph. The theorem deliberately exposes this seam, so a reader can see exactly where the framework's physical claim about three-dimensional space depends on a step that is not yet formalized.

In Recognition Science, this is a step toward showing that the local structure of a ledger, a discrete record of events with weights between nearby sites, can produce global responses. The framework models the cost of recognition as a forced function, and from that cost derives a chain of results including the golden ratio and three spatial dimensions. This theorem is a supporting result in that chain: it shows that a local generator consistent with the minimal cost structure can solve a global source equation. The payoff is that the local-global separation is now inspectable: a reader can see the local weights, the global response, and the equation that connects them, all in one formal statement.

/-- **S4 downstream consumer with an honest seam.** A generator supported on
realizable minimum-J translated-cell dependencies is local. Independently,
the canonical torus Laplacian has a global normalized spectral response.

The Green equation below is for the canonical torus Laplacian, not for the
arbitrary graph `G`. This theorem deliberately exposes the remaining seam:
identifying `G` with that canonical local operator is still OPEN. -/
theorem jMinimalOperationalGenerator_and_canonicalGreen_consumer
    {N : ℕ} [NeZero N]
    (hN : 2 ≤ N)
    (G : SimplicialLedger.ContinuumBridge.WeightedLedgerGraph (N * N * N))
    (hSupport :
      ∀ i j, G.weight i j ≠ 0 →
        TiledJMinimalDependency3 hN i j)
    (sourceScale : ℂ) (a b p : TorusSite3 N) :
    FiniteRangeOn G (encodedDist3 N) 1 ∧
      torusLaplacian
          (scaledDipoleGreenResponse sourceScale a b) p =
        scaledTorusDipole sourceScale a b p := by
  refine ⟨tiledJMinimalGenerator_finiteRangeOn hN G hSupport, ?_⟩
  unfold scaledDipoleGreenResponse
  apply
    torusLaplacian_torusSpectralResponseNormalized_eq_source_of_reconstructed
  exact
    torusSourceReconstructedByNonzeroModesNormalized_of_neutral _
      (scaledTorusDipole_neutral sourceScale a b)

/-- **S4 downstream consumer with an honest seam.** A generator supported on
realizable minimum-J translated-cell dependencies is local. Independently,
the canonical torus Laplacian has a global normalized spectral response.

The Green equation below is for the canonical torus Laplacian, not for the
arbitrary graph `G`. This theorem deliberately exposes the remaining seam:
identifying `G` with that canonical local operator is still OPEN. -/
theorem jMinimalOperationalGenerator_and_canonicalGreen_consumer
    {N : ℕ} [NeZero N]
    (hN : 2 ≤ N)
    (G : SimplicialLedger.ContinuumBridge.WeightedLedgerGraph (N * N * N))
    (hSupport :
      ∀ i j, G.weight i j ≠ 0 →
        TiledJMinimalDependency3 hN i j)
    (sourceScale : ℂ) (a b p : TorusSite3 N) :
    FiniteRangeOn G (encodedDist3 N) 1 ∧
      torusLaplacian
          (scaledDipoleGreenResponse sourceScale a b) p =
        scaledTorusDipole sourceScale a b p := by
  refine ⟨tiledJMinimalGenerator_finiteRangeOn hN G hSupport, ?_⟩
  unfold scaledDipoleGreenResponse
  apply
    torusLaplacian_torusSpectralResponseNormalized_eq_source_of_reconstructed
  exact
    torusSourceReconstructedByNonzeroModesNormalized_of_neutral _
      (scaledTorusDipole_neutral sourceScale a b)

/-- The explicit source scale does not change dipole neutrality. -/
theorem scaledTorusDipole_neutral {N : ℕ} [NeZero N]
    (sourceScale : ℂ) (a b : TorusSite3 N) :
    torusSourceNeutral (scaledTorusDipole sourceScale a b) := by
  classical
  unfold torusSourceNeutral torusTotalSource scaledTorusDipole
  rw [← Finset.mul_sum]
  simp

What this page does not claim

The theorem does not prove that the arbitrary graph G equals the canonical local operator. The theorem does not establish any finite-range property for the global response field. The theorem does not derive the fine-structure constant or any other physical constant.

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