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

Saturation at E₃

E₄ = E₃: the enrichment ladder saturates at exactly four levels. The 4-orbit closure of ρ under ABCD decomposition means no fifth orbit exists. Therefore [E₃^op, E₃] ⊆ E₃ — the functor category collapses back, and the ω-absorber mechanism prevents escape.

Payload

Saturation at E₃

E₄ = E₃: the enrichment ladder saturates at exactly four levels. The 4-orbit closure of ρ under ABCD decomposition means no fifth orbit exists. Therefore [E₃^op, E₃] ⊆ E₃ — the functor category collapses back, and the ω-absorber mechanism prevents escape.

Saturation at E₃

Summary

E₄ = E₃: the enrichment ladder saturates at exactly four levels. The 4-orbit closure of ρ under ABCD decomposition means no fifth orbit exists. Therefore [E₃^op, E₃] ⊆ E₃ — the functor category collapses back, and the ω-absorber mechanism prevents escape.

Statement

%
\label{thm:saturation-e3}
The self-enrichment ladder of Category~$\tau$
has exactly four layers:
\[
    E_0 \;\subsetneq\; E_1 \;\subsetneq\;
    E_2 \;\subsetneq\; E_3,
    \qquad
    E_4 = E_3.
\]
The first three inclusions are strict
(each layer contains genuinely new structure).
The fourth step collapses:
$[E_3^{\op}, E_3] \subseteq E_3$,
so $E_4 = E_3$.
The enrichment ladder is complete.

Proof / Justification

The proof assembles three components.

\medskip
\textbf{Step~1: Strictness.}
Each inclusion $E_k \subsetneq E_{k+1}$
for $k = 0, 1, 2$ is strict.
This was proved in Chapters~4--6:
$E_1$ contains split-complex-enriched Hom~objects
absent from~$E_0$;
$E_2$ contains discrete rational carriers
absent from~$E_1$;
$E_3$ contains self-referential codes
absent from~$E_2$.

\medskip
\textbf{Step~2: Collapse.}
The functor category $[E_3^{\op}, E_3]$
contains no objects of genuinely new structural type
(Proposition~\ref{prop:functor-collapse}).
The obstruction is the Ontic Closure Theorem (I.T01):
the five generators produce exactly four orbit channels,
and any fifth channel factors through
the $\omega$-absorber.
The Ladder Saturation Theorem (I.T02)
translates this orbit closure
into a statement about canonical injectivity:
pentation --- the operation that would populate
a fifth level --- lacks the structural scaffold
for type distinction.

\medskip
\textbf{Step~3: Identity.}
Since $E_4 = [E_3^{\op}, E_3] \subseteq E_3$
and $E_3 \subseteq E_4$
(every object of $E_3$ is in particular
a constant presheaf in $[E_3^{\op}, E_3]$),
we have $E_4 = E_3$.

Source Context

  • Registry source: book-03.jsonl line 18
  • Manuscript source: 2nd-edition/book-iii-categorical-spectrum/02_mainmatter/part01/ch07-saturation-at-e3.tex lines 500-517

Lean / Formalization Notes

  • Formalization: formalized
  • Module: TauLib.BookIII.Enrichment.CanonicalLadder
  • Name: saturation_e3_8_3

Dependencies

  • Canonical: III.D09, III.P02

Generated by later projection phases.

Generated by later projection phases.

Revision Notes

  • 2026-04-24: Initial pilot migration.

Identifiers

  • Corpus ID cid001595
  • Primary alias THM0138
  • Type Theorem
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

III.T03saturation-at-ethm:saturation-e3

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 cid000024Book III, Part 1, Chapter 7 (Part I)

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