Foundation Pair Kernel Production Support S6 Primitive Posting Action Law Produc

The posting law and its reach

A recognition event, in this framework, is a discrete record of a comparison between two sites. The declaration in question, primitivePostingActionLaw_production_lattice_coupling, is a theorem in the framework's machine-checked library of formal theorems. It states a conditional result: if a weighted graph satisfies a law called PrimitivePostingActionLaw3, then three things follow. First, the relation encoding minimum-cost steps is bounded, meaning it connects only sites within a fixed distance. Second, the graph's weights are supported on that relation, so only those minimum-cost steps carry nonzero weight. Third, the weights have finite range on that distance. In plain terms, the theorem says that when a production graph obeys the posting law, its activity is confined to a bounded, recognizable neighborhood.

The posting law itself is a conjunction of two halves. One half says that a pair of sites not linked by a minimum-cost step has zero action coefficient. The other says that a realized primitive posting, one that is a minimum-cost step, has a positive action coefficient. The theorem primitivePostingActionLaw_production_lattice_coupling then proves that this law, when it holds, guarantees the boundedness and support properties just described. It also proves that the law selects the support of the production relation, and that active elementary postings conserve by double entry. These are the consequences the declaration establishes.

What the declaration does not claim is equally precise. It does not prove that every graph satisfies the posting law. The library contains a counterexample: a graph where every pair of sites has weight one, the global graph, violates the law. Another graph with all weights zero violates the other half. The law is a hypothesis about a graph, not a consequence of the framework's existing premises. The theorem existing_premises_do_not_force_primitivePostingActionLaw proves exactly that the prior assumptions do not imply the law for all graphs. So the coupling theorem is conditional, and the condition is a genuine assumption, not a derived fact.

In Recognition Science, this result matters because it shows how a production rule, once assumed, pins down the structure of the recognition lattice. The framework models production as a graph whose weights encode which postings are possible. The theorem says that if the production rule is the right one, the lattice cannot be arbitrary: it must be bounded and supported on minimum-cost steps. This is a step toward connecting the abstract cost function to the concrete geometry of sites, though the physical bridge from recognition to linking remains open.

/-- Proposition-level discharge of the old string-valued
`ProductionLatticeCouplingObligation`: the production graph has bounded
minimum-J support and hence finite range in its transported D=3 step metric.
The string itself is not falsely presented as a proposition. -/
theorem primitivePostingActionLaw_production_lattice_coupling
    {N : ℕ} [NeZero N]
    {G : WeightedLedgerGraph (TorusCard3 N)}
    (hG : PrimitivePostingActionLaw3 G) :
    BoundedRecognitionRelationOn
        (@encodedMinimumJRelation3 N _)
        (@encodedMinimumJDistance3 N _) 1 ∧
      RelationSupportsWeightOn (@encodedMinimumJRelation3 N _) G ∧
      FiniteRangeOn G (@encodedMinimumJDistance3 N _) 1 := by
  refine ⟨encodedMinimumJRelation3_bounded,
    primitivePostingActionLaw_supports_encoded_relation hG, ?_⟩
  exact finiteRangeOn_export_v1
    encodedMinimumJRelation3_bounded
    (primitivePostingActionLaw_supports_encoded_relation hG)

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 globalTorusGraph3_violates_primitivePostingActionLaw :
    ¬ PrimitivePostingActionLaw3 (globalTorusGraph3 3) := by
  intro hLaw
  exact globalTorusGraph3_violates_actionOnlyOnRealized
    hLaw.inactive_zero

/-- 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

What this page does not claim

The declaration does not prove that the posting law holds for any particular physical system. The declaration does not derive the fine-structure constant or any other coupling constant. The declaration does not establish the physical bridge from recognition to linking.

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: