{"id":295,"date":"2007-01-31T21:52:47","date_gmt":"2007-01-31T21:52:47","guid":{"rendered":"http:\/\/scientopia.org\/blogs\/goodmath\/2007\/01\/31\/basics-sets\/"},"modified":"2007-01-31T21:52:47","modified_gmt":"2007-01-31T21:52:47","slug":"basics-sets","status":"publish","type":"post","link":"http:\/\/www.goodmath.org\/blog\/2007\/01\/31\/basics-sets\/","title":{"rendered":"Basics: Sets"},"content":{"rendered":"<p> Sets are truly amazing things. In the history of mathematics, they&#8217;re<br \/>\na remarkably recent invention &#8211; and yet, they&#8217;re now considered to be the<br \/>\nfundamental basis on which virtually all of mathematics is built. From simple things (like the natural numbers), to the most abstract and esoteric things (like algebras, or topologies, or categories),  in modern math, they&#8217;re pretty much all understood<br \/>\nin terms of sets.<\/p>\n<p><!--more--><\/p>\n<p> So what is a set? A set is really just an abstract way about talking about a<br \/>\ncollection of distinct things. Really, in the simplest version of set theory,<br \/>\n<em>that&#8217;s it<\/em>. Such a simple notion! And yet &#8211; from there, the entire world of math opens up. (As an aside, in the rest of this article, I&#8217;m going to be talking about simple set theory, or naive set theory; there is a more advanced variant that was part of the attempt to create a more restrictive version of set theory that avoided paradoxical statements.)<\/p>\n<p> Sets <em>don&#8217;t<\/em> have any intrinsic concept of ordering &#8211; that is, you can&#8217;t talk about the &#8220;first&#8221; thing in a set, or which of two things in a set comes first. Doing that involves creating an operation on the members of the set &#8211; and then you&#8217;re talking about the ordering properties of the <em>operation<\/em>, not of the set itself.<\/p>\n<p> When we write sets, we typically write them as a list of members surrounded by curly braces: {1, 2, 3}, {&#8220;bob&#8221;, &#8220;joe&#8221;, &#8220;mike&#8221;, &#8220;sam&#8221;}, etc. The set with no members,<br \/>\ncalled the empty set is written either {}, or &empty;. We also often use a notation called a <em>set comprehension<\/em>, which specifies the members of a set in terms of some property. {x | x is a friend of mine}, {x | x &lt; 200}, etc.<\/p>\n<p> Commonly, we talk about a very small number of basic fundamental operations that we can talk about for sets:<\/p>\n<ol>\n<li> Membership, written a&isin;B. Given an object &#8220;a&#8221;, a&isin;B is a predicate which is true if and only if &#8220;a&#8221; is one of the objects in B.<\/li>\n<li> Intersection, written A&cap;B. Given two sets A and B, A&cap;B is a set containing the things that are members of both A and B &#8211; that is {x | x&isin;A <em>and<\/em> x&isin;B}. <\/li>\n<li> Union, written A&cup;B. Given two sets A and B, A&cup;B is a set<br \/>\ncontaining everything that is in either A or B &#8211; that is, {x | x &isin; A <em>or<\/em> x &isin; B}<\/li>\n<li> Subset (written A &sube; B) and equality. Given two sets A and B, A&sube;B if and only if every element of A is an element of B. If both A&sube;B and B&sube;A, then we say that A=B; if A&sube;B but B&nsub;A, then we say that A is a <em>proper<\/em> subset of B, written A&sub;B.<\/li>\n<li> Difference, written AB. Given two sets A and B, AB is the set consisting<br \/>\nof the elements of A that are <em>not<\/em> also elements of B; that is,<br \/>\n{x : x&isin;A <em>and<\/em> x&notin;B}.<\/li>\n<li> Symmetric difference, written A&Delta;B. Given two sets A and B, A&Delta;B is<br \/>\nthe set consisting of the <em>union<\/em> of AB and BA: {x : (x&isin;A <em>and<\/em> x&notin;B) <em>or<\/em> (x&notin;A <em>and<\/em> x&isin;B)}.<\/li>\n<\/ol>\n<p> So, why is this stuff so fundamental? What&#8217;s so powerful about this? Let&#8217;s<br \/>\nlook at one simple example. We saw the natural numbers the other day &#8211; let&#8217;s look at<br \/>\nhow to define the natural numbers using sets:<\/p>\n<ol>\n<li> We start by saying that &empty; is the number 0. <\/li>\n<li> One is the set containing 0: {&empty;}.<\/li>\n<li> Two is the set containing 0 and 1: {&empty;,{&empty;}}.<\/li>\n<li> Three is the set containing 0, 1, and 2: {&empty;,{&empty;},{&empty;,{&empty;}}.<\/li>\n<li> The number N={0,1,&#8230;,N-1}.<\/li>\n<li>Given a number N, the successor to N consists of the set N&cup;{N}.\n<\/ol>\n<p> Within this construction, N&lt;M if and only if N&isin;M. And if you take the time<br \/>\nto work it through, you can see that this construction satisfies the Peano axioms &#8211;<br \/>\nthese <em>are<\/em> the integers.<\/p>\n<p> The main problem with this version of set theory is that it&#8217;s very easy to<br \/>\ncreate paradoxical statements. Since we can have sets that contain sets, and there are no restrictions, then we can create all kinds of strange structures. The classic example is: X={S | S&notin;S } &#8211; that is, the set of all sets that are not members of<br \/>\nthemselves. It&#8217;s a simple paradox: is X&isin;X? If X <em>is<\/em> a member of itself, then by the definition of X, it&#8217;s not a member of itself; but if it&#8217;s not a member of itself, then by its definition, it <em>must<\/em> be a member of itself!<\/p>\n<p> The existence of things like this in naive set theory were considered unacceptable, a sign that there was something wrong with the construction of set theory that needed to be fixed. A lot of effort went into creating more structured versions of set theory that tried to avoid paradoxes, but G&ouml;del ultimately showed that no matter how much you did to restrict it, you were trapped &#8211; either you wind up with a theory that is incomplete (includes true statements that can&#8217;t be proven) or inconsistent (contains paradoxical statements). But that is definitely <em>not<\/em> a subject for a basics post!<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Sets are truly amazing things. In the history of mathematics, they&#8217;re a remarkably recent invention &#8211; and yet, they&#8217;re now considered to be the fundamental basis on which virtually all of mathematics is built. From simple things (like the natural numbers), to the most abstract and esoteric things (like algebras, or topologies, or categories), in [&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":[74],"tags":[],"class_list":["post-295","post","type-post","status-publish","format-standard","hentry","category-basics"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p4lzZS-4L","jetpack_sharing_enabled":true,"jetpack_likes_enabled":true,"_links":{"self":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/295","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=295"}],"version-history":[{"count":0,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/295\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/media?parent=295"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/categories?post=295"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/tags?post=295"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}