Quasiregular element

This article addresses the notion of quasiregularity in the context of ring theory, a branch of modern algebra. For other notions of quasiregularity in mathematics, see the disambiguation page quasiregular.

In mathematics, specifically ring theory, the notion of quasiregularity provides a computationally convenient way to work with the Jacobson radical of a ring.[1] Intuitively, quasiregularity captures what it means for an element of a ring to be "bad"; that is, have undesirable properties.[2] Although a "bad element" is necessarily quasiregular, quasiregular elements need not be "bad," in a rather vague sense. In this article, we primarily concern ourselves with the notion of quasiregularity for unital rings. However, one section is devoted to the theory of quasiregularity in non-unital rings, which constitutes an important aspect of noncommutative ring theory.


Let R be a ring (with unity) and let r be an element of R. Then r is said to be quasiregular, if 1  r is a unit in R; that is, invertible under multiplication.[1] The notions of right or left quasiregularity correspond to the situations where 1  r has a right or left inverse, respectively.[1]

An element x of a non-unital ring is said to be right quasiregular if there is y such that .[3] The notion of a left quasiregular element is defined in an analogous manner. The element y is sometimes referred to as a right quasi-inverse of x.[4] If the ring is unital, this definition quasiregularity coincides with that given above.[5] If one writes , then this binary operation is associative.[6] In fact, the map (where × denotes the multiplication of the ring R) is a monoid isomorphism.[5] Therefore, if an element possesses both a left and right quasi-inverse, they are equal.[7]

Note that some authors use different definitions. They call an element x right quasiregular if there exists y such that ,[8] which is equivalent to saying that 1 + x has a right inverse when the ring is unital. If we write , then , so we can easily go from one set-up to the other by changing signs.[9] For example, x is right quasiregular in one set-up iff x is right quasiregular in the other set-up.[9]


If , then
(or if we follow the second convention).
From this we see easily that the quasi-inverse of x is (or ).


Generalization to semirings

The notion of quasiregular element readily generalizes to semirings. If a is an element of a semiring S, then an affine map from S to itself is . An element a of S is said to be right quasiregular if has a fixed point, which need not be unique. Each such fixed point is called a left quasi-inverse of a. If b is a left quasi-inverse of a and additionally b = ab + 1, then b it is called a quasi-inverse of a; any element of the semiring that has a quasi-inverse is said to be quasiregular. It is possible that some but not all elements of a semiring be quasiregular; for example, in the semiring of nonegative reals with the usual addition and multiplication of reals, has the fixed point for all a < 1, but has no fixed point for a ≥ 1.[18] If every element of a semiring is quasiregular then the semiring is called a quasi-regular semiring, closed semiring,[19] or occasionally a Lehmann semiring[18] (the latter honoring the paper of Daniel J. Lehmann.[20])

Examples of quasi-regular semirings are provided by the Kleene algebras (prominently among them, the algebra of regular expressions), in which the quasi-inverse is lifted to the role of a unary operation (denoted by a*) defined as the least fixedpoint solution. Kleene algebras are additively idempotent but not all quasi-regular semirings are so. We can extend the example of nonegative reals to include infinity and it becomes a quasi-regular semiring with the quasi-inverse of any element a ≥ 1 being the infinity. This quasi-regular semiring is not additively idempotent however, so it is not a Kleene algebra.[19] It is however a complete semiring.[21] More generally, all complete semirings are quasiregular.[22] The term closed semiring is actually used by some authors to mean complete semiring rather than just quasiregular.[23][24]

Conway semirings are also quasiregular; the two Conway axioms are actually independent, i.e. there are semirings satisfying only the product-star [Conway] axiom, (ab)* = 1+a(ba)*b, but not the sum-star axiom, (a+b)* = (a*b)*a* and vice versa; it is the product-star [Conway] axiom that implies that a semiring is quasiregular. Additionally, a commutative semiring is quasiregular if and only if it satisfies the product-star Conway axiom.[18]

Quasiregular semirings appear in algebraic path problems, a generalization of the shortest path problem.[19]

See also


  1. 1 2 3 4 Isaacs, p. 180
  2. Isaacs, p. 179
  3. Lam, Ex. 4.2, p. 50
  4. Polcino & Sehgal (2002), p. 298.
  5. 1 2 Lam, Ex. 4.2(3), p. 50
  6. Lam, Ex. 4.1, p. 50
  7. Since 0 is the multiplicative identity, if , then . Quasiregularity does not require the ring to have a multiplicative identity.
  8. Kaplansky, p. 85
  9. 1 2 Lam, p. 51
  10. Kaplansky, p. 108
  11. Lam, Ex. 4.2(2), p. 50
  12. Isaacs, Theorem 13.4(a), p. 180
  13. Isaacs, Theorem 13.4(b), p. 180
  14. Isaacs, Corollary 13.7, p. 181
  15. Isaacs, p. 181
  16. Isaacs, Corollary 13.5, p. 181
  17. Isaacs, Corollary 13.6, p. 181
  18. 1 2 3 Jonathan S. Golan (30 June 2003). Semirings and Affine Equations over Them. Springer Science & Business Media. pp. 157–159 and 164–165. ISBN 978-1-4020-1358-4.
  19. 1 2 3 Marc Pouly; Jürg Kohlas (2011). Generic Inference: A Unifying Theory for Automated Reasoning. John Wiley & Sons. pp. 232 and 248–249. ISBN 978-1-118-01086-0.
  20. Lehmann, D. J. (1977). "Algebraic structures for transitive closure". Theoretical Computer Science. 4: 59. doi:10.1016/0304-3975(77)90056-1.
  21. Droste, M., & Kuich, W. (2009). Semirings and Formal Power Series. Handbook of Weighted Automata, 3–28. doi:10.1007/978-3-642-01492-5_1, pp. 7-10
  22. U. Zimmermann (1981). Linear and combinatorial optimization in ordered algebraic structures. Elsevier. p. 141. ISBN 978-0-08-086773-1.
  23. Dexter Kozen (1992). The Design and Analysis of Algorithms. Springer Science & Business Media. p. 31. ISBN 978-0-387-97687-7.
  24. J.A. Storer (2001). An Introduction to Data Structures and Algorithms. Springer Science & Business Media. p. 336. ISBN 978-0-8176-4253-2.


This article is issued from Wikipedia - version of the 10/13/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.