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

Bridge Axiom

A bridge is a structure-preserving functor F: Cat_τ(E₂) → Mod(ZFC) satisfying carrier preservation, predicate preservation, decoder compatibility, and invariant reflection. The existence of such F is conjectural.

Payload

Bridge Axiom

A bridge is a structure-preserving functor F: Cat_τ(E₂) → Mod(ZFC) satisfying carrier preservation, predicate preservation, decoder compatibility, and invariant reflection. The existence of such F is conjectural.

Bridge Axiom

Summary

A bridge is a structure-preserving functor F: Cat_τ(E₂) → Mod(ZFC) satisfying carrier preservation, predicate preservation, decoder compatibility, and invariant reflection. The existence of such F is conjectural.

Statement

%
\label{def:bridge-axiom}
A \textbf{bridge} from Category~$\T$ to ZFC is a functor
\begin{equation}\label{eq:ch67-bridge-functor}
F \colon \operatorname{Cat}_{\T}(\Elayer{2})
\;\longrightarrow\; \mathbf{Mod}(\mathrm{ZFC})
\end{equation}
satisfying four properties.
\begin{enumerate}
\item\emph{(i) Carrier preservation.}
For every $\T$-object $X$ with NF address
$a_{X} \in \hat{\mathbb{Z}}_{\T}$,
$F(X)$ is a ZFC-definable set.
If $X \neq Y$ and neither lies
in the kernel of any forbidden move $M_{i}$
(Definition~\ref{def:five-forbidden-moves}),
then $F(X) \ncong F(Y)$.

\item\emph{(ii) Predicate preservation.}
If $\varphi$ is $\T$-derivable, then $F(\varphi)$ is ZFC-derivable:
$\T \vdash \varphi \;\Longrightarrow\;
\mathrm{ZFC} \vdash F(\varphi)$.
The converse does not hold: ZFC may derive statements
whose $\T$-preimages involve forbidden moves.

\item\emph{(iii) Decoder compatibility.}
The bridge interleaves the two address systems:
\[
\begin{tikzcd}[column sep=large]
\operatorname{Cat}_{\T}(\Elayer{2})
    \ar[r, "F"]
    \ar[d, "\mathrm{NF}"']
& \mathbf{Mod}(\mathrm{ZFC})
    \ar[d, "{\ulcorner\cdot\urcorner}"] \\
\hat{\mathbb{Z}}_{\T}
    \ar[r, "\phi"']
& \mathbb{N}
\end{tikzcd}
\]
commutes up to the decoder map
$\phi \colon \hat{\mathbb{Z}}_{\T} \to \mathbb{N}$,
which sends NF addresses
to G\"odel numbers of the corresponding ZFC-translations.

\item\emph{(iv) Invariant reflection.}
The bridge maps the $\T$-invariant (primorial coherence)
to a sub-statement of the ZFC-invariant (consistency):
$F(\mathrm{Coh}_{\T}) \vdash
\mathrm{Con}(\mathrm{ZFC} \!\upharpoonright\! \operatorname{Im}(F))$.
\end{enumerate}
The bridge is \emph{lossy}:
$\T$-structures with no ZFC counterpart
(primorial tower, earned enrichment, ABCD decomposition)
are projected away;
ZFC-structures with no $\T$-counterpart
(unbounded powerset, global choice)
are absent from $\operatorname{Im}(F)$.

Proof / Justification

This item is definitional. No manuscript proof is required.

Source Context

  • Registry source: book-03.jsonl line 176
  • Manuscript source: 2nd-edition/book-iii-categorical-spectrum/02_mainmatter/part10/ch67-the-bridge-axiom.tex lines 58-116

Lean / Formalization Notes

  • Formalization: formalized
  • Module: TauLib.BookIII.Bridge.BridgeAxiom
  • Name: bridge_functor_exists

Dependencies

  • Canonical: III.D67, III.D69

Generated by later projection phases.

Generated by later projection phases.

Revision Notes

  • 2026-04-24: Initial pilot migration.

Identifiers

  • Corpus ID cid001516
  • Primary alias DEF0286
  • Type Definition
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

III.D71bridge-axiomdef:bridge-axiom

Release lines

corpus_v3_workingcorpus_v2

Relations

Formalized by (3)

Appears in (1)

Downstream uses (computed) (6)

Items in the corpus that reference this one via load-bearing relations. Computed from the full corpus-v3 graph at build time.

Sources

  • Monograph cid000024Book III, Part 10, Chapter 67 (Part IX)

Version & History

  • v1 · 2026-05-10 imported from v2 registry
  • v1 · 2026-05-10 wired formalized by in wave 5

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