Corpus definition canonical 2026-05-27T20:53:50+00:00
Corpus v3 · Definition cid001033DEF0031canonicalv1

Greedy Peel Algorithm

Greedy peel-off: (1) find A = largest prime dividing X, (2) find C = maximal tetration height, (3) find B = maximal exponent, (4) D = remainder. Deterministic and terminating.

Payload

Greedy Peel Algorithm

Greedy peel-off: (1) find A = largest prime dividing X, (2) find C = maximal tetration height, (3) find B = maximal exponent, (4) D = remainder. Deterministic and terminating.

Greedy Peel Algorithm

Summary

Greedy peel-off: (1) find A = largest prime dividing X, (2) find C = maximal tetration height, (3) find B = maximal exponent, (4) D = remainder. Deterministic and terminating.

Statement

%
\label{def:greedy-peel}
Given $X \in \tau\text{-Idx}$ with $X \geq \underline{2}$,
the \textbf{greedy peel-off} extracts the ABCD coordinates
as follows:
\begin{enumerate}
    \item \textbf{Find $A$ (largest prime divisor):}
          Let $\underline{A}$ be the largest prime
          dividing $X$.
    \item \textbf{Find $C$ (maximal tetration height):}
          Let $\underline{C}$ be the largest
          $\underline{c} \geq \underline{1}$ such that
          $(\underline{A} \uparrow\uparrow \underline{c})
          \mid X$.
    \item \textbf{Find $B$ (maximal exponent):}
          Let $\underline{B}$ be the largest
          $\underline{b} \geq \underline{1}$ such that
          $(\underline{A} \uparrow\uparrow \underline{C})^{\underline{b}}
          \mid X$.
    \item \textbf{Compute $D$ (remainder):}
          Set $\underline{D} = X \;/\;
          (\underline{A} \uparrow\uparrow \underline{C})^{\underline{B}}$.
\end{enumerate}
The output is the tuple
$\Phi(X) = (\underline{A}, \underline{B},
\underline{C}, \underline{D})$.

Proof / Justification

This item is definitional. No manuscript proof is required.

Source Context

  • Registry source: book-01.jsonl line 55
  • Manuscript source: 2nd-edition/book-i-categorical-foundations/02_mainmatter/part04/ch17-tower-atoms-peel.tex lines 177-204

Lean / Formalization Notes

  • Formalization: formalized
  • Module: TauLib.BookI.Coordinates.TowerAtoms
  • Name: Tau.Coordinates.greedy_peel

Dependencies

  • Canonical: I.D19c, I.T09

Generated by later projection phases.

Generated by later projection phases.

Revision Notes

  • 2026-04-24: Initial pilot migration.

Identifiers

  • Corpus ID cid001033
  • Primary alias DEF0031
  • Type Definition
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

I.D19dgreedy-peel-algorithmdef:greedy-peel

Release lines

corpus_v3_workingcorpus_v2

Relations

Appears in (1)

Sources

  • Monograph cid000023Book I, Part 4, Chapter 17 (Part IV)

Version & History

  • v1 · 2026-05-10 imported from v2 registry

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