Foundation Pair Kernel Production Support S6 Zero Torus Graph3 Violates Every Pr

The zero graph as a counterexample

A ledger, a discrete record of events, needs a rule for which events count. In Recognition Science, the proposed rule is that only the cheapest possible postings, the minimal-cost steps, should be active. The declaration zeroTorusGraph3_violates_everyPrimitivePostingActive proves that a graph where every connection has weight zero fails this rule completely: it has no active postings at all, while the rule demands that every minimal-cost step have a positive weight.

The proof is a counterexample, not a construction. It shows that the framework's existing assumptions about action ledgers, which hold for any graph, are too weak to force the production law. The zero graph satisfies all those earlier assumptions, yet it violates the requirement that every minimal-cost posting be active. This is a precise, machine-checked demonstration that the production law is a new hypothesis, not a consequence of what came before.

In Recognition Science, this result splits the production law into two halves. One half says inactive edges have zero weight; the other says active edges have positive weight. The zero graph violates the second half, while another graph, the all-pairs graph, violates the first. Together they show that both halves are needed and that neither follows from the existing premises.

The framework's library proves that a canonical graph, one that connects exactly the minimal-cost steps, satisfies the full law. The zero graph and the all-pairs graph are the two extreme failures. This counterexample is not a defect; it is a boundary marker. It tells a reader exactly what the production law adds to the framework and why that addition is a genuine hypothesis about how production works, not a hidden assumption already in place.

/-- The zero graph kills the completeness half: a concrete minimum-J axis
step exists but receives no positive coefficient. -/
theorem zeroTorusGraph3_violates_everyPrimitivePostingActive :
    ¬ EveryPrimitivePostingActive3 (zeroTorusGraph3 3) := by
  intro hevery
  let p : TorusSite3 3 := fun _ => 0
  let q : TorusSite3 3 :=
    framedForward (Equiv.refl (Fin 3)) p (0 : Fin 3)
  have hstep :
      FramedAxisStep (Equiv.refl (Fin 3)) p q :=
    ⟨0, Or.inl rfl⟩
  have hgenerated :
      JMinimalGeneratedStep (Equiv.refl (Fin 3)) p q :=
    (jMinimalGeneratedStep_iff_framedAxisStep
      (Equiv.refl (Fin 3)) p q).mpr hstep
  have hpos := hevery p q hgenerated
  norm_num [zeroTorusGraph3] at hpos

theorem zeroTorusGraph3_satisfies_existing_premises :
    ExistingActionLedgerPremises3 (zeroTorusGraph3 3) :=
  existingActionLedgerPremises_all_graphs (zeroTorusGraph3 3)

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)

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⟩

theorem canonicalPostingGraph3_obeys_action_law
    (N : ℕ) [NeZero N] :
    PrimitivePostingActionLaw3 (canonicalPostingGraph3 N) := by
  constructor
  · intro p q h
    simp [canonicalPostingGraph3, h]
  · intro p q h
    simp [canonicalPostingGraph3, h]

What this page does not claim

The zero graph is a physically realizable ledger. The production law is false; it is shown to be an independent hypothesis, not a consequence of earlier assumptions. The all-pairs graph is the only other counterexample to the production law.

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: