\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*{coproduct-preserving representable}

\hypertarget{context}{}\subsubsection*{{Context}}\label{context}

\hypertarget{compact_objects}{}\paragraph*{{Compact objects}}\label{compact_objects}

[[!include compact object - contents]]

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{introduction}{Introduction}\dotfill \pageref*{introduction} \linebreak
\noindent\hyperlink{absoluteness}{Absoluteness}\dotfill \pageref*{absoluteness} \linebreak
\noindent\hyperlink{module_categories}{Module categories}\dotfill \pageref*{module_categories} \linebreak
\noindent\hyperlink{positive_results}{Positive results}\dotfill \pageref*{positive_results} \linebreak
\noindent\hyperlink{negative_results}{Negative results}\dotfill \pageref*{negative_results} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak
\noindent\hyperlink{footnote}{Footnote}\dotfill \pageref*{footnote} \linebreak


\hypertarget{introduction}{}\subsection*{{Introduction}}\label{introduction}

In this article, we collect some results about representable functors $C(c, -) \colon C \to V$ (where $V$ is some base of hom-enrichment) that preserve coproducts.

When $C$ is an [[extensive category]] regarded as enriched in $Set$, we call $c$ a \emph{[[connected object]]}, and this terminology matches well one's intuition about connectedness from familiar cases such as $C = Top$, or $C$ the category of graphs, etc. Some basic results with proofs may be found at [[connected object]], including

\begin{itemize}%
\item A connected colimit (i.e., a colimit over a [[connected category|connected diagram]] of) connected objects is connected.


\item If $X$ is connected and $X \to Y$ is epic, then $Y$ is connected.



\end{itemize}
For non-extensive categories (e.g., categories of modules), the relation to ``connectedness'' tends to be less intuitive\footnote{The divide between extensive categories and categories of modules is somewhat analogous to the divide between the classical particles and quantum particles. In the classical picture, if an elementary particle (which we can think of as ``connected'') is in a state described by a union $U + V$, then it is either in state $U$ or in state $V$. Whereas in the quantum picture, one has to consider superpositions $U \oplus V$ of states $U$, $V$, and the usual sort of classical logic of disjunctions breaks down. Notice that classical logic (meaning here, non-quantum logic) is largely derived from our experience with extensive categories such as toposes.} . Nevertheless, the concept of (arbitrary) coproduct-preserving representable remains important, and it is useful to collect some basic information.

\hypertarget{absoluteness}{}\subsection*{{Absoluteness}}\label{absoluteness}

In an [[Ab-enriched category]], \emph{finite} coproducts are [[absolute colimits]], hence are preserved by \emph{every} representable. Thus, the interest is in representables which preserve infinite coproducts as well (which is what most of this page is about).

At the other extreme from extensive categories, in a [[SupLat]]-enriched category (such as [[SupLat]] or [[Rel]]) \emph{arbitrary} coproducts are absolute, and hence preserved by every representable.

\hypertarget{module_categories}{}\subsection*{{Module categories}}\label{module_categories}

Let $\mathbf{Mod}_R$ denote the category of right modules over a ring $R$, and suppose an object $M$ induces a coproduct-preserving hom-functor $\mathbf{Mod}_R(M, -) \colon \mathbf{Mod}_R \to \mathbf{Ab}$. Various names for such $M$ appear in the literature, ``compact'' and ``dually slender'' among them. In any event, a \href{http://mathoverflow.net/questions/59282/sums-compact-objects-f-g-objects-in-categories-of-modules}{question arose on MathOverflow} as to whether or to what extent this condition coincides with the condition of being finitely generated, for various rings $R$.

The information provided below was mostly culled from the answers given to that question, especially those by \hyperlink{Gaillard}{Pierre-Yves Gaillard} and \hyperlink{Muro}{Fernando Muro}. Here and there some minor details and background information have been filled in, and some key results have been slightly rearranged.

\hypertarget{positive_results}{}\subsubsection*{{Positive results}}\label{positive_results}

We begin with some easy preliminary remarks. Given a family of objects $\{B_i\}_{i \in I}$ in an $\mathbf{Ab}$-enriched category $C$ and a functor $F \colon C \to \mathbf{Ab}$, there is a canonical arrow

\begin{displaymath}
\oplus_i F(B_i) \to F(\oplus_i B_i)
\end{displaymath}
and if this arrow is an isomorphism for every family $B_i$, we say $F$ preserves coproducts. Turning to the case of representable functors on modules, let

\begin{displaymath}
p_j \colon \oplus_i B_i \to B_j
\end{displaymath}
be the obvious projection ($p_j \circ i_j = 1_{B_j}$, else $p_j \circ i_k = 0$), and given $f \colon M \to \oplus_i B_i$, put

\begin{displaymath}
f_j \coloneqq p_j \circ f.
\end{displaymath}
Then $\mathbf{Mod}_R(M, -)$ preserves the particular coproduct $\oplus_i B_i$ if for each $f \colon M \to \oplus_i B_i$, we have $f_j = 0$ for all but finitely many $j$.

Clearly $\mathbf{Mod}_R(R, -)$ preserves coproducts, and if $F$, $G$ are coproduct-preserving functors $\mathbf{Mod}_R \to \mathbf{Ab}$, then so is $F \oplus G$. It follows that

\begin{itemize}%
\item $\mathbf{Mod}_R(R^n, -)$ preserves coproducts.

\end{itemize}
\begin{prop}
\label{}\hypertarget{}{}
If $\mathbf{Mod}_R(M, -)$ preserves coproducts and $q \colon M \to N$ is epic, then $\mathbf{Mod}_R(N, -)$ preserves coproducts.

\end{prop}
\begin{proof}
Given $f \colon N \to \oplus_i B_i$, we have $p_j \circ f \circ q = 0$ for all but finitely many $j$, whence $f_j = p_j \circ f = 0$ for all but finitely many $j$ since $q$ is epic.

\end{proof}
Combining the two preceding observations, we infer that

\begin{itemize}%
\item $\mathbf{Mod}_R(M, -)$ preserves coproducts if $M$ is finitely generated.

\end{itemize}
Here is a sharper description of coproduct-preserving representables, based on subobject lattices.

\begin{theorem}
\label{prop1}\hypertarget{prop1}{}
$\mathbf{Mod}_R(M, -)$ preserves coproducts if and only if the union of every countable chain of proper submodules of $M$ is a proper submodule.

\end{theorem}
\begin{proof}
(As adapted from \hyperlink{Gaillard}{Gaillard's answer}.) Let $M_0\subset M_1\subset\cdots$ be a chain of proper submodules of $M$ whose union is $M$, and put $Q_n = M/M_n$. Since for each $m \in M$ we have $q_n(m) = 0$ for all but finitely many $n$, the map

\begin{displaymath}
q = \langle q_n \rangle \colon M \to \prod_n Q_n,
\end{displaymath}
corresponding to the tuple of quotient maps $q_n \colon M \to Q_n$, factors through the inclusion $\oplus_n Q_n \hookrightarrow \prod_n Q_n$. However, since each $q_n$ is nonzero, $q$ does not belong to the subgroup

\begin{displaymath}
\oplus_n \mathbf{Mod}_R(M, Q_n) \hookrightarrow \prod_n \mathbf{Mod}_R(M, Q_n) \cong \mathbf{Mod}_R(M, \prod_n Q_n)
\end{displaymath}
and thus the canonical map $\oplus_n \mathbf{Mod}_R(M, Q_n) \to \mathbf{Mod}_R(M, \oplus_n Q_n)$ is not an isomorphism.

In the other direction, if $\mathbf{Mod}_R(M, -)$ does not preserve coproducts, then we can find some map

\begin{displaymath}
f \colon M \to \oplus_{i\in I} B_i
\end{displaymath}
not belonging to the subgroup $\oplus_{i \in I} \mathbf{Mod}_R(M, B_i) \hookrightarrow \mathbf{Mod}_R(M, \oplus_{i \in I} B_i)$. This means that infinitely many components $f_i \colon M \to B_i$ are nonzero. Choose a countable subset $N \subset I$ such that $f_n \colon M \to B_n$ is nonzero for every $n \in N$, and put

\begin{displaymath}
M_n \coloneqq \bigcap_{k \geq n} \ker(f_k).
\end{displaymath}
Each $M_n$ is a proper submodule of $M$, and the $M_n$ form a nondecreasing chain, but the union of the $M_n$ is $M$ (because for each $m \in M$, only finitely many $f_n(m)$ can be nonzero).

\end{proof}
\begin{theorem}
\label{theorem2}\hypertarget{theorem2}{}
Let $R$ be a Noetherian ring, and suppose $M \to N$ is a monomorphism of $R$-modules. Then if $\mathbf{Mod}_R(N, -)$ is coproduct-preserving, so is $\mathbf{Mod}_R(M, -)$.

\end{theorem}
\begin{proof}
(As adapted from \hyperlink{Muro}{Muro's answer}.) Consider a family $B_i$ of modules, and a map $f \colon M \to \oplus_i B_i$. Since there are \href{http://ncatlab.org/nlab/show/injective+object#AbHasEnoughInjectives}{enough injectives}, there exists an embedding $i_j \colon B_j \to E_j$ in an injective module, for each $j$. Next, as explained \href{http://ncatlab.org/nlab/show/injective+object#DirectSumInjectives}{here}, the Noetherian assumption allows us to infer that $\oplus_i E_i$ is injective. Thus, there exists $g$ such that the diagram

\begin{displaymath}
\itexarray{
M & \to & N \\
 ^\mathllap{f} \downarrow & & \downarrow^\mathrlap{g} \\
\oplus_j B_j & \underset{\oplus_j i_j}{\to} & \oplus_j E_j
}
\end{displaymath}
commutes. Because $\mathbf{Mod}_R(N, -)$ preserves coproducts, we have $g_j = 0$ for all but finitely many $j$. Since the diagram

\begin{displaymath}
\itexarray{
M & \to & N \\
 ^\mathllap{f_j} \downarrow & & \downarrow^\mathrlap{g_j} \\
B_j & \underset{i_j}{\to} & E_j
}
\end{displaymath}
commutes and $i_j$ is injective, we see $f_j = 0$ for all but finitely many $j$, whence $\mathbf{Mod}_R(M, -)$ preserves coproducts.

\end{proof}
\begin{corollary}
\label{}\hypertarget{}{}
Let $R$ be Noetherian. If $\mathbf{Mod}_R(M, -)$ preserves coproducts, then $M$ is finitely generated.

\end{corollary}
\begin{proof}
(Combining \hyperlink{Gaillard}{Gaillard's} and \hyperlink{Muro}{Muro's} answers.) We prove the contrapositive. Suppose $M$ is not finitely generated. Then we can find a strictly increasing sequence of submodules of $M$:

\begin{displaymath}
M_1 \hookrightarrow M_2 \hookrightarrow \ldots \hookrightarrow M.
\end{displaymath}
Let $M'$ be the union of the $M_i$. By \hyperlink{prop1}{Theorem 1}, the representable $\mathbf{Mod}_R(M', -)$ does not preserve coproducts. By \hyperlink{theorem2}{Theorem 2}, we infer that $\mathbf{Mod}_R(M, -)$ does not preserve coproducts.

\end{proof}
\begin{itemize}%
\item \textbf{Remark:} A ring for which finitely generated modules coincide with modules $M$ such that $\mathbf{Mod}_R(M, -)$ is coproduct-preserving is called \textbf{steady}. Thus, Noetherian rings are steady. Cf. \hyperlink{Brandenburg}{Martin Brandenburg's answer}.

\end{itemize}
\hypertarget{negative_results}{}\subsubsection*{{Negative results}}\label{negative_results}

Next, we construct an example of a ring $R$ and an $R$-module $M$ such that $\mathbf{Mod}_R(M, -)$ preserves coproducts but $M$ is not finitely generated.

\begin{lemma}
\label{lem}\hypertarget{lem}{}
A module $M$ is finitely generated if and only if the union of a totally ordered family of proper submodules of $M$ is a proper submodule.

\end{lemma}
\begin{proof}
The following proof is a practically verbatim transcription from \hyperlink{Gaillard}{Gaillard's answer}, modulo some notational changes. Assume that $M$ is not finitely generated. Let $P$ be the set of those submodules $N$ of $M$ such that $M/N$ is not finitely generated, ordered by inclusion. Clearly the poset $P$ is nonempty and has no maximal element. By (the contrapositive of) Zorn's Lemma, there is a nonempty totally ordered subset $T \hookrightarrow P$ which has no upper bound. Letting $U$ be the union of the submodules occurring in $T$, we see that $M/U$ is finitely generated. There is thus a finitely generated submodule $F$ of $M$ which generates $M$ modulo $U$. Then the collection

\begin{displaymath}
\{N+F: N \in T\}
\end{displaymath}
is a totally ordered set of proper submodules whose union is $M$.

\end{proof}
Thus, our task is to construct a ring $R$ and an $R$-module $M$ such that every \emph{countable} chain of proper submodules of $M$ is bounded above by a proper submodule of $M$ (cf. Theorem \ref{theorem2}), but admitting an uncountable chain of proper submodules whose union is $M$ (so that $M$ is not finitely generated, by the preceding lemma \ref{lem}). The solution as presented below is essentially from the answers of \hyperlink{Gaillard}{Gaillard} and \hyperlink{Brandenburg}{Brandenburg}, with a few extra glosses.

The task is more or less straightforward if we just remember that [[valuation ring|valuation rings]] can model arbitrarily complicated \href{http://ncatlab.org/nlab/show/valuation+ring#example_rates_of_growth_10}{rates of growth}, i.e., in the present case, we just want to build a valuation field with uncountable supply of rates of growth (or of degrees of infinite/infinitesimal elements). Thus, consider for example the free abelian group generated by the first uncountable ordinal, and make this a totally ordered group $G$ by imposing the lexicographic order. This is the value group of a valuation field $K$ whose elements are [[Hahn series]], formally described as functions

\begin{displaymath}
f \colon G \to \mathbb{R}
\end{displaymath}
whose support is well-ordered when considered as a subset of the opposite order $G^{op}$. (More suggestively, we think of $f$ as a formal series

\begin{displaymath}
\sum_{g \in G} a_g x^g
\end{displaymath}
where $a_g = f(g)$ and $x$ is an indeterminate viewed as a generic infinite element, with obvious rules for adding and multiplying. The well-ordering condition is used to ensure that the rules for addition and multiplication are well-founded, and the value $v(f)$ of such a series is the least $g \in G^{op}$ lying in the support of $f$. That is to say, the greatest $g \in G$ that indexes a non-zero coefficient $a_g$.)

Now let $R$ be the valuation ring consisting of \emph{bounded} elements of $K$, i.e., those $f \colon G \to \mathbb{R}$ in $K$ where $f(g) = 0$ whenever $g$ is greater than the identity element of $G$. Then $K$ is the field of fractions of $R$, and we may regard $K$ as an $R$-module.

For each $t \in \omega_1$, let $R_t$ be the $R$-submodule of $K$ consisting of all those $f \colon G \to \mathbb{R}$ in $K$ such that $v(f) \leq t$. These $R_t$ are ``principal fractional ideals'', and they form a system of proper submodules which is cofinal in the lattice of $R$-submodules of $K$, ordered by inclusion.

By cofinality, any \emph{countable} chain of submodules of $K$ is bounded above by some $R_t$, so that $\mathbf{Mod}_R(K, -)$ preserves coproducts. However, the union of all the $R_t$ is $K$, so that $K$ is not finitely generated.

\hypertarget{references}{}\subsection*{{References}}\label{references}

\begin{itemize}%
\item Sasha (mathoverflow.net/users/2095), ``Sums-compact'' objects = f.g. objects in categories of modules?, Question 59282 (version: 2011-11-19) (\href{http://mathoverflow.net/questions/59282/sums-compact-objects-f-g-objects-in-categories-of-modules}{link})

\end{itemize}
\begin{itemize}%
\item Fernando Muro (mathoverflow.net/users/12166), ``Sums-compact'' objects = f.g. objects in categories of modules?, Answer 59320 (version: 2011-03-23) (\href{http://mathoverflow.net/questions/59282/sums-compact-objects-f-g-objects-in-categories-of-modules/59320#59320}{link})

\end{itemize}
\begin{itemize}%
\item Pierre-Yves Gaillard (mathoverflow.net/users/461), ``Sums-compact'' objects = f.g. objects in categories of modules?, Answer 81333 (version: 2011-11-29) (\href{http://mathoverflow.net/questions/59282/sums-compact-objects-f-g-objects-in-categories-of-modules/81333#81333}{link})

\end{itemize}
\begin{itemize}%
\item Martin Brandenburg (mathoverflow.net/users/2841), ``Sums-compact'' objects = f.g. objects in categories of modules?, Answer 81623 (version: 2011-11-22) (\href{http://mathoverflow.net/questions/59282/sums-compact-objects-f-g-objects-in-categories-of-modules/81623#81623}{link})

\end{itemize}
\hypertarget{footnote}{}\subsection*{{Footnote}}\label{footnote}



\end{document}