Ordered ring

In abstract algebra, an ordered ring is a (usually commutative) ring R with a total order ≤ such that for all a, b, and c in R:[1]

  • if a ≤ b then a + c ≤ b + c.
  • if 0 ≤ a and 0 ≤ b then 0 ≤ ab.
The real numbers are an ordered ring which is also an ordered field. The integers, a subset of the real numbers, are an ordered ring that is not an ordered field.

Examples

Ordered rings are familiar from arithmetic. Examples include the integers, the rationals and the real numbers.[2] (The rationals and reals in fact form ordered fields.) The complex numbers, in contrast, do not form an ordered ring or field, because there is no inherent order relationship between the elements 1 and i.

Positive elements

In analogy with the real numbers, we call an element c of an ordered ring R positive if 0 < c, and negative if c < 0. 0 is considered to be neither positive nor negative.

The set of positive elements of an ordered ring R is often denoted by R+. An alternative notation, favored in some disciplines, is to use R+ for the set of nonnegative elements, and R++ for the set of positive elements.

Absolute value

If is an element of an ordered ring R, then the absolute value of , denoted , is defined thus:

where is the additive inverse of and 0 is the additive identity element.

Discrete ordered rings

A discrete ordered ring or discretely ordered ring is an ordered ring in which there is no element between 0 and 1. The integers are a discrete ordered ring, but the rational numbers are not.

Basic properties

For all a, b and c in R:

  • If a ≤ b and 0 ≤ c, then ac ≤ bc.[3] This property is sometimes used to define ordered rings instead of the second property in the definition above.
  • |ab| = |a| |b|.[4]
  • An ordered ring that is not trivial is infinite.[5]
  • Exactly one of the following is true: a is positive, -a is positive, or a = 0.[6] This property follows from the fact that ordered rings are abelian, linearly ordered groups with respect to addition.
  • In an ordered ring, no negative element is a square.[7] This is because if a ≠ 0 and a = b2 then b ≠ 0 and a = (-b)2; as either b or -b is positive, a must be nonnegative.
gollark: I said "technically", not "it actually seriously is".
gollark: With V, the best language, you can't argue about it because it compiles 1 trillion LOC/second.
gollark: You must have short arguments.
gollark: Technically, Python (in CPython) probably can via `ctypes`.
gollark: Being wildly unsafe all the time is probably of some value in, say, embedded systems, but mostly it is better to have safe code which is not going to do memory-unsafe things.

See also

Notes

The list below includes references to theorems formally verified by the IsarMathLib project.

  1. Lam, T. Y. (1983), Orderings, valuations and quadratic forms, CBMS Regional Conference Series in Mathematics, 52, American Mathematical Society, ISBN 0-8218-0702-1, Zbl 0516.12001
    • Lam, T. Y. (2001), A first course in noncommutative rings, Graduate Texts in Mathematics, 131 (2nd ed.), New York: Springer-Verlag, pp. xx+385, ISBN 0-387-95183-0, MR 1838439, Zbl 0980.16001
  3. OrdRing_ZF_1_L9
  4. OrdRing_ZF_2_L5
  5. ord_ring_infinite
  6. OrdRing_ZF_3_L2, see also OrdGroup_decomp
  7. OrdRing_ZF_1_L12
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.