Subring test

Subring test

In abstract algebra, the subring test is a theorem that states that for any ring, a nonempty subset of that ring is a subring if it is closed under multiplication and subtraction. Note that here that the terms "ring" and "subring" are used without requiring a multiplicative identity element.

More formally, let R be a ring, and let S be a nonempty a subset of R. If for all a, b in S one has ab in S, and for all a, bin S one has a - b in S, then S is a subring of R.

If rings are required to have unity, then it must also be assumed that the multiplicative identity is in the subset.

Proof

Since S is nonempty and closed under subtraction, by the subgroup test it follows that S is a group under addition. Hence, S is closed under addition, addition is associative, S has an additive identity, and every element in S has an additive inverse.

Since the operations of S are the same as those of R, it immediately follows that addition is commutative, multiplication is associative, multiplication is left distributive over addition, and multiplication is right distributive over addition.

Thus, S is a subring of R.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Subring — In mathematics, a subring is a subset of a ring, which contains the multiplicative identity and is itself a ring under the same binary operations. Naturally, those authors who do not require rings to contain a multiplicative identity do not… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Injective module — In mathematics, especially in the area of abstract algebra known as module theory, an injective module is a module Q that shares certain desirable properties with the Z module Q of all rational numbers. Specifically, if Q is a submodule of some… …   Wikipedia

  • Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… …   Wikipedia

  • Gröbner basis — In computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating subset of an ideal I in a polynomial ring R. One can view it as a multivariate, non linear… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”