Encyclopedia Foundation Foundation Pair Kernel Production Operation Channel Selection S25 Committed Oper

ARTICLE 3 claims 2 theorems 1 model

Foundation Pair Kernel Production Operation Channel Selection S25 Committed Oper

A machine-checked theorem shows that a committed set of production operations can coexist with two different physical channel systems, one that selects channels and one that does not.

The channel selection split

In the Recognition Science framework, a ledger is a discrete record of events, and a recognition is the forced cost of registering one of those events. The declaration committedOperations_admit_channelSelection_split is a theorem in the framework's machine-checked library of formal theorems. It states that the set of committed production operations, the three kinds of acts that turn witnessed events into ledger entries, is compatible with two different physical channel systems. One system selects physical channels for those operations; the other does not. The two systems coexist, meaning the committed operations do not by themselves force a choice of physical channel selection.

The three committed operations are spatial edge actions, tick commits, and balance currents. A spatial edge action is an operation realized on a single edge of a recognition graph, evaluated by an exact action and its edge flux. A tick commit is the ledger commit from a start tick to an end tick, spanning exactly one successor step. A balance current is the event's elementary double-entry current, passing a conservation probe. These are data, not response labels. Their orientation, conservation, and finite-batch composition laws are theorem-backed, and the theorem states that their conjunction is exactly S24 event-act transport, not a weaker theorem.

The theorem's proof is axiom-clean, with no sorry and no new axiom. It does not construct a physical carrier. The first missing physical semantic is split into three operation-to-channel selectors, one for each operation kind. The theorem shows that the committed operations are independent of a proposed response system. Consequently they coexist with both a transport-complete and an incomplete system. No physical carrier, completeness, or observational exhaustion is claimed unconditionally.

What this changes is the boundary of what is known. The committed operations are fixed, but the physical channel selection is not. The theorem exposes a precise gap: the operations do not determine their own physical realization. This is a target for further derivation, not a failure. The framework's library shows exactly where the next step must be taken, and what remains open is the construction of the physical carrier itself.

THEOREM committedOperations_admit_channelSelection_split · IndisputableMonolith/Foundation/PairKernelProductionOperationChannelSelectionS25.lean
/-- The same committed operation package coexists with a system that selects
all operation channels and one that does not. Hence the source operations do
not force their promotion to physical channels. -/
theorem committedOperations_admit_channelSelection_split :
    CommittedProductionOperations3 ∧
      ∃ left right : PostingPhysicalResponseSystem3.{0} 3,
        ProductionOperationsSelectPhysicalChannels3 left ∧
          ¬ ProductionOperationsSelectPhysicalChannels3 right := by
  obtain
    ⟨left, right, _hleftReads, _hrightReads,
      hleftTransport, hrightNotTransport⟩ :=
    committed_ancestry_admits_eventActTransport_split
  exact
    ⟨committedProductionOperations_hold,
      left, right,
      (productionOperationSelectors_iff_eventActTransport
        left).2 hleftTransport,
      fun hright =>
        hrightNotTransport
          ((productionOperationSelectors_iff_eventActTransport
            right).1 hright)⟩
MODEL ProductionSourceOperation3 · IndisputableMonolith/Foundation/PairKernelProductionOperationChannelSelectionS25.lean
/-- The three operation families generated by one primitive posting event.
This is not a five-response carrier. Spatial axis remains an observable of the
edge geometry rather than a field of this type. -/
inductive ProductionSourceOperation3 : Type
  | spatial (operation : SpatialEdgeActionOperation3)
  | tick (operation : TickCommitOperation3)
  | balance (operation : BalanceCurrentOperation3)
THEOREM committedOperations_admit_channelSelection_split · IndisputableMonolith/Foundation/PairKernelProductionOperationChannelSelectionS25.lean
/-- The same committed operation package coexists with a system that selects
all operation channels and one that does not. Hence the source operations do
not force their promotion to physical channels. -/
theorem committedOperations_admit_channelSelection_split :
    CommittedProductionOperations3 ∧
      ∃ left right : PostingPhysicalResponseSystem3.{0} 3,
        ProductionOperationsSelectPhysicalChannels3 left ∧
          ¬ ProductionOperationsSelectPhysicalChannels3 right := by
  obtain
    ⟨left, right, _hleftReads, _hrightReads,
      hleftTransport, hrightNotTransport⟩ :=
    committed_ancestry_admits_eventActTransport_split
  exact
    ⟨committedProductionOperations_hold,
      left, right,
      (productionOperationSelectors_iff_eventActTransport
        left).2 hleftTransport,
      fun hright =>
        hrightNotTransport
          ((productionOperationSelectors_iff_eventActTransport
            right).1 hright)⟩

What this page does not claim

The theorem does not construct a physical carrier for the committed operations. The theorem does not claim that any physical channel system is complete or observationally exhaustive. The theorem does not assert that the committed operations force a unique physical channel selection.

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

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND