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

Point Set Well-Defined

The tau-admissible point set is well-defined: the five constraint conditions (prime, non-negativity, remainder, primorial, depth) are jointly satisfiable for all primes from 2 to 20, producing a non-empty finite set at each stage.

Payload

Point Set Well-Defined

The tau-admissible point set is well-defined: the five constraint conditions (prime, non-negativity, remainder, primorial, depth) are jointly satisfiable for all primes from 2 to 20, producing a non-empty finite set at each stage.

Point Set Well-Defined

Summary

The tau-admissible point set is well-defined: the five constraint conditions (prime, non-negativity, remainder, primorial, depth) are jointly satisfiable for all primes from 2 to 20, producing a non-empty finite set at each stage.

Statement

%
\label{thm:point-set-well-defined}
The set
\[
    \boxed{\tau^3
    \;:=\;
    \tau^3_{\mathrm{fin}}
    \;\cup\;
    \tau^3_{\mathrm{lim}}}
\]
is a well-defined set satisfying:
\begin{enumerate}
    \item[\textup{(1)}] \textbf{Finite part.}
          $\tau^3_{\mathrm{fin}}$ is in bijection
          with $\Obj(\tau)$ via the ABCD chart~$\Phi$
          (Hyperfactorization, I.T04).
    \item[\textup{(2)}] \textbf{Limit part.}
          $\tau^3_{\mathrm{lim}}$ is non-empty:
          the primorial tower produces
          at least one limit point
          (Proposition~\ref{prop:ch04-limit-nonempty}).
    \item[\textup{(3)}] \textbf{Closure under reduction.}
          $\tau^3$ is closed under the CRT reduction maps:
          for every point $x \in \tau^3$ and every stage~$k$,
          the stage-$k$ projection
          $\pi_k(x)$
          is a well-defined $\tau$-admissible point.
\end{enumerate}

Proof / Justification

\emph{Clause~(1).}
By Proposition~\ref{prop:ch04-bijection},
every $n \in \tau\text{-Idx}_{\geq 2}$
maps to a unique $\tau$-admissible quadruple
$\Phi(n) \in \tau^3_{\mathrm{fin}}$,
and conversely,
every element of $\tau^3_{\mathrm{fin}}$
with $A \geq 2$ determines a unique index.
The two degenerate points are handled
by the convention of
Definition~\ref{def:tau-admissible-point}.
Hence $\tau^3_{\mathrm{fin}} \cong \Obj(\tau)$.

\emph{Clause~(2).}
Proposition~\ref{prop:ch04-limit-nonempty}
exhibited the primorial tower
$\{\Phi(P_k)\}_{k \geq 1}$
as a non-eventually-constant coherent family.

\emph{Clause~(3).}
For a finite point $\Phi(n) \in \tau^3_{\mathrm{fin}}$,
the stage-$k$ projection is
$\Phi(n \bmod P_k)$,
which is a well-defined finite $\tau$-admissible point
(the normal-form decomposition of $n \bmod P_k$
satisfies constraints (C1)--(C5)
since $n \bmod P_k \geq 0$ is a valid index).
For a limit point
$\{(A_k, B_k, C_k, D_k)\}_{k \geq 1}
\in \tau^3_{\mathrm{lim}}$,
the stage-$k$ projection is
$(A_k, B_k, C_k, D_k)$ by definition,
which is $\tau$-admissible by the coherence condition.
The tower compatibility
$\pi_{k,l} \circ \pi_{l,m} = \pi_{k,m}$
(CRT coherence, I.T18)
ensures that the projections are self-consistent.

Source Context

  • Registry source: book-02.jsonl line 7
  • Manuscript source: 2nd-edition/book-ii-categorical-holomorphy/02_mainmatter/part01/ch04-tau-admissible-points.tex lines 441-470

Lean / Formalization Notes

  • Formalization: formalized
  • Module: TauLib.BookII.Interior.TauAdmissible
  • Name: Tau.BookII.Interior.admissible_2_to_20

Dependencies

  • Canonical: II.D02, II.D03, I.T04, I.T18

Generated by later projection phases.

Generated by later projection phases.

Revision Notes

  • 2026-04-24: Initial pilot migration.

Identifiers

  • Corpus ID cid001363
  • Primary alias THM0067
  • Type Theorem
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

II.T01point-set-well-definedthm:point-set-well-defined

Release lines

corpus_v3_workingcorpus_v2

Relations

Appears in (1)

Sources

  • Monograph cid000001Book II, Part 1, Chapter 4 (Part I)

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