Foundation Pair Kernel Finite Heisenberg Weyl Event Operator

The finite event operator

The finite Heisenberg-Weyl event operator is a model of a discrete recognition ledger: a record of events that change a system's state in small, countable steps. The construction builds this ledger on a torus of exactly 27 sites, where each site is an address with three coordinates and each coordinate has three possible phases. This is the smallest grid that carries the full structure of three independent axes with a three-step cycle on each one. A theorem proves the carrier has exactly 27 sites.

On this grid, each axis gets two operations. A shift moves an event one step along that axis, and a clock multiplies the event's amplitude by a fixed cubic root of unity, a number whose third power is 1. The construction proves an exact relation between these operations: shifting then clocking equals clocking then shifting, multiplied by the same phase factor. This is the Weyl relation, the finite version of the position-momentum commutation law familiar from quantum mechanics, and here it holds exactly on every axis of the 27-site torus.

The primary object is a coefficient-free action, a sum over all sites and axes of two terms: the squared difference between neighboring sites, and a clock displacement term that measures how far each site's phase sits from a chosen center. The construction proves this action is always nonnegative and is zero when the amplitude is zero everywhere. The source response is defined as the first derivative of this action along a variation, and the operator itself is the second derivative on site basis vectors. No kinetic, potential, or source coefficients are supplied; everything derives from the one action.

In Recognition Science, this construction establishes a self-contained finite model where the response and operator are not separate inputs but packaged derivatives of the primary action. A certificate theorem assembles the site count, the Weyl relation, and the nonnegativity proof into one structure. The construction is honest about its limits: the equal weighting of shift and clock terms, the choice of this action, and the clock center are modeled, not forced by prior theory. The carrier, the Weyl relation, and the nonnegativity are theorems; the action itself is a definitional choice.

What this changes is the starting point for a finite event theory. Instead of assuming a kinetic term and a potential term, the model says the entire dynamics follows from one self-dual action on a small torus. The machine-checked library of formal theorems guarantees the arithmetic and the nonnegativity, so the model's claims about its own consistency are exact. The next question is whether the equal weights and the clock center can be derived from deeper recognition principles rather than chosen.

theorem weylEventSite27_card :
    Nat.card WeylEventSite27 = 27 := by
  change Nat.card (Fin 3 → ZMod 3) = 27
  rw [Nat.card_fun, Nat.card_zmod, Nat.card_fin]
  norm_num

/-- Exact finite Weyl relation on every production-torus axis. -/
theorem axis_weyl_relation27
    (ψ : WeylEventSite27 → ℂ)
    (axis : Fin 3)
    (site : WeylEventSite27) :
    clockAxis27 (shiftAxis27 ψ axis) axis site =
      omega3 * shiftAxis27 (clockAxis27 ψ axis) axis site := by
  have hval :
      ∀ j : ZMod 3,
        j.val = (j - 1).val + 1 ∨
          (j.val = 0 ∧ (j - 1).val = 2) := by
    decide
  have e :
      omega3 ^ (site axis).val =
        omega3 ^ ((site axis - 1).val + 1) := by
    rcases hval (site axis) with h | ⟨h0, h2⟩
    · rw [h]
    · rw [h0, h2, pow_zero]
      exact omega3_pow_three.symm
  simp only [clockAxis27, shiftAxis27, shiftSite27]
  simp only [Function.update_self]
  rw [e]
  simp [pow_succ, mul_comm, mul_assoc, mul_left_comm]

theorem finiteWeylEventAction27_nonneg
    (center : WeylEventSite27)
    (ψ : WeylEventAmplitude27) :
    0 ≤ finiteWeylEventAction27 center ψ := by
  unfold finiteWeylEventAction27
  apply Finset.sum_nonneg
  intro axis _
  apply Finset.sum_nonneg
  intro site _
  exact add_nonneg (sq_nonneg _)
    (mul_nonneg (Complex.normSq_nonneg _) (sq_nonneg _))

theorem finiteWeylEventAction27_zero
    (center : WeylEventSite27) :
    finiteWeylEventAction27 center (fun _ => 0) = 0 := by
  simp [finiteWeylEventAction27]

theorem finiteHeisenbergWeylEventOperator_cert27
    (center : WeylEventSite27) :
    FiniteHeisenbergWeylEventOperatorCert27 center where
  site_count := weylEventSite27_card
  axis_weyl := axis_weyl_relation27
  action_nonnegative := finiteWeylEventAction27_nonneg center
  source_from_action := sourceResponse_from_primary_action27 center
  operator_from_source := operator_from_source_response27 center

What this page does not claim

The action itself is not forced by prior Recognition theory; it is a model choice. No empirical constant or new axiom is introduced in this construction. The operator is not claimed to be the unique finite event operator for the framework.

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