Corpus theorem canonical 2026-05-27T20:53:50+00:00
Corpus v3 · Theorem cid001182THM0016canonicalv1

Spectral Decomposition

Every element of L decomposes uniquely into B-sector and C-sector components via characters. The profinite topology on Z_hat_tau provides the convergence framework.

Payload

Spectral Decomposition

Every element of L decomposes uniquely into B-sector and C-sector components via characters. The profinite topology on Z_hat_tau provides the convergence framework.

Spectral Decomposition

Summary

Every element of L decomposes uniquely into B-sector and C-sector components via characters. The profinite topology on Z_hat_tau provides the convergence framework.

Statement

%
\label{thm:spectral-decomposition}
Let $\mathbb{L} = H_\tau = \hat{\mathbb{Z}}_\tau[j]$
be the algebraic lemniscate
(Theorem~\ref{thm:algebraic-lemniscate}).
For every element $x \in \mathbb{L}$,
there exist unique elements
$\alpha, \beta \in \hat{\mathbb{Z}}_\tau$
such that:
\[
    \boxed{%
    x = \alpha \cdot e_+ + \beta \cdot e_-
    = \chi_+(x) \cdot e_+ + \chi_-(x) \cdot e_-.}
\]
The coefficients are:
\begin{align*}
    \alpha &= \chi_+(x) = a + b, \\
    \beta  &= \chi_-(x) = a - b,
\end{align*}
where $x = a + bj$ with $a, b \in \hat{\mathbb{Z}}_\tau$.
This decomposition is:
\begin{enumerate}
    \item \textbf{Canonical}:
          it depends only on the algebraic structure of $\mathbb{L}$,
          not on any choice of basis or coordinate system.
    \item \textbf{Orthogonal}:
          the $e_+$ and $e_-$ components do not interact
          ($e_+ \cdot e_- = 0$).
    \item \textbf{Complete}:
          $e_+ + e_- = 1$, so no information is lost.
    \item \textbf{Multiplicative}:
          $\chi_\pm(xy) = \chi_\pm(x) \cdot \chi_\pm(y)$
          for all $x, y \in \mathbb{L}$.
\end{enumerate}

Proof / Justification

\textbf{Existence.}
Let $x = a + bj \in \hat{\mathbb{Z}}_\tau[j]$.
By Proposition~\ref{prop:idempotent-decomposition}
(Chapter~\ref{ch:split-complex-scalars}),
\[
    x = (a + b) e_+ + (a - b) e_-.
\]
Setting $\alpha = a + b$ and $\beta = a - b$
gives the decomposition.
These are precisely the character evaluations:
$\chi_+(x) = a + b$ and $\chi_-(x) = a - b$
(Definition~\ref{def:lemniscate-characters}).

\textbf{Uniqueness.}
Suppose $x = \alpha' e_+ + \beta' e_-$
for some $\alpha', \beta' \in \hat{\mathbb{Z}}_\tau$.
Multiplying both sides by $e_+$:
\[
    x \cdot e_+ = \alpha' e_+^2 + \beta' e_- e_+
    = \alpha' e_+ + 0
    = \alpha' e_+.
\]
But also $x \cdot e_+ = (a + b) e_+$ from the computation
in Proposition~\ref{prop:idempotent-decomposition}.
Since $e_+ \neq 0$,
and $\hat{\mathbb{Z}}_\tau$ acts faithfully
on each idempotent sector,
we conclude $\alpha' = a + b = \alpha$.
Similarly, $\beta' = a - b = \beta$.

\textbf{Multiplicativity.}
Let $x = a + bj$ and $y = c + dj$.
Then $xy = (ac + bd) + (ad + bc)j$, and:
\begin{align*}
    \chi_+(xy)
    &= (ac + bd) + (ad + bc) \\
    &= (a + b)(c + d) \\
    &= \chi_+(x) \cdot \chi_+(y).
\end{align*}
The computation for $\chi_-$ is analogous:
$\chi_-(xy) = (a - b)(c - d) = \chi_-(x) \cdot \chi_-(y)$.

\textbf{Additivity} follows similarly:
$\chi_\pm(x + y) = \chi_\pm(x) + \chi_\pm(y)$.
Thus $\chi_+$ and $\chi_-$ are ring homomorphisms,
confirming their character property.

Source Context

  • Registry source: book-01.jsonl line 89
  • Manuscript source: 2nd-edition/book-i-categorical-foundations/02_mainmatter/part11/ch44-spectral-decomposition.tex lines 57-92

Lean / Formalization Notes

  • Formalization: formalized
  • Module: TauLib.BookI.Boundary.Spectral
  • Name: Tau.Boundary.spectral_decomposition

Dependencies

  • Canonical: I.D37, I.D38, I.D19

Generated by later projection phases.

Generated by later projection phases.

Revision Notes

  • 2026-04-24: Initial pilot migration.

Identifiers

  • Corpus ID cid001182
  • Primary alias THM0016
  • Type Theorem
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

I.T12spectral-decompositionthm:spectral-decomposition

Release lines

corpus_v3_workingcorpus_v2

Relations

Formalized by (2)

Appears in (1)

Downstream uses (computed) (4)

Items in the corpus that reference this one via load-bearing relations. Computed from the full corpus-v3 graph at build time.

Sources

  • Monograph cid000023Book I, Part 11, Chapter 44 (Part XI)

Version & History

  • v1 · 2026-05-10 imported from v2 registry
  • v1 · 2026-05-10 wired formalized by in wave 5

Status disclaimer

A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.

Save or share this page for inspection

Download a portable dossier, copy a reviewer note, or send this page to someone who can inspect it.

Email to expert