Pith. sign in
module module high

IndisputableMonolith.Mathematics.ComplexNumbers

show as:
view Lean formalization →

Mathematics.ComplexNumbers supplies the complex-number infrastructure for the eight phases of the recognition tick cycle. Researchers modeling the eight-tick octave cite it when phase rotations or roots of unity appear. The module proceeds through successive definitions and lemmas that first introduce tickPhase, then demonstrate the necessity of complex structure over the reals.

claimThe eight phases of the tick cycle are the eighth roots of unity in $\mathbb{C}$, represented by the map tickPhase that assigns to each phase index $k$ the value $\exp(2\pi i k/8)$.

background

The module imports Mathlib for complex arithmetic and IndisputableMonolith.Constants, whose sole documented object is the fundamental RS time quantum: "The fundamental RS time quantum (RS-native). $\tau_0 = 1$ tick."

It therefore works in the setting where time is discrete in ticks and the cycle length is fixed at eight ticks. The sibling declarations introduce tickPhase, show that the phases are roots of unity and equally spaced, prove that the reals admit no nontrivial rotation, and establish that complex numbers are required for phases, quantum mechanics, and Fourier transforms.

proof idea

This is a definition module, no proofs. It consists of a chain of definitions (tickPhase, phasor) followed by lemmas that successively rule out real-only models and affirm the complex representation needed for the eight-phase cycle.

why it matters in Recognition Science

The module supplies the phase machinery required by the eight-tick octave (T7) in the forcing chain. It directly supports the sibling results on quantum mechanics and Fourier analysis that appear later in the same file; those results in turn feed higher-level statements about the recognition cycle.

scope and limits

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (21)