Skip to content

Commit 4f25a71

Browse files
committed
Update obsolete references
1 parent 31316df commit 4f25a71

6 files changed

Lines changed: 22 additions & 20 deletions

File tree

text/algebras_over_semirings.tex

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -96,7 +96,7 @@ \section{Algebras over semirings}\label{sec:algebras_over_semirings}
9696
\item If \( A \) is also an \( R \)-algebra, we denote the set of all \( R \)-\hyperref[def:algebra_over_semiring/homomorphism]{algebra homomorphisms} by \( \hom(A, N) \) in accordance with the general notation for \hyperref[def:category/morphisms]{categorical morphism sets}.
9797
\end{comments}
9898
\begin{proof}
99-
By \cref{thm:functions_over_model_form_model}, \( N \) is both an \( R \)-semiring and an \( R \)-semimodule. Compatibility comes from left distributivity in \( N \).
99+
By \cref{thm:fol_equational_theory_models/functions}, \( N \) is both an \( R \)-semiring and an \( R \)-semimodule. Compatibility comes from left distributivity in \( N \).
100100
\end{proof}
101101

102102
\paragraph{Semigroup algebras}

text/first_order_structures.tex

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -25,6 +25,22 @@ \section{First-order structures}\label{sec:first_order_structures}
2525
\item Substructures correspond to \hyperref[def:categorical_subobject]{categorical subobjects}; see \cref{thm:fol_categorical_subobjects}.
2626
\end{comments}
2727

28+
\begin{example}\label{ex:replacing_functional_symbols_via_relations}
29+
Consider the \hyperref[def:semigroup/theory]{theory of semigroups}. We have a functional symbol \( \cdot \), which we can also represent via the ternary predicate \( p(x, y, z) \), which holds for \( (a, b, c) \) in some structure \( \mscrX = (X, I) \) if and only if \( a \cdot b = c \).
30+
31+
If we choose to work only with the relation, the signature would not have any function symbols, and every subset of \( X \) would induce a substructure.
32+
33+
This also introduces a complication, however. We must ensure that the relation represents a function, and this can be done via the axiom
34+
\begin{equation*}
35+
\qforall x \qforall y \qExists z p(x, y, z),
36+
\end{equation*}
37+
where we have used the unique existence shorthand from \cref{rem:fol_exists_unique_abbreviation}.
38+
39+
In this setting, a model of the theory of semigroups must satisfy this axiom, and thus it is possible for a substructure not to be a model.
40+
41+
For example, the negative real numbers are not a semigroup under multiplication because the product of two negative numbers is positive. A functional symbol encodes this requirement into the definition of a substructure. But otherwise we must encode this via formulas, which makes the definition of substructure trivial, but now it is possible for a substructure not to be a model.
42+
\end{example}
43+
2844
\begin{proposition}\label{thm:fol_substructure_characterization}
2945
Given a structure \( \mscrX = (X, I) \), the subset \( A \subseteq X \) \hyperref[def:fol_substructure/induces]{induces} a substructure of \( \mscrX \) if and only if it is closed under \( I(f) \) for every function symbol \( f \).
3046
\end{proposition}

text/rings.tex

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1141,7 +1141,7 @@ \section{Rings}\label{sec:rings}
11411141
(\xi \syneq 0) \synvee \qexists \eta (\xi \cdot \eta \syneq 1).
11421142
\end{equation}
11431143

1144-
These axioms are not \hyperref[def:positive_formula]{positive formulas}, hence many structural theorems from \fullref{sec:first_order_models} fail to hold for them.
1144+
The resulting theory is no longer an \hyperref[def:fol_equational_theory]{equational theory}, hence many theorems from \fullref{sec:equational_theories} to hold for them.
11451145

11461146
\thmitem{def:field/homomorphism}\mcite[453]{Knapp2016BasicAlgebra} A \hyperref[def:fol_homomorphism]{first-order homomorphism} between fields is simply a \hyperref[def:ring/homomorphism]{unital ring homomorphism}.
11471147

text/semigroups.tex

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -263,7 +263,7 @@ \section{Semigroups}\label{sec:semigroups}
263263

264264
\SubProofOf{thm:zero_morphisms_pointed/kernel}
265265

266-
\SubProof*{Proof that \( \ker f \) is a submodel of \( A \)} As the preimage of the submodel \( \set{ e_B } \) of \( B \), \( \ker f \) is a substructure of \( A \) as a consequence of \cref{thm:def:fol_homomorphism/preimage_is_substructure}. As a substructure, \( \ker f \) is a model of \( \Gamma \) as a consequence of \cref{thm:substructure_is_model}.
266+
\SubProof*{Proof that \( \ker f \) is a submodel of \( A \)} As the preimage of the submodel \( \set{ e_B } \) of \( B \), \( \ker f \) is a substructure of \( A \) as a consequence of \cref{thm:def:fol_homomorphism/preimage_is_substructure}. As a substructure, \( \ker f \) is a model of \( \Gamma \) as a consequence of \cref{thm:fol_equational_theory_models/substructure}.
267267

268268
\SubProof*{Proof that \( (\ker f, \iota) \) is an equalizer cone} The following diagram must commute:
269269
\begin{equation*}
@@ -287,7 +287,7 @@ \section{Semigroups}\label{sec:semigroups}
287287

288288
\SubProofOf{thm:zero_morphisms_pointed/cokernel}
289289

290-
\SubProof*{Proof that \( \co\ker f \) is a model of \( \Gamma \)} Follows from \cref{thm:quotient_preserves_positive_formulas}.
290+
\SubProof*{Proof that \( \co\ker f \) is a model of \( \Gamma \)} Follows from \cref{thm:fol_equational_theory_models/quotient}.
291291

292292
\SubProof*{Proof that \( (\co\ker f, \pi) \) is a coequalizer cocone} The following diagram must commute:
293293
\begin{equation*}
@@ -326,7 +326,7 @@ \section{Semigroups}\label{sec:semigroups}
326326

327327
Therefore, the set-theoretic image \( f[A] \) necessarily belongs to the category-theoretic image \( \img f \).
328328

329-
\Cref{thm:def:fol_substructure/homomorphism_image} implies that \( f[A] \) is a substructure of \( B \) and \cref{thm:substructure_is_model} implies that it is a model of \( \Gamma \). Hence, \( f[A] \) is an object in the category \( \cat{C} \).
329+
\Cref{thm:def:fol_substructure/homomorphism_image} implies that \( f[A] \) is a substructure of \( B \) and \cref{thm:fol_equational_theory_models/substructure} implies that it is a model of \( \Gamma \). Hence, \( f[A] \) is an object in the category \( \cat{C} \).
330330

331331
As a substructure of \( \mscrY \), it is closed under function applications in \( \mscrY \), hence it contains the equivalence class of \( e_B \) under \( {\cong} \).
332332

text/semimodules.tex

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -353,7 +353,7 @@ \section{Semimodules}\label{sec:semimodules}
353353
\end{equation*}
354354

355355
\begin{thmenum}
356-
\thmitem{def:free_semimodule/operations} \Cref{thm:functions_over_model_form_model} implies that \( R^{\oplus A} \) is a semiring with the elementwise addition and multiplication inherited from \( R \). Scalar multiplication by \( r \in R \) can be defined as multiplication by the \hyperref[def:constant_function]{constant function} at \( r \).
356+
\thmitem{def:free_semimodule/operations} \Cref{thm:fol_equational_theory_models/functions} implies that \( R^{\oplus A} \) is a semiring with the elementwise addition and multiplication inherited from \( R \). Scalar multiplication by \( r \in R \) can be defined as multiplication by the \hyperref[def:constant_function]{constant function} at \( r \).
357357

358358
\thmitem{def:free_semimodule/inclusion} We start with the canonical inclusion
359359
\begin{equation*}

text/semirings.tex

Lines changed: 0 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -408,20 +408,6 @@ \section{Semirings}\label{sec:semirings}
408408
We say that a \hyperref[def:semiring]{semiring} is \term[ru=целостное (\cite[def. 3.5.1]{Винберг2014КурсАлгебры})]{entire} if it has no \hyperref[def:divisibility]{nontrivial zero divisors}, neither left nor right.
409409
\end{definition}
410410

411-
\begin{remark}\label{rem:entire_semiring_axiom}
412-
The following first-order axiom, based on \cite[def. III.1.10]{Aluffi2009Algebra}, ensures that a semiring is \hyperref[def:entire_semiring]{entire}:
413-
\begin{equation}\label{eq:rem:entire_semiring_axiom}
414-
\synx \cdot \syny \syneq 0 \synimplies (\synx \syneq 0 \synvee \syny \syneq 0).
415-
\end{equation}
416-
417-
It is technically not a \hyperref[def:positive_formula]{positive formula} because it contains an implication, but rewriting the conditional via \eqref{eq:thm:classical_equivalences/conditional_as_disjunction}, we obtain another formula that is more obviously not positive:
418-
\begin{equation*}
419-
\synneg (\synx \cdot \syny \syneq 0) \synvee \synx \syneq 0 \synvee \syny \syneq 0.
420-
\end{equation*}
421-
422-
As a side effect, results from \fullref{sec:first_order_models} concerning positive formulas do not hold for \hyperref[def:integral_domain]{integral domains} and especially \hyperref[def:field]{fields}.
423-
\end{remark}
424-
425411
\begin{example}\label{ex:def:entire_semiring}
426412
We list examples of (non-)\hyperref[def:entire_semiring]{entire} semirings:
427413
\begin{thmenum}

0 commit comments

Comments
 (0)