-
Notifications
You must be signed in to change notification settings - Fork 3
/
slides-duesseldorf2017.tex
1605 lines (1359 loc) · 58 KB
/
slides-duesseldorf2017.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
\documentclass[12pt,utf8,notheorems,compress,t]{beamer}
\usepackage{etex}
\usepackage[english]{babel}
\usepackage{mathtools}
%\newcommand{\vcentcolon}{:}
\usepackage{booktabs}
\usepackage{array}
\usepackage{ragged2e}
\usepackage{multicol}
\usepackage{tabto}
\usepackage{xstring}
\usepackage{soul}\setul{0.3ex}{}
\usepackage[all]{xy}
\xyoption{rotate}
\usepackage{tikz}
\usetikzlibrary{calc,shapes.callouts,shapes.arrows}
\hypersetup{colorlinks=true}
\usepackage[protrusion=true,expansion=true]{microtype}
\setlength\parskip{\medskipamount}
\setlength\parindent{0pt}
\title{First steps in synthetic algebraic geometry}
\author{Ingo Blechschmidt}
\date{July 21st, 2017}
\useinnertheme[shadow=true]{rounded}
\useoutertheme{split}
\usecolortheme{orchid}
\usecolortheme{whale}
\setbeamerfont{block title}{size={}}
\useinnertheme{rectangles}
\usecolortheme{seahorse}
\definecolor{mypurple}{RGB}{150,0,255}
\setbeamercolor{structure}{fg=mypurple}
\definecolor{myred}{RGB}{150,0,0}
\setbeamercolor*{title}{bg=myred,fg=white}
\setbeamercolor*{titlelike}{bg=myred,fg=white}
\usefonttheme{serif}
\usepackage[T1]{fontenc}
\usepackage{libertine}
\newcommand{\A}{\mathcal{A}}
\renewcommand{\AA}{\mathbb{A}}
\newcommand{\E}{\mathcal{E}}
\newcommand{\F}{\mathcal{F}}
\renewcommand{\G}{\mathcal{G}}
\newcommand{\GG}{\mathbb{G}}
\renewcommand{\O}{\mathcal{O}}
\newcommand{\K}{\mathcal{K}}
\newcommand{\NN}{\mathbb{N}}
\newcommand{\RR}{\mathbb{R}}
\newcommand{\PP}{\mathbb{P}}
\newcommand{\ZZ}{\mathbb{Z}}
\renewcommand{\P}{\mathcal{P}}
\newcommand{\ppp}{\mathfrak{p}}
\newcommand{\defeq}{\vcentcolon=}
\newcommand{\defeqv}{\vcentcolon\equiv}
\newcommand{\Sh}{\mathrm{Sh}}
\newcommand{\GL}{\mathrm{GL}}
\newcommand{\Zar}{\mathrm{Zar}}
\newcommand{\op}{\mathrm{op}}
\newcommand{\Set}{\mathrm{Set}}
\newcommand{\Sch}{\mathrm{Sch}}
\newcommand{\Aff}{\mathrm{Aff}}
\newcommand{\LRS}{\mathrm{LRS}}
\newcommand{\Hom}{\mathrm{Hom}}
\DeclareMathOperator{\Spec}{Spec}
\newcommand{\lra}{\longrightarrow}
\newcommand{\RelSpec}{\operatorname{Spec}}
\renewcommand{\_}{\mathpunct{.}}
\newcommand{\?}{\,{:}\,}
\newcommand{\speak}[1]{\ulcorner\text{\textnormal{#1}}\urcorner}
\newcommand{\ull}[1]{\underline{#1}}
\newcommand{\affl}{\ensuremath{{\ull{\AA}^1}}}
\newcommand{\Ll}{\vcentcolon\!\Longleftrightarrow}
\setbeamertemplate{blocks}[rounded][shadow=false]
\newcommand{\fmini}[2]{\framebox{\begin{minipage}{#1}#2\end{minipage}}}
\makeatletter
\def\underunbrace#1{\mathop{\vtop{\m@th\ialign{##\crcr
$\hfil\displaystyle{#1}\hfil$\crcr\noalign{\kern3\p@\nointerlineskip}
\crcr\noalign{\kern3\p@}}}}\limits}
\def\overunbrace#1{\mathop{\vbox{\m@th\ialign{##\crcr\noalign{\kern3\p@}
\crcr\noalign{\kern3\p@\nointerlineskip}
$\hfil\displaystyle{#1}\hfil$\crcr}}}\limits}
\makeatother
\newenvironment{changemargin}[2]{%
\begin{list}{}{%
\setlength{\topsep}{0pt}%
\setlength{\leftmargin}{#1}%
\setlength{\rightmargin}{#2}%
\setlength{\listparindent}{\parindent}%
\setlength{\itemindent}{\parindent}%
\setlength{\parsep}{\parskip}%
}%
\item[]}{\end{list}}
\newcommand{\pointthis}[2]{%
\tikz[remember picture,baseline]{\node[anchor=base,inner sep=0,outer sep=0]%
(#1) {#1};\node[overlay,rectangle callout,%
callout relative pointer={(0.5cm,0.5cm)},fill=blue!20] at ($(#1.north)+(-1.1cm,-1.1cm)$) {#2};}%
}%
\newcommand{\hcancel}[5]{%
\tikz[baseline=(tocancel.base)]{
\node[inner sep=0pt,outer sep=0pt] (tocancel) {#1};
\draw[red, line width=0.4mm] ($(tocancel.south west)+(#2,#3)$) -- ($(tocancel.north east)+(#4,#5)$);
}%
}
\newcommand{\slogan}[1]{%
\begin{center}%
\setlength{\fboxrule}{2pt}%
\setlength{\fboxsep}{8pt}%
{\usebeamercolor[fg]{item}\fbox{\usebeamercolor[fg]{normal text}\parbox{0.93\textwidth}{#1}}}%
\end{center}%
}
\newcommand{\sloganwithoutborder}[1]{%
\begin{center}%
\setlength{\fboxrule}{0pt}%
\setlength{\fboxsep}{-14pt}%
{\usebeamercolor[fg]{item}\fbox{\usebeamercolor[fg]{normal
text}\parbox{0.9\textwidth}{\begin{center}#1\end{center}}}}%
\end{center}%
}
\setbeamertemplate{frametitle}{%
\vskip0.7em%
\leavevmode%
\begin{beamercolorbox}[dp=1ex,center]{}%
\usebeamercolor[fg]{item}{\textbf{{\Large \insertframetitle}}}
\end{beamercolorbox}%
}
\setbeamertemplate{navigation symbols}{}
\newcounter{framenumberpreappendix}
\newcommand{\backupstart}{
\setcounter{framenumberpreappendix}{\value{framenumber}}
}
\newcommand{\backupend}{
\addtocounter{framenumberpreappendix}{-\value{framenumber}}
\addtocounter{framenumber}{\value{framenumberpreappendix}}
}
\setbeamertemplate{footline}{%
\begin{beamercolorbox}[wd=\paperwidth,ht=2.25ex,dp=1ex,right,rightskip=1mm,leftskip=1mm]{}%
\inserttitle \hfill
\insertframenumber\,/\,\inserttotalframenumber
\end{beamercolorbox}%
\vskip0pt%
}
\newcommand{\hil}[1]{{\usebeamercolor[fg]{item}{\textbf{#1}}}}
\IfSubStr{\jobname}{\detokenize{nonotes}}{
\setbeameroption{hide notes}
}{
\setbeameroption{show notes}
}
\setbeamertemplate{note page}[plain]
\setbeameroption{hide notes}
\begin{document}
\addtocounter{framenumber}{-1}
\begin{frame}[c]
\centering
\includegraphics[scale=0.3]{images/external-internal-small}
\medskip
\hil{First steps in \\ synthetic algebraic geometry}
\medskip
\scriptsize
Ingo Blechschmidt \\
University of Augsburg
\medskip
Oberseminar Algebra/Geometrie/Topologie \\
Heinrich-Heine-Universität Düsseldorf \\
\ \\
July 21st, 2017
\par
\end{frame}
\backupstart
{\usebackgroundtemplate{\includegraphics[width=\paperwidth]{images/unterbacher-see}}
\begin{frame}[plain]
\vspace{\textheight}\vspace{-0em}
\centering
\textcolor{white}{\emph{Camping at Unterbacher See}} \\
\par
\end{frame}}
% Orally: Laws of reasoning do not only apply to ordinary mathematical objects.
% They also apply to mathematical objects of different toposes. By cleverly
% choosing those topos, we can pretend that ...
\frame[t]{\frametitle{Quick summary}
By employing the internal language of toposes in various ways, you can
pretend that:
\begin{enumerate}
\item Reduced rings are Noetherian and in fact fields.
\item Sheaves of modules are plain modules.
\item Schemes are sets: \[ \PP^2_S = \{
[x_0\mathbin{:}x_1\mathbin{:}x_2] \,|\, x_0 \neq 0 \vee x_1 \neq 0 \vee x_2 \neq
0 \}. \]
\end{enumerate}
}
% Any theorem automatically yields infinitely new theorems; sometimes, these
% are useful, and sometimes, they are indeed very nice.
%\frame[t]{\frametitle{Outline}\small
% \begin{columns}[t]
% \begin{column}{0.6\textwidth}
% \vspace*{-1.5em}
% \begin{itemize}\item[]\tableofcontents\end{itemize}
% \par
% \end{column}
% \begin{column}{0.4\textwidth}
% \centering
% \begin{minipage}{0.70\textwidth}
% \begin{exampleblock}{}
% \justifying
% Any finitely generated vector space does \emph{not not} possess a basis.
% \end{exampleblock}
% \end{minipage}
% \medskip
%
% \scalebox{3}{$\Downarrow$}
%
% \begin{minipage}{0.70\textwidth}
% \begin{exampleblock}{}
% \justifying
% Any sheaf of modules of finite type on a reduced scheme is locally free
% \emph{on a dense open subset}.
% \end{exampleblock}
% \centering
% \tiny Ravi Vakil: ``Important hard exercise'' (13.7.K).
% \par
% \end{minipage}
% \end{column}
% \end{columns}
%}
%
%\note{\justifying\fontsize{8pt}{9.6}\selectfont
% \begin{center}\large\textbf{Abstract}\end{center}
%
% \begin{changemargin}{2.5em}{2.5em}
% (new abstract)
% \end{changemargin}
%}
\section[Internal language]{The internal language of toposes}
\subsection{What is a topos?}
\frame[t]{\frametitle{What is a topos?}
\begin{block}{Formal definition}A \hil{topos} is a category which has finite limits,
is cartesian closed and has a subobject classifier.
\end{block}
\begin{block}{Motto}A topos is a category which is sufficiently rich to support
an \hil{internal language}.
\end{block}
\begin{block}{Examples}\begin{itemize}
\item \hil{$\Set$:} \tabto{1.4cm} category of sets
\item \hil{$\Sh(X)$:} \tabto{1.4cm} category of set-valued sheaves on a space~$X$
\item \hil{$\Zar(S)$:} \tabto{1.4cm} big Zariski topos of a base scheme~$S$
\end{itemize}\end{block}
\note{
\begin{itemize}
\item \begin{justify}While technically correct, the formal definition is actually
misleading in a sense: A topos has lots of other vital structure, which
is crucial for a rounded understanding, but is not listed in the
definition (which is trimmed for minimality).
A more comprehensive definition is: A \emph{topos} is a locally cartesian
closed, finitely complete and cocomplete Heyting category which is exact,
extensive and has a subobject classifier.\end{justify}
\item See~\cite{leinster:topos} for a leisurely introduction to topos
theory.
\end{itemize}
}
}
\subsection{What is the internal language?}
\frame[t]{\frametitle{What is the internal language?}
The internal language of a topos~$\E$ allows to
\begin{enumerate}
\item construct objects and morphisms of the topos,
\item formulate statements about them and
\item prove such statements
\end{enumerate}
in a \hil{naive element-based} language:
\begin{center}
\small
\begin{tabular}{ll}
\toprule
externally & internally to $\E$ \\
\midrule
object of~$\E$ & set \\
morphism in~$\E$ & map of sets \\
monomorphism & injective map \\
epimorphism & surjective map \\
group object & group \\
\bottomrule
\end{tabular}
\end{center}
}
\frame[t]{\frametitle{The internal language of~$\boldsymbol{\Sh(X)}$}
\small
Let~$X$ be a topological space. Then we recursively define
\[ U \models \varphi \quad \text{(``$\varphi$ holds on~$U$'')} \]
for open subsets~$U \subseteq X$ and formulas~$\varphi$.
% Write~``$\Sh(X) \models \varphi$'' to mean~$X \models \varphi$.
\pause
\[ \renewcommand{\arraystretch}{1.25}\begin{array}{@{}l@{\ }c@{\ }l@{}}
U \models f = g \? \F &\Ll& f|_U = g|_U \in \F(U) \\
U \models \varphi \wedge \psi &\Ll&
\text{$U \models \varphi$ and $U \models \psi$} \\
U \models \varphi \vee \psi &\Ll&
\hcancel{\text{$U \models \varphi$ or $U \models \psi$}}{0pt}{3pt}{0pt}{-2pt} \\
&& \text{there exists a covering $U = \bigcup_i U_i$ s.\,th. for all~$i$:} \\
&& \quad\quad \text{$U_i \models \varphi$ or $U_i \models \psi$} \\
U \models \varphi \Rightarrow \psi &\Ll&
\text{for all open~$V \subseteq U$: }
\text{$V \models \varphi$ implies $V \models \psi$} \\
U \models \forall f \? \F\_ \varphi(f) &\Ll&
\text{for all sections~$f \in \F(V), V \subseteq U$: $V \models
\varphi(f)$} \\
U \models \exists f \? \F\_ \varphi(f) &\Ll&
\text{there exists a covering $U = \bigcup_i U_i$ s.\,th. for all~$i$:} \\
&& \quad\quad \text{there exists~$f_i \in \F(U_i)$ s.\,th.
$U_i \models \varphi(f_i)$}
\end{array} \]
}
\note{\fontsize{8pt}{9.6}\selectfont
\begin{itemize}
\item Special case: The language of~$\Set$ is the usual mathematical language.
\item \begin{justify}Actually, the objects of~$\E$ feel more like \emph{types} instead of \emph{sets}:
For instance, there is no global membership relation~$\in$. Rather,
for each object~$A$ of~$\E$, there is a relation~${\in_A} : A \times \P(A) \to
\Omega$, where~$\P(A)$ is the power object of~$A$ and~$\Omega$ is the
object of truth values of~$\E$ (can be understood as the power object of
a terminal object).\end{justify}
\item \begin{justify}Compare with the embedding theorem for abelian categories:
There, an explicit embedding into a category of modules is constructed.
Here, we only change perspective and talk about the same objects and
morphisms.\end{justify}
\item \begin{justify}There exists a weaker variant of the internal language which works
in abelian categories. By using it, one can even pretend that the objects
are abelian groups (instead of modules), and when constructing morphisms
by appealing to the axiom of unique choice (which is a theorem), one
doesn't even have to check linearity. The proof that this approach
works uses only categorical logic.\end{justify}
\item \begin{justify}For expositions of the internal language,
see Chapters~D1 to~D4 of the Elephant, Chapter~VI of Moerdijk and Mac
Lane's book, or Chapter~13 of
\href{https://www.mathematik.tu-darmstadt.de/~streicher/CTCL.pdf}{these
lecture notes by Thomas Streicher}.\end{justify}
\end{itemize}
}
\note{\begin{itemize}\justifying
\item The internal language of a sheaf topos of a $\mathrm{T}_1$-space is
\emph{classical} (that is, verifies the principle of excluded middle) if and
only if the space is discrete. That's a not particularly interesting special
case.
\item See Section~2.4 of
\href{https://rawgit.com/iblech/internal-methods/master/notes.pdf}{these
notes} for remarks on how to appreciate intuitionistic logic.
\end{itemize}}
\note{
\begin{itemize}
\item \begin{justify}The rules are called \emph{Kripke--Joyal semantics} and can be
formulated over any topos (not just sheaf toposes). They are not all
arbitrary: Rather, they are very finely concerted to make the crucial
properties about the internal language (see next slide) true.\end{justify}
\item \begin{justify}If~$\F$ is an object of~$\Sh(X)$, we write
``$f:\F$'' instead of~``$f\in\F$'' to remind us that~$\F$ is not really
(externally) a set consisting of elements, but that we only pretend this
by using the internal language.\end{justify}
\item There are two further rules concerning the constants~$\top$
and~$\bot$ (truth resp. falsehood):
\[ \renewcommand{\arraystretch}{1.3}\begin{array}{@{}lcl@{}}
U \models \top &\Ll& U = U \text{ (always fulfiled)}\\
U \models \bot &\Ll& U = \emptyset
\end{array} \]
\item Negation is defined as
$\neg\varphi :\equiv (\varphi \Rightarrow \bot)$.
\item \begin{justify}The alternate definition ``$U \models \varphi \vee \psi :\Leftrightarrow
\text{$U \models \varphi$ or $U \models \psi$}$'' would not be local (cf.
next slide).\end{justify}
\end{itemize}
}
\note{
\begin{itemize}
\item Let~$\alpha : \F \to \G$ be a morphism of sheaves on~$X$. Then:
\begin{align*}
& X \models \speak{$\alpha$ is injective} \\[0.5em]
\Longleftrightarrow\
& X \models \forall s,t\?\F\_ \alpha(s) = \alpha(t) \Rightarrow s = t \\[0.5em]
\Longleftrightarrow\ &
\text{for all open~$U \subseteq X$, sections $s, t \in \F(U)$:} \\
&\qquad\qquad
U \models \alpha(s) = \alpha(t) \Rightarrow s = t \\[0.5em]
\Longleftrightarrow\ &
\text{for all open~$U \subseteq X$, sections $s, t \in \F(U)$:} \\
&\qquad\qquad
\text{for all open~$V \subseteq U$:} \\
&\qquad\qquad\qquad\qquad
\text{$\alpha_V(s|_V) = \alpha_V(t|_V)$ implies $s|_V = t|_V$} \\[0.5em]
\Longleftrightarrow\ &
\text{for all open~$U \subseteq X$, sections $s, t \in \F(U)$:} \\
&\qquad\qquad
\text{$\alpha_U(s|_U) = \alpha_U(t|_U)$ implies $s|_U = t|_U$} \\[0.5em]
\Longleftrightarrow\ &
\text{$\alpha$ is a monomorphism of sheaves}
\end{align*}
\item The corner quotes ``$\speak{\ldots}$'' indicate that
translation into formal language is left to the reader.
\end{itemize}
}
\note{
\begin{itemize}
\item Similarly, we have (exercise, use the rules!):
\begin{align*}
&
X \models \speak{$\alpha$ is surjective} \\[0.5em]
\Longleftrightarrow\ &
X \models \forall s\?\G\_ \exists t\?\F\_ \alpha(t) = s \\[0.5em]
\Longleftrightarrow\ &
\text{$\alpha$ is an epimorphism of sheaves}
\end{align*}
\end{itemize}
}
\note{\fontsize{8pt}{9.6}\selectfont
\begin{itemize}
\item One can simplify the rules for often-occuring special cases:
\[ \renewcommand{\arraystretch}{1.3}\begin{array}{@{}lcl@{}}
U \models \forall s\?\F\_ \forall t\?\G\_ \varphi(s,t)
&\Longleftrightarrow&
\text{for all open~$V \subseteq U$,} \\
&& \text{sections~$s \in \F(V)$, $t \in \G(V)$:} \\
&&\qquad\qquad V \models \varphi(s,t) \\\\
U \models \forall s\?\F\_ \varphi(s) \Rightarrow \psi(s)
&\Longleftrightarrow&
\text{for all open~$V \subseteq U$, sections~$s \in \F(V)$:} \\
&&\qquad\qquad \text{$V \models \varphi(s)$ implies $V \models \psi(s)$} \\\\
U \models \exists!s\?\F\_ \varphi(s)
&\Longleftrightarrow&
\text{for all open~$V \subseteq U$,} \\
&&
\text{there is exactly one section~$s \in \F(V)$ with:} \\
&&\qquad\qquad V \models \varphi(s)
\end{array} \]
\end{itemize}
}
\note{
\begin{itemize}
\item \begin{justify}One can extend the language to allow for \emph{unbounded}
quantification ($\forall A$ vs.~$\forall a \in A$), by Shulman's
\emph{stack semantics}. This is needed to formulate
universal properties internal to~$\Sh(X)$, for instance.\end{justify}
\item \begin{justify}One can further extend the language to be able to talk
about locally internal categories over~$\Sh(X)$ (in the sense of
Penon, see for instance the appendix
of Johnstone's first topos theory book): Then one can do category theory internal
to~$\Sh(X)$ using the internal language.
This specific approach is, as far as I am aware, original work. But of
course, internal category theory has been done for a long time, see for
instance the Elephant and also Chapman and Rowbottom's \emph{Relative
Category Theory and Geometric Morphisms: A Logical Approach}.\end{justify}
\end{itemize}
}
\frame[t]{\frametitle{The internal language of~$\boldsymbol{\Sh(X)}$}
\begin{block}{Crucial property: Locality}
If~$U = \bigcup_i U_i$, then
$U \models \varphi$ iff $U_i \models
\varphi$ for all~$i$.
\end{block}
\begin{block}{Crucial property: Soundness}
If~$U \models \varphi$ and if $\varphi$
implies $\psi$ \only<1>{constructively}\only<2->{\pointthis{constructively}{
no $\varphi \vee \neg\varphi$,\ \
no $\neg\neg\varphi \Rightarrow \varphi$,\ \
no axiom of choice
}},
then~$U \models \psi$.
\end{block}
\vfill
\vspace*{2em}
\pause\pause
\begin{block}{A first glance at the constructive nature}
\begin{itemize}
\item $U \models f = 0$
\tabto{2.9cm} iff $f|_U = 0 \in \Gamma(U, \F)$.
\item $U \models \neg\neg(f = 0)$
\tabto{2.9cm} iff~$f = 0$ on a dense open subset of~$U$.
\end{itemize}
\end{block}
}
\note{%
\vspace{-0.5em}%
\begin{center}\large\bf Why is constructive mathematics
interesting?\end{center}
\vspace{-1em}
\begin{itemize}
\item The internal logic of most toposes is constructive.
\item \begin{justify}From a constructive proof of a statement, it's always possible to
mechanically extract an \emph{algorithm} witnessing its truth. For example:
A proof of the infinitude of primes gives rise to an algorithm
which actually computes infinitely many primes (outputting one at a
time, never stopping).\end{justify}
\item \begin{justify}By the celebrated \emph{Curry--Howard correspondence},
constructive truth of a formula is equivalent to the existence of a
program of a certain type associated to the formula.\end{justify}
\item \begin{justify}In constructive mathematics, one can experiment with (and draw
useful conclusions also holding in a usual sense) \emph{anti-classical
dream axioms}, for instance the one of synthetic differential geometry:\end{justify}
\begin{quote}All functions~$\RR \to \RR$ are smooth.\end{quote}
\item \begin{justify}Constructive accounts of classical theories are sometimes more
elegant or point out some minor but interesting points which are not appreciated by a
classical perspective.\end{justify}
\item \begin{justify}The philosophical question on the \emph{meaning of truth} is
easier to tackle in constructive mathematics.\end{justify}
\end{itemize}
}
\note{%
\vspace{-0.5em}%
\begin{center}\large\bf Three rumours about constructive mathematics\end{center}
\vspace{-1em}
\begin{enumerate}
\item \begin{justify}There is a false rumour about constructive mathematics, namely that
the term \emph{contradiction} is generally forbidden. This is not the
case, one has to distinguish between
\begin{itemize}
\item a true proof by contradiction: ``Assume~$\varphi$ were false.
Then \ldots, contradiction. So~$\varphi$ is in fact true.''
\end{itemize}
which constructively is only a proof of the weaker
statement~$\neg\neg\varphi$, and
\begin{itemize}
\item a proof of a negated formula: ``Assume~$\psi$ were true. Then
\ldots, contradiction. So~$\neg\psi$ holds.''
\end{itemize}
which is a perfectly fine proof of~$\neg\psi$ in constructive mathematics.\end{justify}
\item \begin{justify}There is a similar rumour that constructive mathematicians \emph{deny}
the law of excluded middle. In fact, one can constructively prove that there is no
counterexample to the law: For any formula~$\varphi$, it holds
that~$\neg\neg(\varphi \vee \neg\varphi)$.
In constructive mathematics, one merely doesn't \emph{use} the law of
excluded middle. (Only in concrete models, for example as provided by the
internal universe of the sheaf topos on a non-discrete topological space,
the law of excluded middle will actually be refutable.)\end{justify}
\end{enumerate}
}
\note{
\begin{enumerate}
\item[3.] \begin{justify}There is one last false rumour about constructive mathematics: Namely
that most of mathematics breaks down in a constructive setting. This is
only true if interpreted naively: Often, already very small changes to the
definitions and statements (which are classically simply equivalent
reformulations) suffice to make them constructively acceptable.
In other cases, adding an additional hypotheses, which is classically
always satisfied, is necessary (and interesting). Here is an example: In
constructive mathematics, one can not show that any inhabited subset of the
natural numbers possesses a minimal element. [One can also not show the
negation -- recall the previous false rumour.] But one can show (quite
easily, by induction) that any inhabited and \emph{detachable} subset
of the natural numbers possesses a minimal element. A subset~$U \subseteq
\NN$ is detachable iff for any number~$n \in \NN$, it holds that~$n
\in U$ or~$n \not\in U$.
This has a computational interpretation: Given an arbitrary inhabited subset~$U
\subseteq \NN$, one cannot algorithmically find its minimal element. But it
\emph{is} possible if one has an algorithmic \emph{test of membership}
for~$U$.\end{justify}
\end{enumerate}
\begin{justify}See~\cite{stanford:constr,dalen:int,troelstra:dalen:constr}
for references about constructive mathematics. The blog~\cite{bauer:blog} is
also very informative.\end{justify}
}
\section[Little Zariski]{The little Zariski topos of a scheme}
\frame[t]{\frametitle{The little Zariski topos}
\begin{block}{Definition}The \hil{little Zariski topos} of a scheme~$X$ is the
category~$\Sh(X)$ of set-valued sheaves on~$X$.\end{block}
\begin{itemize}
\item Internally, the structure sheaf~$\O_X$ looks like \[ \text{
an ordinary ring.} \]
\item Internally, a sheaf of~$\O_X$-modules looks like \[
\text{an ordinary module on that ring.} \]
\end{itemize}
}
\subsection[Dictionary]{Building and using a dictionary}
\begin{frame}\frametitle{Building a dictionary}
\sloganwithoutborder{\hil{Understand notions of algebraic geometry
as notions of algebra internal to~$\boldsymbol{\Sh(X)}$.}}
\begin{center}
\small
\scalebox{0.93}{\begin{tabular}{ll}
\toprule
externally & internally to $\Sh(X)$ \\
\midrule
sheaf of sets & set \\
morphism of sheaves & map of sets \\
monomorphism & injective map \\
epimorphism & surjective map \\
\midrule
sheaf of rings & ring \\
sheaf of modules & module \\
sheaf of finite type & finitely generated module \\
finite locally free sheaf & finite free module \\
% coherent sheaf & coherent module \\
tensor product of sheaves & tensor product of modules \\
sheaf of Kähler differentials & module of Kähler differentials \\
% sheaf of rational functions & total quotient ring of~$\O_X$ \\
dimension of $X$ & Krull dimension of~$\O_X$ \\
\bottomrule
\end{tabular}}
\end{center}
\visible<2>{\begin{tikzpicture}[overlay]
\draw[fill=white, draw=white, opacity=0.9] (0,0) rectangle (\paperwidth,6.6);
\node[anchor=south west,inner sep=0] (image) at (1.8,1.3) {
\includegraphics[width=0.7\textwidth]{images/steven-kleiman-misconceptions-about-kx}
};
\end{tikzpicture}}
\end{frame}
\note{\justifying
See the \href{https://rawgit.com/iblech/internal-methods/master/notes.pdf}{notes} for more dictionary entries.
The simple definition of~$\K_X$ allows to give an internal account of the
basics of the theory of Cartier divisors, for instance giving an easy
description of the line bundle associated to a Cartier divisor.
\par
}
\begin{frame}\frametitle{Using the dictionary}
\begin{center}
\begin{minipage}{0.70\textwidth}
\begin{exampleblock}{}
\justifying
Let~$0 \to M' \to M \to M'' \to 0$ be a short exact sequence of
modules. If~$M'$ and~$M''$ are finitely generated, so is~$M$.
\end{exampleblock}
\end{minipage}
\medskip
\scalebox{3}{$\Downarrow$}
\begin{minipage}{0.70\textwidth}
\begin{exampleblock}{}
\justifying
Let $0 \to \F' \to \F \to \F'' \to 0$ be a short exact sequence
of sheaves of~$\O_X$-modules. If~$\F'$ and~$\F''$ are of finite type,
so is~$\F$.
\end{exampleblock}
\end{minipage}
\end{center}
\end{frame}
\begin{frame}[c]\frametitle{Using the dictionary}
\begin{center}
\begin{minipage}{0.70\textwidth}
\begin{exampleblock}{}
\justifying
Any finitely generated vector space does \emph{not not} possess a basis.
\end{exampleblock}
\end{minipage}
\medskip
\scalebox{3}{$\Downarrow$}
\begin{minipage}{0.70\textwidth}
\begin{exampleblock}{}
\justifying
Any sheaf of modules of finite type on a reduced scheme is locally free
\emph{on a dense open subset}.
\end{exampleblock}
\centering
\tiny Ravi Vakil: ``Important hard exercise'' (13.7.K).
\par
\end{minipage}
\end{center}
\end{frame}
\begin{frame}\frametitle{The objective}
\slogan{\justifying Understand notions and statements of \hil{algebraic geometry} as
notions and statements of (constructive) \hil{commutative
algebra} internal to the \hil{little Zariski topos}.}
% In order to:
% \begin{itemize}
% \item Gain conceptual understanding.
% \item Simplify proofs.
% \item Develop a synthetic account of scheme theory.
% \item Contribute to constructive algebra.
% \end{itemize}
Further topics regarding the little Zariski topos:
\begin{itemize}
\item Unique features of the internal world
\item Transfer principles~$M \leftrightarrow M^\sim$
\item The curious role of affine open subsets
\item Quasicoherence
\item Spreading from points to neighbourhoods
\item The relative spectrum
\end{itemize}
\end{frame}
\subsection[Unique features]{Unique features of the internal world}
\begin{frame}\frametitle{Unique features of the internal world}
Let~$X$ be a scheme. Internally to~$\Sh(X)$,
\begin{center}
\hil{any non-invertible element of~$\boldsymbol{\O_X}$ is nilpotent.}
\end{center}
\only<1>{
\centering
\includegraphics[scale=0.3]{images/tierney-on-the-spectrum-of-a-ringed-topos} \\
\tiny
%Miles Tierney. ``On the spectrum of a ringed topos''. \\ In: \emph{Algebra,
%Topology, and Category Theory. A Collection of Papers in Honor of Samuel
%Eilenberg}. Ed.\@ by A.~Heller and M.~Tierney. Academic Press, 1976,
%pp.~189--210.
Miles Tierney. On the spectrum of a ringed topos. 1976.
\par
}
\pause
If~$X$ is reduced, this implies:
\begin{itemize}
\item $\O_X$ is a \hil{field} in that $\neg(\text{$x$ invertible})
\Rightarrow x = 0$.
\item $\O_X$ has \hil{$\neg\neg$-stable equality}: $\neg\neg(x = 0)
\Rightarrow x = 0$.
\item $\O_X$ is \hil{anonymously Noetherian}: Any ideal of~$\O_X$ is \mbox{\hil{not
not}} finitely generated.
\end{itemize}
\end{frame}
\subsection[Generic freeness]{Grothendieck's generic freeness lemma}
\begin{frame}\frametitle{Generic freeness}
\vspace*{-1.6em}
\[ \xymatrixcolsep{3.5pc}\xymatrixrowsep{2pc}\xymatrix{
& \ar@{-}[d]^{\substack{\text{finitely}\\\text{generated}}} M \\
R \ar[r]_{\text{of finite type}} & S
} \]
\hil{Lemma.} If $R$ is reduced, there
%is a \hil{dense open subset} $U \subseteq \Spec R$ such that for any $f \in R$ with~$D(f)
is $f \neq 0$ in $R$ such that
\begin{enumerate}
\item $S[f^{-1}]$ and $M[f^{-1}]$ are free modules over $R[f^{-1}]$,
\item $R[f^{-1}] \to S[f^{-1}]$ is of finite presentation, and
\item $M[f^{-1}]$ is finitely presented as a module over~$S[f^{-1}]$.
\end{enumerate}
\pause
For a trivial proof, employ~$\Sh(\Spec R)$ and exploit that
$\O_{\Spec R}$ is a \hil{field} and \hil{anonymously Noetherian}.
\end{frame}
\subsection{Transfer principles}
\begin{frame}\frametitle{Transfer principles}
\hil{Question:} How do the properties of
\begin{itemize}
\item an~$A$-module~$M$ in~$\Set$ and
\item the~$\O_X$-module $M^\sim$ in~$\Sh(X)$, where~$X = \Spec A$, relate?
\end{itemize}
\pause
\vfill
\hil{Observation:} $M^\sim = \underline{M}[\F^{-1}]$, where
\begin{itemize}
\item $\underline{M}$ is the constant sheaf with stalks~$M$ on~$X$ and
\item $\F \hookrightarrow \underline{A}$ is the \hil{generic prime filter}
with stalk~$A \setminus \mathfrak{p}$ at $\mathfrak{p} \in \Spec A$.
\end{itemize}
Note: $M$ and $\underline{M}$ share all first-order properties.
\pause
\vfill
\centering
\hil{Answer:} $M^\sim$ inherits those properties of $M$ which are \\
\hil{stable under localisation}.
\par
\end{frame}
\note{\justifying
The concept of a \emph{prime filter} is a direct axiomatization of what you
expect the complement of a prime ideal to fulfil. In classical logic,
complementation gives a bijection between the prime filters and the prime
ideals of a ring.
Prime filters are important in constructive mathematics because localising
them gives rise to local rings. In contrast, localising a ring at the
complement of a prime ideal doesn't usually result in a local ring.
To construct the universal localisation of~$A$, one doesn't pick a particular
prime filter~$F$ to construct~$A[F^{-1}]$. Instead, one picks the
\emph{generic prime filter}~$\F$. This filter doesn't live in~$\Set$, but
in~$\Sh(\Spec A)$.
\par
}
\section[Big Zariski]{The big Zariski topos of a scheme}
\begin{frame}\frametitle{Synthetic algebraic geometry}
Usual approach to algebraic geometry: \hil{layer schemes above ordinary set theory}
using either
\begin{itemize}
\item locally ringed spaces
\small
\begin{multline*}
\text{set of prime ideals of~$\ZZ[X,Y,Z]/(X^n+Y^n-Z^n)$} + {} \\
\text{Zariski topology} + \text{structure sheaf}
\end{multline*}
\normalsize
\item or Grothendieck's functor-of-points account, where a scheme is a functor~$\mathrm{Ring} \to \mathrm{Set}$.
\small\[ A \longmapsto \{ (x,y,z) \in A^3 \,|\, x^n+y^n-z^n=0 \} \]
\end{itemize}
\bigskip
\pause
\hil{Synthetic approach:} model schemes \hil{directly as sets} in a certain
nonclassical set theory.
\small
\[ \{ (x,y,z) \? (\affl)^3 \,|\, x^n+y^n-z^n=0 \} \]
\end{frame}
\begin{frame}\frametitle{The big Zariski topos}
\begin{block}{Definition}The \hil{big Zariski topos} $\Zar(S)$ of a scheme~$S$ is the
category $\Sh(\Aff/S)$. It consists of functors
$(\Aff/S)^\op \to \Set$ satisfying the gluing condition that
\[ F(U) \to
\prod_i F(U_i) \rightrightarrows
\prod_{j,k} F(U_j \cap U_k) \]
\\[-0.6em]
is a limit diagram for any affine scheme~$U = \bigcup_i U_i$ over~$S$.
\end{block}
\begin{itemize}
\item For an~$S$-scheme~$X$, its functor of points $\ull{X} =
\Hom_S(\cdot,X)$ is an object of~$\Zar(S)$. It feels like \hil{the set of
points} of~$X$.
\item Internally, $\affl$ (given by $\affl(X) = \O_X(X)$)
looks like a field:
\[ \Zar(S) \models \forall x\?\affl\_ x \neq 0 \Longrightarrow \text{$x$ invertible} \]
\end{itemize}
\note{
\begin{itemize}
\item \begin{justify}The overcategory~$\Sch/S$ becomes a Grothendieck site by declaring
families of jointly surjective open immersions to be covers. See for
instance the excellent Stacks project for details.\end{justify}
\item \begin{justify}Working in~$\Zar(S)$ amounts to incorporating the
philosophy of describing schemes by their functors of points into one's
mathematical language.\end{justify}
\item \begin{justify}Explicitly, the functor~$\ull{X}$ is given
by~$\ull{X}(T) = \Hom_S(T,X)$ for~$S$-schemes~$T$. Because the Zariski
site is \emph{subcanonical}, this functor is always a sheaf.\end{justify}
\item \begin{justify}The object~$\ull{S}$ looks like an one-element set
from the internal universe. This is to be expected.\end{justify}
\end{itemize}
}
\end{frame}
\note{\scriptsize
\begin{itemize}
\item \begin{justify}Hakim worked out a theory of schemes internal to toposes (but
without using the internal language) in her PhD thesis.\end{justify}
\item \begin{justify}The internal language of~$\Zar(\Spec A)$ is related to
the programme about dynamical methods in algebra by Coquand, Coste,
Lombardi, Roy, and others. See Coquand's \emph{A completeness proof for
geometrical logic}, Coquand and Lombardi's \emph{A logical approach to
abstract algebra}, and Coste, Lombardi, and Roy's \emph{Dynamical methods
in algebra: effective Nullstellensätze}.\end{justify}
\item \begin{justify}The observation that~$\affl$ is internally a field is due to
Kock (in the case~$S = \Spec\ZZ$, see his \emph{Universal projective
geometry via topos theory}) and implies a curious meta-theorem:
Because $\Zar(\Spec\ZZ)$ is the \emph{classifying topos} for the theory
of local rings, any statement about local rings which is of a certain
logical form holds for the \emph{universal model}~$\ull{\AA}^1_{\Spec\ZZ}$
iff it holds for any local ring (in any universe, particularly~$\Set$).
Therefore, in proving a statement of such a form about arbitrary local
rings, one may assume that they even fulfil the field condition.
There is a similar story for local~$A$-algebras.
See Wraith's \emph{Intuitionistic algebra: some recent developments in
topos theory} for a short exposition on the usefulness of
classifying toposes and universal models.\end{justify}
\end{itemize}
}
\subsection{Synthetic constructions}
\begin{frame}\frametitle{Synthetic constructions}
\begin{itemize}
\item $\mathbb{P}^n = \{ (x_0,\ldots,x_n) : (\affl)^{n+1} \,|\,
x_0 \neq 0 \vee \cdots \vee x_n \neq 0 \}/(\affl)^\times$ \\
$\phantom{\mathbb{P}^n} \cong \text{set of one-dimensional subspaces of~$(\affl)^{n+1}$}$.
\begin{itemize}
\item $\O(1) = (\ell^\vee)_{\ell : \mathbb{P}^n}$
\item $\O(-1) = (\ell)_{\ell : \mathbb{P}^n}$
\item Euler sequence: $0 \to \ell^\perp \to ((\affl)^{n+1})^\vee \to \ell^\vee \to 0$
\end{itemize}\bigskip
\item \ \\[-1.2em]\mbox{$\RelSpec R = \Hom_{\mathrm{Alg}(\affl)}(R, \affl) =
\text{set of $\affl$-valued points of $R$}.$}
\begin{itemize}
\item $\RelSpec \affl[X,Y,Z]/(X^n+Y^n-Z^n) \cong {}$ \\ \qquad\qquad $\{ (x,y,z) \? (\affl)^3 \,|\, x^n+y^n-z^n = 0 \}$ \medskip
\item $\Delta \defeq \RelSpec \affl[\varepsilon]/(\varepsilon^2) \cong \{ \varepsilon : \affl \,|\, \varepsilon^2 = 0 \}$
\end{itemize}\bigskip
\item $TX = \Hom(\Delta, X)$.
\end{itemize}
\end{frame}