{"id":423,"date":"2007-05-19T20:22:47","date_gmt":"2007-05-19T20:22:47","guid":{"rendered":"http:\/\/scientopia.org\/blogs\/goodmath\/2007\/05\/19\/why-axiomatize-set-theory\/"},"modified":"2007-05-19T20:22:47","modified_gmt":"2007-05-19T20:22:47","slug":"why-axiomatize-set-theory","status":"publish","type":"post","link":"http:\/\/www.goodmath.org\/blog\/2007\/05\/19\/why-axiomatize-set-theory\/","title":{"rendered":"Why Axiomatize Set Theory?"},"content":{"rendered":"<p> Naive set theory is fun, and as we saw with Cantor&#8217;s diagonalization, it can produce some incredibly beautiful results. But as we&#8217;ve seen before, in the simple world of naive set theory, it&#8217;s easy to run into trouble, in the form of Russell&#8217;s paradox and a variety of related problems. <\/p>\n<p> For the sake of completeness, I&#8217;ll remind you that Russell&#8217;s paradox concerns the set R={ s | s &notin; s}. Is R&isin;R? If R&isin;R, then by the definition of R&notin;R. But by definition, if R&notin;R, then R&isin;R. So R is clearly not a well-defined set. But there&#8217;s nothing about the form of its definition which is prohibited by naive set theory!<\/p>\n<p> Mathematicians, being the annoying buggers that they are, weren&#8217;t willing to just give up on set theory over Russell&#8217;s paradox. It&#8217;s too beautiful, too useful an abstraction, to just give up on it over the self-reference problems. So they went searching for a way of building up set theory axiomatically in a way that would avoid problems by making it impossible to even formulate the problematic statements.<\/p>\n<p><!--more--><\/p>\n<p> To some extent, from a modern viewpoint, it can seem a little silly. The problems of naive set theory involve self-reference issues. And most modern math geeks have absorbed the fact that self-reference is <em>inevitably<\/em> a problem. That&#8217;s the simplistic understanding that most of us have of G&ouml;del&#8217;s incompleteness theorem: that in any formal system, whether it&#8217;s set theory or something else, if it&#8217;s expressive enough to be a complete system, there&#8217;s <em>some<\/em> way of forcing it to allow the formulation of self-reference statements that introduce problems like Russell&#8217;s.<\/p>\n<p> There&#8217;s two things to remember when you think that:<\/p>\n<ol>\n<li> The initial work on axiomatizing set theory <em>predates<\/em> G&ouml;del.<br \/>\nThe late 19th\/early 20th century mathematicians didn&#8217;t know about incompleteness,<br \/>\nand believed that you could create a perfect universal mathematics. So trying<br \/>\nto form a perfect axiomatization of set theory was a very natural thing for them<br \/>\nto try to do.<\/li>\n<li> Naive set theory makes problems like Russell&#8217;s paradox extremely easy to<br \/>\nform. They&#8217;re ubiquitous. Naive set theory is a beautiful idea, but isn&#8217;t a<br \/>\nparticularly well-formed mathematical theory. Axiomatizing it, so that it has<br \/>\na solid formal basis <em>is<\/em> a useful thing to do. It means that until you<br \/>\npush it out to its limit, that it&#8217;s a well-formed valid mathematical theory. So<br \/>\neven recognizing that we can&#8217;t complete avoid the kinds of issues that permeate<br \/>\nnaive set theory, we can <em>reduce<\/em> their impact, and most of the time,<br \/>\navoid them entirely.<\/li>\n<\/ol>\n<p> The first step in axiomatic set theory is the <a href=\"\">class\/set<\/a> distinction. I<br \/>\nfind that a metaphor comparing set theory to predicate logic is useful for understanding<br \/>\nthe reason for that distinction.<\/p>\n<p> Consider a naive version of predicate logic. <em>Not<\/em> first order predicate logic,<br \/>\nbut a fully general predicate logic. In a logic like that, we wouldn&#8217;t distinguish between<br \/>\npredicates and objects &#8211; that is, a predicate can range over predicates. So we can have<br \/>\nstatements like P(P). Suppose that P(x) is defined as meaning &#8220;the predicate x is always<br \/>\nfalse&#8221;. Now, suppose that we say P(&not;P). That&#8217;s a statement that it&#8217;s false that P is<br \/>\nalways false. If P is always false, then that means that P is <em>wrong<\/em> when it says<br \/>\nthat &not;P is always false. We&#8217;ve just found Russell&#8217;s paradox in predicate logic form &#8211;<br \/>\nthe liar&#8217;s paradox.<\/p>\n<p> How does predicate logic avoid that problem? By creating a <em>first-order<\/em> version of predicate logic, in which predicates are not allowed to reason about predicates, and you can&#8217;t use quantifiers ranging over predicates to create universal statements. So suddenly, P(&not;P) becomes an ill-formed statement. <\/p>\n<p> That&#8217;s pretty much what the set\/class distinction accomplishes. Proper classes &#8211;<br \/>\nclasses that aren&#8217;t sets &#8211; aren&#8217;t members of other classes. They&#8217;re like the predicates,<br \/>\nwhich you can&#8217;t range over in first order logic. Sets are like the things that can be<br \/>\nquantified over in first-order predicate logic. By doing this, we lose a lot of expressive<br \/>\nability: a lot of things become excluded from the space of things that we can reason over.<br \/>\nBut just like first order predicate logic, <em>most of the time<\/em>, that expressive limit is acceptable, and it allows us to escape the most common forms of problems that make<br \/>\nthe system unsound.<\/p>\n<p> So mathematicians created a structure in which we made that distinction &#8211; and create a formal system of axioms that defined the entire basis of the theory. With those axioms, set theory becomes a complete, well-founded basis for mathematics. <\/p>\n<p> Next time, we&#8217;ll take an initial look at the axioms, and roughly what they mean. Then we&#8217;ll dive in and take a deep look at a couple of the more interesting or controversial ones.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Naive set theory is fun, and as we saw with Cantor&#8217;s diagonalization, it can produce some incredibly beautiful results. But as we&#8217;ve seen before, in the simple world of naive set theory, it&#8217;s easy to run into trouble, in the form of Russell&#8217;s paradox and a variety of related problems. For the sake of completeness, [&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":[56],"tags":[],"class_list":["post-423","post","type-post","status-publish","format-standard","hentry","category-set-theory"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p4lzZS-6P","jetpack_sharing_enabled":true,"jetpack_likes_enabled":true,"_links":{"self":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/423","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=423"}],"version-history":[{"count":0,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/posts\/423\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/media?parent=423"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/categories?post=423"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.goodmath.org\/blog\/wp-json\/wp\/v2\/tags?post=423"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}