PRP0088canonicalv1Earned Admissibility
Characters (W=1), identity (W=0), successor (W=1) are admissible. Composition sub-additive: W(g∘f) ≤ W(f)+W(g). CRT product: W = max. The admissible functions form a compositionally closed class.
Payload
Earned Admissibility
Characters (W=1), identity (W=0), successor (W=1) are admissible. Composition sub-additive: W(g∘f) ≤ W(f)+W(g). CRT product: W = max. The admissible functions form a compositionally closed class.
Earned Admissibility
Summary
Characters (W=1), identity (W=0), successor (W=1) are admissible. Composition sub-additive: W(g∘f) ≤ W(f)+W(g). CRT product: W = max. The admissible functions form a compositionally closed class.
Statement
\label{prop:earned-admissibility}
The following hold:
\begin{enumerate}
\item \textbf{Characters.}
The boundary characters $\chi_+ = \tfrac{1}{2}(1 + \jj)$ and
$\chi_- = \tfrac{1}{2}(1 - \jj)$ are $\tau$-admissible with
$W(\chi_\pm) = 1$.
\item \textbf{Identity.}
The identity function $\id$ is $\tau$-admissible with $W(\id) = 0$.
\item \textbf{Successor.}
The successor map $\rho(x) = x + 1$ is $\tau$-admissible with
$W(\rho) = 1$.
\item \textbf{Composition.}
If $f$ and $g$ are $\tau$-admissible, then $g \circ f$ is $\tau$-admissible with
\begin{equation}\label{eq:ch56-composition-width}
W(g \circ f) \;\leq\; W(f) + W(g).
\end{equation}
\item \textbf{CRT product.}
If $f_1, \ldots, f_k$ are $\tau$-admissible with widths $W(f_i) = w_i$,
then the CRT product $f_1 \times \cdots \times f_k$
(acting componentwise on the CRT decomposition) is $\tau$-admissible with
\begin{equation}\label{eq:ch56-crt-product-width}
W(f_1 \times \cdots \times f_k) \;=\; \max_{1 \leq i \leq k} w_i.
\end{equation}
\end{enumerate}
Consequently, the $\tau$-admissible functions form a compositionally closed class.
Proof / Justification
No immediate manuscript proof block was extracted in this pilot run.
Source Context
- Registry source:
book-03.jsonlline 151 - Manuscript source:
2nd-edition/book-iii-categorical-spectrum/02_mainmatter/part09/ch56-interface-width-and-tau-admissibility.texlines 274-301
Lean / Formalization Notes
- Formalization:
formalized - Module:
TauLib.BookIII.Computation.Admissibility - Name:
earned_admissibility_check
Dependencies
- Canonical: III.D54, III.T31
Related Results
Generated by later projection phases.
Related Publications
Generated by later projection phases.
Revision Notes
- 2026-04-24: Initial pilot migration.
Identifiers
Aliases & legacy IDs
III.P21earned-admissibilityprop:earned-admissibilityRelease lines
corpus_v3_workingcorpus_v2Relations
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
Version & History
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.