# Composition ring

In mathematics, a composition ring, introduced in (Adler 1962), is a commutative ring (R, 0, +, −, ·), possibly without an identity 1 (see non-unital ring), together with an operation

${\displaystyle \circ :R\times R\rightarrow R}$

such that, for any three elements ${\displaystyle f,g,h\in R}$ one has

1. ${\displaystyle (f+g)\circ h=(f\circ h)+(g\circ h)}$
2. ${\displaystyle (f\cdot g)\circ h=(f\circ h)\cdot (g\circ h)}$
3. ${\displaystyle (f\circ g)\circ h=f\circ (g\circ h).}$

It is not generally the case that ${\displaystyle f\circ g=g\circ f}$, nor is it generally the case that ${\displaystyle f\circ (g+h)}$ (or ${\displaystyle f\circ (g\cdot h)}$) has any algebraic relationship to ${\displaystyle f\circ g}$ and ${\displaystyle f\circ h}$.

## Examples

There are a few ways to make a commutative ring R into a composition ring without introducing anything new.

• Composition may be defined by ${\displaystyle f\circ g=0}$ for all f,g. The resulting composition ring is a rather uninteresting.
• Composition may be defined by ${\displaystyle f\circ g=f}$ for all f,g. This is the composition rule for constant functions.
• If R is a boolean ring, then multiplication may double as composition: ${\displaystyle f\circ g=fg}$ for all f,g.

More interesting examples can be formed by defining a composition on another ring constructed from R.

• The polynomial ring R[X] is a composition ring where ${\displaystyle (f\circ g)(x)=f(g(x))}$ for all ${\displaystyle f,g\in R}$.
• The formal power series ring R[[X]] also has a substitution operation, but it is only defined if the series g being substituted has zero constant term (if not, the constant term of the result would be given by an infinite series with arbitrary coefficients). Therefore, the subset of R[[X]] formed by power series with zero constant coefficient can be made into a composition ring with composition given by the same substitution rule as for polynomials. Since nonzero constant series are absent, this composition ring does not have a multiplicative unit.
• If R is an integral domain, the field R(X) of rational functions also has a substitution operation derived from that of polynomials: substituting a fraction g1/g2 for X into a polynomial of degree n gives a rational function with denominator ${\displaystyle g_{2}^{n}}$, and substituting into a fraction is given by
${\displaystyle {\frac {f_{1}}{f_{2}}}\circ g={\frac {f_{1}\circ g}{f_{2}\circ g}}.}$
However, as for formal power series, the composition cannot always be defined when the right operand g is a constant: in the formula given the denominator ${\displaystyle f_{2}\circ g}$ should not be identically zero. One must therefore restrict to a subring of R(X) to have a well-defined composition operation; a suitable subring is given by the rational functions of which the numerator has zero constant term, but the denominator has nonzero constant term. Again this composition ring has no multiplicative unit; if R is a field, it is in fact a subring of the formal power series example.
• The set of all functions from R to R under pointwise addition and multiplication, and with ${\displaystyle \circ }$ given by composition of functions, is a composition ring. There are numerous variations of this idea, such as the ring of continuous, smooth, holomorphic, or polynomial functions from a ring to itself, when these concepts makes sense.

For a concrete example take the ring ${\displaystyle {\mathbb {Z} }[x]}$, considered as the ring of polynomial maps from the integers to itself. A ring endomorphism

${\displaystyle F:{\mathbb {Z} }[x]\rightarrow {\mathbb {Z} }[x]}$

of ${\displaystyle {\mathbb {Z} }[x]}$ is determined by the image under ${\displaystyle F}$ of the variable ${\displaystyle x}$, which we denote by

${\displaystyle f=F(x)}$

and this image ${\displaystyle f}$ can be any element of ${\displaystyle {\mathbb {Z} }[x]}$. Therefore, one may consider the elements ${\displaystyle f\in {\mathbb {Z} }[x]}$ as endomorphisms and assign ${\displaystyle \circ :{\mathbb {Z} }[x]\times {\mathbb {Z} }[x]\rightarrow {\mathbb {Z} }[x]}$, accordingly. One easily verifies that ${\displaystyle {\mathbb {Z} }[x]}$ satisfies the above axioms. For example, one has

${\displaystyle (x^{2}+3x+5)\circ (x-2)=(x-2)^{2}+3(x-2)+5=x^{2}-x+3.}$

This example is isomorphic to the given example for R[X] with R equal to ${\displaystyle \mathbb {Z} }$, and also to the subring of all functions ${\displaystyle \mathbb {Z} \to \mathbb {Z} }$ formed by the polynomial functions.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 33, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://en.wikipedia.org/wiki/Composition_ring", "fetch_time": 1495558939000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2017-22/segments/1495463607648.39/warc/CC-MAIN-20170523163634-20170523183634-00098.warc.gz", "warc_record_offset": 759753829, "warc_record_length": 12957, "token_count": 1212, "char_count": 4554, "score": 4.09375, "int_score": 4, "crawl": "CC-MAIN-2017-22", "snapshot_type": "latest", "language": "en", "language_score": 0.8817090392112732, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00050-of-00064.parquet"}