Encyclopedia Foundation Foundation Complex Structure Forcing Spectral Completeness Boundary

ARTICLE 4 claims 4 theorems

Foundation Complex Structure Forcing Spectral Completeness Boundary

A cyclic shift on eight positions cannot be fully described with real numbers alone; the framework's library proves that complex numbers are forced, not chosen.

The forced entry into complex numbers

A cyclic shift is the simplest repeating motion: move every item one place, and after eight moves everything returns to the start. In the Recognition Science framework, whose ledger is a discrete record of events, this eight-step cycle is not an assumption but a proved consequence of the cost function. The shift operator, which performs that motion on the state space, has a striking property: it cannot be fully described using only real numbers. The framework's machine-checked library of formal theorems proves that this operator has an eigenvalue equal to the imaginary unit i, the number whose square is minus one.

Why real numbers fail is a matter of algebra. The eigenvalues of an eight-step shift are the eight eighth roots of unity, the complex numbers whose eighth power is one. Among them sits i, and no real number squares to minus one: x² + 1 is always positive for any real x. Because this eigenvalue has no real representative, the shift operator cannot be diagonalized over the reals. The library states this as a formal theorem: no basis of real signals can diagonalize the shift. Extending the state space to complex numbers is therefore forced by the structure, not an optional convenience.

Once complex numbers are admitted, the framework shows the natural diagonalization is the eight-point discrete Fourier transform. This transform preserves the inner product, meaning it is unitary, and it diagonalizes the shift exactly. The cost function, which assigns a number to each state, depends only on the magnitude of a complex coefficient, not its phase. Rotating the phase of any mode leaves the total cost unchanged, a property the library proves as phase invariance. This closes a gap: the cost axioms, which start with real-valued quantities, lead inevitably to the complex Hilbert space structure needed for unitarity.

The declaration spectral_completeness_boundary does not claim that complex numbers are physically observable or that the framework predicts new physics. It establishes a mathematical necessity within the framework: the eight-tick cycle, derived from the cost function, forces complexification. The library's theorems are about the shift operator and its diagonalization, not about the physical interpretation of complex amplitudes. The step from this algebraic structure to a physical claim about the universe remains open, and the declaration does not address it.

THEOREM complexification_forced · IndisputableMonolith/Foundation/ComplexStructureForcing.lean
/-- **THEOREM (Complexification is Forced)**:
    The shift operator T on Signal8 has eigenvalue i (at k=2).
    Since i is not real (no real x satisfies x² + 1 = 0), the eigenspace
    decomposition of T REQUIRES ℂ. Working over ℝ alone, T can only
    be block-diagonalized into 2×2 rotation matrices — it cannot
    be fully diagonalized.

    This is the core theorem: the 8-tick forces ℂ. -/
theorem complexification_forced :
    (∃ k : Fin 8, eigenvalue k = Complex.I) ∧
    (∀ x : ℝ, x ^ 2 + 1 ≠ 0) := by
  exact ⟨⟨⟨2, by norm_num⟩, eigenvalue_2_is_I⟩, x2_plus_1_no_real_root⟩
THEOREM no_real_tick_eigenbasis · IndisputableMonolith/Foundation/ComplexStructureForcing.lean
/-- No real basis of the 8-register consists entirely of one-dimensional tick eigenstates. -/
theorem no_real_tick_eigenbasis :
    ¬ (∃ (b : Module.Basis (Fin 8) ℝ RealSignal8) (mu : Fin 8 → ℝ),
        ∀ k, realShift (b k) = mu k • b k) := by
  classical
  rintro ⟨b, mu, hb⟩
  let W : Submodule ℝ RealSignal8 :=
    { carrier := {v | v (2 : Fin 8) = v 0}
      zero_mem' := rfl
      add_mem' := by
        intro x y hx hy
        have hx' : x (2 : Fin 8) = x 0 := hx
        have hy' : y (2 : Fin 8) = y 0 := hy
        show x (2 : Fin 8) + y (2 : Fin 8) = x 0 + y 0
        rw [hx', hy']
      smul_mem' := by
        intro c x hx
        have hx' : x (2 : Fin 8) = x 0 := hx
        show c • x (2 : Fin 8) = c • x 0
        rw [hx'] }
  have hbW : Set.range (fun k => b k) ⊆ W := by
    rintro v ⟨k, rfl⟩
    have hper := realShift_eigenvector_two_periodic (mu k) (b k) (b.ne_zero k) (hb k) 0
    simpa [W, nextIdx] using hper
  have hspan_le : Submodule.span ℝ (Set.range fun k => b k) ≤ W :=
    Submodule.span_le.mpr hbW
  have htop_le : (⊤ : Submodule ℝ RealSignal8) ≤ W := by
    simpa [Module.Basis.span_eq] using hspan_le
  have hWtop : W = ⊤ := le_antisymm le_top htop_le
  let e0 : RealSignal8 := Pi.single (0 : Fin 8) (1 : ℝ)
  have he0_mem : e0 ∈ W := by
    rw [hWtop]
    trivial
  have he0_not_mem : e0 ∉ W := by
    intro he
    have h20 : (2 : Fin 8) ≠ 0 := by decide
    simpa [W, e0, h20] using he
  exact he0_not_mem he0_mem
THEOREM dft8_preserves_norm · dftBasis_is_tick_eigenvector · IndisputableMonolith/Foundation/ComplexStructureForcing.lean
/-- **COROLLARY**: The DFT-8 preserves the norm: ‖F(f)‖² = ‖f‖². -/
theorem dft8_preserves_norm (f : Signal8) :
    inner8 (dft8 f) (dft8 f) = inner8 f f :=
  dft8_preserves_inner f f
/-- The local DFT vectors are tick eigenvectors over `ℂ`. -/
theorem dftBasis_is_tick_eigenvector (k : Fin 8) :
    shift (dftBasis k) = eigenvalue k • dftBasis k := by
  funext j
  simp only [shift, dftBasis, eigenvalue, nextIdx, Pi.smul_apply, smul_eq_mul]
  have hzk : (ζ ^ k.val) ^ 8 = 1 := by
    rw [← pow_mul, mul_comm, pow_mul, ζ_pow_8, one_pow]
  calc
    ζ ^ (k.val * ((j.val + 1) % 8))
        = (ζ ^ k.val) ^ ((j.val + 1) % 8) := by rw [← pow_mul]
    _ = (ζ ^ k.val) ^ ((j.val + 1) % 8 + 8 * ((j.val + 1) / 8)) := by
      rw [pow_add, pow_mul, hzk, one_pow, mul_one]
    _ = (ζ ^ k.val) ^ (j.val + 1) := by rw [Nat.mod_add_div]
    _ = ζ ^ (k.val * (j.val + 1)) := by rw [← pow_mul]
    _ = ζ ^ (k.val * j.val + k.val) := by rw [Nat.mul_succ]
    _ = ζ ^ k.val * ζ ^ (k.val * j.val) := by
      rw [pow_add]
      ring
THEOREM mode_cost_phase_invariant · IndisputableMonolith/Foundation/ComplexStructureForcing.lean
/-- **THEOREM (Mode Cost is Phase-Invariant)**:
    Rotating each mode by an independent phase does not change
    the total cost. This means the cost landscape has a U(1)⁸
    gauge symmetry in the mode basis.

    Combined with the norm constraint, this forces the dynamics
    to be unitary: any cost-preserving, norm-preserving linear
    map on ℂ⁸ is unitary. -/
theorem mode_cost_phase_invariant (f : Signal8) (phases : Fin 8 → ℝ) :
    totalModeCost f =
    totalModeCost (fun k => f k * Complex.exp (↑(phases k) * Complex.I)) := by
  simp only [totalModeCost]
  congr 1; ext k; congr 1
  rw [norm_mul, Complex.norm_exp_ofReal_mul_I, mul_one]

What this page does not claim

Complex numbers are physically observable entities. The declaration predicts new experimental results. The step from algebraic complexification to a physical claim about the universe is established.

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