{"id":1782,"date":"2024-01-29T18:18:48","date_gmt":"2024-01-30T00:18:48","guid":{"rendered":"https:\/\/sites.imsa.edu\/hadron\/?p=1782"},"modified":"2024-01-29T18:26:57","modified_gmt":"2024-01-30T00:26:57","slug":"explaining-the-properties-of-the-real-numbers","status":"publish","type":"post","link":"https:\/\/sites.imsa.edu\/hadron\/2024\/01\/29\/explaining-the-properties-of-the-real-numbers\/","title":{"rendered":"Explaining the Properties of the Real Numbers"},"content":{"rendered":"

Written by: Karthik Prasad<\/span><\/p>\n

 <\/p>\n

The real numbers are something every math student is familiar with\u2014after all, they are the numbers that make up the real world itself. However, we often take the existence and structure of these numbers for granted. We will discuss the whole numbers, the integers, construct the rational numbers, and then discuss what makes the real numbers special amongst these.<\/span><\/p>\n

 <\/p>\n

Addition and The Integers<\/b><\/p>\n

First, let us discuss the <\/span>whole numbers<\/b>. These are 0, 1, 2, \u2026 and are simple to imagine in the real world\u2014we can consider them as the amount of a certain object we have. You have zero cookies (none at all), one cookie, two cookies, etc. Now, the whole numbers are imbued with a couple of properties. The first is associativity: <\/span>a<\/span><\/i>+(<\/span>b+c)<\/span><\/i> = <\/span>(a+b)<\/span><\/i>+<\/span>c<\/span><\/i>. The second is commutativity: <\/span>a+b = b+a<\/span><\/i>. Finally, the zero identity property: <\/span>a+<\/span><\/i>0<\/span>=a<\/span><\/i>. These hold for all natural numbers. For example, if you have 2 cookies, and add them to a group of 3 and 4 cookies, this is the same as adding 2 cookies and 7 cookies to get 9 cookies, But, you could also have a group of 2 and 3 cookies first to get 5 cookies, and then add 4 to get 9 cookies as well. Similarly, if you have 2 cookies and 3 cookies, that\u2019s the same as 3 cookies and 2 cookies\u2014and if you have 0 cookies and 2 cookies, then you still have 2 cookies.<\/span><\/p>\n

However, we may also \u201cowe\u201d other people cookies. In this case, we want to quantify the idea of a <\/span>negative number<\/b>\u2014if we owe someone <\/span>a<\/span><\/i> cookies, then we effectively have some new \u201cnegative\u201d amount x of cookies. If we gain <\/span>a<\/span><\/i> cookies, we imagine giving these <\/span>a<\/span><\/i> cookies to the other person, and then we have 0 cookies left over. So, we have that <\/span>a<\/span><\/i>+<\/span>x =<\/span><\/i> 0 for all <\/span>a<\/span><\/i>, and that for any <\/span>a<\/span><\/i>, there is always an <\/span>x<\/span><\/i> that does this, as you can always give away your cookies. We say <\/span>x<\/span><\/i> is <\/span>-a<\/span><\/i> and call it the inverse of <\/span>a<\/span><\/i>. This leads to the property that for every whole <\/span>a<\/span><\/i>, there is a number <\/span>-a<\/span><\/i> such that <\/span>a<\/span><\/i>+<\/span>-a<\/span><\/i> =<\/span><\/i> 0. This is the inverse property of addition. These above properties are summarized in Figure 1.<\/span><\/p>\n

Figure 1<\/span><\/p>\n

Depicts Associativity, Commutativity, Identity, and Inverse Properties of Addition<\/span><\/p>\n

\"\"<\/span><\/p>\n

Source: <\/span>[Original Work]<\/span><\/i><\/p>\n

These lead us to create the <\/span>integers<\/b>, which are \u2026 -2, -1, 0, 1, 2, \u2026 and satisfy these above properties, which are summarized in the table above. Also note that if you have <\/span>a<\/span><\/i> amount of cookies and <\/span>b<\/span><\/i> amount of cookies, then <\/span>a+b<\/span><\/i> is also a valid amount of cookies. This is the closure property of addition. There is also an ordering of the integers, which makes sense\u2014for two amounts of cookies <\/span>a<\/span><\/i> and <\/span>b<\/span><\/i>, either <\/span>a<\/span><\/i> is less than <\/span>b<\/span><\/i>, <\/span>a<\/span><\/i> is the same as <\/span>b<\/span><\/i>, or <\/span>a<\/span><\/i> is greater than <\/span>b<\/span><\/i>, and if <\/span>a <\/span><\/i>cookies is more than <\/span>b<\/span><\/i> cookies, and if <\/span>b<\/span><\/i> cookies is more than <\/span>c<\/span><\/i> cookies, then <\/span>a<\/span><\/i> cookies is more than <\/span>c<\/span><\/i> cookies.\u00a0<\/span><\/p>\n

 <\/p>\n

Multiplication and the Rationals<\/b><\/p>\n

Notably, when we repeat addition multiple times, we create a new operation called multiplication. We say that if we want to add a number <\/span>b<\/span><\/i> to something <\/span>a<\/span><\/i> times, then we add a new quantity <\/span>a\u22c5b<\/span><\/i>, such that <\/span>a\u22c5b = b + b + b+ b<\/span><\/i> (with <\/span>a<\/span><\/i> b<\/span><\/i>\u2019s). If you think about the same cookie example, this has commutativity, closure, associativity, and also a new property that works with addition. The distributive property says <\/span>a\u22c5(b+c) = a\u22c5b+a\u22c5c<\/span><\/i>. This makes sense\u2014if we are adding <\/span>b+c<\/span><\/i> together <\/span>a<\/span><\/i> times, this should be the same as adding <\/span>b <\/span><\/i>together <\/span>a<\/span><\/i> times, adding <\/span>c<\/span><\/i> together <\/span>a<\/span><\/i> times, and then adding them together. We also have the identity property with the number 1, as <\/span>a\u22c5<\/span><\/i>1 = <\/span>a<\/span><\/i> (adding <\/span>a<\/span><\/i> cookies one time gives you <\/span>a<\/span><\/i> cookies).\u00a0<\/span><\/p>\n

These properties hold on the integers and seem to match up with most of their properties. However, there is one curious omission\u2014an inverse property for multiplication. This property would imply that there must exist a number <\/span>x <\/span><\/i>such that <\/span>a\u22c5x <\/span><\/i>= 1 in accordance with the identity and inverse properties of addition (where 0 is the identity in addition, 1 is the identity in multiplication, and so an inverse property must produce 1 as the inverse of addition produces 0).\u00a0<\/span><\/p>\n

Therefore, we wish to extend the integers to a new set of numbers that includes this inverse. If we have two integers <\/span>a<\/span><\/i> and <\/span>b<\/span><\/i>, we define <\/span>a\/b<\/span><\/i> to be a number such that <\/span>b\u22c5a\/b<\/span><\/i> = <\/span>a<\/span><\/i>. When we let <\/span>a =<\/span><\/i> 1, this gives <\/span>b\u22c51\/b = <\/span><\/i>1, giving us an inverse property. This definition holds for all <\/span>b<\/span><\/i> not equal to 0. To explain why this does not hold for <\/span>b<\/span><\/i> = 0, consider adding <\/span>a<\/span><\/i> cookies 0 times for any number <\/span>a<\/span><\/i>. This gives you 0 cookies total, logically. But, if there was an identity 1\/0 for 0, then we would have 0<\/span>\u22c5<\/span><\/i>1\/0 = 1, but 0<\/span>\u22c5<\/span><\/i>1\/0 = 0, so this number 1\/0 cannot exist. Therefore, we now have the numbers <\/span>a<\/span><\/i>\/<\/span>b<\/span><\/i>, and note that every integer <\/span>a <\/span><\/i>is equal to <\/span>a\/<\/span><\/i>1, as 1<\/span>\u22c5a<\/span><\/i>\/1 = <\/span>a<\/span><\/i>\/1 <\/span>=<\/span><\/i> a<\/span><\/i>. Therefore, we can make every integer into the form <\/span>a\/b<\/span><\/i>. We call these numbers <\/span>a\/b<\/span><\/i> the <\/span>rational numbers<\/b>.\u00a0<\/span><\/p>\n

The properties of associativity, commutativity, and distributivity are summarized in the table below:<\/span><\/p>\n

 <\/p>\n

Figure 1<\/span><\/p>\n

\"\"<\/span><\/p>\n

Depictions of Commutativity, Associativity, and Distributivity of Multiplication<\/span><\/p>\n

Source: <\/span>[1]<\/span><\/i><\/p>\n

 <\/p>\n

The Real Numbers<\/b><\/p>\n

These numbers satisfy all the properties of integer addition and multiplication have an inverse property for multiplication, and have the same ordering as the integers do. In the terminology of abstract algebra, this makes rational numbers into a <\/span>field<\/b>.\u00a0 But, there are curious omissions in the rational numbers. For example, the number \u03c0, the ratio of a circle\u2019s circumference to its diameter, cannot be written as a\/b. Other numbers, such as the number <\/span>a<\/span><\/i> such that <\/span>a\u22c5a = <\/span><\/i>2, are also not in the rational numbers. To create the real numbers\u2014essentially, the rational numbers PLUS all of the holes in the rationals\u2014we want all of these holes to be filled.\u00a0<\/span><\/p>\n

A mathematical property that achieves this is the least upper bound property, which says that for a set <\/span>S<\/span><\/i> of real numbers, there exists a least upper bound\u2014an element in <\/span>S<\/span><\/i> bigger than all the other elements\u2014and that this least upper bound is also a real number. For example, consider the set S of real numbers <\/span>a<\/span><\/i> such that <\/span>a\u22c5a<\/span><\/i> \u2264 2. The maximal <\/span>a<\/span><\/i> that works is the <\/span>a<\/span><\/i> such that <\/span>a\u22c5a = <\/span><\/i>2. As we said before, this is not a rational number\u2014but we define it to be a real number, as it must be the least upper bound of <\/span>S<\/span><\/i>, and therefore is a real number. For any \u201chole\u201d in the rational numbers, then, you can construct a set <\/span>S<\/span><\/i> like this and split the rational numbers as \u201cin S\u201d and \u201coutside of S.\u201d Then, the value that is the least upper bound must be a real number, as in the above example. This can be done formally via the method known as Dedekind cuts, filling in all the holes in the rational numbers.<\/span><\/p>\n

 <\/p>\n

Conclusion<\/b><\/p>\n

This article started with a discussion of the whole numbers and reasoned through various properties of an \u201caddition\u201d operation on these numbers. We then extended the whole numbers to the integers to satisfy more properties of addition that we desired and then defined the \u201cmultiplication\u201d operation of repeated addition (for integers). This allowed us to extend the integers to the rationals to satisfy more properties of multiplication. Finally, we explained a method for filling in the \u201choles\u201d in the rationals to create the reals via satisfying the least upper bound property. Now, why is this important? These counting numbers and these real numbers are the foundation of, well, the real world. Our current models of the universe and the things we do daily rely on these numbers, and understanding their properties allows us to explore these models further and more completely, hopefully bringing us to new revolutions in mathematics and science.<\/span><\/p>\n

 <\/p>\n

\u00a0<\/span><\/p>\n

 <\/p>\n

References and Sources<\/span><\/p>\n

Source 1: <\/span>Properties of Operations: Multiplication – Mr Elementary Math<\/span><\/i>. (2014, November 9). https:\/\/mrelementarymath.com\/properties-of-operations-multiplication\/<\/span><\/p>\n

Source 2: Schwartz, R. (2014). <\/span>Dedekind Cuts<\/span><\/i>. https:\/\/www.math.brown.edu\/reschwar\/INF\/handout3.pdf<\/span><\/p>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

Written by: Karthik Prasad   The real numbers are something every math student is familiar with\u2014after all, they are the numbers that make up the real world itself. However, we often take the existence and structure of these numbers for granted. We will discuss the<\/p>\n","protected":false},"author":930,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ngg_post_thumbnail":0,"footnotes":""},"categories":[11],"tags":[],"class_list":["post-1782","post","type-post","status-publish","format-standard","hentry","category-math"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/posts\/1782","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/users\/930"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/comments?post=1782"}],"version-history":[{"count":2,"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/posts\/1782\/revisions"}],"predecessor-version":[{"id":1798,"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/posts\/1782\/revisions\/1798"}],"wp:attachment":[{"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/media?parent=1782"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/categories?post=1782"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/sites.imsa.edu\/hadron\/wp-json\/wp\/v2\/tags?post=1782"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}