CT4
Lecture 4
Abstract
We discuss purity and its cotorsion theory. We introduce definable subgroups and pp conditions, as a threshod for purity. We study pure exact sequence, pure projectives (and ML modules), pure injectives (= algebraically compact modules). A general pure-relative homological theory is based on cotorsion pairs which is discussed in the forthcoming lectures.
Definable Subgroups
We refer to Ziegler’s foundational article for model theory of modules. The theory established a equivalence between
- axiomatisable subcategories (aka definable subcategory) of some $𝐌𝐨𝐝 _R$, and
- the category of exact functors $\mathcal{A} → 𝐀𝐛$ for $\mathcal{A}$ essentially small.
A typical example: the categry of injective (= divisible Abelian groups) is equivalent to the category of exact functors $\mathrm{Exact}(𝐚𝐛^{\mathrm{op}}, 𝐀𝐛)$.
PP Condition
We explain axiomatisable in positive primitive (pp for short) formula. All modules are right modules for convention, and all vectors are row vectors.
Consider ses of multiplicating $r$:
$$\begin{equation} 0 → \mathrm{ann}_r(M) → M \xrightarrow{× r} Mr → 0. \end{equation}$$
We axiomise
- $\mathrm{ann}_r(M) = \{x ∈ M^1 : x ⋅ r = 0\}$;
- $Mr = \{x ∈ M^1 : ∃ y ∈ M^1 \ (x - y ⋅ r = 0)\}$.
(Another definition of f.p. modules). Once we fix the expression $R^m \xrightarrow {⋅ 𝐂 } R^n → M → 0$, then $(M, -)_R$ is a subfunctor of $(R^n, - ) : 𝐌𝐨𝐝 _R → 𝐀𝐛$ defined by sending
$$\begin{equation} X ↦ \{𝐱 ∈ X^n : 𝐱 ⋅ 𝐂^T = \mathbf 0\}. \end{equation}$$
We may rewrite the conditions as $⋀_{j=1}^m ∑ _{i =1} ^n c_{j,i} x _i = 0$.
We shall axiomatise such assignments (functors). Recall a structure over the language $\mathcal{L}$ (e.g. $\mathcal{N} = (ℕ, 0, ++)$ due to Peano) consists of an underlying set $M$, some chosen constants, together with some operations.
Our language $M_R$ consists of first order logic and right module operations, e.g., $∧$, $¬$, $∃$, $∀$ and $⋅_R$, $+_R$, $1_R$, $0_R$.
((pp-)definable subgroup). A definable subgroup of $M ∈ 𝐌𝐨𝐝 _R$ given by positive primitive (p.p) formula $φ$
$$\begin{equation} φ (M) := \{𝐱 ∈ M^k : M ⊧ φ [𝐱 , 𝐲]\}, \end{equation}$$
where $φ$ takes the form $∃ 𝐲 \ ((𝐱 \ 𝐲) ⋅ \binom{𝐀}{ - 𝐁} = \mathbf 0)$, or simply $𝐁 ∣ 𝐱 𝐀$. The formula consists of $k = |𝐱|$ free variables and $(n-k) = |𝐲|$ bounds.
We write $φ [-]$ for a formula, and $φ (-)$ for functors.
$φ(-)$ is a subfunctor of the forgotful one $(R^n, -)_R : 𝐌𝐨𝐝 _R → 𝐀𝐛$.
For morphism of modules, $f : M → N$, we define
$$\begin{equation} φ (f) : \{𝐱 ∈ M^k : 𝐁 ∣ 𝐱 𝐀 \} ↠ \{f(𝐱) ∈ N^k : 𝐁 ∣ 𝐱 𝐀 \} ↪ \{𝐱' ∈ N^k : 𝐁 ∣ 𝐱' 𝐀 \}. \end{equation}$$
We obtain the natural inclusion $φ ↪ (R^n,-)$, which shows the functoriality.
We notice that
- $φ$ preserves monomorphisms: larger underlying set implies larger solution set.
- For submodule $L ↪ M$, one has $φ (L) ⊆ (φ (M) ∩ L)$. The equality does not hold in general (unless $L ↪ M$ is a pure submodule), e.g. $2ℤ ↪ ℤ$ with condition $φ [x , y] := ∃ y \ (x = y ⋅ 2)$.
- $φ$ does not preserve epimorphisms, e.g. $φ [x , y] := (x⋅2 = 0)$ and $ℤ ↠ ℤ / 2ℤ$.
- $φ(M)$ is not necessary an $R$-submodule of $M^k$, but instead a $\mathrm{End}(M_R)$-submodule (under diagonal action).
Recall that $M$ is flat iff $𝐦 ⋅ 𝐂 = \mathbf 0$ implies the existence of $𝐀$ s.t. $(A ∣ 𝐦) ∧ (𝐀𝐂 = 0)$. Show that $M$ is flat iff $M ⋅ ϕ (R) ⊆ ϕ (M)$ holds equality for all pp formula with $1$ free variable.
PP Lattice
We denote $φ [𝐱, 𝐲]$ by $∃ 𝐲 \ (𝐱 , 𝐲 )⋅ H = \mathbf 0$, and $H = \binom{A }{-B}$. We use
- $A$, $B$ and $H$ for matrices in determing pp conditions,
- $k = |𝐱|$ the number of free variables, $n = |𝐱| + |𝐲|$ the number of total variables.
in the procedding analysis without mentioning.
As how we learn linear algebra, we write $x$ (instead of $𝐱$) for general vectors (row vectors for default).
Before we proceed, we introduce a criterion for $φ' ≤ φ$.
$φ' ≤ φ$ iff there are matrices $X$, $Y$ and $Z$ s.t. $\binom{I \ X}{O \ Y} ⋅ H = H' ⋅ Z$.
(← ). Consider
$$\begin{aligned} (x ∈ φ '(M)) ↔ (B' ∣ xA') → (B'Z ∣ xA'Z) ↔ (YB ∣ x(A-XB))\\[6pt] → (B ∣ x(A-XB)) → (B ∣ xA) ↔ (x ∈ φ (M)). \end{aligned}$$
(→). We take $φ' (M) = \{x : B' ∣ xA'\}$ as the projection of the first $k$ coordinates of f.p. module $M: = \{(x,y) : (x,y)\binom{A'}{-B'}=O\} = \operatorname{cok}(A'^T, -B'^T)$. Let $\{z_k\}_{k=1}^n$ denote the image of coordinal basis along $R^n ↠ M$ generating set of $M$, which is a generating set of $M$. By definition, $(z_{[1,k]}, z_{(k,n]})\binom{A'}{-B'} = O$. Hence $(z_{[1,k]}, w)\binom{A}{-B} = O$ for some $w$. We write $w = z_{(k,n]}\binom{X}{Y}$ which recovers the construction.
(Lattice). All pp condition (with $k$ free variabels) forms a lattice. For pp conditions
$$\begin{equation} φ _i[𝐱 ,𝐲_i] := ∃ 𝐲_i \ ((𝐱 , 𝐲 _i)⋅ H_{i} = \mathbf 0)\quad (i =1,2), \end{equation}$$
one has
- $(φ_1 ∧ φ _2) [𝐱 , ...] = ∃ 𝐲 _1, 𝐲 _2 \ ((𝐱, 𝐲_1 ) ⋅ H_{1} = 0 ∧ (𝐱, 𝐲_2 ) ⋅ H_{2} = 0)$, and
- $(φ_1 ∨ φ _2) [𝐱 , ...] = ∃ 𝐚,𝐛,𝐜,𝐝 \ (𝐱 = 𝐚 + 𝐛 ∧ (𝐚, 𝐛) ⋅ H_{1} = 0 ∧ (𝐜, 𝐝) ⋅ H_{2} = 0)$.
The lattice is modular.
We show for $α' ≤ α$, one has $(α ∧ β ) ∨ α ' = α ∧ (β ∨ α ')$. By universal property of $∧$ and $∨$, we obtain $⊆$. Conversely, consider
$$\begin{equation} α ∧ (β ∨ α ') [𝐱 ,...]= ∃ \ ((𝐱,𝐚 )H_α =0 ∧ (𝐛 ,𝐜 )H_β =0∧ (𝐞, 𝐟 )H_{α '} =0 ∧ 𝐱=𝐛+𝐞 ). \end{equation}$$
We see $𝐱=𝐛+𝐞$ satisfies
$$\begin{equation} (𝐛 , 𝐚 - 𝐟 ) H_α = 0 ∧ (𝐛 , 𝐜 ) H_β = 0 ∧ (𝐞 , 𝐟 ) H_{α '} = 0. \end{equation}$$
(Galois connection). Once we fix $M ∈ 𝐌𝐨𝐝 _R$, there is a pairing to truth value
$$\begin{equation} \text{definable subgrps} \ × \ \text{pp formula} → 𝔽 _2,\quad (G, φ) ↦ \{G ⊆ φ (M) \ ?\}. \end{equation}$$
We define the vanishing set of $𝐱 ∈ M^k$ as $pp^M_k(𝐱 ) := \{φ : 𝐱 ∈ φ (M)\}$. We write $pp(x)$ for simplicity.
Show that $pp(𝐱 )$ is a filter, i.e.,
- if $α , β ∈ pp(𝐱 )$ then $(α ∧ β ) ∈ pp(𝐱 )$,
- if $α ∈ pp(𝐱 )$ then $α ' ∈ pp(𝐱 )$ for all $α ' ≥ α$.
In particular, $pp(𝐱)$ is either principal (generated by one element) or infinitely generated.
- A filter on the finite poset is always principal; note that the filtered colimit over finite index category is the valuation at the terminal object.
- The assignment $X ↦ \mathcal{P}(\mathcal{P}(X)), \quad x ↦ \{A : x ∈ A\}$ takes each element in the set $X$ to its generating principal ultrafilter (ultra = maximal). Each filter is contained in some ultrafilter, as each ideal in $(𝔽_2)^X$ is contained in some maximal ideal. However, there exists some non-principle ($≈$ unconstructable) ultrafilter. Set $X = ℤ _{≥ 1}$, then any ultrafilter containing $\{k ℤ \}_{k ≥ 1}$ is non-principal. Such unconstructable ultrafilter yields a fruitful field of non-standard analysis.
Fortunately, such filter of pp conditions is always principal for f.p. modules.
Let $M$ be f.p.. For any $x ∈ M^k$, $pp(x)$ is principal.
We write $R^m \overset {C^T} → R^n \overset π → M → 0$, then $\{z_k = π (e_k)\}_{k=1}^n$ generates $M$. Now $z C = 0$. We set $x + z X = 0$ and define
$$\begin{equation} φ_m [x,y] := ∃ y \ ((x,y)\binom{I \ O}{X \ C} = 0). \end{equation}$$
To see $φ _m$ is the least pp condition, we take any $x ∈ φ(M)$ and show that $φ_m ≤ φ$. There is $y'$ s.t. $(x,y')\binom{A}{-B} = 0$. Since $z$ is a generating set, there is $(x,y') = (x,z)\binom{I \ O}{O \ Q}$. Hence,
$$\begin{equation} \binom{I\ O}{O \ Q} ⋅ \binom{A}{-B} = \binom {A}{-QB} ∈ \ker ((x,z) ⋅ ) \overset ⋆= \operatorname{im} (\binom{I \ O}{X \ C}⋅ ). \end{equation}$$
Here $⋆$ is equivalent to $\ker ((0, z)⋅) = \operatorname{im}(\binom{I \ O}{O \ C} ⋅)$, which is more over equivalent to $\ker π = \operatorname{im} (C^T)$.
Herzog’s Pairing
The tensor pairing yields the duality. Assume $M ⊗ N = 0$, then $M$ is $r$-annihilated iff $N$ is $r$-divisible. The dualised pp conditions are
$$\begin{equation} xr = 0\quad ↔ ∃ y\ (x,y)\binom{1}{r} = 0. \end{equation}$$
(Dualised pp condition). The dualised pp condition (for $𝐦𝐨𝐝 _R$) of
$$\begin{equation} φ (x) := ∃ y \ (x, y) \binom{A}{B} = 0 \end{equation}$$
is (for $𝐦𝐨𝐝 _{R^{\mathrm{op}}}$)
$$\begin{equation} Dφ (c) := ∃ d \ (c,d) \binom{\ I \ \ \ O\ }{A^T \ B^T} =0. \end{equation}$$
We show that $D$ is an anti-isomorphism of lattices.
$φ ≤ φ'$ iff $Dφ' ≤ Dφ$. Moreover $D^2 φ = φ$.
(→). If $\binom{I \ X}{O \ Y} \binom{A}{B} = \binom{A'}{B'}Z$, then $$\begin{equation} \binom{I \ \ O\ }{O \ Z^T}\binom{I \ \ \ \ O\ }{A'^T \ B'^T} = \binom{I \ \ \ O\ }{A^T \ B^T}\binom{I \ \ \ O\ }{X^T \ Y^T}. \end{equation}$$
(←). It suffices to show $D^2 φ = φ$. Note that the matrix for for $φ$, $Dφ$, and $D^2 φ$ are $$\begin{equation} \binom{A}{ {\color{blue} B}} ↦ \binom{I \ \ O\ }{ {\color{blue}A^T \ B^T}} ↦ \binom{I \ O}{ {\color{blue}\binom{I \ A}{O \ B}}}. \end{equation}$$
Clearly $B ∣ Ax$ iff $\binom{I \ A}{O \ B} ∣ x (I \ 0)$.
By Galois connection, show that
$$\begin{equation} D(φ ∨ ψ) = Dφ ∧ Dψ,\quad\text{and} \quad D(φ ∧ ψ) = Dφ ∨ Dψ. \end{equation}$$
Now we show a criterion for determing whether $∑_i m_i ⊗ _R n_i = 0$ in $M ⊗ N$.
Let $𝐦$ and be a row vector and $𝐧$ be a column vector. Then $𝐦 ⊗ 𝐧 = ∑ m_i ⊗ n_i = 0 ∈ M ⊗ N$ iff there is $𝐥$, $𝐤$, $(X \ Y)$ s.t.
$$\begin{equation} 𝐦 ⊗ 𝐧 = (𝐦\ \mathbf0) ⊗ \binom{𝐧 }{𝐤} = 𝐥 (X\ Y) ⊗ \binom{𝐧 }{𝐤} = 𝐥 ⊗ (X\ Y) \binom{𝐧 }{𝐤} = 𝐥 ⊗ \mathbf0. \end{equation}$$
(←). Clear. (→). Note that $N$ is a filtered colimit of f.p. modules containing $𝐧$. Let $N_0$ be any f.p. module in such system, AB5 shows
$$\begin{equation} \ker [N_0 → N] = ⋃ _{0 → ?} \ker [N_0 → N_?]. \end{equation}$$
Hence, $𝐦 ⊗ 𝐧 = 0$ in some $M ⊗ N_?$. WLOG, we assume $N$ is f.g. at the beginning. We extend $𝐧$ to $(𝐧 \ 𝐥) = \{y_j\}_{j=1}^q$ as a generating set of $N$. Now $(𝐦\ \mathbf0) ⊗ \binom{𝐧 }{𝐤} = 0$ in the image of each $M ⊗ \frac{N}{(\{y_j\}_{j ≠ j_0})}$. By definition, $M ⊗ \frac{R}{(r)} = \frac{M}{Mr}$, there is a vector $𝐯_{j_0}$ s.t.
$$\begin{equation} ∑ (𝐦\ \mathbf0) ⊗ y_{j_0} = ∑ 𝐯 _{j_0} a ⊗ y_{j_0} = ∑ 𝐯 _{j_0} ⊗ a y_{j_0} = 0\quad ∈ M ⊗ N. \end{equation}$$
Combining each $𝐯 _{j_0}$ we obtain $(X \ Y)$.
Show that $𝐦 ⊗ 𝐧 = 0$ iff there is some pp condition s.t. $φ (𝐦)$ and $Dφ (𝐧^T)$.
Presentation
We wish a presentation of pp condition. Recall the assignment
$$\begin{equation} (𝐦𝐨𝐝_R)_+ → \text{pp condition},\quad (M, x) ↦ \min pp^M(x). \end{equation}$$
For pointed morphism $f : (M, m) → (N, n)$, one has $\min pp^M(m) ≥ \min pp^N(n)$.
Such assignment is surjective.
Any $φ '$ has a preimage $(M, z_{[1,k]})$ as shown in the first theorem in PP Lattice
, i.e.,
$$\begin{equation} φ' [z_{[1,k]},y] = ∃ y \ ((z_{[1,k]},y)⋅ \begin{pmatrix}I&O\\ -I&A\\ O&-B\end{pmatrix}). \end{equation}$$
One may take $y = z$ to obtain the universal solution.
We denote $z = z_{[1,k]}$ in the previous lemma. The assignment $(M, z) ↦ φ$ gives the presentation of pp condition, i.e.,
$$\begin{equation} 0 → (M / (z), - ) → (M, - ) → φ (-) → 0. \end{equation}$$
The morphism $(M, N) → φ (N)$ sends $f ↦ f(z)$ (with diagonal action). To see it is surjective, any $s ∈ φ (N)$ satisfies $\binom{I \ -A}{O \ \ \ B \ } ∣ s I$. Hence, $s$ maps from the generating set $z ⊆ M$. For exactness, we see
$$\begin{equation} \ker [(M, N) \xrightarrow{(-)(z)} φ (N)] = \{f : f(z) = 0\} ≃ (M/(z), N). \end{equation}$$
This presentation indicates a universal property of $(M, z)$.
(Free realisation). A free realisation of pp condition $φ$ is a pair $z ∈ φ (M)$ such that, for any $x ∈ φ (N)$, there is a morphism $f : (M, z) → (N, x)$ of pointed modules.
Verify such universal property according to the presentation.
Now we show functorial property of pp condition.
$φ$ preserves $∐$, $∏$, $\varinjlim^{fil}$, and summands.
We write $φ(-) := \operatorname{cok}((p,-))$, where $p: M → M/(z)$ is a morphism between f.p. modules. For any $☆ ∈ \{∐ , ∏ , \varinjlim^{fil}\}$,
$$\begin{equation} ☆ φ (M_∙ ) = ☆ \operatorname{cok}((p, M_∙ )) ≃ \operatorname{cok}((p, ☆M_∙ )) = φ (☆ M_∙). \end{equation}$$
$φ$ is clearly a additive functor, which preserves summands.
Purity
The functor $φ$ preserves $∐$, $∏$, $\varinjlim^{fil}$ and summands. It might preserves a more general class of submodules; nonetheless, $2ℤ ↪ ℤ$ is a non-example, since $φ (2ℤ) ≠ 2ℤ ∩ φ (ℤ)$ for $φ [x,y] = ∃ y \ (x-2y=0)$.
A pure submodule $L ↪ M$ is such that $φ (L) ⊆ φ (M) ∩ L^k$ holds equality for all pp formula $φ$.
- The notion of pure subgroup (reine Untergruppe) is due to Prüfer, where the pp conditions are specialised to the form $x = y ⋅ n$ for some $n ∈ ℕ$.
In this sense, $L ↪ M$ is a pure submodule iff $p^L(x) = p^M(x)$ for all $x ∈ L^k$, that is
- a solution set of a pp condition $φ$ in $L$ is compatible with the restriction $L ↪ M$.
A pure submodule, or pure embedding $e_i : L_i ↪ M_i$ is preserved by $∐$, $∏$, $\varinjlim^{fil}$ and pure submodules (including summands).
For pp condition $φ$ and any $☆ ∈ \{∐ , ∏ , \varinjlim^{fil}\}$, one has
$$\begin{aligned} φ (☆ M_i) ∩ (☆ L_i)^k = (☆φ (M_i)) ∩ (☆ L_i^k) = \ker ☆(φ(M_i) ⊕ L_i^k → M_i)\\ = ☆ \ker (φ(M_i) ⊕ L_i^k → M_i) = ☆ φ (L_i) = φ (☆ L_i). \end{aligned}$$
To see the pure embedding in transitive, we take $L ↪ M ↪ N$ and see that
$$\begin{equation} φ (M) ∩ L^k = (φ (M) ∩ N^k) ∩ L^k = φ (N) ∩ L^k = φ (L). \end{equation}$$
A transfinite composition of pure embedding is again a pure embedding.
Let $L_0 ↪ L_1 ↪ \cdots L_γ ↪ \cdots$ be such system which terminates at some limit ordinal $α$. We denote $P_γ$ as the proposition that $L_0 ↪ L_γ$ is a pure embedding for some $γ ∈ α$. Clearly $P_0$ holds. $P_γ → P_{γ +1}$ is given by the transitivity of pure embedding. We see $⋀ _{β ∈ γ } P_β → P_γ$ for limit ordinal $γ$:
$$\begin{aligned} φ (L_γ) ∩ L_0 ^k &= φ (⋃\limits_{β ∈ γ } L_β) ∩ L_0 ^k = (⋃\limits_{β ∈ γ } φ (L_β)) ∩ L_0 ^k \\[6pt] &\overset{\text{AB5}}= ⋃\limits_{β ∈ γ } (φ (L_β) ∩ L_0 ^k) = ⋃\limits_{β ∈ γ } φ (L_0) = φ (L_0). \end{aligned}$$
Conclude that,
- for any filtered system of pure embeddings, the structure morphism $L_β ↪ \varinjlim^{fil}L_∙$ is again a pure embedding.
- any embedding of f.g. projective module $P$ to a flat module $M$ is a pure embedding.
This indicates that a pure embeddings are $\varinjlim^{fil}$-closure of split monomorphisms. A pure embedding $i : L ↪ M$ is defined by the equivalent manners:
- (pp). $φ (L) = φ (M) ∩ L^k$ for all pp condition $φ$;
- (exactness). The ses $0 → L → M → M/L → 0$ is preserved by all $⊗$-type functor.
- (pure morphism). The pure morphism in locally finitely presented category ($𝐌𝐨𝐝 _R$).
We show a theorem connecting the first two conditions.
Say $0 → A → B → C → 0$ is a pure ses provided $A ↪ B$ is a pure embedding. $θ$ is pure exact iff $(K, θ)$ is pure exact for all f.p. $K$.
Note that the latter statement is equivalent to that, f.p. modules lifts $B ↠ C$.
(←). Recall that $φ(-) = \operatorname{cok}((M/(z),-) ↪ (M, -))$. By assumption, both $(M/(z),θ)$ and $(M, θ)$ are exact, thus $φ (θ)$ is exact. We obtain a monomorphis of ses:
By inclusion of cokernels, $\square$ is a pullback. Hence $φ (B) ∩ A^k = φ (A)$.
(→). For any pp condition $φ$, $c ∈ φ (C)$, there is $y$ s.t. $(c,z)H = 0$. Taking the preimage
$$\begin{equation} B^n ↠ C^n,\quad (b,y) ↦ (c , z), \end{equation}$$
we see $(b,y)H ∈ A^m$. By pure embedding, there is some $(a,x) ∈ A^n$ s.t. $(a,x)H = (b,y)H$. Hence, we obtain the induced surjection
$$\begin{equation} π : φ (B) ↠ φ (C),\quad (b-a) ↦ c. \end{equation}$$
Now we show that any morphism $h : K → C$ lifts to $\widetilde h : K → B$. Let $x$ be the generating set of $K$, and take $φ = \min pp^K(x)$. Now $h(x) ∈ φ (C)$. By induced surjection $φ (B) ↠ φ (C)$, there is some $y ∈ φ (B)$ s.t. $π (y) = h(x)$. Since $(K, x)$ is a free realisation of $φ$, there is a morphism $\widetilde h : K → B$ s.t. $\widetilde h (x) = y$. We see that $\widetilde h$ is a lift of $h$.
Let $0 → A \overset i→ B \overset π → C → 0$ be ses, show the following equivalent.
- $i$ is a pure embedding,
- $i ⊗ X$ is monic for all $X ∈ 𝐌𝐨𝐝 _R$,
- $i ⊗ K$ is monic for all $K ∈ 𝐦𝐨𝐝 _R$,
- $(K, π)$ is epic for all $K ∈ 𝐦𝐨𝐝 _R$.
Hint: we just show 1 ↔ 4. Since $\varinjlim^{fil}(𝐦𝐨𝐝 _R) = 𝐌𝐨𝐝_R$, and $\varinjlim^{fil}$ is exact, we see 2 ↔ 3. To see 3 ↔ 4, we consider two ways of finite cocompletion of $𝐚𝐝𝐝 (R)$ in $\mathrm{PSh}(𝐌𝐨𝐝 _R)$:
We show another definition of purity.
Say $f : X → Y$ is a pure morphism, if for any $g : A → B$ the morphism in $𝐦𝐨𝐝_R$, and for any commutative diagram $g ⇒ f$, there exists $s$ making $\circlearrowleft$ commutative:
Any pure morphism $f:X → Y$ is monic.
Let $K$ be any f.p. module s.t. the composition $K \xrightarrow g X \xrightarrow f → Y$ is zero. We shall show that $g=0$. Recall that
- $f$ is a filtered colimit of morphisms between f.p.modules, and
- any f.g. modules are $ω$-small objects.
Hence, $g$ passes through some f.p. submodule $X_i ↪ X$, and $f(X_i)$ passed through some f.p. submodule $Y_j ↪ Y$. There is also dashed morphism $s$ making all $\circlearrowleft$ commutative:
By diagram chasing, $fg=0$ implies $g=0$.
Pure morphisms are precisely filtered colimits of split monomorphisms.
(←) split monomorphisms and pure. It suffices to show pure morphisms are closed under $\varinjlim^{fil}$. The partial lifting property of pure morphism $f_i$ and f.p. morphism $g$ is equivalent to $\operatorname{im}(2) ⊆ \operatorname{im}(3 ∘ 1)$ in the following diagram:
By exactness of filtered colimit, we obtain $\operatorname{im}(2) ⊆ \operatorname{im}(3 ∘ 1)$ in the colimit diagram.
(→). Any pure morphism $f : X ↪ Y$ is a filtered colimit of the injective system $f_i ⇒ f$. We assign each $i$ a pushout diagram, wherein $e_i$ splits by partial lifting property:
Now $\varinjlim^{fil} Y_i ↪ \varinjlim^{fil} (X ⊔ _{X_i} Y_i) ↪ Y$. Hence the isomorphisms holds.
The followings are equivalent definitions for $f : X → Y$ to be a pure morphism.
- For any f.p. morphism $g:A → B$, and commutative diagram $g ⇒ f$, the morphism $A → X$ passes through $g$.
- $f$ is a filtered colimit of split monomorphisms.
- $f ⊗ X$ is injective for all $X ∈ 𝐌𝐨𝐝 _R$.
- $f ⊗ K$ is injective for all f.p. $K ∈ 𝐦𝐨𝐝 _R$.
- $(K, Y) ↠ (K, Y/X)$ is surjective for all f.p. $K ∈ 𝐦𝐨𝐝 _R$.
- $φ (f(X)) = φ (Y) ∩ f(X)^k$ for any pp condition $φ$. There are various equivalent definition by pp conditions, e.g.,
- For any $𝐑 ∈ R^{n × m}$, $\{x𝐑 ∣ x ∈ X^n\} = X^m ∩ \{y𝐑 ∣ y ∈ Y^n\}$.
- Equation $𝐱 ⋅ 𝐑 = 𝐱_0$ has a solution in $Y$, then it has a solution in $X$.
We show 1 ↔ 2 and 5 ↔ 6, while 3 ↔ 4 ↔ 5 is an exercise. Clearly 2 → 3. It remains to show 5 → 1.
(5 → 1). We shall find the partial lifting map $s$ in the diagram:
Here $\operatorname{cok}(g)$ is f.p.. By 5., there is dashed $t$ making $\circlearrowleft$ commutative. Since $(j - tp) ∈ (π _∗ )$, there is some $s$ s.t. $j - tp= fs$. Now
$$\begin{equation} (sg=i) ↔ (fsg=fi) ↔ ((j - tp)g =jg) ↔ \text{true}. \end{equation}$$
We remark that purity comes from the defect of the pairing $- ⊗ ? : 𝖮𝖻 × 𝖬𝗈𝗋 → 𝐀𝐛$.
- For $\mathrm{Hom}(-,?)$, $(-,p)$ is always epic iff $p$ is split epi.
- For $\mathrm{Hom}(?,-)$, $(i, -)$ is always epic iff $i$ is split mono.
- For $- ⊗ ?$, $i ⊗ X$ is always monic iff $i$ is pure mono.
Examples of Pure ses
We show some examples of pure short exaxct sequences.
We call the ker-coker pair in a pure exact sequence as pure monomorphism and pure epimorphism.
Let $g$ be an pure monomorphism. Then $g ∘ f$ is a pure monomorphism iff $f$ is a pure monomorphism. Hint: use $- ⊗ X$.
Let $f$ be a pure epimorphism. Then $g ∘ f$ is a pure epimorphism iff $g$ is a pure epimorphism. Hint: use $(K,-)$.
Pure monomorphisms (resp. epimorphisms) are closed under pushout (resp. pullback). Hint: apply $(K, -)$.
- Corollary, if $N ↪ M$ is pure, then $\frac{N}{L} ↪ \frac{M}{L}$ is pure.
- Corollary, if $L ↪ M$ and $\frac{N}{L} ↪ \frac{M}{L}$ are pure, then $L ↪ N$ is pure.
This result shows convenience in construction when constructing a sequential pure embedding $M_0 ↪ M_1 ↪ M_2 ↪ \cdots ↪ M_α$.
- If $M_{γ} ↪ M_α$ is a pure embedding, then for any pure submodule $\frac{M_{γ +1}}{M_γ } ↪ \frac{M_α }{M_γ}$, the embedding $M_γ ↪ M_{γ +1}$ is pure.
- For limit cardinal $β$, $M_β ↪ M_α$ is a pure embedding when all $M_γ ↪ M_α$ ($γ < β$) are pure embeddings. Hence all $M_γ ↪ M_β$ are pure embeddings.
Conversely, we wonder when a pushout morphisms is a pure embedding.
The left morphism yields the right diagram of four ses:
Hence, $f'$ is monic whenever $\ker f ⊆ \ker g$.
$f'$ is pure embedding iff $\ker (f ⊗ 1_X) ⊆ \ker (g ⊗ 1_X)$ for all $X ∈ 𝐌𝐨𝐝_R$, iff $\ker (f ⊗ 1_X) ⊆ \ker (g ⊗ 1_X)$ for all $X ∈ 𝐦𝐨𝐝_R$.
Note that $⊗$ commutes with pushout and filtered colimits.
The pure ses $0 → A → B → C → 0$ splits when $C ∈ 𝐦𝐨𝐝 _R$.
The pure ses are preserved by $∐$, $∏$, $\varinjlim^{fil}$, and summands.
Recall that pure embeddings are preserves by these exact functors.
For any filtered colimit, the following is pure ses
$$\begin{equation} 0 → K → ∐ X_∙ → \varinjlim{}^{fil} X_∙ → 0. \end{equation}$$
For any $K ∈ 𝐦𝐨𝐝 _R$, $f : K → \varinjlim{}^{fil} X_∙$ passes some $⨁ _{i=1}^n X_∙$.
The following is pure ses
$$\begin{equation} 0 → ∐ X_∙ → ∏ X_∙ → C → 0. \end{equation}$$
For any $K ∈ 𝐦𝐨𝐝 _R$, $K ⊗ -$ preserves $∐$ and $∏$.
$F$ is flat iff any ses $0 → K → M → F → 0$ is pure.
If $F$ is flat, then it is the filtered colimit of projectives. Hence, this ses is a filtered colimit of split ses’s. Conversely, we take $∐_F R ↠ F$. For any $K ∈ 𝐦𝐨𝐝 _R$, $K → F$ factors through some f.g. free module. Hence $F$ is flat.
(Löwenheim–Skolem). For any $x ∈ M$ belongs to a pure submodule $x ∈ L ↪ M$ for $|L| ≤ \max (ω , |R|)$.
- This theorem is specialised from (Downward) Löwenheim–Skolem Theorem in model theory, which discuss the existence and cardinality of models.
Note that the cardinal of the set of pp conditions is no more than $\max (ω , |R|)$. Set $L_0 := (x)$. For each $x ∈ L_0$ and pp condition $φ$, one can find finitely many bound variables ${}^xS^0_φ ⊆ M$ such that $φ (M) ∩ L_0 ⊆ ({}^xS^0_φ ∪ L_0)$. Take
$$\begin{equation} L_{k+1} := (L_{k} ∪ ⋃ \limits_{x ∈ L_0, φ ∈ \ \text{pp condition}}{}^xS^k_φ),\quad k ∈ ℕ. \end{equation}$$
Hence, for arbitrary $k$ and pp condition $φ$, one has $φ (M) ∩ L_{k} ⊆ L_{k+1}$. Note that $|L_k|≤ \max (ω , |R|)$. We obtain the desired pure submodule $L := ⋃ _{k ∈ ℕ }L_k$.
Pure-Relative Homological Algebra
Relative homological studies the pairing of object and morphism classes. For instance, once we take $Θ := \{\text{specialised ses}\}$, then
- a specialised projective objects is $Q$ such that $(Q, η )$ is exact for all $η ∈ Θ$,
- a specialised injective objects is $J$ such that $(η , J)$ is exact,
- a specialised flat objects is $G$ such that $G ⊗ η$ is exact for all $η ∈ Θ$,
- …
Pure Proj
Analogous to the definition of projective object, say $Q$ is pure projective provided $(Q, η )$ is ses for all pure ses $η$.
Both projectives and f.p. modules are pure projective.
(Structure of pure projectives). Pure projective modules are precisely the summand of $∐ (𝐦𝐨𝐝_R)$. Hence, any pure projective modules is a coproduct of countably generated pure projective modules.
Summands of $∐ (𝐦𝐨𝐝_R)$ are pure projective, as pure projectives are closed under $∐$. Conversely, any pure porjective $M$ is a filtered colimit of f.p. modules. By definition of pure exactness, the following ses splits:
$$\begin{equation} 0 → K → ∐_{i ∈ I} M_i → \varinjlim{}^{fil} M_i → 0. \end{equation}$$
By the proof of Kaplansky theorem, a summand of coproducts of countably generated modules is also a coproduct of countably generated modules.
The following tensor-product argument characterise the f.g. modules, f.p. modules and Mittag-Leffler modules. The latter contains all pure projective modules.
Let $M$ be a module. For any collection of left modules $\{N_∙ \}_{i ∈ I}$, one has the natural transformation
$$\begin{equation} M ⊗ ∏ _{i ∈ I} N_i → ∏_{i ∈ I} (M ⊗ N_i),\quad ∑ m_s ⊗ (n^s_i)_{i ∈ I} ↦ (m_s ⊗ n^s_i)_{i ∈ I}. \end{equation}$$
In particular, the above is an isomorphism iff $M$ is f.p., and an epimorphism iff $M$ is f.g.. See Lec0 for details. In general, a pure projective module $Q ∈ 𝐒𝐦𝐝 (∐ (𝐦𝐨𝐝 _R))$ yields the monic natural transformation, as $∐ ∏ ↪ ∏ ∐$.
(Mittag-Leffler module in sense of Raynaud and Gruson). $M$ is said to be Mittag-Leffler (ML for short), provided the above natural transformation is monic.
Show that ML modules are closed under $∐$, $\varinjlim^{fil}$, and summands.
Recall that for any f.p. module $M$ and $x ∈ M^k$, the filter $pp^M(x)$ is principal. This property is easily generalised to $∐ (𝐦𝐨𝐝 _R)$ and moreover to pure projective modules. In fact,
$M$ is ML iff $pp^M(x)$ is principal for any $k$ and $x ∈ M^k$.
We apply Herzog’s pairing to the assignment
$$\begin{equation} M ⊗ ∏ _{i ∈ I} N_i → ∏ (M ⊗ N_i),\quad x ⊗ (y_i)_{i ∈ I} ↦ (x ⊗ y_i)_{i ∈ I}. \end{equation}$$
(→). When M is ML, the above is monic. Assume that $pp^M(x)$ is non-principal. We take $N_φ$ be such that $\max pp^N(y_φ) = Dφ$, where $φ$ runs through $pp^M(x)$. Since $x ⊗ (y_φ)_{φ ∈ pp^M(x)} = 0$, there exists pp condition $ψ$ s.t. $x ∈ ψ (M)$ and $$\begin{equation} (y_φ)_{φ ∈ pp^M(x)} ∈ (Dψ) (∏\limits_{φ ∈ pp^M(x)} N_φ), \quad \text{that is,}\quad ⋀\limits_{φ ∈ pp^M(x)} (y_φ ∈ Dψ (N_φ )). \end{equation}$$
Hence, $ψ ∈ pp^M(x)$ is smaller than any $φ ∈ pp^M(x)$, yielding that $x$ is principle. A contradiction.
(←). Assume that $pp^M(x)$ is principal. For any $(x ⊗ y_i)_{i ∈ I} = 0$ in $∏ (M⊗ N_i)$, there is a list of pp conditions $\{φ _i\}_{i ∈ I}$ s.t. $$\begin{equation}
x ∈ φ _i (M) ∧ y_i ∈ Dφ _i (N_i),\quad i ∈ I.
\end{equation}$$
Taking $ψ = \min pp^M(x)$, we see that
$$\begin{equation} x ∈ ψ (M) ∧ (y_i ∈ Dψ (N_i)),\quad i ∈ I. \end{equation}$$
Since $φ$ preserves $∏$, $ψ$ shows $x ⊗ (y_i)_{i ∈ I} = 0$ in $M ⊗ ∏ _{i ∈ I} N_i$ by Herzog’s pairing.
We care about the structure of countably generated pure projective modules, as they are the building blocks of pure projectives.
Let $M$ be countably generated. When $M$ is pure projective iff it is ML.
We show (←), i.e., a countably generated ML module $X$ is pure projective. Let $\{x_i\}_{i ∈ ω }$ be generating set of $X$. For each $n$ we denote $φ _n := \min pp^X_{n+1} (x_0,\ldots, x_n)$. We also define
$$\begin{equation} φ ' _{n+1} [x_0, \ldots, x_n] := ∃ y \ φ _{n+1}[x_0, \ldots, x_n, y]. \end{equation}$$
Let $p : Q ↠ X$ be any pure epimorphism. We shall construct the right inverse of $p$ by assigning $x_i ↦ q_i$. We choose any $q_0$ to be the inverse image of $x_0$ s.t. $(q_0) ∈ φ_0(x_0)$. Suppose that we have $(q_0, \ldots, q_n)$ such that
- $φ _k [q_0, \ldots, q_k]$ for arbitrary $k ≤ n$, and
- $x_k ↦ q_k$ for $k ≤ n$.
We shall find $q_{n+1}$ satisfying the inductive conditions. We see that $φ '_{k+1}[q_0, \ldots, q_k]$. Consider the following tuples in $Q^{k+1}$:
- Let $\widetilde {q_{k+1}}$ be the indeterminant such that $φ_{k+1}[q_0, \ldots, q_k, \widetilde{q_{k+1}}]$.
- Let $(r_i)_{i ≤ k+1}$ be preimages of each $x_i$.
Hence, $(q_i - r_i)_{i ≤ k} ∈ (\ker p)^{k+1}$. By pure embedding, there is some $λ ∈ (\ker p)^{k+1}$ s.t.
$$\begin{equation} (q_0 - r_0, \ldots , q_k - r_k, λ ) ∈ φ _{k+1} (Q). \end{equation}$$
Set $q_{k+1} := r_{k+1} + λ$, we complete the induction.
Finally, we show $x_i ↦ q_i$ is well-defined. When there is $∑_{i ≤ l} x_i a_i = 0$, we have $φ _l (x_∙) → φ _l (q_∙)$. Hence $∑_{i ≤ l} q_i a_i = 0$.
This shows that pure projective modules are exactly the coproducts of countably generated Mittag-Leffler modules.
Recollection: ML Conditions
We show the exact meaning of Mittag-Leffler conditions, and show more equivalent definitions of Mittag-Leffler modules. Our base category is either $𝐌𝐨𝐝 _R$ or $C(R)$.
(Cotower and Colimit). A cotower is a $ω$-transfinite composition
$$\begin{equation} X_0 \xrightarrow{φ _0} X_1 \xrightarrow{φ _1} X_2 \xrightarrow{φ _2} \cdots \end{equation}$$
We set $φ : ∐ _{n ≥ 0} X_n → ∐ _{n ≥ 0} X_n,\quad (x_0, x_1,\ldots ) ↦ (0, x_0, x_1,\ldots)$ and ontain ses
$$\begin{equation} 0 → ∐ _{n ≥ 0} X_n \xrightarrow{1 - φ } ∐ _{n ≥ 0} X_n → \varinjlim{}^{fil} X_n → 0. \end{equation}$$
Note that $(1 - φ) (x_n)_{n ≥ 0} = 0$ iff $x_0 = 0$ and $φ_k (x_k) = x_{k+1}$ for each $k$. Hence $1-φ$ is injective. We show $\operatorname{cok}(1-φ ) ≃ \varinjlim X_∙$ by Yoneda lemma.
$$\begin{aligned} (\operatorname{cok}(1-φ ), M) &≃ \ker (1-φ , M) = \{f ∈ (∐ X, M) ∣ f_{k+1} = φ _k ∘ f_k\} \\[6pt] & ≃ (X_0 \xrightarrow{φ _0} X_1 \xrightarrow{φ _1} X_2 \xrightarrow{φ _2} \cdots,\quad M=M=\cdots )_{𝐏𝐒𝐡} \\[6pt] & ≃ (\varinjlim X_∙ , M). \end{aligned}$$
A tower is a countable cocomposition of morphisms $$\begin{equation} \cdots → X_2 \overset{ψ _1}→ X_1 \overset{ψ _0}→ X_0 → 0. \end{equation}$$
Set $ψ : ∏ X → ∏ X,\quad (x_0, x_1, x_2, \ldots ) ↦ (ψ _0(x_1), ψ _1(x_2), \ldots)$. Show that
- $\ker (1-ψ) ≃ \varinjlim X_∙$ (by Yoneda lemma),
- $\operatorname{cok}(1 - ψ)$ is surjective if all $ψ _∙$ are surjections,
- $\operatorname{cok}(1 - ψ)$ is not necessary surjective!
The defect of AB5* yields $\varprojlim {}^1 X_∙ := \operatorname{cok}(1 - ψ)$. Note that the functor $\varinjlim{}^1$ is defined over $ω$-tower for default.
$\varprojlim {}^1$ is the right derived functor of $\varprojlim_{ω \text{-tower}}$.
The functor $X ↦ [\cdots = X = \overset{\deg n} X → 0 = 0 → \cdots → 0]$ has left adjoint $(Y_∙, ψ_∙) ↦ Y_n$. Since an exact left adjoint preserves injective objects, the category of $ω$-towers has enough injectives, i.e.,
$$\begin{equation} (Y_∙, ψ_∙) ↪ I^0(Y_∙) := [\cdots = E(∐ Y_∙)= E(∐ Y_∙)]. \end{equation}$$
We obtain ses of $ω$-towers $0 → Y → I^0 → C → 0$. The morphisms in $I^0$ are surjections, hence $\varprojlim{}^1 I^0 = 0$. By snake lemma, we have the $4$-term ker-coker sequence
By injective resolution $Y \overset ι ↪ I^0 \overset {g_0}→ I^1\overset {g_1}→ \cdots$,
$$\begin{equation} (\mathrm R^1 \varprojlim) Y = \frac{\ker [\varprojlim (g_1)]}{\operatorname{im} [\varprojlim (g_0)]} ≃ \frac{\varprojlim \ker (g_1)}{\operatorname{im} [\varprojlim (g_0)]}≃ \frac{\varprojlim C}{\operatorname{im} [\varprojlim I^0 → \varprojlim C]} ≃ \varprojlim {}^1 C \end{equation}$$
In particular, $\varprojlim {}^1$ is right exact. The higher derived limits for $ω$-towers vanish.
$\varprojlim{}^1$ is closely related to the completion. Consider a descending sequence of submodules $\cdots ⊆ M_{k+1} ⊆ M_{k} ⊆ \cdots ⊆ M_0$, aka open neighbourhoods. Applying $\varprojlim$ to the ses $0 → M_k → M → \frac{M}{M_k} → 0$, we obtain the following exact sequence
$$\begin{equation} 0 → \varprojlim M_k → M → \varprojlim \frac{M}{M_k} → \varprojlim {}^1 M_k → 0\quad (=\varprojlim {}^1 M). \end{equation}$$
Assume $\{M_∙\}$ is Hausdorff, i.e., $\varprojlim M_k = ⋂ M_k = 0$. Then $∏ M_k /∼_{\text{Cauchy Seq}} ↠ \varprojlim {}^1 M_k$.
Some remarks:
- A computation of spectra sequence shows more on derived limits.
- The derived (co)limit are usually talked over (co)towers. One can show that $\mathrm R^1 [A → B ← C ↦ A × _B C]$ is $A ⊔_{A × _C B} B$, i.e., the sum $A + C$.
- A general construction of higher derived limits is seen in Roos’s inaccessible paper, where there is also a famous mistake.
We are interested in the case when $\varprojlim {}^1 X = 0$. For instance, when morphisms in tower are surjections, then $\varprojlim {}^1 X = 0$.
(Mittag-Leffler condition). An inverse directed system is said to be Mittag-Leffler provided
$$\begin{equation} ∀ X \ ∃ (Y \overset f → X) \ ∀ (Z \xrightarrow g Y) \ (\operatorname{im} (g ∘ f) = \operatorname{im}(f)). \end{equation}$$
Here all objects and morphisms belongs to the inverse system.
- The ML condition is talked over inverse directed systems. There is no worry to talk about ML conditions over the system of cofiltered limits, as every filtered category is cofinal to a directed category.
(Mittag-Leffler tower). Let $(X, ψ)$ be tower. For each $m$, the descending sequence of image $\{\operatorname{im}(ψ _{n+k, n})\}_{k ≥ 1}$ stabilises for large $k$. Hence, the tower is cofinal to (has the same limit as) the surjective system of images:
The quotient system $\frac{X_k }{\operatorname{im}(ψ _{∞ , k})}$ is also Mittag-Leffler since the stable image is $0$ at each degree. We see $\varprojlim{}^1X_k = 0$ by the ses below $$\begin{equation} 0 = \varprojlim{}^1\operatorname{im}(ψ _{∞ , k}) → \varprojlim{}^1X_k → \varprojlim{}^1\frac{X_k }{\operatorname{im}(ψ _{∞ , k})} = 0. \end{equation}$$
Countable ML condition guarentees the vanishing of $\mathrm R^1\varprojlim _{ω}$. It is NOT ture that $\mathrm R^1 \varprojlim ^{ML}_I$ vanishes for uncountable $I$!
This note explains the Mittag-Leffler theorem in analysis.
ML Module Revisited
We show another equivalent definition of Mittag-Leffler modules in language of Mittag-Leffler system.
Recall that for morphisms $A \overset f ← X \overset g→ B$, we denote $f' : B → A ⊔ _X B$ and $g' := A → A ⊔ _X B$ as the pushout morphisms.
- $f'$ is injective iff $\ker g ⊇ \ker f$.
- $f'$ is pure injective iff $\ker (g ⊗ -) ⊇ \ker (f ⊗ -)$ as a subfunctor.
Let $(M_∙, f_∙ )$ be a filtered system (WLOG directed). The inverse system $((M_∙ , X), f^∗ _∙ )$ is ML provided
$$\begin{equation} ∀ i \ ∃ (i → j) \ ∀ (i → j → k)\ (\operatorname{im}(f^∗ _{k,i}) = \operatorname{im}(f^∗ _{j,i})). \end{equation}$$
In diagram:
We take $X := ∏ M_∙$, and see that $f_{j,i}$ factors through all $f_{k,i}$ for $k ≥ 1$.
Conclude that the following are equivalent for a filtered directed system $(M_∙ , f_∙ )$.
- $((M_∙ , X), f^∗ _∙ )$ is ML for arbitrary $X$;
- For any $i$, there is $j$ s.t. $f_{j,i}$ factors through $f_{k,i}$ for all $k ≥ j$.
Let $M = \varinjlim ^{fil}M_∙$ be a filtered colimit of f.p. modules. Say $M$ is ML, iff the following equivalent definitions hold:
- for any $𝐱 ∈ M^k$, $pp^M_k (𝐱 )$ is a principal filter;
- the natural transformation $M ⊗ ∏ N_∙ → ∏ (M ⊗ N_∙)$ is injective;
- the natural transformation $M ⊗ ∏ N_∙ → ∏ (M ⊗ N_∙)$ is injective for $N_∙$ f.p.;
- the system $(M_∙ , X)$ is ML for any $X$;
- for any structure morphism $e_i : M_i → M$, there is $f_{j,i} : M_i → M_j$ s.t. the two poshout morphisms are pure embeddings;
- for any morphism $X → M$ ($M ∈ 𝐦𝐨𝐝_R$), there is a morphism $(X → Y) ∈ 𝐦𝐨𝐝 _R$ s.t. the two poshout morphisms are pure embeddings.
We show (1 → 2 → 3 → 1). We show in previous subsection shows (1 ↔ 2). Recall that in the proof of (2 → 1), the collection $N_φ$ s.t. $φ = \min pp^{N_φ }(y_φ )$ is chosen to be f.p. modules. Hence, (3 → 1) holds.
We show (6 → 5 → 4 → 6).
(6 → 5). We take any $e_i : M_i → M$ and $g : M_i → X$ s.t. the pushouts are pure embeddings. Note that $\operatorname{cok}[M_j → M_j ⊔ _{M_i} X]$ is f.p. (pure projective), $e_i$ factors through $g$ via some $s :X → M$. By smallness of compact objects, there is $M_j$ making the following diagram commute:
To see that the pushout morphisms of $e_i$ and $f_{j,i}$ are pure embeddings, we observe $$\begin{equation}
\ker (f_{j,i} ⊗ -) ⊆ \ker (e_i ⊗ -) = \ker (g ⊗ -) ⊆ \ker (f_{j,i} ⊗ -).
\end{equation}$$ The equality holds.
(5 → 4). Note that for any $i$, there is $i → j$ s.t. $\ker (e_i ⊗ -) = \ker (f_{j,i} ⊗ -)$. We obtain the pure embedings:
Note that pure embedding splits when cokernel is pure projective. Hence $f_{j,i}$ factors through $f_{k,i}$.
(4 → 6). We take arbitrary $f : X → M$. There is $e_i$ where $f$ passes through. By ML condition, there is $j$ s.t. for any $j → k$, $f_{j,i}$ factors through $f_{k,i}$.
For each $j → k$ we have the left pushout square. $M_j → M_j \sqcup _{X}M_k$ is split monic by factoring morphism. Taking filtered colimit we obtain the right pushout square. The morphism $X_j → M_j \sqcup _X\varinjlim ^{fil}M_k$ is a pure embedding since it is a filtered colimit of split monomorphisms. By cofinality, $\varinjlim ^{fil}_{k \ (j → k)}M_k ≃ M$. The morphism $X → M$ factors through $e_j$, thus the pushout of $X → M_j$ also splits.
We finally show (1,2,3 ↔ 4,5,6). Note that the canonical morphism in 2. is
$$\begin{equation} \varinjlim{}^{fil}_i ∏_λ (M_i ⊗ N_λ) → ∏_λ \varinjlim{}^{fil}_i (M_i ⊗ N_λ). \end{equation}$$
(3 → 6). For any $f : X → M$, we take index set $$\begin{equation} Λ := ⨆ \limits_{K ∈ 𝐦𝐨𝐝 _R} \ker (f ⊗ K) =\{(λ, K_λ)\}. \end{equation}$$
Explicitly, $λ := (λ, K_λ)$ is an element in $Λ$, $λ ∈ \ker (f ⊗ K_λ)$. $K_λ$ is a representative of the isomorphism class of $𝐦𝐨𝐝 _R$. The above is well-defined since
- $𝐦𝐨𝐝 _R$ is essentially small, and
- $X ⊗ ∏ K_λ ≃ ∏ (X ⊗ K_λ)$ as $X$ is f.p..
Let $x := (λ)_{λ ∈ Λ } ∈ ∏ (X ⊗ K_λ)$ be the universal element. By Herzog’s tensor pairing, any $x ∈ \ker (f ⊗ ∏ _{λ ∈ Λ} K_λ)$ lies in some $\ker (g ⊗ ∏ _{λ ∈ Λ} K_λ)$, where $g : P → Y$ is a morphism between f.p. modules.
It suffices to consider in the right column, that is, $x = (λ) ∈ ∏ X ⊗ K_λ$ belongs to $∏ \ker (f⊗ 1)$. By structure of $λ$, $\ker (g ⊗ K) ⊆ \ker (f ⊗ K)$ for any $K ∈ 𝐦𝐨𝐝 _K$. Let $f'$ and $g'$ denote the pushout morphisms of $f$ and $g$. Therefore, $g'$ is pure monic and $f'$ splits monic.
(5 → 2). When $(M_∙ , X)$ is ML system, we show $\ker (M ⊗ ∏ N_∙ → ∏ (M ⊗ N_∙ )) = 0$. Equivalently, for any $i$ there is $i → j$ s.t. any
$$\begin{equation} x ∈ \ker \left(M_i ⊗ ∏ N_∙ → ∏ (M ⊗ N_∙ )\right) ≃ ∏_{λ ∈ Λ } \ker (e_i ⊗ N_λ ) ∋ (x_λ ) \end{equation}$$
maps to $0$ under $f_{j,i} ⊗ 1$. Note that there is $j$ s.t. $\ker (e_i ⊗ -) = \ker (f_{j,i} ⊗ -)$ by ML system.
We remark that the definition of ML modules is independent of the choice of the filtered system.
Let $Q_∙$ and $M_∙$ be the filtered system with colimit $M$. We assume there is an assignment $φ$ s.t. the following diagram commutes for each $i$:
Assume $M_∙$ is ML, we shall show taht $Q_∙$ is also ML. There is some $φ (φ (i)) → j$ s.t. $f_{j, φ (i)}$ factors through $f_{k, φ (i)}$ ($∀ j → k$). We claim that
- for any $φ (j) → l$, $f_{φ (j), i}$ factors through $f_{l,i}$.
Note that
$$\begin{aligned} & Q_i → Q_{φ (j)} \ \text{factors through} \ Q_i → Q_l \\ ← \ & Q_i → Q_{φ (j)} \ \text{factors through} \ Q_i → Q_l → \ M_{φ (l)} \\ ↔ \ & Q_i → Q_{φ (j)} \ \text{factors through} \ Q_i → M_{φ (l)} → M_{φ (l)} \\ ↔ \ & Q_i → Q_{φ (j)} \ \text{factors through} \ Q_i → M_{φ (l)} → M_{φ (j)} \\ ← \ & Q_i → Q_{φ (j)} \ \text{factors through} \ Q_i → M_{φ (l)} → M_{φ (j)} → Q_{φ (j)} \quad = \text{True}\\ \end{aligned}$$
We revisit some examples of ML modules.
Pure projectives ($= 𝐒𝐦𝐝 (∐ 𝐦𝐨𝐝 _R)$), including $𝐦𝐨𝐝_R$ and $𝐏𝐫𝐨𝐣$, are ML. For countably generated modules, pure projectives coincides ML.
We show some closure property.
ML modules are closed under $∐$, $𝐒𝐦𝐝$, $⊗$, pure subobjects, pure extensions, as well as pure syzygies.
($∐$). We show $∐ _{i ∈ I} M_i$ is ML provided each $M_i$ is ML. Note that
$$\begin{aligned} (∐ \limits_{i ∈ I} M_i) ⊗ ∏ \limits_{λ ∈ Λ }N_λ & ≃ ∐ \limits_{i ∈ I} (M_i ⊗ ∏ \limits_{λ ∈ Λ }N_λ) ↪ ∐ \limits_{i ∈ I} ∏ \limits_{λ ∈ Λ } (M_i ⊗ N_λ) \\[6pt] & ↪ ∏ \limits_{λ ∈ Λ } ∐ \limits_{i ∈ I} (M_i ⊗ N_λ) ≃ ∏ \limits_{λ ∈ Λ } ((∐ \limits_{i ∈ I} M_i) ⊗ N_λ). \end{aligned}$$
($𝐒𝐦𝐝$). Note that summand of a monomorphism is again monic.
($⊗$). Let $(M_i, f)$ and $(N_a, φ )$ be filtered systems of $M$ and $N$, respectively. The Catersian product of the underlying diagram is also filtered, with colimit
$$\begin{equation} \varinjlim_{(i, a) ∈ I × A}{}^{fil} M_i ⊗ N_a ≃ M ⊗ A. \end{equation}$$
For $(i, a) ∈ I × A$, there exists $(i, a) → (j,b)$ s.t.
- for any $j → k$, $f_{j,i}$ factors through $f_{k,i}$ via some $α$, and
- for any $b → c$, $φ_{b,a}$ factors through $φ_{c,a}$ via some $β$.
Hence, for any $(j, b) → (k,c)$, the morphism $f_{j,i} ⊗ φ _{b,a}$ factors through $f_{k,i} ⊗ φ _{c,a}$ via $α ⊗ β$. It yields that $M ⊗ N$ is ML module.
(Pure subobjects and pure extensions). Let $0 → K → M → C → 0$ be pure exact. Then we obtain the commutative diagram:
If $β$ is monic, then $α$ is also monic; if $α$ and $γ$ are monic, then $β$ is also monic.
We finally shows the differences between projectives and ML modules.
Consider the following conditions:
- $M$ is flat;
- $M$ is ML;
- $M$ is $∐$ of countably generated modules.
In particular, (1 ∧ 2 ∧ 3) ↔ projective, (2 ∧ 3) ↔ pure projective; there are some characterisation of (1 ∧ 3) for commutative Noetherian rings, we show that it has projective dimension $≤ 1$.
(1 ∧ 2 ∧ 3 ↔ projective). (←). Any projective module satisfies 1 and 3. Any countably generated ML module is pure projective, including projectives. (→). Let $M = \varinjlim^{fil}F_∙$ be filtered colimit of f.g. free obejects. Let $\{x_i\}_{i ≥ 0}$ be the generating set of $x_i$. One can inductively find
- a countable chain $i_0^{(0)} → i_1^{(0)} → \cdots$ s.t. $\{x_{≤ k}\} ⊆ \operatorname{im} e_{i_k ^{(0)}}$;
- $i_p ^{(t+1)} := φ (i_p ^{(t)} )$, by ML condition.
By Cantor’s diagonal argument, we obtain a sequence $\{\overline {n}_i \}_{i ∈ ω}$. We take $n_0 := \overline {n} _0$ and $n_k ← n_{k+1} → \overline {n}_{k+1}$ and obtain an $ω$-chain $\{n_i\}_{i ∈ ω}$. We show $\varinjlim^{fil} M_{n_i}$.
- Clearly $\varinjlim ^{fil}_{i ∈ ω } M_{n_i} ↠ M$.
- To see the injection, $\ker (e_{n_i}) = \ker ⋃ _{ {n_i} → {n_j} } φ _{n_j,n_i} = \ker φ _{n_k , n_i}$ for some $n_k ≥ φ (n_i)$. Hence, if $x ∈ M_{n_i}$ maps to $0$, then it vanishes within finite steps, which shows the injection.
Hence, we find a cofinal $ω$-chain of the filtered system which is also ML under $(-, N)$ ($∀ N$). Note that $\varprojlim ^{fil}(M_i, -)$ is an exact functor, $M$ is projective.
(2 ∧ 3 ↔ $\text{Pure Proj}$). A pure projective module is a summand of $∐ 𝐦𝐨𝐝_R$. By Kaplansky’s argument,
$$\begin{equation} 𝐒𝐦𝐝 (∐(\text{Countably generated})) = ∐(\text{Countably generated}). \end{equation}$$
Hence pure projective satisties 2. and 3.. Conversely, recall that countably generated ML modules are pure projective. Hence, any module satisfying 2. and 3. is pure projective.
(1 ∧ 3 → pd $M ≤ 1$). A countably generated flat module $M$ is a filtered colimit of f.g. free modules. Follwoing the countable generating set, the system is cofinal to a countable transfinite composition. Hence, we obtain a presentation
$$\begin{equation} 0 → ∐ _{n ∈ ω } F_n \xrightarrow {1- φ } ∐ _{n ∈ ω } F_n → M → 0. \end{equation}$$
Therefore $p.d. M ≤ 1$.
We show some examples of the above comparision.
- (¬ 1 ∧ 2 ∧ 3). Any f.p. module is countably generated and ML, but not flat in general.
- (1 ∧ ¬ 2 ∧ 3). $ℚ ∈ 𝐌𝐨𝐝 _ℤ$ is countably generated flat. $ℚ$ is never ML, since $ℚ ⊗ ∏_{n ≥ 1} ℤ / n ℤ ≠ 0 = ∏ _{n ≥ 0}(ℚ ⊗ ℤ / n ℤ)$.
- (1 ∧ 2 ∧ ¬ 3). $ℤ ^ω ∈ 𝐌𝐨𝐝 _ℤ$ is flat and ML, but not a coproduct of countably generated module. $ℤ ^ω$ is flat since $ℤ$ is coherent. To see it is ML, we take any turple $x = (x^s)_{s ∈ ω} ∈ (ℤ^ω )^k$. By commuting of pp condition and $∏$, $\min pp(x) = ⋀ _{s ∈ ω } pp (x^s)$ exists. Hence $pp^{ℤ ^ω }(x)$ is principal. We finally show that $ℤ^ω$ is not a coproduct of countable abelian groups. Sperker’s theorem shows $(ℤ ^ω ,ℤ ) ≃ ℤ ^{(ω)}$. If $ℤ ^ ω = ∐_{i ∈ I} A_i$ is coproduct of countable Abelian groups, then $ℤ ^{(ω )}$ is a product of the dual groups. Since $|2^ω| > ω$, there are exactly finite many $i$ s.t. $(A_i, ℤ ) ≠ 0$. Hence, there is some uncountable summand $M ↪ ℤ ^ω$ s.t. $(M, ℤ) = 0$. Consider the projection $M \xrightarrow{p_k} ℤ$, a contradiction.
Show the local property of ML module $M$:
- any finite subset $S ⊆ M$ is contained in some pure projective submodule $P ⊆ M$;
- any countable subset $S ⊆ M$ is contained in some countably generated pure projective submodule $P ⊆ M$.
Pure Injective and Compactness
Anagolously to pure projectives, a pure injective module $X$ is such that $(θ , X)$ is exact for any pure exact sequence $θ$.
For any injective module $I$ and any module $X$, $(X, I)$ is pure exact. Note that $(θ , (X , I)) ≃ (θ ⊗ X , I)$ is exact.
Show basic properties of pure injective module:
- $M$ is pure injective iff any pure exact sequence $0 → M → X → Y → 0$ splits.
- $M$ is injective iff the canonical pure embedding $M ↪ M^{++}$ splits.
- Pure injective modules are closed under $∏$, $𝐒𝐦𝐝$。
- If $X$ is pure injective, then $\mathrm{Ext}^k(M,X)$ are pure injective for any $k ≥ 0$.
We show pure injective means algebraically compact. We show some examples before explaining the definitions
(Bohr’s compactification for Toplogical Abelian Groups). Let $T = ℝ / ℤ$ be the torus group. We endow $X^c := (X,T)_ℤ$ with discrete topology. In this case $X^{cc}$ is compact Hausdorff with dense subspace $X$.
- Note that $X^{cc} ↪ (X^c, T)_{𝐒𝐞𝐭𝐬} = T^{X^c}$ is a product of compact Hausdorff space. $X^{cc} = \{(t_f) : t_{f+g} = t_{f}+t_{g}\}$ is clearly a closed subspace, thus it is compact hausdorff.
- We show the essnetial image $X ↪ X^{cc},\quad x ↦ (f(x))_{f ∈ X^c}$ is dense. If not, then $\overline {X} ⋐ X^{cc}$ is compact subset. We take non-zero continuous character $χ : X^{cc} → T$ which vanishes on $\overline {X}$. By Pontryagin-duality theorem, $χ$ is evaluation of some $f ∈ X^c$. Since $χ : \overline {X} → 0$, we have $f = 0$. It yields $χ = 0$, a contradiction.
Hence, for any compact group $G$, the group homomorphism $X → G$ uniquely extends to a continuous homomorphism $X^{cc} → G$. Note that $(-)^{cc}$ is a left adjoint to the inclusion $𝐀𝐛𝐓𝐨𝐩𝐆𝐫𝐩 → 𝐂𝐩𝐭𝐇𝐚𝐮𝐬𝐀𝐛𝐓𝐨𝐩𝐆𝐫𝐩$. The adjuntion is generalised to the non-commutative case, see here for the general theory.
(Scalar-compact). A module $M ∈ 𝐌𝐨𝐝 _R$ is scalar-compact iff there is some compact Hausdorff space over $M$ making each
$$\begin{equation} M → M,\quad m ↦ mr\quad (r ∈ R) \end{equation}$$
a continuous map.
$X^{cc}$ is scalar-compact. We identify $r : X → X$ as a continuous endomorphism of discrete space $X$. The scalar maps extends to a continuous endomorphism of $X^{cc}$ by the universal property of Bohr’s compactification.
(Algebraically compact). The definition is related to Łoś’s theorem, we provide a simple definition here. Say $M$ is algebraically compact, iff for any linear system
$$\begin{equation} \mathcal{S} := \left\{∑ _{j ∈ J} m_i r_{i,j} = 0 ∣ i ∈ I\right\},\quad (∀ i ∈ I, \{r_{i,j}≠ 0 ∣ j ∈ J\} \ \text{is finite}). \end{equation}$$
when any finite subset of $\mathcal{S}$ has a solution, then the whole system $\mathcal{S}$ has a solution.
- Any such system identifies an element in $∏ _{i ∈ I} ∐ _{j ∈ J} R$.
Show that algebraically compact modules are closed under summands.
- We shall see that the idempotent completion of scalar-compact modules are algebraically compact ones.
Now we show equivalent definition of pure injective modules.
$M$ is pure injective iff the following equivalent definitions are satisfied.
- $(-, M)$ preserves the exactness of pure exact sequences.
- $M → M^{cc}$ or $M → M^{++}$ splits.
- $M$ is a summand of some scalar-compact module.
- $M$ is algebraically compact.
- The summation $Σ : ∐_{λ ∈ Λ }M → M$ extends to $∏_{λ ∈ Λ }M → M$.
Recall that $M ↪ M^{++}$, $M ↪ M^{cc}$, and $∐ _{λ ∈ Λ } M ↪ ∏ _{λ ∈ Λ } M$ are pure embeddings. Hence, (1 ↔ 2 → 3 ∧ 5). is clear.
(3 → 4). It suffices to show all scalar-compact modules are algebraically compact. We take arbitrary system $r_{∙,∙} ∈ ∏ _I ∐ _J R$. Note that for each finite $I_0 ⊆ I$, $M^{I_0}$ is zero of a continuous map, which is closed. Hence the solution set (with $I_0$ linear equations) is a closed subset of $M^I$, thus it is compact. By finite intersection argument of compact sets, $M$ is algebraically compact.
(4 → 1). For any pure submodule $X ↪ Y$, we show $h : X → M$ extends to $Y → M$. We take infinite turple $f ∈ M^Y$ with the following set of equations
$$\begin{equation} \{f_{y}r+f_{y'}r'-f_{yr+y'r'}=0\}_{y,y' ∈ Y, \text{and} \ r,r' ∈ R} ∪ \{f_y = h(y)\}_{y ∈ X ⊆ Y}. \end{equation}$$
When these equality holds, we obtain a homomorphism $f : Y → M$ with $f|_X = h$. Any finite subset of the above equations are of the form $𝐦 ⋅ 𝐑 = 𝐦 _0$, which has a solution in the pushout $M ⊔ _A B$. Since $M → M ⊔ _A B$ pure embedding, any such finite set of equation has a solution in $M$. By assumption of algebraically compactness, the global solution exists.
(5 → 4). A linear equation of the form $𝐱_{I_k} ⋅ 𝐑 ^{n × m} = 𝐱_0$ determines a composition of morphism
$$\begin{equation} ∐ _{I_k} M \xrightarrow{⋅ 𝐑 \ \text{termwise}} ∐ _{I_k}∐ _{J_k} M↪∐ _{I}∐ _{J_k} M \xrightarrow {∐ _{J_k}Σ} ∐ _{J_k}M. \end{equation}$$
We assume $J_∙$ to be the juxtaposition of constant terms, i.e., for $i ≠ j$, we take $J_i ∩ J_j = ∅$. By lifting property of $Σ$, we obtain
Since $\coprod_{J_0}\Sigma$ is surjective, $\coprod_{J_i}\widetilde {\Sigma}$ is surjective. The colimit functor of $\varinjlim _{J_i}$ preserves surjection, thus $\coprod_{J}\widetilde {\Sigma}$ is surjective. We denote $𝐲$ as the disjoint union of the constant part of the equation, taking $I$-projection of any $(\coprod_{J}\widetilde {\Sigma})^{-1}(𝐲)$ yields the solution.
Any additive functor preserving both $∐$ and $∏$ preserves pure injective modules.
Let $F$ be such a functor. Let $\widetilde {Σ} : ∏ _I X → X$ denote any lifting map of $Σ : ∐ _I X→ X$. Now $∐ _I (FX) \xrightarrow Σ FX$ has a lifting map
$$\begin{equation} ∏_I FX ≃ F∏_I X \xrightarrow {F\widetilde {Σ}} FX. \end{equation}$$
Fp-Injective
Another name for FP-Injective module is absolutely pure module. It is a dual notion of flat module.
Recall that, $M$ is flat iff any ses $0 → K → X → M → 0$ is pure.
(Fp-Inj). The following are equivalent for $M$.
- Any ses $0 → M → X → Y → 0$ is pure exact;
- $M ∈ (𝐦𝐨𝐝_R)^⟂$ (standard $\mathrm{Ext}^1$-orthogonality);
- $M$ is a pure submodule of some injective module.
(1 → 2, 3). Clear.
(3 → 1). Assume $M ↪ I$, is pure embedding, then any monomorphism $M ↪ X$ passes through $X → I$. Recall that
- if $gf$ is pure embedding, then so is $f$.
Hence $M ↪ X$ is a pure embedding.
(2 → 3). Let $M ↪ I$ be any injective preenvelope. Since $\mathrm{Ext}^1(𝐦𝐨𝐝 _R, M) = 0$, for any $K ∈ 𝐦𝐨𝐝 _R$ the morphism $K → I/M$ lifts up to $K → I$. Hence $M → I → I/M$ is pure exact.
Show that $(𝐒𝐦𝐝 (𝐅𝐢𝐥 (𝐦𝐨𝐝 _R)), \text{fp-Injective})$ is cogenerated by set, thus it is complete.