\documentclass[12pt,titlepage]{article} \usepackage{amsmath} \usepackage{mathrsfs} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsthm} \usepackage{mathtools} \usepackage{graphicx} \usepackage{color} \usepackage{ucs} \usepackage[utf8x]{inputenc} \usepackage{xparse} \usepackage{hyperref} %----Macros---------- % % Unresolved issues: % % \righttoleftarrow % \lefttorightarrow % % \color{} with HTML colorspec % \bgcolor % \array with options (without options, it's equivalent to the matrix environment) % Of the standard HTML named colors, white, black, red, green, blue and yellow % are predefined in the color package. Here are the rest. \definecolor{aqua}{rgb}{0, 1.0, 1.0} \definecolor{fuschia}{rgb}{1.0, 0, 1.0} \definecolor{gray}{rgb}{0.502, 0.502, 0.502} \definecolor{lime}{rgb}{0, 1.0, 0} \definecolor{maroon}{rgb}{0.502, 0, 0} \definecolor{navy}{rgb}{0, 0, 0.502} \definecolor{olive}{rgb}{0.502, 0.502, 0} \definecolor{purple}{rgb}{0.502, 0, 0.502} \definecolor{silver}{rgb}{0.753, 0.753, 0.753} \definecolor{teal}{rgb}{0, 0.502, 0.502} % Because of conflicts, \space and \mathop are converted to % \itexspace and \operatorname during preprocessing. % itex: \space{ht}{dp}{wd} % % Height and baseline depth measurements are in units of tenths of an ex while % the width is measured in tenths of an em. \makeatletter \newdimen\itex@wd% \newdimen\itex@dp% \newdimen\itex@thd% \def\itexspace#1#2#3{\itex@wd=#3em% \itex@wd=0.1\itex@wd% \itex@dp=#2ex% \itex@dp=0.1\itex@dp% \itex@thd=#1ex% \itex@thd=0.1\itex@thd% \advance\itex@thd\the\itex@dp% \makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}} \makeatother % \tensor and \multiscript \makeatletter \newif\if@sup \newtoks\@sups \def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}% \def\reset@sup{\@supfalse\@sups={}}% \def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else% \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}% \else \append@sup#2 \@suptrue \fi% \expandafter\mk@scripts\fi} \def\tensor#1#2{\reset@sup#1\mk@scripts#2_/} \def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2% \reset@sup\mk@scripts#3_/} \makeatother % \slash \makeatletter \newbox\slashbox \setbox\slashbox=\hbox{$/$} \def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$} \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa \copy\slashbox \kern-\@tempdima \box\@tempboxa} \def\slash{\protect\itex@pslash} \makeatother % math-mode versions of \rlap, etc % from Alexander Perlis, "A complement to \smash, \llap, and lap" % http://math.arizona.edu/~aprl/publications/mathclap/ \def\clap#1{\hbox to 0pt{\hss#1\hss}} \def\mathllap{\mathpalette\mathllapinternal} \def\mathrlap{\mathpalette\mathrlapinternal} \def\mathclap{\mathpalette\mathclapinternal} \def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}} \def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}} \def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}} % Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2} \let\oldroot\root \def\root#1#2{\oldroot #1 \of{#2}} \renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}} % Manually declare the txfonts symbolsC font \DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n} \SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n} \DeclareFontSubstitution{U}{txsyc}{m}{n} % Manually declare the stmaryrd font \DeclareSymbolFont{stmry}{U}{stmry}{m}{n} \SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n} % Manually declare the MnSymbolE font \DeclareFontFamily{OMX}{MnSymbolE}{} \DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n} \SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n} \DeclareFontShape{OMX}{MnSymbolE}{m}{n}{ <-6> MnSymbolE5 <6-7> MnSymbolE6 <7-8> MnSymbolE7 <8-9> MnSymbolE8 <9-10> MnSymbolE9 <10-12> MnSymbolE10 <12-> MnSymbolE12}{} % Declare specific arrows from txfonts without loading the full package \makeatletter \def\re@DeclareMathSymbol#1#2#3#4{% \let#1=\undefined \DeclareMathSymbol{#1}{#2}{#3}{#4}} \re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116} \re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117} \re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118} \re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119} \re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46} \re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121} \re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12} \re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64} \re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6} \re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77} \re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77} \makeatother % \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE \makeatletter \def\Decl@Mn@Delim#1#2#3#4{% \if\relax\noexpand#1% \let#1\undefined \fi \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}} \def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}} \def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}} \Decl@Mn@Open{\llangle}{mnomx}{'164} \Decl@Mn@Close{\rrangle}{mnomx}{'171} \Decl@Mn@Open{\lmoustache}{mnomx}{'245} \Decl@Mn@Close{\rmoustache}{mnomx}{'244} \makeatother % Widecheck \makeatletter \DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}} \def\@widecheck#1#2{% \setbox\z@\hbox{\m@th$#1#2$}% \setbox\tw@\hbox{\m@th$#1% \widehat{% \vrule\@width\z@\@height\ht\z@ \vrule\@height\z@\@width\wd\z@}$}% \dp\tw@-\ht\z@ \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@ \setbox\tw@\hbox{% \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box \tw@}}}% {\ooalign{\box\tw@ \cr \box\z@}}} \makeatother % \mathraisebox{voffset}[height][depth]{something} \makeatletter \NewDocumentCommand\mathraisebox{moom}{% \IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{% \IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}% }{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}% \mathpalette\@temp{#4}} \makeatletter % udots (taken from yhmath) \makeatletter \def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.} \mkern2mu\raise4\p@\hbox{.}\mkern1mu \raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}} \makeatother %% Fix array \newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}} %% \itexnum is a noop \newcommand{\itexnum}[1]{#1} %% Renaming existing commands \newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}} \newcommand{\widevec}{\overrightarrow} \newcommand{\darr}{\downarrow} \newcommand{\nearr}{\nearrow} \newcommand{\nwarr}{\nwarrow} \newcommand{\searr}{\searrow} \newcommand{\swarr}{\swarrow} \newcommand{\curvearrowbotright}{\curvearrowright} \newcommand{\uparr}{\uparrow} \newcommand{\downuparrow}{\updownarrow} \newcommand{\duparr}{\updownarrow} \newcommand{\updarr}{\updownarrow} \newcommand{\gt}{>} \newcommand{\lt}{<} \newcommand{\map}{\mapsto} \newcommand{\embedsin}{\hookrightarrow} \newcommand{\Alpha}{A} \newcommand{\Beta}{B} \newcommand{\Zeta}{Z} \newcommand{\Eta}{H} \newcommand{\Iota}{I} \newcommand{\Kappa}{K} \newcommand{\Mu}{M} \newcommand{\Nu}{N} \newcommand{\Rho}{P} \newcommand{\Tau}{T} \newcommand{\Upsi}{\Upsilon} \newcommand{\omicron}{o} \newcommand{\lang}{\langle} \newcommand{\rang}{\rangle} \newcommand{\Union}{\bigcup} \newcommand{\Intersection}{\bigcap} \newcommand{\Oplus}{\bigoplus} \newcommand{\Otimes}{\bigotimes} \newcommand{\Wedge}{\bigwedge} \newcommand{\Vee}{\bigvee} \newcommand{\coproduct}{\coprod} \newcommand{\product}{\prod} \newcommand{\closure}{\overline} \newcommand{\integral}{\int} \newcommand{\doubleintegral}{\iint} \newcommand{\tripleintegral}{\iiint} \newcommand{\quadrupleintegral}{\iiiint} \newcommand{\conint}{\oint} \newcommand{\contourintegral}{\oint} \newcommand{\infinity}{\infty} \newcommand{\bottom}{\bot} \newcommand{\minusb}{\boxminus} \newcommand{\plusb}{\boxplus} \newcommand{\timesb}{\boxtimes} \newcommand{\intersection}{\cap} \newcommand{\union}{\cup} \newcommand{\Del}{\nabla} \newcommand{\odash}{\circleddash} \newcommand{\negspace}{\!} \newcommand{\widebar}{\overline} \newcommand{\textsize}{\normalsize} \renewcommand{\scriptsize}{\scriptstyle} \newcommand{\scriptscriptsize}{\scriptscriptstyle} \newcommand{\mathfr}{\mathfrak} \newcommand{\statusline}[2]{#2} \newcommand{\tooltip}[2]{#2} \newcommand{\toggle}[2]{#2} % Theorem Environments \theoremstyle{plain} \newtheorem{theorem}{Theorem} \newtheorem{lemma}{Lemma} \newtheorem{prop}{Proposition} \newtheorem{cor}{Corollary} \newtheorem*{utheorem}{Theorem} \newtheorem*{ulemma}{Lemma} \newtheorem*{uprop}{Proposition} \newtheorem*{ucor}{Corollary} \theoremstyle{definition} \newtheorem{defn}{Definition} \newtheorem{example}{Example} \newtheorem*{udefn}{Definition} \newtheorem*{uexample}{Example} \theoremstyle{remark} \newtheorem{remark}{Remark} \newtheorem{note}{Note} \newtheorem*{uremark}{Remark} \newtheorem*{unote}{Note} %------------------------------------------------------------------- \begin{document} %------------------------------------------------------------------- \section*{affine space} \hypertarget{contents}{}\section*{{Contents}}\label{contents} \noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak \noindent\hyperlink{definitions}{Definitions}\dotfill \pageref*{definitions} \linebreak \noindent\hyperlink{summary}{Summary}\dotfill \pageref*{summary} \linebreak \noindent\hyperlink{details_and_comparisons}{Details and comparisons}\dotfill \pageref*{details_and_comparisons} \linebreak \noindent\hyperlink{vectorvalued_differences}{Vector-valued differences}\dotfill \pageref*{vectorvalued_differences} \linebreak \noindent\hyperlink{two_ternary_operations}{Two ternary operations}\dotfill \pageref*{two_ternary_operations} \linebreak \noindent\hyperlink{one_quaternary_operation}{One quaternary operation}\dotfill \pageref*{one_quaternary_operation} \linebreak \noindent\hyperlink{one_ternary_operation}{One ternary operation}\dotfill \pageref*{one_ternary_operation} \linebreak \noindent\hyperlink{unbiased_definition}{Unbiased definition}\dotfill \pageref*{unbiased_definition} \linebreak \noindent\hyperlink{slice_of_}{Slice of $Vect$}\dotfill \pageref*{slice_of_} \linebreak \noindent\hyperlink{closed_monoidal_structure}{Closed monoidal structure}\dotfill \pageref*{closed_monoidal_structure} \linebreak \noindent\hyperlink{further_remarks}{Further Remarks}\dotfill \pageref*{further_remarks} \linebreak \noindent\hyperlink{affine_spaces_as_model_spaces}{Affine spaces as model spaces}\dotfill \pageref*{affine_spaces_as_model_spaces} \linebreak \noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak \noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak \hypertarget{idea}{}\subsection*{{Idea}}\label{idea} An \textbf{affine space} or \textbf{affine linear space} is a [[vector space]] that has forgotten its origin. An \textbf{affine linear map} (a morphism of affine spaces) is a linear map (a morphism of vector spaces) that need not preserve the origin. Note that the `linear functions' of elementary algebra ---the total functions whose graphs are lines--- are in fact (precisely) \emph{affine} $\mathbb{R}$-linear maps from $\mathbb{R}$ to itself. (Similarly, the `linear relations' ---the relations whose graphs are lines--- are precisely the \emph{[[projective space|projective]]} $\mathbb{R}$-linear maps.) Alternatively, in [[algebraic geometry]], the terminology ``$n$-dimensional affine space'' $\mathbb{A}^n k$ (affine line, affine plane, etc.) over a [[field]] $k$ refers to, depending on context, the set $k^n$, or the set of maximal ideals of the [[polynomial algebra]] $k[x_1, \ldots, x_n]$ -- these definitions coinciding if $k$ is an [[algebraically closed field]] -- and typically considered as equipped with relevant extra structure such as a [[Zariski topology]] or, going even further, the [[locally ringed space]] structure adhering to the [[affine variety]] or [[affine scheme]] corresponding to the polynomial algebra $k[x_1, \ldots, x_n]$. Whatever the precise sense chosen, the idea is that an affine space $\mathbb{A}^n k$ is a setting in which the study of loci of polynomial equations, i.e. definable sets in the theory of [[commutative algebras]] over $k$, is carried out. Most of this article concerns affine spaces in the sense of vector spaces that have forgotten their origins or identities; the algebraic geometry sense is very briefly touched upon in the section \emph{Affine spaces as model spaces}. \hypertarget{definitions}{}\subsection*{{Definitions}}\label{definitions} \hypertarget{summary}{}\subsubsection*{{Summary}}\label{summary} The definition of affine space can be made precise in various (equivalent) ways. We give a name to some of the definitions for later reference. \begin{itemize}% \item An affine space is simply a vector space, but with different morphisms; an affine linear map is a function that is the difference between a linear map and a [[constant function]]. \item An affine space is a [[set]] equipped with an equivalence class of vector space structures, where two vector space structures are considered equivalent if the [[identity function]] is affine linear as a map from one structure to the other; whether a map between affine spaces is affine linear is independent of the representative vector space structures. \item An affine space is a set $A$ together with a vector space $V$ and an [[action]] of (the additive group or \emph{[[translation group]]} of) $V$ on $A$ that makes $A$ into a $V$-[[torsor]] (over the point); an affine linear map is a $V$-equivariant map. For this point of view, see also [[zoranskoda:affine space]]. \item An affine space is a [[heap]] whose [[automorphism group]] is equipped with structure making it the additive group of a vector space; an affine linear map is a heap morphism. \item An affine space is an [[inhabited set]] $A$ together with a vector space $V$ and a function $\Lambda\colon A \times A \to V$ (thought of $\Lambda(x,y) \coloneqq x - y$) that satisfies some equations; an affine linear map $A \to A'$ is a function equipped with a linear map $V \to V'$ relative to which it preserves subtraction (the ``vector-valued difference'' definition). \item An affine space over the [[ground field]] $k$ is an [[inhabited set]] $A$ together with functions $\mu\colon A \times A \times A \to A$ (thought of as $\mu(x,y,z) \coloneqq x - y + z$) and $\Lambda_*\colon k \times A \times A \to A$ (thought of as $\Lambda_r(x,y) \coloneqq x - r x + r y$) that satisfy some equations; an affine linear map is a function that preserves these operations (the ``two ternary operations'' definition). \item An affine space over $k$ is an inhabited set $A$ together with a function $\mu_*\colon k\times A\times A\times A\to A$ (thought of as $\mu_r(x,y,z) \coloneqq r x - r y + z$) that satisfies some equations; an affine linear map is a function that preserves this operation (the ``one quaternary operation'') definition. \item Assuming that $2$ is invertible in the field $k$ (i.e. the [[characteristic]] of $k$ is not $2$), an affine space over $k$ is an inhabited set $A$ together with a function $\Lambda_*\colon k \times A \times A \to A$ that satisfies some equations; an affine linear map is a function that preserves this operation (the ``one ternary operation'' definition). \item An affine space over the field $k$ is an inhabited set $A$ together with, for every [[natural number]] $n \geq 0$ and every $(n+1)$-tuple $(r_0,\dots,r_n)$ of elements of $k$ such that $r_0 + \dots + r_n = 1$, a function $\gamma_{r_0,\ldots,r_n}\colon A^{n+1}\to A$ (thought of as $\gamma_{r_0,\ldots,r_n}(x_0,\ldots,x_n) \coloneqq r_0 x_0 + \cdots + r_n x_n$), satisfying some equations; an affine linear map is a function that preserves these operations (the ``[[unbiased]]'' definition). \item An affine space over the field $k$ is a vector space $A'$ together with a surjective linear map $\pi:A'\to k$ (the ``slice of $Vect$'' definition). The affine space itself (the set being regarded as equipped with affine-space structure) is the fiber $\pi^{-1}(1)$. \end{itemize} [[Mike Shulman]]: I think there should also be a definition of the form ``an affine space is a [[projective space]]'' with a distinguished line called ``infinity'', which should also be equivalent to a ``synthetic'' description involving points and lines and incidence axioms. This definition would not fix the field $k$ at the outset, but rather recover it synthetically using cross-ratios. Accordingly, it ought to define an equivalent groupoid to the groupoid of pairs $(k,A)$ where $k$ is a field and $A$ is an affine space over $A$. I don't know how one could recover the non-invertible affine transformations from it directly. There should be another characterisation, which I don't quite see how to phrase, at least when $k = \mathbb{R}$, which is that an affine space is a manifold (perhaps Riemannian) that is sufficiently flat and unbounded in some sense. ---Toby [[Mike Shulman]]: It'd have to be at least Riemannian, otherwise you don't have enough structure. I don't suppose it's enough to say that a (finitely generated) affine space is a Riemannian manifold isometric to some $\mathbb{R}^n$? \emph{Toby}: I intended `that is \ldots{} in some sense' to include the possibility of structure that should be preserved by the morphisms. Note that a Riemannian manifold is \emph{too much} structure, although it allows a definition like the first one above. (A Riemannian manifold isometric to some $\mathbb{R}^n$ is precisely a [[Euclidean space]].) But really, I'm hoping for some phrasing such that \guilsinglleft{}isomorphic to some $\mathbb{R}^n$\guilsinglright{} actually becomes a (not too obvious) \emph{theorem}. I'll keep thinking about it. [[Mike Shulman]]: Shouldn't a Riemannian manifold isometric to some $\mathbb{R}^n$ be a ``Euclidean affine space'' (a torsor over a Euclidean space)? Seems that a Euclidean space would be a Riemannian manifold \emph{equipped with} an isometry to some $\mathbb{R}^n$. It does seem like there should be a natural way to say this, but I don't know what it is. \emph{Toby}: I guess that this depends on what you think `Euclidean space' means; I've known people to define it to \emph{be} $\mathbb{R}^n$, but that seems quite ahistorical to me; I like that Urs calls such a thing [[Cartesian space]] instead. Euclid did not have coordinates; he did not even have an origin, so a Euclidean space should be a heap rather than a group. For my comment above, I would define a [[Euclidean space]] to be an affine inner product space; FWIW \href{https://secure.wikimedia.org/wikipedia/en/affine_space}{Wikipedia agrees}. (However, Wikipedia doesn't go as far as I do when I claim that the inner product should be valued in an $\mathbb{R}$-line rather than in $\mathbb{R}$ itself; then again, I ignored that subtlety myself in my previous comment.) Clearly every vector space has an underlying affine space (and every linear map is affine linear), giving a [[forgetful functor]] $U:Vect \to Aff$. Conversely, any affine space gives rise to a canonical vector space, sometimes called its space of \emph{displacements}. This is obvious from the definitions that involve a vector space as part of the structure, but a vector space can also be reconstructed from the other definitions as well, analogously to how a group can be reconstructed from a [[heap]]. This gives a functor $D:Aff\to Vect$ in the other direction. One can verify that $D(U(V))\cong V$ and $U(D(A))\cong A$; the first isomorphism is [[natural isomorphism|natural]], but the second is not (otherwise $Vect$ and $Aff$ would be [[equivalent categories]], which they are not). The category of affine spaces is almost a [[variety of algebras]], as can be seen from the last few definitions, except for the requirement that an affine space be inhabited. To rectify this, sometimes one allows the [[empty set]] to be an affine space, although it does not have any particular vector space of displacements. (See \href{heap#empty}{heap\#empty} for discussion.) Note that there are a few different ways to think about the operations involved in the final three definitions (those not explicitly involving a vector space). The operation $\mu\colon x,y,z \mapsto x - y + z$ is the same as the [[Mal'cev operation]] (i.e. [[heap]] structure) of the [[translation group|additive group]] of a vector space. It can be viewed as the point completing a parallelogram with given vertices $x,y,z$, or equivalently as the result of adding $x$ and $z$, relative to a choice of $y$ as the origin. The operation $\Lambda_*\colon r,x,y \mapsto x - r x + r y$ can be viewed as either a weighted average of $x$ and $y$ (i.e. as $(1-r)x + r y$) or as the result of multiplying the ``displacement vector'' $y-x$ by $r$, relative to the origin $x$ (i.e. as $x + r(y-x)$). \hypertarget{details_and_comparisons}{}\subsubsection*{{Details and comparisons}}\label{details_and_comparisons} The first few definitions, which explicitly involve a vector space, make no especial use of the fact that the vector space is a vector space rather than merely an abelian [[group]]. Thus, they are valid (and equivalent) in the more general context of [[torsors]] and [[heaps]]. They are also mostly complete as stated, except for the final one. \hypertarget{vectorvalued_differences}{}\paragraph*{{Vector-valued differences}}\label{vectorvalued_differences} In this definition, an affine space over a vector space $V$ is a set $A$ together with a ``subtraction'' function $\Lambda\colon A\times A\to V$, written $\Lambda\colon x,y \mapsto x-y$, such that: \begin{itemize}% \item $\Lambda(x,x) = 0$, or $x-x = 0$, for any $x$ in $A$. \item $\Lambda(x,y) + \Lambda(y,z) = \Lambda(x,z)$, or $(x-y) + (y-z) = (x-z)$, for any $x,y,z$ in $A$. \item For any $x$ in $A$ and $v$ in $V$ there exists a unique $y$ in $A$ such that $\Lambda(y,x) = v$, or $y - x = v$. \end{itemize} If $y - x = v$, then we write $y = x + v$, which we can regard as an operation on $x$ and $v$ by the third axiom. Hence we have $(x + v) - x = v$ and (by uniqueness) $x + (y - x) = y$, and also $x + 0 = x$ and $(x + v) + w = x + (v + w)$ by the first two axioms. Thus, these axioms suffice to make $A$ into a [[torsor]] over the additive group of $V$ with the action $+$, which is one of the previous definitions given. Note again that this would makes sense if $V$ is any group, not just the additive group of a vector space. \hypertarget{two_ternary_operations}{}\paragraph*{{Two ternary operations}}\label{two_ternary_operations} This definition is an affine version of the usual definition of a vector space in terms of addition and scalar multiplication. However, in each case the affine operation needs to take an extra parameter. In reading the following axioms it helps to think of $\mu(x,y,z)$ as ``the sum of $x$ and $z$ relative to the basepoint $y$'' and likewise $\Lambda_r(x,y)$ as ``the product $r\cdot y$ relative to the basepoint $x$''. \begin{itemize}% \item $\mu(x,x,y) = y$ (identity for addition) \item $\mu(x,y,\mu(z,w,v)) = \mu(\mu(x,y,z),w,v)$ (associativity of addition) \item $\mu(x,y,z) = \mu(z,y,x)$ (commutativity of addition) \item $\Lambda_{r s}(x,y) = \Lambda_r(x, \Lambda_s(x,y))$ (associativity of scalar multiplication) \item $\Lambda_1(x,y) = y$ (identity for scalar multiplication) \item $\Lambda_0(x,y) = x$ (left zero for scalar multiplication) \item $\Lambda_{r+s}(x,y) = \mu(\Lambda_r(x,y), x, \Lambda_s(x,y))$ (left distributivity of scalar multiplication) \item $\Lambda_r(w, \mu(x,y,z)) = \mu(\Lambda_r(w,x), \Lambda_r(w,y), \Lambda_r(w,z))$ (right distributivity of scalar multiplication) \end{itemize} \emph{Joost}: Could it be that there is an axiom missing here ? One can go from Vector spaces to the 2 ternary operations definition and back, but I can't see that by starting with the two ternary operations definition, going to vectorspaces and back, you get the same $\Lambda$. I guess you need an extra axiom as $\mu(x,y,\Lambda_r(y,z))=\Lambda_r(x,\mu(x,y,z))$. \emph{Toby}: Conceptually, there is something missing, which I've inserted as the left zero property of scalar multiplication. (The right zero property $\Lambda_r(x,x) = x$ follows from this using associativity of scalar multiplication with $s = 0$, same as with vector spaces.) But I have to leave, and I haven't yet derived your axiom, even with this aid. \hypertarget{one_quaternary_operation}{}\paragraph*{{One quaternary operation}}\label{one_quaternary_operation} This definition is an affine version of the less standard definition of a vector space in terms of a single operation $r,x,y\mapsto r\cdot x + y$. Here an affine space over $k$ is a set $A$ together with a single operation $\mu\colon k\times A\times A\times A\to A$, written as $(r,x,y,z)\mapsto \mu_r(x,y,z)$ and thought of as the sum ``$r\cdot x + z$ relative to the basepoint $y$,'' such that: \begin{itemize}% \item $\mu_1(x,y,y) = x$ \item $\mu_r(x,x,y) = y$ \item $\mu_1(x,y,z) = \mu_1(z,y,x)$ \item $\mu_r(\mu_s(x,y,z),w,v) = \mu_{r s}(x,y,\mu_r(z,w,v))$ \item $\mu_{r+s}(x,y,z) = \mu_r(x,y,\mu_s(x,y,z))$ \end{itemize} \hypertarget{one_ternary_operation}{}\paragraph*{{One ternary operation}}\label{one_ternary_operation} In the affine case (in contrast to the vector space case), it turns out that if $2$ is invertible the ``addition'' $(x,y,z)\mapsto x-y+z$ can be recovered from the ``scalar multiplication'' $(r,x,y)\mapsto r x + (1-r)y$ by $\mu(x,y,z) = \Lambda_2(y,\Lambda_{1/2}(x,z))$. Thus, in this case we can define an affine space over $k$ to be a set $A$ together with a single operation $\Lambda\colon k\times A\times A\to A$ such that the axioms for the two-ternary-operations definition are satisfied with this definition of $\mu$. However, we can also simplify the requisite axioms in this presentation. The following axioms are easier to state if we write $\Lambda_r(x,y)$ as $(1-r) x + r y$, or equivalently as $r x + s y$, where we require $r+s=1$ for the expression to be defined. \begin{itemize}% \item Idempotence: $r x + s x = x$ whenever $r+s=1$. \item Commutativity: $r x + s y = s y + r x$ whenever $r+s=1$. \item Associativity: whenever $r+s+t=1$, whichever of the following three expressions are defined are equal:\begin{displaymath} \itexarray{ r x + (1-r)\left(\frac{s}{1-r} y + \frac{t}{1-r} z\right)\\ (1-s)\left(\frac{r}{1-s} x + \frac{t}{1-s} z\right) + s y\\ (1-t)\left(\frac{r}{1-t} x + \frac{s}{1-t} y\right) + t z } \end{displaymath} The first is defined whenever $r\neq 1$, the second whenever $s\neq 1$, and the third whenever $t\neq 1$. Since $k$ has characteristic $\neq 2$, we cannot have $r=s=t=1$ and $r+s+t=1$ at the same time, so at least one of these expressions is always defined. We write $r x + s y + t z$ for the common value of whichever of them are defined. \item Cancellation: for any $r\in k$ and $x,y\in A$, we have $x + a y - a y = x$. \end{itemize} \hypertarget{unbiased_definition}{}\paragraph*{{Unbiased definition}}\label{unbiased_definition} Let $Th_{vect}$ denote the [[Lawvere theory]] of $k$-vector spaces. For any $n$, its $n$-ary operations are $n$-tuples $(r_1,\dots,r_n)\in k^n$ representing the [[linear combination]] operation $(x_1,\dots,x_n)\mapsto r_1 x_1 +\dots+ r_n x_n$. Composition of operations is by substitution in the obvious way, and the identity operation is $(1)$. A model of this theory is simply a vector space. With this `unbiased' definition, a vector space comes equipped with, for every integer $n\ge 0$ and $n$-tuple $(r_1,\dots,r_n)$ of elements of $k$, a function $V^n\to V$ (thought of as $(v_1,\dots,v_n)\mapsto r_1 v_1+\dots r_n v_n$), satisfying some axioms. Let $Th_{aff}$ denote the subtheory of $Th_{vect}$ containing only those operations $(r_1,\dots,r_n)$ such that $r_1+\dots+r_n=1$; an \textbf{affine space} is a nonempty model of $Th_{aff}$. (We have to observe that these are closed under the theory operations and thus define a subtheory. Note that this excludes all zero-ary operations, so an affine space has no distinguished constants, and it also excludes all nonidentity unary operations.) The basic operations $r_0x_0+\dots+r_n x_n$, when $r_0+\dots+r_n=1$, are called \textbf{affine (linear) combinations} of elements of $A$. The axioms for the unbiased definition are most straightforward to see by writing out the operations of $Th_{aff}$. In particular, this includes ``substitution'' axioms of the form \begin{displaymath} r_0(s_{00} x_{00} + \dots + s_{0m_0} x_{0m_0}) + \dots + r_n (s_{n0} x_{n0} + \dots + s_{n m_n} x_{n m_n}) = r_0 s_{00} x_{00} + \dots + r_n s_{n m_n} x_{n m_n}. \end{displaymath} However, it also includes ``permutation'' axioms of the form \begin{displaymath} r_0 x_0 + \dots + r_n x_n = r_{\sigma 0} x_{\sigma 0} + \dots + r_{\sigma n} x_{\sigma n} \end{displaymath} and also ``duplication'' and ``omission'' axioms. This Lawvere theory can be defined concisely as follows. The Lawvere theory of vector spaces is the opposite of the category of finite-dimensional vector spaces; its operations are all [[linear combinations]]. The Lawvere theory for affine spaces is the sub-theory of this consisting of only the affine combinations. (The Lawvere theory of vector spaces also has other interesting sub-theories, such as that consisting of \emph{[[convex combinations]]} whose algebras are abstract [[convex space]]s in one sense of the term.) Note that the empty set is a model (algebra) of this Lawvere theory; an affine space is an \emph{inhabited} model. Given the unbiased definition in terms of a Lawvere theory, the previous three ``biased'' vector-space-free definitions can then be recovered by finding particular generating operations for the theory. In particular, this Lawvere theory is generated by $2$-ary operations if $char(k)\neq 2$, and by $3$-ary ones if $char(k)=2$. To wit, suppose given $(r_0,\dots,r_n)\in k^{n+1}$ with $n\ge 3$ such that $r_0+\dots+r_n=1$. Suppose for the moment that the $r_i$ are not all $1$, and WLOG suppose that $r_0\neq 1$. (Note that here we use the invariance under permutations.) Then we have \begin{displaymath} r_0 x_0 + \dots + r_n x_n = r_0 x_0 + (1-r_0)\left(\frac{1}{1-r_0} r_1 x_1 + \dots + \frac{1}{1-r_0}r_n x_n\right) \end{displaymath} so we have expressed the given $(n+1)$-ary operation in terms of a $2$-ary one and an $n$-ary one. By induction, in this way we can express any $(n+1)$-ary operation in terms of $2$-ary ones (note that there is only one $1$-ary operation, namely the identity, and no $0$-ary ones) --- as long as we never hit a tuple where every $r_i=1$. But since we always have the requirement $r_0+\dots+r_n=1$, this badness can only happen if the characteristic of $k$ is $n$. Moreover, we still have \begin{displaymath} x_0 + \dots + x_n = x_0 - x_1 + (2x_1 + x_2 + \dots + x_n) \end{displaymath} so we can still write this $(n+1)$-ary operation in terms of a $3$-ary one and an $n$-ary one. So only if $n+1=3$ (i.e. $n=char(k)=2$) are we prevented from getting down to $2$-ary operations only, and in this case we can still get down to $3$-ary ones. Finally, we observe that any $3$-ary operation can be written in terms of $2$-ary ones and the particular $3$-ary operation $x_0 - x_1 + x_2$: \begin{displaymath} r_0 x_0 + r_1 x_1 + r_2 x_2 = \big(r_0 x_0 + (1-r_0) x_2\big) - x_2 + \big(r_1 x_1 + (1-r_1) x_2\big). \end{displaymath} \hypertarget{slice_of_}{}\paragraph*{{Slice of $Vect$}}\label{slice_of_} Given an affine space $A$ (with any other definition), the corresponding $\pi:A'\to k$ is constructed as follows. Let $A' = 1 \sqcup A$, where $\sqcup$ is the coproduct in affine spaces (akin to a simplicial [[join]]), $1$ is the [[terminal object|terminal]] affine space, and $\pi$ is the composite of $1 \sqcup !: 1 \sqcup A \to 1 \sqcup 1$ with a natural identification $\mu: 1 \sqcup 1 \cong k$. Both $1 \sqcup !$ and $\mu$ which are morphisms of $Aff$ may be regarded as morphisms of $1 \downarrow Aff \simeq Vect$ (pointed affine spaces are vector spaces) if we let the first inclusion $i_0: 1 \to 1 \sqcup 1$ be the pointing of $1 \sqcup 1$ and $0: 1 \to k$ the pointing of $k$ and define $\mu$ by $\mu \circ i_0 = 0$, $\mu \circ i_1 = 1$ (the element $1 \in k$). (So $\mu$ is like two ends of a meter stick used to set up coordinates on the line $k$.) Conversely, given $\pi:A'\to k$, the fiber $\pi^{-1}(1)$ naturally acquires a ``vector-valued difference'' affine space structure by simple subtraction in the vector space $A'$, where the vector space of displacements is $V = \pi^{-1}(0)$. Note that this definition embeds the category $Aff$ of (inhabited) affine spaces fully-faithfully in the [[slice category]] $Vect/k$. The objects of $Vect/k$ not in $Aff$ are those of the form $0:V\to k$, which form a category equivalent to $Vect$ itself. Moreover, there are no morphisms from objects of $Aff$ to objects not in $Aff$; while by the above construction, a morphism from $0:V\to k$ to an affine space $\pi:A'\to k$ is just a map from $V$ to the vector space of displacements of $A$. Hence, $Vect/k$ is equivalent to the (dual) [[cograph of a functor|cograph]] of $D:Aff\to Vect$. \hypertarget{closed_monoidal_structure}{}\subsubsection*{{Closed monoidal structure}}\label{closed_monoidal_structure} If we allow affine spaces to be empty, then they are the models of an [[algebraic theory]] $Th_{Aff}$. Moreover, like $Th_{Vect}$, the theory $Th_{Aff}$ is a [[commutative theory]]. It follows that if $A, B$ are affine spaces, then the set $\hom(A, B)$ is closed under all affine space operations pointwise defined on the set of all functions from $A$ to $B$. This gives $Aff$ a [[closed category]] structure; on general grounds, it is in fact a [[symmetric monoidal closed category]]. The unit of this structure is the terminal or one-pointed affine space $1$, via the natural isomorphism $\hom(1, B) \cong B$. Thus $Aff$ is a closed [[semicartesian monoidal category]]. Analogous to the case of $Vect$, every affine space is a coproduct of copies of the monoidal unit: an affine space $A$ of dimension $n$ admits an affine basis, which amounts to an isomorphism $1 \sqcup 1 \sqcup \ldots \sqcup 1 \cong A$, represented by $n+1$ \emph{sic} points of $A$. Such basis representations allow one to coordinatize spaces of maps $\hom(A, B) \cong B^{n+1}$, with dimension $(n+1)\dim(B)$. If one uses the first of the affine basis elements to give a pointing of the affine space (equivalent to a vector space structure), then the remaining affine basis elements provide a vector space basis, and in those coordinates every element $f \in \hom(A, B)$ may be written in matrix-vector form $f(x) = M x + b$, where again the space of such $(M, b)$ has dimension $m n + m$ if $m$ is the dimension of $B$. (There are also more `unbiased' coordinate descriptions, not biased in favor of the first basis element playing the role of the origin.) Similarly, we can coordinatize affine tensor products $A \otimes B$: the tensor distributes over coproducts (as it does in any symmetric monoidal closed category) and so \begin{displaymath} (\bigsqcup_{n+1} 1) \otimes (\bigsqcup_{m+1} 1) \cong \bigsqcup_{(m+1)(n+1)} 1 \otimes 1 \cong \bigsqcup_{(m+1)(n+1)} 1 \end{displaymath} with dimension $m n + m + n$. In other words, if $a_1, \ldots, a_{n+1}$ is an affine basis of $n$-dimensional $A$ and $b_1, \ldots, b_{m+1}$ a basis of $m$-dimensional $B$, then $A \otimes B$ has an affine basis consisting of the $m n + m + n + 1$ many elements $a_i \otimes b_j$. The embedding $Aff \to Vect/k$ described in the previous subsection, sending $A$ to $1 \sqcup !: 1 \sqcup A \to 1 \sqcup 1$, is a [[strong monoidal functor]] (preserves the tensor product up to coherent isomorphism) if $Vect/k$ is endowed with the obvious tensor product acquired from $Vect$. Note that $Vect/k$ is the coreflection of $Vect$ from monoidal categories to [[semicartesian monoidal categories]]; the embedding $Aff \to Vect/k$ was in fact discovered by one of us in conjunction with this fact, and is the same as the functor induced by universality from the strong monoidal functor $Aff \to Vect$ given by $A \mapsto 1 \sqcup A$. \hypertarget{further_remarks}{}\subsection*{{Further Remarks}}\label{further_remarks} Every finitely-generated affine space is isomorphic to the $n$-fold [[direct sum]] $k^n$, where $k$ is the [[base field]] and $n$ is a [[natural number]] (possibly $0$). In [[algebraic geometry]], an $n$-dimensional affine space is often denoted $\mathbb{A}^n$ and identified with $k^n$. If one accepts the empty set as an affine space, then this is considered to have dimension $-1$ by convention (so $k^{-1} = \empty$). The notion of affine space may be generalised to \textbf{affine module} by replacing the vector space above by a [[module]] and the base field $k$ by a [[commutative ring]]. Then an affine module over the ring $\mathbb{Z}$ of [[integer]]s is precisely a commutative [[heap]], just like a module over $\mathbb{Z}$ is an [[abelian group]]. Note that the definition involving only one ``scalar multiplication'' operation works if and only if $2$ is invertible in $k$; it's not enough that $2 \ne 0$ in $k$. [[Mike Shulman]]: I haven't thought much about affine modules, but it seems likely to me that the ``biased'' module-free definitions won't be right any more, since the Lawvere theory needn't be generated by 2-ary or 3-ary operations (as far as I can see). More explicitly, I don't immediately see how to write an operation like \begin{displaymath} (x_0,x_1,x_2,x_3) \mapsto 4x_0 - 6x_1 - 2x_2 + 5x_3 \end{displaymath} in terms of $A^3\to A$ and $\mathbb{Z}\times A^2\to A$, but it seems to me that this operation should still exist in an affine $\mathbb{Z}$-module. [[Mike Shulman]]: Well that's rubbish isn't it. The operation $A^3\to A$ is enough to give you a heap, hence an additive group, and then $\mathbb{Z}\times A^2\to A$ gives you the scalar multiplication. And so \begin{displaymath} 4x_0 - 6x_1 - 2x_2 + 5x_3 = \big((4x_0 - 3y) - y + (-6x_1+7y)\big) - y + \big((-2x_2+3y) - y + (5x_3 - 4y)\big) \end{displaymath} for any $y$ at all. \emph{Toby}: Right. But I find an affine module of a \emph{rig} to be a trickier concept. [[Mike Shulman]]: Quite so. Perhaps first one should look for a version of a [[heap]] corresponding to a [[monoid]]? \emph{Toby}: Yes, that would be an affine $\mathbb{N}$-module. \hypertarget{affine_spaces_as_model_spaces}{}\subsection*{{Affine spaces as model spaces}}\label{affine_spaces_as_model_spaces} Affine spaces typically serve as local models for more general kinds of spaces. For instance a [[manifold]] is a [[topological space]] that is locally isomorphic to an affine space over the [[real numbers]]. Similarly, in [[algebraic geometry]] a [[scheme]] is locally isomorphic to an [[affine scheme]]. Therefore there are attempts to axiomatize properties of categories of affine spaces for the purpose of using these as model spaces for more complicated geometries. One such axiomatization is the notion of [[geometry (for structured (∞,1)-toposes)]]. and in particular that of \href{/nlab/show/geometry+(for+structured+(infinity%2C1%29-toposes%29#Pregeometry}{pregeometry}. \hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts} \begin{itemize}% \item the [[automorphism group]] of an affine space is an \emph{[[affine group]]} \item [[Cartesian space]] \item [[polydisk]] \item [[projective space]], [[conical space]] \end{itemize} \hypertarget{references}{}\subsection*{{References}}\label{references} \begin{itemize}% \item [[Aurelio Carboni]], \emph{Categories of Affine Spaces} , JPAA \textbf{61} (1989) pp.243-250. \item [[Aurelio Carboni]], [[George Janelidze]], \emph{Modularity and Descent} , JPAA \textbf{99} (1995) pp.255-265. \item Michel Thi\'e{}baud, \emph{Modular Categories} , pp.386-400 in \emph{Proc. Como conference - Category Theory} , LNM \textbf{1488} Springer Heidelberg 1991. \end{itemize} [[!redirects affine space]] [[!redirects affine spaces]] [[!redirects affine vector space]] [[!redirects affine vector spaces]] [[!redirects affine linear space]] [[!redirects affine linear spaces]] [[!redirects affine-linear space]] [[!redirects affine-linear spaces]] [[!redirects affine function]] [[!redirects affine functions]] [[!redirects affine linear function]] [[!redirects affine linear functions]] [[!redirects affine-linear function]] [[!redirects affine-linear functions]] [[!redirects affine map]] [[!redirects affine maps]] [[!redirects affine linear map]] [[!redirects affine linear maps]] [[!redirects affine-linear map]] [[!redirects affine-linear maps]] [[!redirects affine combination]] [[!redirects affine combinations]] [[!redirects affine linear combination]] [[!redirects affine linear combinations]] [[!redirects affine-linear combination]] [[!redirects affine-linear combinations]] [[!redirects affine module]] [[!redirects affine modules]] \end{document}