Foundation Pair Kernel Production Support S6 Primitive Posting Action Law Resolv

The law that separates two worlds

In the Recognition Science framework, a ledger (a discrete record of which events connect to which) can be described by a weighted graph: each possible connection between two sites carries a number, its weight. The framework's central cost function J assigns an action to every posting, and the framework's own prior stage, called S5, left a question open: which graph of connections is the physically real one? Two candidate graphs survived all previous tests. One, the canonical graph, connected exactly the sites that a minimum-J posting could realize. The other, the global graph, connected every pair of sites with equal weight. Both satisfied every previously stated premise, so the framework could not tell them apart.

The new declaration, primitivePostingActionLaw_resolves_S5_countermodels, is a theorem in the framework's machine-checked library of formal theorems. It proves that a single new law, the Primitive Posting Action Law, separates the two candidates cleanly. The law has two halves. First, a pair of sites that is not realized by a minimum-J posting must have zero action coefficient, meaning the graph assigns it no weight. Second, a realized primitive posting must have a positive action coefficient, meaning the graph gives it a strictly positive weight. The theorem shows that the canonical graph obeys this law, the global graph violates it, and the support of each graph matches the support of its corresponding S5 model exactly. The ambiguity is gone: the law selects the canonical graph as the one consistent with production selection.

The theorem also derives consequences that make the law operational. Under the law, the exact J-cost action decomposes over realized posting edges only, so inactive connections contribute nothing to the action. Active elementary postings conserve by double entry, a bookkeeping balance. The law's support satisfies the exact S5 selection predicate, and the law transports through the bounded relation and the global Green consumer. These are not independent assumptions; they are proved consequences of the law itself.

What the declaration does not claim is as important as what it proves. The law is a hypothesis about an externally supplied production graph, not a derived fact. The theorem does not prove that the canonical graph is the only possible one, nor that the law itself follows from the earlier premises. In fact, the library proves the opposite: the existing premises do not force the law, because the global graph satisfies all of them yet violates it. The law is an added postulate, and the theorem shows what that postulate buys. It buys a unique resolution to the S5 standoff, in the sense that the two candidate graphs now differ: one obeys the law, the other does not.

The reader can now see that the framework's production selection content, which S5 left as a bare hypothesis, has been restated in action language with positivity made explicit. The resolution is a theorem, not a guess, and the cost of that theorem is a new law whose status remains an honest hypothesis. That is the trade, stated plainly.

/-- The new operational law resolves the S5 support underdetermination: the
canonical bare support has an action extension, while the global bare support
cannot obey the law. Coefficient scale remains explicitly unselected. -/
theorem primitivePostingActionLaw_resolves_S5_countermodels :
    PrimitivePostingActionLaw3 (canonicalPostingGraph3 3) ∧
      ¬ PrimitivePostingActionLaw3 (globalTorusGraph3 3) ∧
      graphProductionSupport3 (canonicalPostingGraph3 3) =
        canonicalBareMinimumJSupportModel3.productionSupport ∧
      graphProductionSupport3 (globalTorusGraph3 3) =
        globalBareMinimumJSupportModel3.productionSupport :=
  ⟨canonicalPostingGraph3_obeys_action_law 3,
    globalTorusGraph3_violates_primitivePostingActionLaw,
    canonical_graph_realizes_canonical_S5_support,
    global_graph_realizes_global_S5_support⟩

theorem primitivePostingActionLaw_iff_two_halves
    {N : ℕ} [NeZero N]
    (G : WeightedLedgerGraph (TorusCard3 N)) :
    PrimitivePostingActionLaw3 G ↔
      ActionOnlyOnRealizedPostings3 G ∧
        EveryPrimitivePostingActive3 G := by
  constructor
  · intro h
    exact ⟨h.inactive_zero, h.active_positive⟩
  · rintro ⟨honly, hevery⟩
    exact ⟨honly, hevery⟩

/-- **Exact action decomposition.** Under the operational law, no term lies
outside the realized minimum-J posting family. The positive active
coefficients remain free, as required by the independent scale countermodel. -/
theorem exactJCostAction_eq_realizedPostingAction
    {N : ℕ} [NeZero N]
    {G : WeightedLedgerGraph (TorusCard3 N)}
    (honly : ActionOnlyOnRealizedPostings3 G)
    (ε : Fin (TorusCard3 N) → ℝ) :
    exactJCostAction G ε = realizedPostingExactJCostAction G ε := by
  classical
  unfold exactJCostAction realizedPostingExactJCostAction
  apply Finset.sum_congr rfl
  intro i _
  apply Finset.sum_congr rfl
  intro j _
  by_cases hactive :
      JMinimalGeneratedStep (Equiv.refl (Fin 3))
        ((torusSiteEquivFin N).symm i)
        ((torusSiteEquivFin N).symm j)
  · simp [hactive]
  · have hz :
        G.weight i j = 0 := by
      simpa using honly
        ((torusSiteEquivFin N).symm i)
        ((torusSiteEquivFin N).symm j)
        hactive
    simp [hactive, hz]

theorem existing_premises_do_not_force_primitivePostingActionLaw :
    ¬ (∀ G : WeightedLedgerGraph (TorusCard3 3),
      ExistingActionLedgerPremises3 G →
        PrimitivePostingActionLaw3 G) := by
  intro hforce
  exact globalTorusGraph3_violates_primitivePostingActionLaw
    (hforce (globalTorusGraph3 3)
      globalTorusGraph3_satisfies_existing_premises)

What this page does not claim

The Primitive Posting Action Law is a derived theorem; it remains a hypothesis for an externally supplied production graph. The canonical graph is the unique graph obeying the law. The theorem proves the law follows from the existing S5 premises.

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