annotate categorical/synthetic.org @ 2:b4de894a1e2e

initial import
author Robert McIntyre <rlm@mit.edu>
date Fri, 28 Oct 2011 00:03:05 -0700
parents
children
rev   line source
rlm@2 1 #+TITLE: Synthetic Differential Geometry
rlm@2 2 #+author: Dylan Holmes
rlm@2 3 #+EMAIL: rlm@mit.edu
rlm@2 4 #+MATHJAX: align:"left" mathml:t path:"../MathJax/MathJax.js"
rlm@2 5 #+STYLE: <link rel="stylesheet" type="text/css" href="../css/aurellem.css" />
rlm@2 6 #+OPTIONS: H:3 num:t toc:t \n:nil @:t ::t |:t ^:t -:t f:t *:t <:t
rlm@2 7 #+SETUPFILE: ../templates/level-0.org
rlm@2 8 #+INCLUDE: ../templates/level-0.org
rlm@2 9 #+BABEL: :noweb yes :results silent
rlm@2 10
rlm@2 11 (My notes on Anders Kock's /Synthetic Differential Geometry/)
rlm@2 12
rlm@2 13 * Revisiting the real line
rlm@2 14
rlm@2 15 *Lines*, the kind which Euclid talked about, each constitute a commutative
rlm@2 16 ring: you choose any two points on the line to be 0 and 1, then add
rlm@2 17 and multiply as if you were dealing with real numbers $\mathbb{R}$.
rlm@2 18
rlm@2 19 Euclid moreover uses the axiom that for any two points, /either/ they are the
rlm@2 20 same point /or/ there is a unique line between them. Algebraically,
rlm@2 21 this amounts to saying that each line is not only a commutative ring
rlm@2 22 but a *field*, as well. This marks our first departure from euclidean
rlm@2 23 geometry, as our first axiom denies that each line is a field.
rlm@2 24
rlm@2 25
rlm@2 26 ** The first anti-euclidean axiom
rlm@2 27 A point in a ring is called *nilpotent* if its square is
rlm@2 28 zero. Normally (that is, in $\mathbb{R}^n$), only $0$ is
rlm@2 29 nilpotent. Here, as a consequence of the following axiom, there will
rlm@2 30 exist other elements that are nilpotent. These elements will
rlm@2 31 encapsulate our intuitive idea of \ldquo{}infinitesimally small\rdquo{} numbers.
rlm@2 32
rlm@2 33 #+begin_quote
rlm@2 34 *Axiom 1:* Let $R$ be the line, considered as a commutative ring, and
rlm@2 35 let $D\subset R$ be the set of nilpotent elements on the line. Then for any
rlm@2 36 morphism $g:D\rightarrow R$, there exists a unique $b\in R$ such that
rlm@2 37
rlm@2 38 \(\forall d\in D, g(d) = g(0)+ b\cdot d\)
rlm@2 39
rlm@2 40 Intuitively, this unique $b$ is the slope of the function $g$ near
rlm@2 41 zero. Because every morphism $g$ has exactly one such $b$, we have the
rlm@2 42 following results:
rlm@2 43
rlm@2 44 1. The set $D$ of nilpotent elements contains more than
rlm@2 45 just 0. Indeed, suppose the contrary: if $D=\{0\}$, then for any $g$, /every/ $b\in R$ has the
rlm@2 46 property described above;\mdash{}$b$ isn't uniquely defined.
rlm@2 47 2. Pick $b_1$ and $b_2$ in $R$. If every nilpotent $d$ satisfies $d\cdot
rlm@2 48 b_1 = d\cdot b_2$, then $b_1$ and $b_2$ are equal.
rlm@2 49
rlm@2 50 ** The first axiom $\ldots$ in terms of arrows
rlm@2 51
rlm@2 52 Define $\xi:R\times R\rightarrow R^D$ by \(\xi:(a,b)\mapsto (d\mapsto
rlm@2 53 a+b\cdot d)\). The first axiom is equivalent to the statement
rlm@2 54 \ldquo{}\xi is invertible (i.e., a bijection)\rdquo{}
rlm@2 55
rlm@2 56 We give $R\times R$ the structure of an $R$-algebra by defining
rlm@2 57 multiplication: \( (a_1,b_1)\star(a_2,b_2) = (a_1\cdot a_2,\quad
rlm@2 58 a_1\cdot b_2 + a_2\cdot b_1)\). This is called *dual-numbers
rlm@2 59 multiplication*, and is similar to muliplication of complex numbers.
rlm@2 60
rlm@2 61
rlm@2 62 ** Ex
rlm@2 63 1. If $a$ and $b$ are nilpotent, then $ab$ is nilpotent.
rlm@2 64 2. Even if $a$ and $b$ are nilpotent, the sum $a+b$ may not be.
rlm@2 65 3. Even if $a+b$ is nilpotent, either summand $a$, $b$ may not be.
rlm@2 66 4.
rlm@2 67
rlm@2 68 #+end_quote