Chapter 3 · Dimensional Operators

Overview

Each dimensional operator $O_i$ is a smooth map that advances the system from phase $D_i$ to $D_{i+1 mod 12}$. Its action on the dimensional field is given by a $12 imes12$ matrix $A_i = P^i + u_i w_i^T$: a permutation matrix (the base structure) plus a rank-1 correction (the phase-specific adjustment). The rank-1 correction is what allows each operator to be distinct while sharing the permutation skeleton.

Definitions 3.1–3.6

Definition 3.1 — Dimensional Operator

$O_i : D_i o D_{i+1 mod 12}$

(i) $O_i$ maps $D_i$ into $D_{i+1 mod 12}$; (ii) $\Delta(O_i(x)) = A_i \Delta(x)$; (iii) $|\Delta(O_i(x))| = |\Delta(x)|$.

(i) $O_i$ mapeia $D_i$ em $D_{i+1 mod 12}$; (ii) $\Delta(O_i(x)) = A_i \Delta(x)$; (iii) norm-preserving.

O_i(D_i) ⊆ D_{i+1 mod 12} Δ(O_i(x)) = A_i Δ(x) |A_i Δ(x)| = |Δ(x)|

Definition 3.2 — Phase Advance

$O_i(D_i) \subseteq D_{i+1 mod 12}$. Each operator advances the phase by exactly one step.

O_i(D_i) ⊆ D_{i+1 mod 12}

Definition 3.3 — Operator Matrix

$A_i = P^i + u_i w_i^T$ where $P$ is the $12 imes12$ cyclic permutation matrix, $u_i, w_i \in \mathbb{R}^{12}$ with $\|u_i w_i^T\| \leq arepsilon^* = 1/3$. The bound on the rank-1 correction is the stability radius in matrix form.

A_i = P^i + u_i w_i^T, ‖u_i w_i^T‖ ≤ ε* = 1/3

Definitions 3.4–3.6 — Cycle, Cycle Map, Cumulative Matrix

A cycle is a sequence $(x, O_1(x), O_2(O_1(x)), \ldots)$ of 12 steps returning to phase $D_1$. The cycle map $R = O_{12} \circ \cdots \circ O_1$. The cumulative matrix $A^{(n)} = A_n \cdots A_1$ tracks the composed linear action over $n$ steps.

R = O₁₂ ∘ ⋯ ∘ O₁   (12-step cycle map = Emergence operator E)
A^(n) = Aₙ ⋯ A₁   (cumulative matrix action)

The 12 Operators — Full Table

Idx	Name	Base	Invariant	Source → Target	‖u_i w_i^T‖	σ_min(A_i⊥)
O₁	Compression–Orthogonality	C	I₁	D₁ → D₂	≤ ε*	≥ 2/3
O₂	Compression–Nilpotency	C	I₂	D₂ → D₃	≤ ε*	≥ 2/3
O₃	Compression–Spectral	C	I₃	D₃ → D₄	≤ ε*	≥ 2/3
O₄	Curvature–Orthogonality	K	I₁	D₄ → D₅	≤ ε*	≥ 2/3
O₅	Curvature–Nilpotency	K	I₂	D₅ → D₆	≤ ε*	≥ 2/3
O₆	Curvature–Spectral	K	I₃	D₆ → D₇	≤ ε*	≥ 2/3
O₇	Fold–Orthogonality	F	I₁	D₇ → D₈	≤ ε*	≥ 2/3
O₈	Fold–Nilpotency	F	I₂	D₈ → D₉	≤ ε*	≥ 2/3
O₉	Fold–Spectral	F	I₃	D₉ → D₁₀	≤ ε*	≥ 2/3
O₁₀	Unfold–Orthogonality	U	I₁	D₁₀ → D₁₁	≤ ε*	≥ 2/3
O₁₁	Unfold–Nilpotency	U	I₂	D₁₁ → D₁₂	≤ ε*	≥ 2/3
O₁₂	Unfold–Spectral	U	I₃	D₁₂ → D₁	≤ ε*	≥ 2/3

The bound $\sigma_{\min}(A_i^\perp) \geq 2/3$ is the minimum singular value of $A_i$ restricted to the perpendicular complement. This lower bound, together with the rank-1 norm bound $\|u_i w_i^T\| \leq arepsilon^* = 1/3$, is the key quantitative input for the Orthogonality Theorem (Chapter 5) and the Pythagorean contraction estimate (Chapter 6).

Why Rank-1 Corrections

The permutation matrix $P^i$ alone would make all twelve operators identical up to relabelling — the system would be purely cyclic with no ability to distinguish phases. The rank-1 correction $u_i w_i^T$ is the minimal perturbation that breaks this symmetry while preserving norm: $\|A_i \Delta(x)\| = \|\Delta(x)\|$ for all $x$. Rank-1 means one degree of freedom per operator — the simplest possible non-trivial perturbation. This is why GTCT has a constructive realization: the corrections are explicit, computable, and bounded by $arepsilon^* = 1/3$.