{"id":580,"date":"2008-01-16T15:53:49","date_gmt":"2008-01-16T15:53:49","guid":{"rendered":"http:\/\/scientopia.org\/blogs\/goodmath\/2008\/01\/16\/fields-characteristics-and-prime-numbers\/"},"modified":"2008-01-16T15:53:49","modified_gmt":"2008-01-16T15:53:49","slug":"fields-characteristics-and-prime-numbers","status":"publish","type":"post","link":"http:\/\/www.goodmath.org\/blog\/2008\/01\/16\/fields-characteristics-and-prime-numbers\/","title":{"rendered":"Fields, Characteristics, and Prime Numbers"},"content":{"rendered":"<p> When we start looking at fields, there are a collection<br \/>\nof properties that are interesting. The simplest one &#8211; and<br \/>\nthe one which explains the property of the nimbers that<br \/>\nmakes them so strange &#8211; is called the<br \/>\n<em>characteristic<\/em> of the field. (In fact, the<br \/>\ncharacteristic isn&#8217;t just defined for fields &#8211; it&#8217;s defined<br \/>\nfor rings as well.)<\/p>\n<p> Given a field F, where 0<sub>F<\/sub> is the additive<br \/>\nidentity, and 1<sub>F<\/sub> is the multiplicative identity,<br \/>\nthe characteristic of the field is 0 if and only if no<br \/>\nsequence of adding 1<sub>F<\/sub> to itself will ever result<br \/>\nin 0<sub>F<\/sub>; otherwise, the characteristic is the<br \/>\nnumber of 1<sub>F<\/sub>s you need to add together to get<br \/>\n0<sub>F<\/sub>.<\/p>\n<p> That sounds confusing &#8211; but it really isn&#8217;t. It&#8217;s just<br \/>\nhard to write in natural language. A couple of examples will<br \/>\nmake it clear.<\/p>\n<p><!--more--><\/p>\n<p> The field of nimbers has characteristic two &#8211; because<br \/>\n1+1=0 in the nimbers &#8211; so adding to 1s together gives you<br \/>\n0.<\/p>\n<p> The field of numbers modulo-7 is a nice simple field,<br \/>\nwith characteristic 7: in mod-7, you need to add 1+1=2;<br \/>\n2+1=3; 3+1=4; 4+1=5; 5+1=6; 6+1=0. So 1+1+1+1+1+1+1=0.<\/p>\n<p> The real numbers have characteristic 0, because adding<br \/>\none repeatedly will never give you 0. In fact, the<br \/>\ncharacteristic is 0 for any <em>ordered<\/em> field O &#8211; that<br \/>\nis, a field with a properly defined &#8220;&amp;lt&#8221; operator (one<br \/>\nwhere &forall;x&isin;O, &exist;y&isin;O : x&lt;y &and;<br \/>\n&exist;z&isin;0 : z&lt;y, and &lt; is total, transitive,<br \/>\nantisymmetric, and antireflexive).<\/p>\n<p> See? Not hard, right?<\/p>\n<p> What makes nimbers so strange is that they&#8217;re an<br \/>\ninfinite set with characteristic two. Our intuitions about<br \/>\nnumbers all rely on the structure of an infinite set with<br \/>\ncharacteristic 0. All of the strange properties of nimbers<br \/>\ncan be traced back to the fact that their basic structure is<br \/>\nstrange; and the root of that strangeness always traces back<br \/>\nto the field characteristic.<\/p>\n<p> There&#8217;s an interesting notion also associated with the<br \/>\ncharacteristic of a field. Like groups could have<br \/>\nsub-groups, fields can have sub-fields: a sub-field of a<br \/>\nfield (F,+,&times;) is a field (G,+,&times;) where G&sube;F.<br \/>\nFor every field, there is a minimal subfield &#8211; a field where<br \/>\nremoving any elements would require removing 1 to maintain<br \/>\nclosure. The minimal subfield of a field, F, is called the<br \/>\n<em>prime subfield<\/em> of F.<\/p>\n<p> Here&#8217;s where we get something fascinating. There are<br \/>\nnumerous limits to the kinds of structures that can fulfill<br \/>\nthe field axioms to become proper fields. One of the amazing<br \/>\nones (at least to me) is that every field has either<br \/>\ncharacteristic 0 (in which case it&#8217;s isomorphic to a<br \/>\nsub-field of the complex numbers), or it has a<br \/>\n<em>prime<\/em> characteristic, and it&#8217;s prime subfield is<br \/>\nisomorphic to a finite field whose size equals it&#8217;s<br \/>\ncharacteristic.<\/p>\n<p> What does this tell us? Well, looking at it<br \/>\nphilosophically, it means that the prime numbers are very<br \/>\ndeeply embedded in the structure of algebra. Even if we<br \/>\nthrow away our standard number system and go into the realm<br \/>\nof the abstract, the numbers that are prime in the basic set<br \/>\nof natural numbers remain fundamental. Both the concept and<br \/>\nthe specific values of the prime numbers are deeply embedded<br \/>\nall the way down in the foundations of what we know as<br \/>\nmathematics. Even when we start from scratch, with abstract<br \/>\nsets, and build upwards into mathematical structures, when<br \/>\nwe get to the point where we can build things that behave<br \/>\neven just a little bit like numbers, the prime numbers are<br \/>\ninevitable &#8211; even though they aren&#8217;t necessarily prime in<br \/>\nevery field!<\/p>\n<p> After all, think about the nimbers! The number 11 for example, is clearly prime in the natural numbers. But in nimbers, it&#8217;s 8&times;4: and yet, even if we play with the nimbers, we&#8217;ll wind up finding out that 11 is prime.<\/p>\n<p> Incidentally, I&#8217;m still trying to hack together an implementation of the nimbers. As one of the commenters (Xanthir?) mentioned, it&#8217;s hard to get them right, and I haven&#8217;t had much free time to try it. I&#8217;ve got a bunch of Scheme code that&#8217;s close, but it&#8217;s still got one recursive case that never terminates. Nimbers are truly annoying.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>When we start looking at fields, there are a collection of properties that are interesting. The simplest one &#8211; and the one which explains the property of the nimbers that makes them so strange &#8211; is called the characteristic of the field. (In fact, the characteristic isn&#8217;t just defined for fields &#8211; it&#8217;s defined for [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[26],"tags":[],"class_list":["post-580","post","type-post","status-publish","format-standard","hentry","category-group-theory"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p4lzZS-9m","jetpack_sharing_enabled":true,"jetpack_likes_enabled":true,"_links":{"self":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/580","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/comments?post=580"}],"version-history":[{"count":0,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/580\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/media?parent=580"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/categories?post=580"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/tags?post=580"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}