Foundation Pair Kernel Production Action Construction S8 Recognition Production

The unique production graph

A graph is a collection of points with lines between them. In the Recognition Science framework, a ledger, a discrete record of events, assigns a number, called a cost, to each possible transition between states. The framework's central result forces this cost to be a specific function, J(x) = (x + 1/x)/2 - 1. A production graph is a weighted graph whose edge weights represent the cost contributions of elementary posting events, the smallest possible changes in the ledger.

The declaration recognitionProductionGraph3_unique_loopless_action_representation is a theorem in the framework's machine-checked library of formal theorems. It states that, on a finite three-dimensional torus (a grid where opposite edges connect), the graph built from all minimum-cost posting events has a special property: it is the only loopless graph, one with no edge from a point to itself, that has the same exact action. The action is the total cost of a configuration, the sum of the J-cost contributions of all its posting events. The theorem proves that if any other loopless graph has exactly the same action for every possible configuration, then that graph is identical to the one built from the posting events.

This uniqueness result is not a definition or a choice. It is proved from the framework's earlier theorems, which establish that a minimum-J ledger transition is an actual one-account posting and that every elementary posting is double-entry conserved. The theorem also shows that the constructed graph satisfies the production action identity, meaning its action equals the sum of the event costs, and that it has strictly positive weights on all realized postings. Two counterexamples are ruled out: the graph with all zero weights and the graph with all possible edges both fail to have the required property.

The theorem does not claim that the production graph is the only graph with any action, nor that it is the only graph with the same support of posting events. It claims uniqueness only among loopless graphs, and only for the exact action function, not for an approximate or truncated version. It also does not claim that the production graph is physically realized in the world; it is a mathematical object constructed within the framework. The theorem's scope is the finite three-dimensional torus with at least two sites in each direction, and it does not extend to other geometries or to infinite lattices without further proof.

/-- Independent uniqueness consequence: the event-fold graph is the unique
loopless graph carrying its exact action. -/
theorem recognitionProductionGraph3_unique_loopless_action_representation
    {N : ℕ} [NeZero N] (hN : 2 ≤ N)
    (G : WeightedLedgerGraph (TorusCard3 N))
    (hloop : LooplessGraph G)
    (haction :
      ∀ ε : Fin (TorusCard3 N) → ℝ,
        exactJCostAction G ε =
          exactJCostAction (recognitionProductionGraph3 N) ε) :
    G = recognitionProductionGraph3 N :=
  exactJCostAction_determines_loopless_graph
    G (recognitionProductionGraph3 N)
    hloop (recognitionProductionGraph3_loopless hN) haction

/-- Independent uniqueness consequence: the event-fold graph is the unique
loopless graph carrying its exact action. -/
theorem recognitionProductionGraph3_unique_loopless_action_representation
    {N : ℕ} [NeZero N] (hN : 2 ≤ N)
    (G : WeightedLedgerGraph (TorusCard3 N))
    (hloop : LooplessGraph G)
    (haction :
      ∀ ε : Fin (TorusCard3 N) → ℝ,
        exactJCostAction G ε =
          exactJCostAction (recognitionProductionGraph3 N) ε) :
    G = recognitionProductionGraph3 N :=
  exactJCostAction_determines_loopless_graph
    G (recognitionProductionGraph3 N)
    hloop (recognitionProductionGraph3_loopless hN) haction

/-- Independent uniqueness consequence: the event-fold graph is the unique
loopless graph carrying its exact action. -/
theorem recognitionProductionGraph3_unique_loopless_action_representation
    {N : ℕ} [NeZero N] (hN : 2 ≤ N)
    (G : WeightedLedgerGraph (TorusCard3 N))
    (hloop : LooplessGraph G)
    (haction :
      ∀ ε : Fin (TorusCard3 N) → ℝ,
        exactJCostAction G ε =
          exactJCostAction (recognitionProductionGraph3 N) ε) :
    G = recognitionProductionGraph3 N :=
  exactJCostAction_determines_loopless_graph
    G (recognitionProductionGraph3 N)
    hloop (recognitionProductionGraph3_loopless hN) haction

/-- Every event in the constructed batch has an underlying minimum-J ledger
transition which is an actual one-account posting, and its spatial posting
current is double-entry conserved. -/
theorem realizedPrimitivePostingPair_has_ledger_event
    {N : ℕ} [NeZero N]
    (e : PostingPair3 N)
    (he : e ∈ realizedPrimitivePostingPairs3 N) :
    ∃ A B : LedgerPostingAdjacency.LedgerState 3,
      PostingStep A B ∧
        JMinimalPostingStep A B ∧
        (∑ k : Fin (TorusCard3 N),
          divF (elementaryPosting e.1 e.2) k) = 0 := by
  have hrel :=
    (mem_realizedPrimitivePostingPairs3_iff e).mp he
  unfold encodedMinimumJRelation3 at hrel
  rcases hrel with ⟨A, B, hmin, a, haxis, hshift⟩
  have hpost : PostingStep A B :=
    minJlogCost_monotoneStep_implies_postingStep
      hmin.1 hmin.2.1 hmin.2.2
  exact
    ⟨A, B, hpost, hmin,
      elementaryPosting_sum_div_zero e.1 e.2⟩

theorem zeroTorusGraph3_not_recognitionProductionGraph3 :
    zeroTorusGraph3 3 ≠ recognitionProductionGraph3 3 := by
  intro h
  have hid :=
    recognitionConstruction_productionActionIdentity
      (N := 3) (by norm_num)
  rw [← h] at hid
  exact
    zeroTorusGraph3_violates_positiveRealizedProductionActionIdentity hid

What this page does not claim

The theorem does not claim the production graph is the only graph with any action, only the only loopless graph with the exact action. It does not claim the production graph is physically realized; it is a mathematical object constructed within the framework. The theorem does not extend to other geometries or infinite lattices; it is proved only for a finite three-dimensional torus with at least two sites per direction.

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