Encyclopedia Foundation Foundation Pair Kernel Gap2a Phase Bearing Transaction Residual Phase Bearing Pr

ARTICLE 4 claims 4 theorems

Foundation Pair Kernel Gap2a Phase Bearing Transaction Residual Phase Bearing Pr

A machine-checked proof shows a complete eight-step transaction exists, while also proving that no such transaction can single out a physical action scale.

The eight-phase transaction

A recognition event, in this framework, is a discrete record of a comparison between two quantities. The declaration phaseBearingProductionTransaction_gap2a_residual concerns a specific kind of recognition event called a posting, which records a change in state. The theorem proves that a complete transaction, a sequence of exactly eight postings, can be constructed. Each posting in this sequence is associated with a phase, and each phase carries a committed operation, a step in the transaction's advance. The sequence is built on a Gray code, a binary counting scheme where consecutive values differ by only one bit, which cycles through eight distinct states. The theorem shows that after eight such committed operations, the transaction returns to its starting phase, and it cannot return to that phase any sooner. This establishes the existence of a minimal, complete eight-step transaction cycle.

The construction is explicit: for each of the eight phases, the theorem provides a concrete posting event that lies on a specific axis, and a proof that the phase advances by exactly one step per commit. The advance operation is shown to be additive, meaning that committing twice in a row is the same as committing once with a combined count, and it is shown to be periodic with period eight. The theorem also states that the aggregate effect of all eight postings, when each posting has a constant magnitude, is exactly four times that magnitude. This is a precise algebraic fact about how the postings combine over a full cycle.

In Recognition Science, the framework models physical quantities as arising from such recognition events. The key result of this declaration is not just that the transaction exists, but what it cannot do. The theorem proves that no function can select an absolute action value for each phase that is consistent across all possible physical valuations. Similarly, no function can serve as a multiplicative dual source for all representatives. And no law that breaks the scale of the transaction can exist under the current boundary conditions. These are no-go theorems: they establish structural limits on what the framework can derive from this transaction alone.

The declaration does not claim that this transaction selects a physical action scale, nor that it provides a representative-independent source dual. The Gray state and its period are dimensionless data. Adjoining the phase to the observable class leaves two representatives with the same recognition data but different action. Identifying the aggregate Green source with a static continuum source is additional physical content that this theorem does not provide. The canonical Gray schedule is a construction, not a physical selection theorem. The no-go results are theorems; the schedule itself is a choice.

THEOREM phaseBearingProductionTransaction_gap2a_residual · IndisputableMonolith/Foundation/PairKernelGap2aPhaseBearingTransactionResidual.lean
phaseBearingProductionTransaction_gap2a_residual · IndisputableMonolith/Foundation/PairKernelGap2aPhaseBearingTransactionResidual.lean:408
theorem phaseBearingProductionTransaction_gap2a_residual :
    Gap2aPhaseBearingTransactionResidualCert3 where
  actual_exact_eight_transaction :=
    phaseBearingActualTransaction_cert
  absolute_action_still_not_selected :=
    no_phaseTransaction_selector_recovers_absolutePostingAction
  action_dual_source_still_not_selected :=
    no_phaseTransaction_sourceSelector_is_actionDual_for_all_representatives
  full_scale_breaking_law_still_absent :=
    no_currentBoundary_phaseBearingScaleBreakingTransactionLaw
THEOREM phaseBearingAdvance3_eight · phaseBearingAdvance3_ne_self_before_eight · IndisputableMonolith/Foundation/PairKernelGap2aPhaseBearingTransactionResidual.lean
/-- Every transaction state returns after the complete eight-commit orbit. -/
theorem phaseBearingAdvance3_eight
    (phase : Fin 8) :
    phaseBearingAdvance3 phase 8 = phase := by
  apply Fin.ext
  simp [phaseBearingAdvance3,
    Nat.mod_eq_of_lt phase.isLt]
/-- No positive proper prefix of the octave returns to its initial phase. -/
theorem phaseBearingAdvance3_ne_self_before_eight
    (phase : Fin 8) (commits : ℕ)
    (hpositive : 0 < commits)
    (hshort : commits < 8) :
    phaseBearingAdvance3 phase commits ≠ phase := by
  intro hreturn
  have hval := congrArg Fin.val hreturn
  simp only [phaseBearingAdvance3, Fin.val_mk] at hval
  omega
THEOREM no_phaseTransaction_selector_recovers_absolutePostingAction · IndisputableMonolith/Foundation/PairKernelGap2aPhaseBearingTransactionResidual.lean
no_phaseTransaction_selector_recovers_absolutePostingAction · IndisputableMonolith/Foundation/PairKernelGap2aPhaseBearingTransactionResidual.lean:222
/-- Even on the exact eight-phase actual transaction, absolute posting action
does not descend through the current observable quotient. -/
theorem no_phaseTransaction_selector_recovers_absolutePostingAction :
    ¬ ∃ selector : PhaseTransactionAbsoluteActionSelector3,
      SelectsAllPhaseRepresentativeActions3 selector := by
  rintro ⟨selector, hselector⟩
  let left : RecognitionPhysicalValuation3.{0} 3 :=
    unitRecognitionPhysicalValuation3
      (parentPhysicalChannelCarrier3 3)
  let right : RecognitionPhysicalValuation3.{0} 3 :=
    scalePhysicalValuation3
      2 1 (by norm_num) (by norm_num) left
  let phase : Fin 8 := 0
  have hsame : SameRecognitionData3 left right := by
    dsimp [right]
    exact scalePhysicalValuation_sameRecognitionData
      2 1 (by norm_num) (by norm_num) left
  have hclass :
      physicalObservableClass3 left =
        physicalObservableClass3 right :=
    sameRecognitionData_sameObservableClass hsame
  have hleft := hselector left phase
  have hright := hselector right phase
  rw [← hclass] at hright
  have hequal :
      postingEventAction3 left.kinematics
          (phaseBearingPostingEvent3 phase).1 =
        postingEventAction3 right.kinematics
          (phaseBearingPostingEvent3 phase).1 :=
    hleft.symm.trans hright
  have hscaled :
      postingEventAction3 right.kinematics
          (phaseBearingPostingEvent3 phase).1 =
        2 *
          postingEventAction3 left.kinematics
            (phaseBearingPostingEvent3 phase).1 := by
    dsimp [right]
    simpa using
      (scalePhysicalValuation_eventAction
        2 1 (by norm_num) (by norm_num) left
        (phaseBearingPostingEvent3 phase).1)
  have hpositive :
      0 <
        postingEventAction3 left.kinematics
          (phaseBearingPostingEvent3 phase).1 :=
    mul_pos
      (left.kinematics.energy_pos _)
      (left.kinematics.duration_pos _)
  rw [hscaled] at hequal
  nlinarith
THEOREM phaseBearingCompleteOrbitGreenSource3_of_constant · IndisputableMonolith/Foundation/PairKernelGap2aPhaseBearingTransactionResidual.lean
phaseBearingCompleteOrbitGreenSource3_of_constant · IndisputableMonolith/Foundation/PairKernelGap2aPhaseBearingTransactionResidual.lean:334
theorem phaseBearingCompleteOrbitGreenSource3_of_constant
    (postingMagnitude : Fin 8 → ℝ)
    (q : ℝ)
    (hconstant : ∀ phase, postingMagnitude phase = q) :
    phaseBearingCompleteOrbitGreenSource3 postingMagnitude =
      4 * q := by
  unfold phaseBearingCompleteOrbitGreenSource3
  simp_rw [hconstant, realGreenScaleFromPostingMagnitude]
  simp [Finset.sum_const, nsmul_eq_mul]
  ring

What this page does not claim

The transaction selects a physical action scale. A representative-independent multiplicative source dual descends from the transaction. The aggregate Green source is identified with a static continuum source.

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