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

Finite Factorization Pasting

Every E₁ object factors through finitely many primitive sector components; the E₁ content of α_p ∧ α_q = α_{p×q}

Payload

Finite Factorization Pasting

Every E₁ object factors through finitely many primitive sector components; the E₁ content of α_p ∧ α_q = α_{p×q}

Finite Factorization Pasting

Summary

Every E₁ object factors through finitely many primitive sector components; the E₁ content of α_p ∧ α_q = α_{p×q}

Statement

\label{thm:finite-factorization-pasting}
Let $X$ be an $\Elayer{1}$ object in $\operatorname{Cat}_{\T}(\Elayer{1})$ with NF address in the primorial tower at depth~$k$.  Then $X$ factors through finitely many primitive sector components:
\begin{equation}
\operatorname{Enr}_{01}(X) \;\cong\; \bigoplus_{S \in \{A, B, C, D\}} X_S,
\label{eq:ch50-finite-factorization}
\end{equation}
where each $X_S = \pi_S \circ \operatorname{Enr}_{01}(X)$ is the sector-$S$ component.  Moreover, the factorization is compatible with both the tower structure and the spectral structure:
\begin{enumerate}
\item\emph{(Tower.)} The restriction $\operatorname{res}_k(X_S) = (\operatorname{res}_k X)_S$ for every sector~$S$ and every primorial depth~$k$: the sector decomposition commutes with tower restriction.
\item\emph{(Spectral.)} The automorphic--Galois duality preserves the factorization: $\operatorname{AG}(\operatorname{Enr}_{01}(X)) = \prod_S \operatorname{AG}_S(X_S)$, where the product on the right runs over the primitive sectors.
\item\emph{(Finiteness.)} The number of non-trivial sector components is bounded: $|\{S : X_S \neq 0\}| \leq 4$, with equality when $X$ has non-trivial projection onto every primitive sector.
\end{enumerate}

Proof / Justification

No immediate manuscript proof block was extracted in this pilot run.

Source Context

  • Registry source: book-03.jsonl line 137
  • Manuscript source: 2nd-edition/book-iii-categorical-spectrum/02_mainmatter/part06/ch50-the-enriched-bi-square.tex lines 116-130

Lean / Formalization Notes

  • Formalization: formalized
  • Module: TauLib.BookIII.Arithmetic.EnrichedBiSquare
  • Name: finite_factorization_check

Dependencies

  • Canonical: III.D65

Generated by later projection phases.

Generated by later projection phases.

Revision Notes

  • 2026-04-24: Initial pilot migration.

Identifiers

  • Corpus ID cid001630
  • Primary alias THM0173
  • Type Theorem
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

III.T38finite-factorization-pastingthm:finite-factorization-pasting

Release lines

corpus_v3_workingcorpus_v2

Relations

Formalized by (1)

Appears in (1)

Downstream uses (computed) (2)

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

Sources

  • Monograph cid000024Book III, Part 6, Chapter 50 (Part VI)

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