Foundation Pair Kernel Production Event Response Generation S24 Production Event

The unique factoring map

In the Recognition Science framework, a ledger is a discrete record of events, and a response act is a single recorded event together with its witnesses: a spatial act carries its geometric axis, a successor act carries its committed next tick, and a balance act carries its double-entry witness. The framework's machine-checked library of formal theorems proves that if you have any function that assigns a label to every response act, and that function gives the same label to any two acts that are observationally equivalent, then that function must factor through the response classes. In plain terms, the label cannot depend on the extra witness details; it must be a function of the response class alone, which is the equivalence class of acts that observations cannot distinguish.

The theorem, named productionEventResponseInvariantMap_factors_unique, states this factoring is unique: for any such invariant label-assignment map, there exists exactly one descended map from the response classes to the labels that agrees with the original map on every act. The proof proceeds by showing the response classes are canonically equivalent to the recognition response quotient, and that the projection from acts to classes is surjective. This means the response classes themselves are the complete repository of observable information in the response acts; the witnesses that distinguish individual acts carry no observable label content.

The construction builds a source response catalog from realized S8 events, which are the complete finite batch of witnessed minimum-J posting pairs. Every one of the five response classes has an explicit source act, and the resulting observational quotient is canonically equivalent to the S22 Recognition response quotient. The quotient universal property is the target-blind minimality statement: it holds for any target type, not just for a specific one. Orientation preserves response classes, and finite event-response batches compose by list append without creating new primitive classes.

What this theorem does not claim is equally important. It does not promote the observational quotient to a physical response system; doing so would make realization true by construction, which the framework explicitly avoids. The theorem is a statement about the algebraic structure of response classes and invariant maps, not about the physical implementation of those responses. It also does not claim that the descended map is computable or that it can be constructed without the axiom of choice; the theorem only asserts existence and uniqueness of the factoring map.

For a reader, the practical consequence is that any invariant labeling scheme for response acts is determined entirely by its values on the response classes. This is a structural simplification: the witnesses, which are the concrete geometric axes, tick successors, and balance witnesses, do not add observable label distinctions beyond what the classes already encode. The theorem thus provides a clean separation between the observational content of a response and the extra structural witnesses that realize it.

/-- Universal property: every operational map invariant under committed
production-response probes factors uniquely through the generated class
carrier. This is its target-blind minimality statement. -/
theorem productionEventResponseInvariantMap_factors_unique
    {β : Type*}
    (map : ProductionEventResponseAct3 → β)
    (hinvariant :
      ProductionEventResponseInvariantMap3 map) :
    ∃! descended :
        ProductionEventResponseClass3 → β,
      ∀ act,
        descended
            (proj productionEventResponseProbeFamily3 act) =
          map act := by
  let descended :
      ProductionEventResponseClass3 → β :=
    Quotient.lift map
      (fun left right h => hinvariant left right h)
  refine
    ⟨descended, fun _ => rfl, ?_⟩
  intro other hother
  funext responseClass
  refine
    Quotient.inductionOn responseClass
      (fun act => ?_)
  exact hother act

/-- Universal property: every operational map invariant under committed
production-response probes factors uniquely through the generated class
carrier. This is its target-blind minimality statement. -/
theorem productionEventResponseInvariantMap_factors_unique
    {β : Type*}
    (map : ProductionEventResponseAct3 → β)
    (hinvariant :
      ProductionEventResponseInvariantMap3 map) :
    ∃! descended :
        ProductionEventResponseClass3 → β,
      ∀ act,
        descended
            (proj productionEventResponseProbeFamily3 act) =
          map act := by
  let descended :
      ProductionEventResponseClass3 → β :=
    Quotient.lift map
      (fun left right h => hinvariant left right h)
  refine
    ⟨descended, fun _ => rfl, ?_⟩
  intro other hother
  funext responseClass
  refine
    Quotient.inductionOn responseClass
      (fun act => ?_)
  exact hother act

/-- Canonical equivalence from event-generated source classes to S22's
Recognition observational quotient. This is a source-catalog theorem, not
production physical selection. -/
def productionEventResponseClassEquivQuotient3 :
    ProductionEventResponseClass3 ≃
      RecognitionResponseQuotient3 :=
  productionEventResponseClassEquiv3.trans
    recognitionResponseQuotientEquiv3.symm

/-- Every one of the five S21 response basis elements has an explicit
production-event response act. -/
theorem every_response_has_productionEventAct
    (response : RecognitionParentResponse3) :
    ∃ act : ProductionEventResponseAct3,
      productionEventResponseAct_read act = response := by
  cases response with
  | spatial axis =>
      exact
        ⟨.spatial
            (productionSpatialEvent3 axis) axis
            (productionSpatialEvent_has_axis axis),
          rfl⟩
  | temporal kind =>
      fin_cases kind
      · let event :=
          productionSpatialEvent3
            ⟨0, by norm_num [GapDerivation.D]⟩
        exact
          ⟨.successor event
              (successorResponseProbe3_exists event),
            rfl⟩
      · let event :=
          productionSpatialEvent3
            ⟨0, by norm_num [GapDerivation.D]⟩
        exact
          ⟨.balance event
              (balanceResponseProbe3_exists event),
            rfl⟩

What this page does not claim

The theorem does not promote the observational quotient to a physical response system. The theorem does not claim the descended map is computable or constructible without choice. The theorem does not establish that any particular physical system realizes the response classes.

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