fprd-afterword.tex

\clearpage
\hypertarget{afterword-fprd-labs-contribution}{%
\section*{Afterword: FPRD Lab's
contribution}\label{afterword-fprd-labs-contribution}}

An isomorphism between six-root quantum gluing modules

Methodological and contribution addendum. The paper's mathematical scope
and review status remain as stated in the paper.

\hypertarget{the-labs-approach}{%
\subsubsection*{The Lab's approach}\label{the-labs-approach}}

FPRD means \textbf{Finitely Presented Recognition Dynamics}. Its
starting point is to distinguish a finite description, the possibly
infinite process it generates, and what an observer can learn from that
process. Equal answers need not come from equal internal structures.
Conversely, an infinite state space may have a short, exact description
and useful coordinates; failure to compress it into finitely many states
need not end the investigation.

\hypertarget{a-small-example-balanced-parentheses}{%
\subsubsection*{A small example: balanced
parentheses}\label{a-small-example-balanced-parentheses}}

The grammar \texttt{S\ \ensuremath{\rightarrow}\ (S)S\ \textbar{}\ \ensuremath{\varepsilon}} presents the language of
balanced parentheses. To recognize a prefix, keep the number of
unmatched opening parentheses, or a failure state if a closing
parenthesis arrived too early. An opening parenthesis increments the
count. A closing parenthesis decrements a positive count; at zero it
enters failure. Failure persists. At the end, accept exactly when the
count is zero.

The prefixes \texttt{(} and \texttt{()(} leave the same future task: any
suffix that completes one completes the other. The prefix \texttt{((}
leaves a different task: \texttt{)} completes the first two prefixes but
not this one. These future tasks are \textbf{residuals}. There are
infinitely many counts, yet a finite set of update rules generates their
dynamics. This is a classical automata example, not a discovery of FPRD
Lab. It illustrates the research question: which coordinates preserve
all relevant futures, and what does updating or reading those
coordinates cost?

\hypertarget{from-viewpoint-to-proof}{%
\subsubsection*{From viewpoint to proof}\label{from-viewpoint-to-proof}}

In practice, the Lab fixes the observable and the allowed operations,
compares presentations of the same problem, and seeks an exact
translation or invariant. A failed shortcut is useful when a
counterexample identifies the missing coordinate or hypothesis. Small
computations test particular uncertainties; a proof must explain why the
result holds beyond those tests. Costs, relation sides, boundary
conditions, and the direction of each translation remain explicit.

AI-assisted exploration, source comparison, executable checks, and
adversarial reconstruction support this work. Their agreement is not
automatically independent evidence: shared assumptions must be exposed.
A formal development certifies its stated formal theorem, not every
interpretation attached to it. Each paper retains its own evidence and
review status.

The approach is most useful when a poor representation hides a reusable
construction, a compatibility condition, or a sharp obstruction. Outside
recognition theory, it can guide the search for a structural
reformulation without producing a literal residual dynamical system. The
account below distinguishes that methodological influence from the
ingredients of the proof.

\hypertarget{fprds-contribution-to-this-paper}{%
\subsubsection*{FPRD's contribution to this
paper}\label{fprds-contribution-to-this-paper}}

The target was an exact comparison of two presentations. Chen and
Kricker had a surjection from a six-root presentation to an image inside
a larger quotient. The missing statement was that passing through the
larger algebra introduces no extra relations among the shape
coordinates.

The Lab recast that issue as an intersection equality: the visible
relation module must equal the intersection of the ambient relation
module with the shape torus. This keeps the target fixed. Defining the
desired image by the smaller presentation would have assumed precisely
what needed proof.

The argument combines reversible local normalization with a lattice
grading whose zero component is the shape torus. Projection onto that
component respects multiplication on both sides by shape elements. Once
the ambient relations have the required normalized form, this bimodule
property recovers the full intersection. It replaces a search through
triangulations or link configurations with a structural statement about
the presentation.

Keeping relation sides was essential. These are mixed-sided module
quotients, not automatically two-sided algebra quotients. The proof also
retains all six roots and the disclosed coefficient ring. A source
wording inconsistency is handled by stating the chosen
right-tetrahedron/left-edge convention explicitly, rather than silently
changing the question.

\hypertarget{inherited-ingredients-and-the-boundary-of-the-contribution}{%
\subsubsection*{Inherited ingredients and the boundary of the
contribution}\label{inherited-ingredients-and-the-boundary-of-the-contribution}}

Chen--Kricker supply the conjecture, comparison map, and a local
calculation refined here. Panitch--Park supply the ambient presentation
used to check conventions. Existing trace-comparison results provide the
consequences for the named traces. Lattice gradings and projection onto
degree zero are established algebraic tools; the contribution is showing
that the actual quantum-torus lattice and normalized relation module
satisfy their required hypotheses.

Exact ordered-monomial and Weyl-basis calculations check finite
algebraic identities by different implementations. The
arbitrary-triangulation conclusion comes from the lattice and
intersection arguments, not from sampling triangulations. No
proof-assistant formalization or external peer review is claimed.

This is a direct example of the Lab's structural-translation approach,
although it is not a language-residual automaton. The isomorphism does
not itself prove that either target is nonzero, that a quantum trace is
injective, or that the Dehn-filling conjecture is solved. Those are
distinct questions with distinct obligations.

\textbf{Where to inspect the contribution:}
\href{https://fprd-lab.joshgay.chatgpt.site/publications/ck-degree-zero-descent}{the
paper, Sections 2--6 and 8.3}, including the mixed-sided intersection
lemma, lattice projection, and exact-verification limits.