Encyclopedia Foundation Foundation Pair Kernel Gap2a Scale Breaking Phase Transaction Law Residual

ARTICLE 4 claims 4 theorems

Foundation Pair Kernel Gap2a Scale Breaking Phase Transaction Law Residual

A machine-checked proof shows that the eight-phase transaction law still cannot pick a physical scale, and names exactly what a future law must add.

The missing physical premise

The ledger, a discrete record of events, is the core picture of Recognition Science. A phase is one of eight labeled steps in a complete recognition cycle, and a transaction is the posting of an event to that ledger. This result, part of the framework's machine-checked library of formal theorems, examines a specific gap in the derivation of physical laws: after the eight phases are attached to actual ledger postings, the theory still cannot decide between two different physical scales that produce identical recognition data.

The construction provides two concrete representatives of a physical valuation, which assigns action values to events. The first is a unit representative. The second is built by scaling the primitive-event action by a factor of two. A theorem proves that these two representatives have the same recognition data, meaning every observable property that descends from recognition data sees them as identical. Yet another theorem shows that for every one of the eight phases, the actual posting action differs between the two representatives: one is exactly twice the other. This is the core obstruction, stated precisely and proved in the library.

The framework then considers any proposed physical premise, a predicate on valuations meant to select the correct physical scale. The construction defines what it means for such a premise to descend through the observable quotient, meaning that if two valuations share recognition data, the premise treats them the same. Two theorems prove that if a premise descends through this quotient and admits the unit representative, then no function from observable classes to real numbers can recover the absolute phase actions, and no such function can serve as a representative-independent multiplicative action-dual source. In plain language, any premise that only uses recognition data is blind to the scale difference and cannot close the law.

The terminal theorem, scaleBreakingPhaseTransactionLaw_gap2a_residual, assembles these results into a single certificate. It states that the missing physical content is exactly a target-blind production premise that breaks, rather than descends through, the positive action-scale torsor. This means a successful law must add a physical premise that rejects one of the two positive action-scale representatives despite their identical recognition data. The Gray phase labels, response completeness, and eight-tick closure do not do this; the construction proves they cannot.

The consequence is a sharpened research target. The framework's library has shown that the eight-phase transaction is real and closed, but the step from recognition data to a unique physical action scale remains open. The next law must introduce a premise that distinguishes between the two representatives, and this result has proved that such a premise cannot be derived from anything that descends through the observable quotient. The path forward is named, and the obstruction is certified.

THEOREM phaseUnit_doubled_sameRecognitionData · IndisputableMonolith/Foundation/PairKernelGap2aScaleBreakingPhaseTransactionLawResidual.lean
theorem phaseUnit_doubled_sameRecognitionData :
    SameRecognitionData3
      phaseUnitValuation3 phaseDoubledActionValuation3 := by
  unfold phaseDoubledActionValuation3
  exact
    scalePhysicalValuation_sameRecognitionData
      2 1 (by norm_num) (by norm_num)
      phaseUnitValuation3
THEOREM phaseUnit_doubled_phase_action_ne · IndisputableMonolith/Foundation/PairKernelGap2aScaleBreakingPhaseTransactionLawResidual.lean
theorem phaseUnit_doubled_phase_action_ne
    (phase : Fin 8) :
    postingEventAction3 phaseUnitValuation3.kinematics
        (phaseBearingPostingEvent3 phase).1 ≠
      postingEventAction3 phaseDoubledActionValuation3.kinematics
        (phaseBearingPostingEvent3 phase).1 := by
  intro heq
  have hscaled :=
    phaseDoubledAction_phase_action_eq_two_mul phase
  rw [hscaled] at heq
  have hpos :
      0 <
        postingEventAction3 phaseUnitValuation3.kinematics
          (phaseBearingPostingEvent3 phase).1 :=
    mul_pos
      (phaseUnitValuation3.kinematics.energy_pos _)
      (phaseUnitValuation3.kinematics.duration_pos _)
  nlinarith
THEOREM no_S20_descended_phasePremise_recovers_absolutePhaseAction · IndisputableMonolith/Foundation/PairKernelGap2aScaleBreakingPhaseTransactionLawResidual.lean
no_S20_descended_phasePremise_recovers_absolutePhaseAction · IndisputableMonolith/Foundation/PairKernelGap2aScaleBreakingPhaseTransactionLawResidual.lean:130
/-- If a phase-production premise still descends through S20 and admits the
already constructed unit representative, no observable-class action selector
can recover all primitive phase actions under that premise. -/
theorem no_S20_descended_phasePremise_recovers_absolutePhaseAction
    (premise : PhaseProductionPhysicalPremise3)
    (hdescends :
      PhaseProductionPremiseDescendsThroughS20 premise)
    (hunit : premise phaseUnitValuation3) :
    ¬ ∃ selector : PhasePremiseAbsoluteActionSelector3,
      SelectsPremisePhaseRepresentativeActions3
        premise selector := by
  rintro ⟨selector, hselector⟩
  have hdoubled : premise phaseDoubledActionValuation3 :=
    hdescends phaseUnitValuation3 phaseDoubledActionValuation3
      phaseUnit_doubled_sameRecognitionData hunit
  let phase : Fin 8 := 0
  have hleft :=
    hselector phaseUnitValuation3 hunit phase
  have hright :=
    hselector phaseDoubledActionValuation3 hdoubled phase
  rw [← phaseUnit_doubled_sameObservableClass] at hright
  have heq :
      postingEventAction3 phaseUnitValuation3.kinematics
          (phaseBearingPostingEvent3 phase).1 =
        postingEventAction3 phaseDoubledActionValuation3.kinematics
          (phaseBearingPostingEvent3 phase).1 :=
    hleft.symm.trans hright
  exact phaseUnit_doubled_phase_action_ne phase heq
THEOREM scaleBreakingPhaseTransactionLaw_gap2a_residual · IndisputableMonolith/Foundation/PairKernelGap2aScaleBreakingPhaseTransactionLawResidual.lean
/-- Terminal theorem for this pass: the missing physical content is exactly a
target-blind production premise that breaks, rather than descends through, the
S20 positive action-scale torsor. -/
theorem scaleBreakingPhaseTransactionLaw_gap2a_residual :
    Gap2aScaleBreakingPhaseTransactionLawResidualCert3 where
  actual_phase_transaction :=
    phaseBearingActualTransaction_cert
  same_observable_scaled_representative :=
    phaseUnit_doubled_sameObservableClass
  phase_action_changes_under_scaled_representative :=
    phaseUnit_doubled_phase_action_ne
  descended_premise_cannot_select_action :=
    no_S20_descended_phasePremise_recovers_absolutePhaseAction
  descended_premise_cannot_select_action_dual :=
    no_S20_descended_phasePremise_selects_actionDualSource

What this page does not claim

This module does not provide the missing physical premise that breaks the scale torsor. It does not claim that the eight-phase transaction law is complete or physically predictive. It does not derive any specific value for the action scale from recognition data alone.

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