Renamed Graphs

This commit is contained in:
Samy Avrillon 2024-08-16 00:59:15 +02:00
parent 17d3a5b0d8
commit 86dd4ec900
Signed by: Mysaa
GPG Key ID: 0220AC4A3D6A328B
22 changed files with 70 additions and 47 deletions

View File

@ -104,9 +104,9 @@
The category $\BB$ is equipped with a forgetful functor $R$ to $\BB_0$, the category of models of the two-sort sort specification $(\mathcal{O},\El)$. The category $\BB$ is equipped with a forgetful functor $R$ to $\BB_0$, the category of models of the two-sort sort specification $(\mathcal{O},\El)$.
\begin{center} \begin{center}
% YADE DIAGRAM G1-0.json % YADE DIAGRAM GlobalConstructionSimple.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/G1-0.tex} \input{graphs/GlobalConstructionSimple.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -156,9 +156,9 @@
Here is a figure that describes the recursive construction of some of the above objects Here is a figure that describes the recursive construction of some of the above objects
\begin{center} \begin{center}
% YADE DIAGRAM G1.json % YADE DIAGRAM GlobalRecursiveConstruction.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/G1.tex} \input{graphs/GlobalRecursiveConstruction.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -334,9 +334,9 @@
A morphism $X \to X'$ of $\BB_i$ is a morphism $f : R_{i-1}^iX \to R_{i-1}^iX'$ in $\BB_{i-1}$ such that the following diagram commutes. A morphism $X \to X'$ of $\BB_i$ is a morphism $f : R_{i-1}^iX \to R_{i-1}^iX'$ in $\BB_{i-1}$ such that the following diagram commutes.
\begin{center} \begin{center}
% YADE DIAGRAM D1.json % YADE DIAGRAM BiMorphismDiagram.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D1.tex} \input{graphs/BiMorphismDiagram.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -351,9 +351,9 @@
The adjunction $F_i \vdash G_i$ is built using the two functors from the adjunction $F_{i-1} \vdash G_{i-1}$ defined in the previous induction step. We use them to define the first part of the adjunction, and we compose them with two adjoint functors $W$ and $E$ that we will define in this section. The overall construction for this induction step is as follows: The adjunction $F_i \vdash G_i$ is built using the two functors from the adjunction $F_{i-1} \vdash G_{i-1}$ defined in the previous induction step. We use them to define the first part of the adjunction, and we compose them with two adjoint functors $W$ and $E$ that we will define in this section. The overall construction for this induction step is as follows:
\begin{center} \begin{center}
% YADE DIAGRAM G2.json % YADE DIAGRAM InductionStepDiagram.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/G2.tex} \input{graphs/InductionStepDiagram.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -403,9 +403,9 @@
It is indeed a morphism of $\BB_{i}$ as it makes the following diagram commute. It is indeed a morphism of $\BB_{i}$ as it makes the following diagram commute.
\begin{center} \begin{center}
% YADE DIAGRAM D2.json % YADE DIAGRAM WghMorphismOfBi.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D2.tex} \input{graphs/WghMorphismOfBi.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -420,18 +420,18 @@
Where $(A,h)$ is defined as the following pullback: Where $(A,h)$ is defined as the following pullback:
\begin{center} \begin{center}
% YADE DIAGRAM D3a.json % YADE DIAGRAM EDefinitionPullback.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D3a.tex} \input{graphs/EDefinitionPullback.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
The action on a morphism $f$ from $X$ to $X'$ is defined as $E(f) = (R_{i-1}^i f, !)$, with $!$ being the only morphism making the following diagram commute (thanks to the pullback property): The action on a morphism $f$ from $X$ to $X'$ is defined as $E(f) = (R_{i-1}^i f, !)$, with $!$ being the only morphism making the following diagram commute (thanks to the pullback property):
\begin{center} \begin{center}
% YADE DIAGRAM D3b.json % YADE DIAGRAM EDefinitionMorphism.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D3b.tex} \input{graphs/EDefinitionMorphism.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -464,11 +464,12 @@
The second component is defined through the universal property of the pullback defined by $E(Z)$ according to the following diagram: The second component is defined through the universal property of the pullback defined by $E(Z)$ according to the following diagram:
\begin{center} \begin{center}
% YADE DIAGRAM D6.json % YADE DIAGRAM PhiXYZSndComponentPullback.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D6.tex} \input{graphs/PhiXYZSndComponentPullback.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center}
\end{center}
\subsubsection{Constructing $\phi^{-1}_{XYZ}$} \subsubsection{Constructing $\phi^{-1}_{XYZ}$}
@ -485,20 +486,22 @@
Where $\square$ is a morphism $K_{H_iF_{i-1}} (X,Y) \to R_0^i Z$ in $\TSet$ defined by the following diagram: Where $\square$ is a morphism $K_{H_iF_{i-1}} (X,Y) \to R_0^i Z$ in $\TSet$ defined by the following diagram:
\begin{center} \begin{center}
% YADE DIAGRAM D7.json % YADE DIAGRAM PhiXYZ-1Square.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D7.tex} \input{graphs/PhiXYZ-1Square.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center}
\end{center}
Finally, we check that $\phi^{-1}_{XYZ}(g,h)$ is a morphism of $\BB_i$ from $W(X,Y)$ to $Z$, i.e. that it makes the following diagram commute: Finally, we check that $\phi^{-1}_{XYZ}(g,h)$ is a morphism of $\BB_i$ from $W(X,Y)$ to $Z$, i.e. that it makes the following diagram commute:
\begin{center} \begin{center}
% YADE DIAGRAM D8.json % YADE DIAGRAM PhiXYZ-1MorphismOfBi.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D8.tex} \input{graphs/PhiXYZ-1MorphismOfBi.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center}
\end{center}
In order to complete this proof, we need to show that In order to complete this proof, we need to show that
\begin{itemize} \begin{itemize}
@ -544,9 +547,9 @@
It is a morphism of $\BB_i$ as it makes the following diagram commute: It is a morphism of $\BB_i$ as it makes the following diagram commute:
\begin{center} \begin{center}
% YADE DIAGRAM D4.json % YADE DIAGRAM TlInj1MorphismOfBi.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D4.tex} \input{graphs/TlInj1MorphismOfBi.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -564,9 +567,9 @@
We define $\{g ; h\}_i = \{R_{i-1}^i g ; h\}_{i-1}$. This is a morphism of $\BB_i$ as it makes the following diagram commute: We define $\{g ; h\}_i = \{R_{i-1}^i g ; h\}_{i-1}$. This is a morphism of $\BB_i$ as it makes the following diagram commute:
\begin{center} \begin{center}
% YADE DIAGRAM D5.json % YADE DIAGRAM TlUniversalMorphismIsOfBi.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D5.tex} \input{graphs/TlUniversalMorphismIsOfBi.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -774,9 +777,9 @@
A morphism from $(X,\Cstr)$ to $(X', \Cstr')$ is a morphism from $X$ to $X'$ in $\TSet$ (i.e. a natural transformation $X \implies X'$) which makes the following diagram commute, for all $a$ in $S_{i-1}$. A morphism from $(X,\Cstr)$ to $(X', \Cstr')$ is a morphism from $X$ to $X'$ in $\TSet$ (i.e. a natural transformation $X \implies X'$) which makes the following diagram commute, for all $a$ in $S_{i-1}$.
\begin{center} \begin{center}
% YADE DIAGRAM D1.json % YADE DIAGRAM BiMorphismDiagram.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D1.tex} \input{graphs/BiMorphismDiagram.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -840,11 +843,12 @@
The second component of $\phi_{XYZ} (\phi_{XYZ}^{-1}(g,h))$ follows the following diagram The second component of $\phi_{XYZ} (\phi_{XYZ}^{-1}(g,h))$ follows the following diagram
\begin{center} \begin{center}
% YADE DIAGRAM D9.json % YADE DIAGRAM CompositionSecondComponent.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D9.tex} \input{graphs/CompositionSecondComponent.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center}
\end{center}
\todo{Justifier que la partie du haut commute, i.e. que \[ \todo{Justifier que la partie du haut commute, i.e. que \[
@ -863,9 +867,9 @@
where $\square$ follows the following diagram where $\square$ follows the following diagram
\begin{center} \begin{center}
% YADE DIAGRAM D10.json % YADE DIAGRAM CompositionSquareConstruction.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D10.tex} \input{graphs/CompositionSquareConstruction.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -883,9 +887,9 @@
We want to show that the following diagram commutes, for any objects $X$,$Y$,$Z$,$X'$,$Y'$,$Z'$ and morphisms $f$,$g$,$h$. We want to show that the following diagram commutes, for any objects $X$,$Y$,$Z$,$X'$,$Y'$,$Z'$ and morphisms $f$,$g$,$h$.
\begin{center} \begin{center}
% YADE DIAGRAM D10.0.json % YADE DIAGRAM NaturalityDiagram.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D10.0.tex} \input{graphs/NaturalityDiagram.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -904,9 +908,9 @@
The second components are defined as described by the following diagram The second components are defined as described by the following diagram
\begin{center} \begin{center}
% YADE DIAGRAM D11.json % YADE DIAGRAM NaturalityDoublePullbackDefinition.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/D11.tex} \input{graphs/NaturalityDoublePullbackDefinition.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -934,35 +938,35 @@
Where $(A,h)$ is the pullback defined as Where $(A,h)$ is the pullback defined as
\begin{center} \begin{center}
% YADE DIAGRAM E1.json % YADE DIAGRAM ReflectionFGPullback.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/E1.tex} \input{graphs/ReflectionFGPullback.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
We can extend this pullback with the two isomorphisms $\en_0^i$ and $H_iF_{i-1}(\inj_\tl^{i-1})$ in another pullback. This new pullback is over the injection morphism $\inj_2$ of the coproduct of $\TSet$, so the new pullback object is the second component of the $\bullet \oplus B$ i.e. $B$. We can extend this pullback with the two isomorphisms $\en_0^i$ and $H_iF_{i-1}(\inj_\tl^{i-1})$ in another pullback. This new pullback is over the injection morphism $\inj_2$ of the coproduct of $\TSet$, so the new pullback object is the second component of the $\bullet \oplus B$ i.e. $B$.
\begin{center} \begin{center}
% YADE DIAGRAM E2.json % YADE DIAGRAM ReflectionFGExtendedPullback.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/E2.tex} \input{graphs/ReflectionFGExtendedPullback.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
The first component of the isomorphism is the following isomorphism, where $\eta_{i-1}^{FG}$ if the counit of the adjunction $F_{i-1} \vdash G_{i-1}$, that we know to be an isomorphism from the induction hypothesis. The first component of the isomorphism is the following isomorphism, where $\eta_{i-1}^{FG}$ if the counit of the adjunction $F_{i-1} \vdash G_{i-1}$, that we know to be an isomorphism from the induction hypothesis.
\begin{center} \begin{center}
% YADE DIAGRAM E3.json % YADE DIAGRAM ReflectionFGIsomorphismFirst.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/E3.tex} \input{graphs/ReflectionFGIsomorphismFirst.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
And the second component is made using the isomorphism constructed by the pullback, that makes the diagram commute. And the second component is made using the isomorphism constructed by the pullback, that makes the diagram commute.
\begin{center} \begin{center}
% YADE DIAGRAM E4.json % YADE DIAGRAM ReflectionFGIsomorphismSecond.json
% GENERATED LATEX % GENERATED LATEX
\input{graphs/E4.tex} \input{graphs/ReflectionFGIsomorphismSecond.tex}
% END OF GENERATED LATEX % END OF GENERATED LATEX
\end{center} \end{center}
@ -1073,6 +1077,26 @@

View File

@ -1 +0,0 @@
{"graph":{"latexPreamble":"\\newcommand\\ensuremath[1]{#1}\n\\newcommand\\BB{{\\ensuremath{\\mathcal{B}}}}\n\\newcommand\\TT{{\\ensuremath{\\mathcal{T}}}}\n\\newcommand\\UU{{\\ensuremath{\\mathcal{U}}}}\n\\newcommand\\El{{\\ensuremath{\\operatorname{\\mathcal{E}l}}}}\n\\newcommand\\ii{{\\ensuremath{\\mathbf{i}}}}\n\\newcommand\\Cstr{{\\ensuremath{\\operatorname{\\mathcal{C}str}}}}\n\\newcommand\\Set{{\\ensuremath{\\operatorname{\\mathcal{S}et}}}}\n\\newcommand\\Hom{{\\ensuremath{\\operatorname{\\mathcal{H}om}}}}\n\\newcommand\\this{{\\ensuremath{\\operatorname{\\texttt{this}}}}}\n\\newcommand\\Hbar{{\\ensuremath{\\overline{H}}}}\n\\newcommand\\dash{{\\;\\textrm{---}\\;}}\n\n\\newcommand\\inj{\\operatorname{inj}}\n\\newcommand\\id{\\operatorname{id}}","tabs":[{"active":true,"edges":[{"from":1,"id":4,"label":{"kind":"normal","label":"\\Gamma","style":{"alignment":"left","bend":0,"color":"black","dashed":false,"head":"default","kind":"normal","position":0.5,"tail":"none"},"zindex":0},"to":0},{"from":2,"id":5,"label":{"kind":"normal","label":"A","style":{"alignment":"left","bend":0,"color":"black","dashed":false,"head":"default","kind":"normal","position":0.5,"tail":"none"},"zindex":0},"to":1},{"from":2,"id":6,"label":{"kind":"normal","label":"\\Delta","style":{"alignment":"right","bend":0.20000000000000004,"color":"black","dashed":false,"head":"default","kind":"normal","position":0.5,"tail":"none"},"zindex":0},"to":0}],"nodes":[{"id":0,"label":{"isMath":true,"label":"\\Con","pos":[100,100],"zindex":0}},{"id":1,"label":{"isMath":true,"label":"\\Ty","pos":[300,100],"zindex":0}},{"id":2,"label":{"isMath":true,"label":"\\Tm","pos":[500,100],"zindex":0}},{"id":3,"label":{"isMath":true,"label":"\\circlearrowleft","pos":[302,76.8125],"zindex":0}}],"sizeGrid":200,"title":"1"}]},"version":12}