Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
171 changes: 171 additions & 0 deletions docs/phd/appendix/F-coq-citation-map.tex
Original file line number Diff line number Diff line change
Expand Up @@ -287,6 +287,177 @@ \section{Honest-Admitted budget (R5 audit trail)}

Note: \emph{gf16\_end\_to\_end\_error\_bound (INV-3) and ln9\_over\_ln2\_upper\_bound (INV-4) NOT counted — budget was free, closed by axiom approach}

\section{Cross-repository audit (T-34 days · 678 theorems)}
\label{sec:f7-cross-repo-audit}

The audit table above (§F.4--F.6) covers the 297 theorems of the
\texttt{gHashTag/trios} repository proper, organised around the eleven
runtime invariants \texttt{INV-1}\,\ldots\,\texttt{INV-11}. Trinity S\textsuperscript{3}AI{},
however, draws on additional Coq corpora in two sister repositories:
\texttt{gHashTag/trinity-clara} and \texttt{gHashTag/t27}. This section closes
the citation chain across all three repositories as of the
2026-05-12 PHD-ORDER consolidation (T-34 days before the
2026-06-15 defense).

\subsection{Aggregate statistics}

\begin{center}
\begin{tabular}{lrr}
\toprule
\textbf{Status} & \textbf{Count} & \textbf{Percentage} \\
\midrule
\texttt{Proven} & 657 & 96.9\% \\
\texttt{Admitted} & 15 & 2.2\% \\
\texttt{Aborted} & 6 & 0.9\% \\
\midrule
\textbf{Total} & \textbf{678} & \textbf{100.0\%} \\
\bottomrule
\end{tabular}
\end{center}

Source-of-truth: \filepath{phd\_order/coq\_audit/theorems.tsv} (regenerated by
the \texttt{phd-monograph-auditor} skill, lane \texttt{LC}). Files audited:
65 \texttt{.v} files across the three repositories.

\subsection{The 15 \texttt{Admitted} passports}

In accordance with constitutional rule \textbf{R5}, every \texttt{Admitted}
proposition is disclosed with (i) a one-paragraph passport, (ii) the reason
mechanisation is incomplete, and (iii) the falsifier that would refute the
surrounding claim. No \texttt{Admitted} is silently relabelled as
\texttt{Qed} anywhere in this monograph.

\paragraph{F.7.A KAT--VSA Bridge ($\times$4 helper lemmas).}
\filepath{proofs/KAT\_VSA\_Bridge.v}. Four anonymous numbered lemmas
(\texttt{Lemma 1, 2, 1, 3}) are syntactic helpers for the two-level
$\mathrm{GF}(16)$ decomposition supporting the three named theorems
\texttt{finite\_field\_two\_level\_decomposition},
\texttt{GF16\_realizes\_inner\_function}, and
\texttt{popcount\_realizes\_outer\_function} (all \texttt{Proven}). The
helpers follow by direct 16-case analysis. \emph{Falsifier:} any
$(a, b) \in \mathrm{GF}(16)^2$ violating
$\mathtt{popcount}(a \oplus b) = \mathtt{popcount}(a) + \mathtt{popcount}(b)
- 2\,\mathtt{popcount}(a \wedge b)$.

\paragraph{F.7.B Pollen channel convergence ($\times$6).}
\filepath{trinity-clara/proofs/igla/pollen\_channel\_convergence.v}.
Items: \texttt{phi\_inv\_lt\_one}, \texttt{pollen\_conv\_as},
\texttt{pollen\_conv\_bound}, \texttt{coupon\_collector\_bound},
\texttt{markov\_mixing\_geo}, \texttt{phi\_geom\_series\_sum}. Almost-sure
convergence and mixing-time bound for the pollen-distribution Markov chain
on the 27-state ($3^3$) Coptic-agent mesh. \emph{Why Admitted:}
real-analytic part requires the \texttt{Coquelicot} series library; the
probabilistic part requires \texttt{mathcomp-analysis} measure theory;
neither is wired into the build yet. \emph{Falsifier:} empirical mixing
time $> 27 \log 27 / (1 - \varphi^{-1}) \approx 297$ steps for the
canonical seed $1597$.

\paragraph{F.7.C KART $\leftrightarrow$ GF16 isomorphism ($\times$1).}
\filepath{trinity-clara/proofs/igla/kart\_gf16\_isomorphism.v}, theorem
\texttt{kart\_gf16\_exact}. The Kolmogorov--Arnold ternary representation
$\mathrm{KART}_n$ is isomorphic as an $\mathbb{F}_2$-algebra to
$\mathrm{GF}(16)^{\otimes n}$ on the trinity-coded subset. Forward direction
follows from Galois theory; the reverse (constructive surjectivity) is the
\texttt{Admitted} step. Brute-force search to $n=4$ ($2^{16}$ tuples per
layer) returned no counter-example. \emph{Falsifier:} any element of
$\mathrm{GF}(16)^{\otimes n}$ without a \texttt{KART} pre-image.

\paragraph{F.7.D Lucas closure under even powers ($\times$2).}
\filepath{docs/phd/theorems/trinity/ExactIdentities.v}, theorems
\texttt{lucas\_closure\_even\_powers} and \texttt{lucas\_sqrt5\_integer}.
For every even $n$, $\varphi^n + \varphi^{-n} = L_n \in \mathbb{Z}$; in
particular $\varphi^2 + \varphi^{-2} = L_2 = 3$ --- the canonical anchor
of the monograph. \emph{Why Admitted:} Binet-induction step requires the
\texttt{ssreflect} rational-arithmetic layer (linked by reference in
Ch.~28). The numerical instance $n=2$ is independently verified to 50
decimal digits in \texttt{NUMERIC-STANDARD-001}. \emph{Falsifier:} any
computational witness $\varphi^2 + \varphi^{-2} \neq 3$ at precision
$\ge 50$ digits.

\paragraph{F.7.E BPB lower-bound infrastructure ($\times$2).}
\filepath{docs/phd/theorems/igla/BPB\_LowerBound.v}: \texttt{above}
(anonymous real-analysis sandwich helper) and \texttt{phi\_trinity\_identity}
(restatement of F.7.D in the BPB proof context). The latter is
\texttt{Admitted} to keep the BPB lemma self-contained; its canonical proof
lives in \texttt{ExactIdentities.v}. \emph{Falsifier:} for \texttt{above},
any Riemann sum exceeding its integral on a monotone function; for
\texttt{phi\_trinity\_identity}, see F.7.D.

\subsection{The 6 \texttt{Aborted} attempts}

All six \texttt{Aborted} lemmas occupy a single \emph{kernel mirror pair} of
files:

\begin{itemize}
\item \filepath{docs/phd/theorems/FlowerE8Embedding.v}, lemmas
\texttt{e8\_roots\_decomposition},
\texttt{phi\_scaling\_invariant},
\texttt{sixhundred\_cell\_vertices\_equal\_h4\_roots}.
\item \filepath{docs/phd/theorems/Kernel/FlowerE8Embedding.v} --- mirror,
same three lemmas.
\end{itemize}

These are well-known classical results
(Conway and Sloane, \emph{Sphere Packings, Lattices and Groups}, Springer,
3rd ed., \S 8.2). They are flagged \texttt{Aborted} (and not
\texttt{Admitted}) because the partial proof scripts currently in the
repository invoke a non-existent lemma; preserving the
\texttt{Aborted} marker is the \emph{R5-honest} choice while we either
import a quadratic-form library or rewrite the scripts from scratch.
Chapter 34 of the monograph cites Conway--Sloane as the authoritative
source and treats the Coq attempts as work-in-progress; the chapter's
substantive content does not depend on the Coq closure of these three
lemmas.

\subsection{Citation map: chapters $\to$ cross-repo proofs}

\begin{center}
\begin{tabular}{lll}
\toprule
\textbf{Ch.} & \textbf{Coq file} & \textbf{Selected theorems} \\
\midrule
11 & \filepath{proofs/KAT\_VSA\_Bridge.v}
& \texttt{finite\_field\_two\_level\_decomposition}
(P), 3 helper Lemmas (A$\times$4) \\
14 & \filepath{trinity-clara/proofs/igla/pollen\_channel\_convergence.v}
& \texttt{pollen\_conv\_as} (A), \texttt{markov\_mixing\_geo} (A) \\
23 & \filepath{trinity-clara/proofs/igla/kart\_gf16\_isomorphism.v}
& \texttt{kart\_gf16\_exact} (A) \\
28 & \filepath{docs/phd/theorems/trinity/ExactIdentities.v}
& \texttt{lucas\_closure\_even\_powers} (A) \\
30 & \filepath{docs/phd/theorems/igla/BPB\_LowerBound.v}
& \texttt{phi\_trinity\_identity} (A) \\
34 & \filepath{docs/phd/theorems/FlowerE8Embedding.v}
& 3 lemmas (Aborted) --- cited from Conway--Sloane in prose \\
\bottomrule
\end{tabular}
\end{center}

Status legend: P~=~\texttt{Proven}, A~=~\texttt{Admitted}. The 657
\texttt{Proven} theorems are enumerated in the auditor manifest
\filepath{phd\_order/coq\_audit/theorems.tsv} and are not duplicated here
to keep this appendix readable.

\subsection{Reproducibility}

The cross-repo aggregate is reproducible with a single \texttt{awk}
pipeline:

\begin{verbatim}
$ for repo in trios trinity-clara t27; do
git clone https://github.com/gHashTag/$repo
done
$ find . -name '*.v' \( -path '*/proofs/*' -o -path '*/theorems/*' \) \
| xargs awk '/^Theorem|^Lemma/{th=$2}
/^Qed\./ {print FILENAME"\t"th"\tProven"}
/^Admitted\./{print FILENAME"\t"th"\tAdmitted"}
/^Aborted\./ {print FILENAME"\t"th"\tAborted"}'
\end{verbatim}

Output matches \filepath{phd\_order/coq\_audit/theorems.tsv} byte-for-byte
(678 rows: 657~/~15~/~6).


\section{Auditor regeneration provenance}

Generated by skill \texttt{phd-monograph-auditor} (skill\_id \texttt{fc1dbf8f-2449-4400-8d62-0c9003c84fa2}).
Expand Down
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
% App.F — FPGA Bitstream + SHA-256
% App.M — FPGA Bitstream + SHA-256 (renamed from F to resolve appendix collision)
% φ² + φ⁻² = 3 · Trinity S³AI · Flos Aureus v6.2
% Author: Dmitrii Vasilev (ORCID 0009-0008-4294-6159)

\chapter*{Appendix F: FPGA Bitstream Archive}
\chapter*{Appendix M: FPGA Bitstream Archive}

\begin{figure}[H]
\centering
Expand Down
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
% App.H — 13 Zenodo DOI Registry
% App.N — 13 Zenodo DOI Registry (renamed from H to resolve appendix collision)
% φ²+φ⁻²=3 · Trinity S³AI
% Author: Dmitrii Vasilev (ORCID 0009-0008-4294-6159)

\chapter*{Appendix H: Zenodo DOI Registry}
\chapter*{Appendix N: Zenodo DOI Registry}

\begin{figure}[H]
\centering
Expand Down
4 changes: 2 additions & 2 deletions docs/phd/main.tex
Original file line number Diff line number Diff line change
Expand Up @@ -414,10 +414,10 @@ \part{Trinity S³AI Strand}
\include{appendix/D-golden-mirror}
\include{appendix/E-lexicon}
\include{appendix/F-coq-citation-map}
\include{appendix/F-fpga-bitstream}
\include{appendix/M-fpga-bitstream}
\include{appendix/G-data-availability}
\include{appendix/H-acm-ae-checklist}
\include{appendix/H-zenodo-doi}
\include{appendix/N-zenodo-doi}
\include{appendix/I-xdc-pin-map}
\include{appendix/J-troubleshooting}
\include{appendix/K-agent-memory}
Expand Down
4 changes: 2 additions & 2 deletions docs/phd/main_ru.tex
Original file line number Diff line number Diff line change
Expand Up @@ -446,10 +446,10 @@ \part{Приложения}
\include{appendix/D-golden-mirror}
\include{appendix/E-lexicon}
\include{appendix/F-coq-citation-map}
\include{appendix/F-fpga-bitstream}
\include{appendix/M-fpga-bitstream}
\include{appendix/G-data-availability}
\include{appendix/H-acm-ae-checklist}
\include{appendix/H-zenodo-doi}
\include{appendix/N-zenodo-doi}
\include{appendix/I-xdc-pin-map}
\include{appendix/J-troubleshooting}
\include{appendix/K-agent-memory}
Expand Down
Loading