Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Integer
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Order-theoretic properties== <math>\mathbb{Z}</math> is a [[total order|totally ordered set]] without [[upper and lower bounds|upper or lower bound]]. The ordering of <math>\mathbb{Z}</math> is given by: {{math|:... β3 < β2 < β1 < 0 < 1 < 2 < 3 < ...}}. An integer is ''positive'' if it is greater than [[0|zero]], and ''negative'' if it is less than zero. Zero is defined as neither negative nor positive. The ordering of integers is compatible with the algebraic operations in the following way: # If {{math|''a'' < ''b''}} and {{math|''c'' < ''d''}}, then {{math|''a'' + ''c'' < ''b'' + ''d''}} # If {{math|''a'' < ''b''}} and {{math|0 < ''c''}}, then {{math|''ac'' < ''bc''}} Thus it follows that <math>\mathbb{Z}</math> together with the above ordering is an [[ordered ring]]. The integers are the only nontrivial [[totally ordered]] [[abelian group]] whose positive elements are [[well-ordered]].<ref>{{cite book |title=Modern Algebra |series=Dover Books on Mathematics |first=Seth |last=Warner |publisher=Courier Corporation |year=2012 |isbn=978-0-486-13709-4 |at=Theorem 20.14, p. 185 |url=https://books.google.com/books?id=TqHDAgAAQBAJ&pg=PA185 |access-date=2015-04-29 |archive-url=https://web.archive.org/web/20150906083836/https://books.google.com/books?id=TqHDAgAAQBAJ&pg=PA185|archive-date=2015-09-06 |url-status=live}}.</ref> This is equivalent to the statement that any [[Noetherian ring|Noetherian]] [[valuation ring]] is either a [[Field (mathematics)|field]]βor a [[discrete valuation ring]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)