"ordered ring" meaning in All languages combined

{
  "derived": [
    {
      "_dis1": "49 51",
      "word": "lattice-ordered ring"
    }
  ],
  "forms": [
    {
      "form": "ordered rings",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "ordered ring (plural ordered rings)",
      "name": "en-noun"
    }
  ],
  "hyponyms": [
    {
      "_dis1": "50 50",
      "alt": "= discretely ordered ring",
      "sense": "both senses",
      "word": "discrete ordered ring"
    },
    {
      "_dis1": "50 50",
      "sense": "both senses",
      "word": "ordered field"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "_dis1": "49 51",
      "word": "ordered field"
    }
  ],
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Algebra",
          "orig": "en:Algebra",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "50 50",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "text": "1965, Seth Warner, Modern Algebra, Dover, 1990, Single-volume republication, page 217,\nIf < is an ordering on A compatible with its ring structure, we shall say that (A,+,·,<) is an ordered ring. An element x of an ordered ring A is positive if x>0, and x is strictly positive if x>0.\nThe set of all positive elements of an ordered ring A is denoted by A_+, and the set of all strictly positive elements of A is denoted by A^*₊.\nIf (A,+,·,<) is an ordered ring and if < is a total ordering, we shall, of course, call (A,+,·,<) a totally ordered ring; if (A,+,·) is a field, we shall call (A,+,·,<) an ordered field, and if, moreover, < is a total ordering, we shal call (A,+·,<) a totally ordered field."
        },
        {
          "ref": "1990, P. M. Cohn, J. Howie (translators), Nicolas Bourbaki, Algebra II: Chapters 4-7, [1981, N. Bourbaki, Algèbre, Chapitres 4 à 7, Masson], Springer, 2003, Softcover reprint, page 19, DEFINITION 1. — Given a commutative ring A, we say that an ordering on A is compatible with the ring structure on A if it is compatible with the additive group structure of A, and if it satisfies the following axiom",
          "text": "(OR) The relations x>0 and y>0 imply xy>0.\nThe ring A, together with such an ordering, is called an ordered ring.\nExamples. — 1) The rings Q and Z , with the usual orderings, are ordered rings.\n2) A product of ordered rings, equipped with the product ordering, is an ordered ring. In particular, the ring Aᴱ of mappings from a set E to an ordered ring A is an ordered ring.\n3) A subring of an ordered ring, with the induced ordering, is an ordered ring."
        }
      ],
      "glosses": [
        "A ring, R, equipped with a partial order, ≤, such that for arbitrary a, b, c ∈ R, if a ≤ b then a + c ≤ b + c, and if, additionally, 0 ≤ c, then both ca ≤ cb and ac ≤ bc."
      ],
      "id": "en-ordered_ring-en-noun-aGYFoKpm",
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "ring",
          "ring"
        ],
        [
          "partial order",
          "partial order"
        ]
      ],
      "qualifier": "ring theory",
      "raw_glosses": [
        "(algebra, order theory, ring theory) A ring, R, equipped with a partial order, ≤, such that for arbitrary a, b, c ∈ R, if a ≤ b then a + c ≤ b + c, and if, additionally, 0 ≤ c, then both ca ≤ cb and ac ≤ bc."
      ],
      "synonyms": [
        {
          "_dis1": "65 35",
          "sense": "ring equipped with a partial order",
          "word": "partially ordered ring"
        }
      ],
      "topics": [
        "algebra",
        "mathematics",
        "order-theory",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Algebra",
          "orig": "en:Algebra",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "50 50",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "ref": "2013, Jonathan K. Hodge, Steven Schlicker, Ted Sundstrom, Abstract Algebra: An Inquiry Based Approach, CRC Press, page 253",
          "text": "The positive elements in an ordered ring allow us to compare elements to 0, but we know in the integers that we can compare any two elements to each other. For example, we know that 4#x3E;2 because 4-2#x3E;0. We can extend this idea to any ordered ring. If R is an ordered ring and a,b#x5C;inR, then we know by trichotomy that exactly one of the following must be true: a-b#x3E;0, a-b#x3D;0, or -(a-b)#x3E;0.",
          "type": "quotation"
        },
        {
          "ref": "2014, Benjamin Fine, Anthony M. Gaglione, Gerhard Rosenberger, Introduction to Abstract Algebra, Johns Hopkins University Press, page 77, Definition 3.5.4. A ring R is an ordered ring if there exists a distinguished set R⁺, R⁺⊂R, called the set of positive elements, with the properties that",
          "text": "(1) The set R⁺ is closed under addition and multiplication.\n(2) If x∈R then exactly one of the following is true: (trichotomy law)\n(a) x=0,\n(b) x∈R⁺,\n(c) -x∈R⁺.\nIf further R is an integral domain we call R an ordered integral domain.\n[…]\nLemma 3.5.9. If R is an ordered ring and a∈R is a positive element, then the set na:n∈ N⊂R⁺.\n[…]\nTheorem 3.5.2. An ordered ring must be infinite."
        }
      ],
      "glosses": [
        "A ring, R, equipped with a total order, ≤, such that for arbitrary a, b, c ∈ R, if a ≤ b then a + c ≤ b + c, and if, additionally, 0 ≤ c, then both ca ≤ cb and ac ≤ bc."
      ],
      "id": "en-ordered_ring-en-noun-1kdvSCJ9",
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "ring",
          "ring"
        ],
        [
          "total order",
          "total order"
        ]
      ],
      "qualifier": "ring theory",
      "raw_glosses": [
        "(algebra, order theory, ring theory) A ring, R, equipped with a total order, ≤, such that for arbitrary a, b, c ∈ R, if a ≤ b then a + c ≤ b + c, and if, additionally, 0 ≤ c, then both ca ≤ cb and ac ≤ bc."
      ],
      "synonyms": [
        {
          "_dis1": "32 68",
          "sense": "ring equipped with a total order",
          "word": "totally ordered ring"
        }
      ],
      "topics": [
        "algebra",
        "mathematics",
        "order-theory",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "ordered ring"
  ],
  "word": "ordered ring"
}

{
  "categories": [
    "English countable nouns",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English nouns"
  ],
  "derived": [
    {
      "word": "lattice-ordered ring"
    }
  ],
  "forms": [
    {
      "form": "ordered rings",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "ordered ring (plural ordered rings)",
      "name": "en-noun"
    }
  ],
  "hyponyms": [
    {
      "alt": "= discretely ordered ring",
      "sense": "both senses",
      "word": "discrete ordered ring"
    },
    {
      "sense": "both senses",
      "word": "ordered field"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "ordered field"
    }
  ],
  "senses": [
    {
      "categories": [
        "en:Algebra"
      ],
      "examples": [
        {
          "text": "1965, Seth Warner, Modern Algebra, Dover, 1990, Single-volume republication, page 217,\nIf < is an ordering on A compatible with its ring structure, we shall say that (A,+,·,<) is an ordered ring. An element x of an ordered ring A is positive if x>0, and x is strictly positive if x>0.\nThe set of all positive elements of an ordered ring A is denoted by A_+, and the set of all strictly positive elements of A is denoted by A^*₊.\nIf (A,+,·,<) is an ordered ring and if < is a total ordering, we shall, of course, call (A,+,·,<) a totally ordered ring; if (A,+,·) is a field, we shall call (A,+,·,<) an ordered field, and if, moreover, < is a total ordering, we shal call (A,+·,<) a totally ordered field."
        },
        {
          "ref": "1990, P. M. Cohn, J. Howie (translators), Nicolas Bourbaki, Algebra II: Chapters 4-7, [1981, N. Bourbaki, Algèbre, Chapitres 4 à 7, Masson], Springer, 2003, Softcover reprint, page 19, DEFINITION 1. — Given a commutative ring A, we say that an ordering on A is compatible with the ring structure on A if it is compatible with the additive group structure of A, and if it satisfies the following axiom",
          "text": "(OR) The relations x>0 and y>0 imply xy>0.\nThe ring A, together with such an ordering, is called an ordered ring.\nExamples. — 1) The rings Q and Z , with the usual orderings, are ordered rings.\n2) A product of ordered rings, equipped with the product ordering, is an ordered ring. In particular, the ring Aᴱ of mappings from a set E to an ordered ring A is an ordered ring.\n3) A subring of an ordered ring, with the induced ordering, is an ordered ring."
        }
      ],
      "glosses": [
        "A ring, R, equipped with a partial order, ≤, such that for arbitrary a, b, c ∈ R, if a ≤ b then a + c ≤ b + c, and if, additionally, 0 ≤ c, then both ca ≤ cb and ac ≤ bc."
      ],
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "ring",
          "ring"
        ],
        [
          "partial order",
          "partial order"
        ]
      ],
      "qualifier": "ring theory",
      "raw_glosses": [
        "(algebra, order theory, ring theory) A ring, R, equipped with a partial order, ≤, such that for arbitrary a, b, c ∈ R, if a ≤ b then a + c ≤ b + c, and if, additionally, 0 ≤ c, then both ca ≤ cb and ac ≤ bc."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "order-theory",
        "sciences"
      ]
    },
    {
      "categories": [
        "English terms with quotations",
        "en:Algebra"
      ],
      "examples": [
        {
          "ref": "2013, Jonathan K. Hodge, Steven Schlicker, Ted Sundstrom, Abstract Algebra: An Inquiry Based Approach, CRC Press, page 253",
          "text": "The positive elements in an ordered ring allow us to compare elements to 0, but we know in the integers that we can compare any two elements to each other. For example, we know that 4#x3E;2 because 4-2#x3E;0. We can extend this idea to any ordered ring. If R is an ordered ring and a,b#x5C;inR, then we know by trichotomy that exactly one of the following must be true: a-b#x3E;0, a-b#x3D;0, or -(a-b)#x3E;0.",
          "type": "quotation"
        },
        {
          "ref": "2014, Benjamin Fine, Anthony M. Gaglione, Gerhard Rosenberger, Introduction to Abstract Algebra, Johns Hopkins University Press, page 77, Definition 3.5.4. A ring R is an ordered ring if there exists a distinguished set R⁺, R⁺⊂R, called the set of positive elements, with the properties that",
          "text": "(1) The set R⁺ is closed under addition and multiplication.\n(2) If x∈R then exactly one of the following is true: (trichotomy law)\n(a) x=0,\n(b) x∈R⁺,\n(c) -x∈R⁺.\nIf further R is an integral domain we call R an ordered integral domain.\n[…]\nLemma 3.5.9. If R is an ordered ring and a∈R is a positive element, then the set na:n∈ N⊂R⁺.\n[…]\nTheorem 3.5.2. An ordered ring must be infinite."
        }
      ],
      "glosses": [
        "A ring, R, equipped with a total order, ≤, such that for arbitrary a, b, c ∈ R, if a ≤ b then a + c ≤ b + c, and if, additionally, 0 ≤ c, then both ca ≤ cb and ac ≤ bc."
      ],
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "ring",
          "ring"
        ],
        [
          "total order",
          "total order"
        ]
      ],
      "qualifier": "ring theory",
      "raw_glosses": [
        "(algebra, order theory, ring theory) A ring, R, equipped with a total order, ≤, such that for arbitrary a, b, c ∈ R, if a ≤ b then a + c ≤ b + c, and if, additionally, 0 ≤ c, then both ca ≤ cb and ac ≤ bc."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "order-theory",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "sense": "ring equipped with a partial order",
      "word": "partially ordered ring"
    },
    {
      "sense": "ring equipped with a total order",
      "word": "totally ordered ring"
    }
  ],
  "wikipedia": [
    "ordered ring"
  ],
  "word": "ordered ring"
}