Foundation Pair Kernel Production Support S6 Global Torus Graph3 Violates Primit

The all-pairs graph

In the Recognition Science framework, a ledger, a discrete record of events, is often represented as a weighted graph. The vertices are sites on a torus, and an edge between two sites carries a weight. One natural graph, called the global torus graph, assigns weight 1 to every possible pair of sites. It connects everything to everything else with equal strength.

The framework's production rule, the Primitive Posting Action Law, demands two things of a graph. First, an edge that does not correspond to a possible minimum-cost posting must have weight zero. Second, every edge that does correspond to such a posting must have a positive weight. This law is a formal statement, a HYPOTHESIS in the framework's language, about how production should select which postings are real.

The proved theorem globalTorusGraph3_violates_primitivePostingActionLaw states that the global torus graph fails the first half of this law. Because it assigns weight 1 to every pair, it gives positive weight to edges that are not possible minimum-cost postings. The theorem is a formal consequence of a more basic fact: the graph violates the requirement that action only occurs on realized postings. The proof is machine-checked, with no gaps and no added axioms.

This result is a counterexample, not a construction. It shows that the framework's existing premises, the facts known before this law was stated, do not by themselves force the law to hold. The global graph satisfies all those earlier premises, yet it still violates the new law. The theorem therefore marks a precise boundary: the new law adds real content that the old assumptions did not contain.

In Recognition Science, this declaration establishes that the all-pairs graph is not a valid model of production. It separates the global graph from the canonical graph, which does obey the law. The consequence is that production cannot be indifferent to which postings are possible; a graph that treats every connection as equally real is ruled out by the framework's own logic.

/-- All-pairs action graph on the finite torus enumeration. -/
def globalTorusGraph3
    (N : ℕ) [NeZero N] :
    WeightedLedgerGraph (TorusCard3 N) where
  weight := fun _ _ => 1
  weight_nonneg := fun _ _ => zero_le_one
  weight_symm := fun _ _ => rfl

/-- **S6 operational factorization of the missing arrow (HYPOTHESIS for an
externally supplied graph).**

An action coefficient records a primitive realized posting: unrealized pairs
contribute zero and realized primitive pairs contribute positively. The law
does not choose a coefficient scale; the committed source-coupling
countermodel already proves that posting integrality does not fix that scale. -/
structure PrimitivePostingActionLaw3
    {N : ℕ} [NeZero N]
    (G : WeightedLedgerGraph (TorusCard3 N)) : Prop where
  inactive_zero :
    ∀ p q : TorusSite3 N,
      ¬ JMinimalGeneratedStep (Equiv.refl (Fin 3)) p q →
        G.weight (torusSiteEquivFin N p) (torusSiteEquivFin N q) = 0
  active_positive :
    ∀ p q : TorusSite3 N,
      JMinimalGeneratedStep (Equiv.refl (Fin 3)) p q →
        0 < G.weight (torusSiteEquivFin N p) (torusSiteEquivFin N q)

theorem globalTorusGraph3_violates_primitivePostingActionLaw :
    ¬ PrimitivePostingActionLaw3 (globalTorusGraph3 3) := by
  intro hLaw
  exact globalTorusGraph3_violates_actionOnlyOnRealized
    hLaw.inactive_zero

/-- Exact action algebra, double-entry conservation, and source grammar all
hold for the global graph, but the support-soundness half rejects it. -/
theorem globalTorusGraph3_violates_actionOnlyOnRealized :
    ¬ ActionOnlyOnRealizedPostings3 (globalTorusGraph3 3) := by
  intro honly
  obtain ⟨p, q, hnot⟩ :=
    framedAxisStep_excludes_global_model (Equiv.refl (Fin 3))
  have hinactive :
      ¬ JMinimalGeneratedStep (Equiv.refl (Fin 3)) p q := by
    intro hgenerated
    exact hnot
      ((jMinimalGeneratedStep_iff_framedAxisStep
        (Equiv.refl (Fin 3)) p q).mp hgenerated)
  have hz := honly p q hinactive
  norm_num [globalTorusGraph3] at 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 global torus graph is a physically realizable production graph. The Primitive Posting Action Law is a proved theorem for all graphs; it remains a hypothesis for an externally supplied production graph. The theorem says anything about which postings are physically possible; it only concerns the graph's weights.

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: