\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*{polynomial}

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

\hypertarget{algebra}{}\paragraph*{{Algebra}}\label{algebra}

[[!include higher algebra - contents]]

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

\noindent\hyperlink{definitions_and_meanings}{Definitions and meanings}\dotfill \pageref*{definitions_and_meanings} \linebreak
\noindent\hyperlink{properties}{Properties}\dotfill \pageref*{properties} \linebreak
\noindent\hyperlink{as_continuous_functions}{As continuous functions}\dotfill \pageref*{as_continuous_functions} \linebreak
\noindent\hyperlink{as_domains}{As domains}\dotfill \pageref*{as_domains} \linebreak
\noindent\hyperlink{related_concepts}{Related concepts}\dotfill \pageref*{related_concepts} \linebreak


\hypertarget{definitions_and_meanings}{}\subsection*{{Definitions and meanings}}\label{definitions_and_meanings}

Let $R$ be a [[commutative ring]]. A \emph{polynomial} with coefficients in $R$ is an element of a \textbf{polynomial ring} over $R$. A polynomial ring over $R$ consists of a [[set]] $X$ whose elements are called ``[[variables]]'' or ``indeterminates'', and a [[function]] $X \to R[X]$ to (the underlying set of) a commutative $R$-algebra that is universal among such functions, so that $R[X]$ is the [[free object|free]] commutative $R$-algebra generated by $X$; a polynomial is then an element of the underlying set of $R[X]$.

\begin{remark}
\label{}\hypertarget{}{}
Much like ``[[vector]]'', the term ``polynomial'' in this sense may seem slightly deprecated from the viewpoint of modern mathematics. We no longer think of a [[vector space]] as consisting of things called ``vectors'' (i.e. we don't assign an objective meaning to ``vectors''); it's the other way around, where we introduce a type of structure called a vector space and then, relative to a given vector space context, declare that ``vector'' just means an element therein. Similarly, the term ``polynomial'' in the sense above has seemingly been subordinated to the structural concept of polynomial ring. (In Linderholm's \emph{Mathematics Made Difficult}, page 152, there is an amusing passage where someone points at the expression $a_0 + a_1 X + a_2 X^2 + \ldots + a_n X^n$ and asks ``Well, how about it? Is it a polynomial, or isn't it?'' and the respondent says, ``Yeah, sure, I guess. Looks like one. Yeah, sure, that's a polynomial all right'' -- an answer which is not wrong exactly, but not quite right either, since it fails to recognize that there is something questionable about the question.)

\end{remark}
\begin{remark}
\label{}\hypertarget{}{}
On further reflection, however, we might more objectively identify the concept of ``polynomial'' (let us say a polynomial in $n$ variables) with a definable $n$-[[signature (in logic)|ary]] [[signature (in logic)|operation]] in the [[theory]] of commutative $R$-algebras. From a categorical perspective, if $U: CommAlg_R \to Set$ is the forgetful functor, a definable $n$-ary operation means a [[natural transformation]] $U^n \to U$. The connection is that the functor $U^n$ is [[representable functor|representable]], being represented by the [[free object]] $F[n] = R[x_1, \ldots, x_n]$, so that a natural transformation $U^n \to U$ is canonically identified with a transformation $\hom(R[x_1, \ldots, x_n], -) \to U$ or to an element of $U R[x_1, \ldots, x_n]$, by the [[Yoneda lemma]]. In pursuit of this objective meaning (which is essentially due to [[Lawvere]]), we find that the ``variable'' $x_i$ stands for the $i^{th}$ projection map $U^n \to U$, and that the meaning of (let's say) $x_1 x_2 \in R[x_1, x_2, x_3]$ is that it is the definable operation whose instantiation at any commutative $R$-algebra $A$ is the function $A^3 \to A$ taking $(a, b, c)$ to $a b$.

Of course there are traditional standard expressions that people usually have in mind when they speak of ``a polynomial'' as such. But leaving it at that, where polynomials are merely identified with certain types of expressions (as by the characters in Linderholm's book), ignores the deeper objective meaning of definable operations which of course is the actual point of it all.

\end{remark}
\begin{remark}
\label{}\hypertarget{}{}
Finally, sometimes ``polynomial'' is construed to mean a \emph{polynomial function}. This is actually just a particular instantiation of a definable operation. The default meaning is that, if we are working for instance with a polynomial ring in one variable $R[x]$, then we have a composite

\begin{displaymath}
U R[x] \cong \hom(U, U) \stackrel{ev_R}{\to} \hom(U R, U R)
\end{displaymath}
where the second map sends a natural transformation to its component at $R$ as an $R$-algebra. Put differently, the set $\hom(U R, U R)$ carries a commutative $R$-algebra structure under the pointwise operations, and there is a unique $R$-algebra map $R[x] \to \hom(U R, U R)$ that sends `$x$' to the [[identity map]]. The [[value]] of a polynomial $p \in R[x]$ under this map is then the corresponding polynomial function $U R \to U R$.

This conflation of polynomials with polynomial functions is often forgivable, particularly in those cases where the map $R[x] \to \hom(U R, U R)$ is [[injective function|injective]] (so that `polynomials' are identified with certain types of functions). Of course the map \emph{won't} be injective if $R$ is [[finite set|finite]], to give one example. But in analysis, where we consider functions on $\mathbb{R}$ or $\mathbb{C}$, the conflation is familiar and rarely cause for concern. The conflation may also be responsible for certain notational artifacts, such as the common (and useful!) practice of writing $p(x)$ for polynomials $p$.

\end{remark}
With these preliminary remarks out of the way, we recall some of the more syntactic considerations with an example.

\begin{example}
\label{}\hypertarget{}{}
The set of \textbf{polynomials} in one [[variable]] $z$ with [[coefficients]] in $R$ is the set $R[\mathbb{N}]$ of all [[formal linear combinations]] on elements $n \in \mathbb{N}$, thought of as powers $z^n$ of the variable $z$. As a string of symbols, a polynomial is frequently represented by a form like

\begin{displaymath}
a_n z^n + \cdots + a_1 z + a_0 
  \,,
\end{displaymath}
where $n$ is an arbitrary [[natural number]] and $a_0, \dots, a_n \in R$, subject to the usual fine print (where we work [[quotient set|modulo]] the [[congruence]] generated by equations of the form

\begin{displaymath}
0 z^{n+1} + a_n z^n + \cdots + a_1 z + a_0 = a_n z^n + \cdots + a_1 z + a_0
\end{displaymath}
so that we ignore coefficients of zero). (The \textbf{degree} of a polynomial is the maximum $n$ for which $a_n$ is nonzero, in which case the \textbf{leading term} of the polynomial is $a_n z^n$. A polynomial is \textbf{constant} if its degree is $0$. The degree of the zero polynomial may be left chastely undefined, although for some purposes it may be convenient to define it as $-1$ or as $-\infty$. Even $0$ is possible if one is prepared to observe some fine print. \emph{Chacun \`a{} son go\^u{}t}.)

This set is equipped with an $R$-module structure (where formal linear combinations are added and scalar-multiplied as usual) and also with the structure of a ring, in fact a [[commutative algebra]] over $R$, denoted $R[z]$ and called the \textbf{polynomial ring} or \textbf{ring of polynomials}, with ring multiplication

\begin{displaymath}
R[z] \cdot R[z] \to R[z]
\end{displaymath}
the unique one that bilinearly extends the multiplication of monomials given by

\begin{displaymath}
z^k \cdot z^l = z^{k+l}
  \,.
\end{displaymath}
\end{example}
Thus, one way to construct a polynomial ring is first to construct the free commutative monoid generated by a set $X$ (the monoid of monomials), and then to construct the free $R$-module generated by the underlying set of that monoid, extending the monoid multiplication to a ring multiplication by bilinearity.

In addition to the ring structure, there is a further operation $R[z] \times R[z] \to R[z]$ which may be described as ``substitution''; see Remark \ref{substitution} below for a general description (which applies in fact to any [[Lawvere theory]]).

Moreover, there is a noncommutative analogue of polynomial ring on a set $X$, efficiently described as the free $R$-[[module]] generated by the (underlying set of the) free [[monoid]] on $X$. This carries also a ring structure, with ring multiplication induced from the monoid multiplication. A far-reaching generalization of this construction is given at [[distributive law]].

Finally: polynomial algebras may be regarded as [[graded algebras]] (graded over $\mathbb{N}$). Specifically: let us regard $R[X]$ as the free $R$-module generated by (the underlying set of) the free [[commutative monoid]] $F(X)$. The monoid homomorphism $F(!): F(X) \to F(1) \cong \mathbb{N}$ induced by the unique function $!: X \to 1$ gives an $\mathbb{N}$-fibering of $F(X)$ over $\mathbb{N}$, with typical fiber $F(X)_n$ whose elements are called \emph{monomials of degree $n$}. Then the \emph{homogeneous component} of degree $n$ in $R[X]$ is the $R$-submodule generated by the subset $F(X)_n \subset F(X)$. The elements of this component are called \emph{homogeneous polynomials of degree $n$}.

\hypertarget{properties}{}\subsection*{{Properties}}\label{properties}

\begin{prop}
\label{}\hypertarget{}{}
The polynomial ring $R[z]$ is the [[free construction|free]] $R$-[[commutative algebra|algebra]] on one generator (the variable $z$).

\end{prop}
\begin{proof}
By the definition of [[free objects]] one needs to check that algebra [[homomorphisms]]

\begin{displaymath}
f : R[z] \to K
\end{displaymath}
to another algebra K are in [[natural bijection]] with [[functions]] of [[sets]]

\begin{displaymath}
\bar f : * \to K
\end{displaymath}
from the [[singleton]] to the set underlying $K$. Take $\bar f \coloneqq f(z)$. Using $R$-linearity, this is directly seen to yield the desired bijection.

\end{proof}
\begin{remark}
\label{}\hypertarget{}{}
Similarly, the set of polynomials in any given [[set]] of variables with coefficients in $R$ is the [[free construction|free]] commutative $R$-algebra on that set of generators; see [[symmetric power]] and [[symmetric algebra]].

\end{remark}
\begin{remark}
\label{substitution}\hypertarget{substitution}{}
As usual in the study of universal algebra via [[Lawvere theories]], there is an [[operad]] whose $n^{th}$ component $C_n$ is the free algebra $R[x_1, \ldots, x_n]$, and whose operadic multiplication is given by maps

\begin{displaymath}
C_k \times C_{n_1} \times \ldots \times C_{n_k} \to C_n
\end{displaymath}
($n = n_1 + \ldots + n_k$) that take a tuple of elements $(p; q_1, \ldots, q_k)$ to $p(q_1(x), \ldots, q_k(x))$. Formally, it takes this tuple to the value of $p$ under the unique algebra map $R[x_1, \ldots, x_k] \to R[x_1, \ldots, x_n]$ that extends the mapping $x_j \mapsto i_j(q_j)$. Here the $i_j: R[x_1, \ldots, x_{n_j}] \to R[x_1, \ldots, x_n]$ are appropriate coproduct inclusions (in the category of commutative rings), where $i_j(x_l) = x_{n_1 + \ldots + n_{j-1} + l}$. A particularly important case of substitution is the case $k=1$ and $n_1 = 1$, where the map $R[x] \times R[x] \to R[x]$ is ordinary substitution $(p, q) \mapsto p(q(x))$. This is a special case of the more general notion of [[Tall-Wraith monoid]].

\end{remark}
\begin{remark}
\label{}\hypertarget{}{}
In case $R$ is an [[integral domain]], the [[field of fractions]] of $R[z]$ is the [[field]] $R(z)$ of [[rational functions]].

\end{remark}
\hypertarget{as_continuous_functions}{}\subsubsection*{{As continuous functions}}\label{as_continuous_functions}

If $R = \mathbb{R}$ is the [[real numbers]] regarded as a [[Euclidean space]] equipped with its [[metric topology]], regard a polynomial $P \in \mathbb{R}[X]$ as a [[function]] $\mathbb{R} \to \mathbb{R}$. Then this is a [[continuous function]]. See at \emph{[[polynomials are continuous]]}.

\hypertarget{as_domains}{}\subsubsection*{{As domains}}\label{as_domains}

In the case where $R = k$ is a [[field]], the polynomial ring $k[x]$ has a number of useful properties. One is that it is a [[Euclidean domain]], where the degree serves as the Euclidean function:

\begin{lemma}
\label{}\hypertarget{}{}
Let $R$ be a commutative ring. Given $f, g \in R[x]$ where the leading coefficient of $g$ is a unit (e.g., if $g$ is a [[monic polynomial]]), there are unique $q, r \in k[x]$ such that $f = q \cdot g + r$ and $\deg(r) \lt \deg(g)$.

\end{lemma}
\begin{proof}
If $\deg(f) \lt \deg(g)$, then $q = 0$ and $r = f$ will serve. Otherwise we may argue by [[induction]] on $\deg(f)$, where if $a_m x^m$ is the leading term of $f$ and $b_n x^n$ the leading term of $g$, then $h(x) = f(x) - a_m b_n^{-1} x^{m-n}g(x)$ has lower degree than $f(x)$. This proves existence. Uniqueness is clear, since if $q \cdot g + r = q' \cdot g + r'$ and $q \neq q'$, we have $\deg((q - q')g) = \deg(r' - r) \lt \deg(g)$ which is impossible; then $r = r'$ quickly follows from $q = q'$.

\end{proof}
\begin{cor}
\label{}\hypertarget{}{}
If $k$ is field, then $k[x]$ is a [[Euclidean domain]]. As a result, $k[x]$ is a [[principal ideal domain]], and therefore a [[unique factorization domain]].

\end{cor}
See [[Euclidean domain]] for a proof.

\begin{cor}
\label{}\hypertarget{}{}
For any commutative ring $R$, if $a \in R$ is a [[root]] of $p(x) \in R[x]$, i.e., if the value of the polynomial function $p(a)$ is $0$, then $p(x)$ is of the form $(x - a)q(x)$.

\end{cor}
\begin{proof}
Since $x - a$ is monic, we may write $p(x) = (x - a)q(x) + r$ where $\deg(r) \lt 1$, whence $r$ is a constant. By evaluating the polynomial function at $x = a$, the term $r$ is $0$.

\end{proof}
This observation may be exploited in various neat ways. One is that if $p(x)$ is a polynomial, then $p(y) = p(x) + (y - x)q(x, y)$ for some unique $q(x, y) \in k[x, y]$. A consequence is that the Lawvere theory of commutative $k$-algebras is a [[Fermat theory]]. The [[derivative]] of $p$ may be defined to be $q(x, x) \in k[x]$.

\hypertarget{related_concepts}{}\subsection*{{Related concepts}}\label{related_concepts}

\begin{itemize}%
\item [[monomial]]


\item [[power series]], [[formal power series]]


\item [[monic polynomial]]


\item [[tensor algebra]]


\item [[affine line]], [[affine space]]


\item [[Tate algebra]], [[polydisk]]


\item [[variety]], [[Diophantine equation]]


\item [[Jones polynomial]], [[Alexander polynomial]] ([[knot theory]])


\item [[spectral polynomial algebra]]


\item [[polynomial Poisson algebra]]


\item [[Wick polynomial]]



\end{itemize}
[[!redirects polynomial]] [[!redirects polynomials]]

[[!redirects polynomial ring]] [[!redirects polynomial rings]] [[!redirects polynomial algebra]] [[!redirects polynomial algebras]]

[[!redirects polynomial function]] [[!redirects polynomial functions]]



\end{document}