THM0033canonicalv1Cartesian Closed
E_tau is cartesian closed: Hom(A x B, C) <-> Hom(A, C^B) pointwise. The evaluation morphism (Q^P x P) -> Q is verified. Internal hom with terminal/initial satisfies expected identities.
Payload
Cartesian Closed
E_tau is cartesian closed: Hom(A x B, C) <-> Hom(A, C^B) pointwise. The evaluation morphism (Q^P x P) -> Q is verified. Internal hom with terminal/initial satisfies expected identities.
Cartesian Closed
Summary
E_tau is cartesian closed: Hom(A x B, C) <-> Hom(A, C^B) pointwise. The evaluation morphism (Q^P x P) -> Q is verified. Internal hom with terminal/initial satisfies expected identities.
Statement
%
\label{thm:cartesian-closed}
The earned topos
$\mathcal{E}_\tau = \mathrm{PSh}(\mathrm{Cat}_\tau)$
(Definition~\ref{def:earned-topos}, I.D59)
is a \textbf{cartesian closed category}.
That is, for all presheaves $A$, $P$, $Q$
in $\mathcal{E}_\tau$:
\begin{enumerate}
\item The internal hom $Q^P$
(Definition~\ref{def:internal-hom}, I.D64)
is an object of $\mathcal{E}_\tau$.
\item The exponential adjunction holds naturally:
\[
\boxed{%
\Hom_{\mathcal{E}_\tau}(A \times P,\; Q)
\;\cong\;
\Hom_{\mathcal{E}_\tau}(A,\; Q^P).}
\]
\item The evaluation morphism
$\mathrm{ev} : Q^P \times P \to Q$
is universal:
every $\varphi : A \times P \to Q$
factors uniquely as
$\varphi = \mathrm{ev} \circ (\tilde{\varphi} \times \id_P)$
for a unique $\tilde{\varphi} : A \to Q^P$.
\end{enumerate}
Proof / Justification
\textbf{Step 1: $Q^P$ is a presheaf.}
Definition~\ref{def:internal-hom} assigns to each $X$
the set $(Q^P)(X) = \mathrm{Nat}(y(X) \times P, Q)$.
The restriction maps are defined by precomposition,
and functoriality follows from
$y(g \circ f) = y(g) \circ y(f)$.
Thus $Q^P : \mathrm{Cat}_\tau^{\mathrm{op}} \to \mathrm{Set}$
is a well-defined presheaf.
\textbf{Step 2: The currying bijection.}
Given a natural transformation
$\varphi : A \times P \Rightarrow Q$,
define for each $X$ the map
$\tilde{\varphi}_X : A(X) \to (Q^P)(X)$
as follows.
For $a \in A(X)$,
consider the element $a$ as inducing
a morphism $y(X) \to A$
via Yoneda
(Theorem~\ref{thm:yoneda-lemma}, I.T23).
Then $\tilde{\varphi}_X(a)$ is the composite:
\[
y(X) \times P
\xrightarrow{\;a \times \id_P\;}
A \times P
\xrightarrow{\;\varphi\;}
Q.
\]
This defines a natural transformation
$\tilde{\varphi} : A \Rightarrow Q^P$.
Conversely, given $\psi : A \Rightarrow Q^P$,
set $\varphi := \mathrm{ev} \circ (\psi \times \id_P)$.
These two maps are mutually inverse.
In the thin setting,
the bijection simplifies further.
Both sides are subterminal:
$\Hom(A \times P, Q) \in \{\varnothing, \{*\}\}$
and $\Hom(A, Q^P) \in \{\varnothing, \{*\}\}$.
The condition $A \times P \leq Q$
(i.e., $\mathrm{supp}(A) \cap \mathrm{supp}(P) \subseteq \mathrm{supp}(Q)$)
is equivalent to
$\mathrm{supp}(A) \subseteq \mathrm{supp}(Q^P)$,
which holds by the support formula
(Remark~\ref{rem:internal-hom-supports}).
\textbf{Step 3: Naturality.}
Both in $A$ (by Yoneda)
and in $P$, $Q$ (by the universal property
of the product), the bijection is natural.
Source Context
- Registry source:
book-01.jsonlline 146 - Manuscript source:
2nd-edition/book-i-categorical-foundations/02_mainmatter/part15/ch59-internal-hom.texlines 261-289
Lean / Formalization Notes
- Formalization:
formalized - Module:
TauLib.BookI.Topos.InternalHom - Name:
Tau.Topos.cartesian_closed_adj
Dependencies
- Canonical: I.D64, I.D60, I.T26
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
I.T28cartesian-closedthm:cartesian-closedRelease 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.