%%run pdflatex % \documentclass[12pt]{amsart} \usepackage[pdfpagemode=Fullscreen,pdfstartview=FitBH]{hyperref} \parindent=0pt \parskip=5pt \addtolength{\oddsidemargin}{-.5in} \addtolength{\evensidemargin}{-.5in} \addtolength{\textwidth}{1in} \theoremstyle{definition} \newtheorem{definition}{Definition} \newtheorem*{morphisms}{Morphisms} \newtheorem*{basic_results}{Basic Results} \newtheorem*{examples}{Examples} \newtheorem{example}{} \newtheorem*{properties}{Properties} \newtheorem*{finite_members}{Finite Members} \newtheorem*{subclasses}{Subclasses} \newtheorem*{superclasses}{Superclasses} \newcommand{\abbreviation}[1]{\textbf{Abbreviation: #1}} \pagestyle{myheadings}\thispagestyle{myheadings} \markboth{\today}{math.chapman.edu/structures} \begin{document} \textbf{\Large Commutative rings with identity} \quad\href{http://math.chapman.edu/cgi-bin/structures?action=edit;id=Commutative_rings_with_identity}{edit} \abbreviation{CRng$_1$} \begin{definition} A \emph{commutative ring with identity} is a \href{Rings_with_identity.pdf}{rings with identity} $\mathbf{R}=\langle R,+,-,0,\cdot,1 \rangle$ such that $\cdot$ is commutative: $x\cdot y=y\cdot x$ \end{definition} \begin{morphisms} Let $\mathbf{R}$ and $\mathbf{S}$ be commutative rings with identity. A morphism from $\mathbf{R}$ to $\mathbf{S}$ is a function $h:R\rightarrow S$ that is a homomorphism: $h(x+y)=h(x)+h(y)$, $h(x\cdot y)=h(x)\cdot h(y)$, $h(1)=1$ Remark: It follows that $h(0)=0$ and $h(-x)=-h(x)$. \end{morphisms} \begin{basic_results} $0$ is a zero for $\cdot$: $0\cdot x=x$ and $x\cdot 0=0$. \end{basic_results} \begin{examples} \begin{example} $\langle\mathbb{Z},+,-,0,\cdot,1\rangle$, the ring of integers with addition, subtraction, zero, multiplication, and one. \end{example} \end{examples} \begin{table}[h] \begin{properties} (\href{http://math.chapman.edu/cgi-bin/structures?Properties}{description}) \begin{tabular}{|ll|}\hline Classtype & variety\\\hline Equational theory & decidable\\\hline Quasiequational theory & \\\hline First-order theory & undecidable\\\hline Locally finite & no\\\hline Residual size & unbounded\\\hline Congruence distributive & no\\\hline Congruence modular & yes\\\hline Congruence n-permutable & yes, $n=2$\\\hline Congruence regular & yes\\\hline Congruence uniform & yes\\\hline Congruence extension property & \\\hline Definable principal congruences & \\\hline Equationally def. pr. cong. & \\\hline Amalgamation property & \\\hline Strong amalgamation property & \\\hline Epimorphisms are surjective & \\\hline \end{tabular} \end{properties} \end{table} \begin{finite_members} $f(n)=$ number of members of size $n$. $\begin{array}{lr} f(1)= &1\\ f(2)= &1\\ f(3)= &1\\ f(4)= &4\\ f(5)= &1\\ f(6)= &1\\ \end{array}$ \end{finite_members} \hyperbaseurl{http://math.chapman.edu/structures/files/} \parskip0pt \begin{subclasses}\ \href{Boolean_algebras.pdf}{Boolean algebras} \href{Integral_domains.pdf}{Integral domains} \end{subclasses} \begin{superclasses}\ \href{Commutative_rings.pdf}{Commutative rings} \href{Rings_with_identity.pdf}{Rings with identity} \end{superclasses} \begin{thebibliography}{10} \bibitem{Ln19xx} \end{thebibliography} \end{document} %
|