<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wikidot="http://www.wikidot.com/rss-namespace">

	<channel>
		<title>Logic, Proof, &amp; Axiomatic Systems (Fall 2009) - new forum posts</title>
		<link>http://ma3110fall2009.wikidot.com/forum/start</link>
		<description>Posts in forums of the site &quot;Logic, Proof, &amp; Axiomatic Systems (Fall 2009)&quot; - Plymouth State University</description>
				<copyright></copyright>
		<lastBuildDate>Tue, 09 Jun 2026 17:48:41 +0000</lastBuildDate>
		
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-201661#post-647489</guid>
				<title>Hints</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-201661/problem-7-4-9#post-647489</link>
				<description></description>
				<pubDate>Thu, 03 Dec 2009 14:53:54 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>This problem is awesome!</p> <p>First, the <span class="math-inline">$\LaTeX$</span> syntax for <span class="math-inline">$\mathcal{P}(\mathbb{N})$</span> is</p> <div class="code"> <pre><code>[[$\mathcal{P}(\mathbb{N})$]]</code></pre></div> <p>Let <span class="math-inline">$X$</span> be set of all sequences of 0's and 1's. Each element of <span class="math-inline">$X$</span> is of the form <span class="math-inline">$(a_i)_{i=1}^{\infty}$</span>, where each <span class="math-inline">$a_i$</span> equals 0 or 1 (but not both!). In order to show that <span class="math-inline">$\mathcal{P}(\mathbb{N})$</span> and <span class="math-inline">$X$</span> have the same cardinality, we need to show that there is a 1-1 correspondence between the two sets. Our job is to construct a function between these two sets and then show that it is (1) 1-1, and (2) onto. The hardest part is figuring out what the function should be and actually writing it down nicely. I'll do that part for you now.</p> <p>Define <span class="math-inline">$f: \mathcal{P}(\mathbb{N}) \to X$</span> via</p> <span class="equation-number">(1)</span> <div class="math-equation" id="equation-985252-1">\begin{align} f(A)=(a_i)_{i=1}^{\infty}, \end{align}</div> <p>where <span class="math-inline">$A\subseteq \mathbb{N}$</span> and <span class="math-inline">$(a_i)$</span> is defined by</p> <span class="equation-number">(2)</span> <div class="math-equation" id="equation-985252-2">\begin{align} a_i=\begin{cases} 0, &amp; \text{if } i\notin A\\ 1, &amp; \text{if } i\in A \end{cases}. \end{align}</div> <p>The <span class="math-inline">$\LaTeX$</span> syntax for the above definition of <span class="math-inline">$a_i$</span> is</p> <div class="code"> <pre><code>[[math]] a_i=\begin{cases} 0, &amp; \text{if } i\notin A\\ 1, &amp; \text{if } i\in A \end{cases}. [[/math]]</code></pre></div> <p>All that remains to do is to show that <span class="math-inline">$f$</span> is 1-1 and onto.</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100218">Hidden / Per page discussions</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-201661/problem-7-4-9">Problem 7.4.9</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-201659#post-647480</guid>
				<title>Hints</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-201659/corollary-7-4-6#post-647480</link>
				<description></description>
				<pubDate>Thu, 03 Dec 2009 14:36:39 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Proceed by contradiction. Recall that <span class="math-inline">$\mathbb{R}$</span> is equal to the union of the rationals and irrationals. If the irrationals are countable, what does <a href="http://ma3110fall2009.wikidot.com/exercise-7-3-9">Exercise 7.3.9</a> tell us?</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100218">Hidden / Per page discussions</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-201659/corollary-7-4-6">Corollary 7.4.6</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-201653#post-647475</guid>
				<title>Hints</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-201653/corollary-7-4-5#post-647475</link>
				<description></description>
				<pubDate>Thu, 03 Dec 2009 14:29:51 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>As in <a href="http://ma3110fall2009.wikidot.com/corollary-7-4-4">Corollary 7.4.4</a>, use a proof by contradiction. In each case, assume the interval is countable. Appeal to Exercise 7.1.2(2) to conclude that each of these intervals has the same cardinality as an interval that you already know something about.</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100218">Hidden / Per page discussions</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-201653/corollary-7-4-5">Corollary 7.4.5</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-201646#post-647457</guid>
				<title>Hints</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-201646/corollary-7-4-4#post-647457</link>
				<description></description>
				<pubDate>Thu, 03 Dec 2009 14:14:23 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Use a proof by contradiction. Assume that <span class="math-inline">$\mathbb{R}$</span> is countable. Then by definition, there exists a 1-1 correspondence <span class="math-inline">$f: \mathbb{N}\to \mathbb{R}$</span>. We'd like to use the fact that the interval <span class="math-inline">$(0,1)$</span> is uncountable (see Theorem 7.4.3) to get a contradiction. Let <span class="math-inline">$X=f^{-1}((0,1))$</span>. Define a new function <span class="math-inline">$f^*:X\to (0,1)$</span> via <span class="math-inline">$f^*(n)=f(n)$</span> (this is similar to what we did in the proof of Theorem 5.1.16). Show that <span class="math-inline">$f^*$</span> is onto. What does <a href="http://ma3110fall2009.wikidot.com/theorem-7-3-5">Theorem 7.3.5</a> say in this case?</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100218">Hidden / Per page discussions</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-201646/corollary-7-4-4">Corollary 7.4.4</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-201216#post-646281</guid>
				<title>Hints</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-201216/theorem-7-3-6#post-646281</link>
				<description></description>
				<pubDate>Wed, 02 Dec 2009 03:44:53 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Consider the set of fractions listed in Figure 7.3 on page 165. Let's call this set <span class="math-inline">$F$</span>. Notice that <span class="math-inline">$\mathbb{Q}\subseteq F$</span> (we're not reducing the fractions in <span class="math-inline">$F$</span>). If we can show that <span class="math-inline">$F$</span> is countable, then we're done (by Theorem 7.3.4). The general strategy here is to construct a function <span class="math-inline">$f: \mathbb{N}\to F$</span> that is onto and then appeal to Theorem 7.3.5. Doing this is rather tricky and probably best to do by drawing a picture. Try to find a path through the grid in Figure 7.3 that hits every fraction exactly once. Define <span class="math-inline">$f: \mathbb{N}\to F$</span> via <span class="math-inline">$f(n)$</span> is the fraction that you hit on the <span class="math-inline">$n\text{th}$</span> step in your path.</p> <p>If you can figure out the path by drawing a picture, I can help you scan it and post it here.</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100218">Hidden / Per page discussions</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-201216/theorem-7-3-6">Theorem 7.3.6</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-201206#post-646268</guid>
				<title>Hints</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-201206/theorem-7-3-5#post-646268</link>
				<description></description>
				<pubDate>Wed, 02 Dec 2009 03:32:56 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>For each <span class="math-inline">$x\in X$</span>, choose exactly one <span class="math-inline">$n_x\in\mathbb{N}$</span> such that <span class="math-inline">$f(n_x)=x$</span>. We know that we can do this since <span class="math-inline">$f$</span> is onto. Also, since <span class="math-inline">$f$</span> is a function, we know that <span class="math-inline">$f(n_x)\neq f(n_y)$</span> whenever <span class="math-inline">$x\neq y$</span>. Now, define the set <span class="math-inline">$N'\subseteq \mathbb{N}$</span> via</p> <span class="equation-number">(1)</span> <div class="math-equation" id="equation-263898-1">\begin{align} N'=\{n_x:x\in X\}. \end{align}</div> <p>What does Theorem 7.3.4 tell us about <span class="math-inline">$N'$</span>? Next, define the function <span class="math-inline">$g: N'\to X$</span> via <span class="math-inline">$g(n_x)=x$</span>. Is <span class="math-inline">$g$</span> onto? How about 1-1? What does Theorem 7.3.3 tell us?</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100218">Hidden / Per page discussions</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-201206/theorem-7-3-5">Theorem 7.3.5</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-201200#post-646243</guid>
				<title>Hints</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-201200/theorem-7-3-3#post-646243</link>
				<description></description>
				<pubDate>Wed, 02 Dec 2009 02:54:16 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>There are quite a few ways to approach this problem. Here's one way. Consider two cases:</p> <ol> <li><span class="math-inline">$C$</span> finite,</li> <li><span class="math-inline">$C$</span> countably infinite.</li> </ol> <p>In case 1, there exists a 1-1 correspondence <span class="math-inline">$g: \{1,2,\dots,k\}\to C$</span> for some <span class="math-inline">$k$</span> (by definition of <span class="math-inline">$C$</span> being finite). Consider the composition <span class="math-inline">$f\circ g: \{1,2,\dots, k\}\to B$</span> and take a look at Theorem 5.2.3. Conclude that <span class="math-inline">$B$</span> is finite and hence countable.</p> <p>In case 2, there exists a 1-1 correspondence <span class="math-inline">$g: \mathbb{N}\to C$</span> (since <span class="math-inline">$\mathbb{N}$</span> and <span class="math-inline">$C$</span> have same cardinality). Again consider the composition <span class="math-inline">$f\circ g$</span> and argue similar to case 1, except you will conclude that <span class="math-inline">$B$</span> is countably infinite.</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100218">Hidden / Per page discussions</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-201200/theorem-7-3-3">Theorem 7.3.3</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-199738#post-646077</guid>
				<title>Looking good!</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-199738/theorem-7-2-3#post-646077</link>
				<description></description>
				<pubDate>Tue, 01 Dec 2009 22:05:15 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>This looks perfect now. David, thanks for taking the time to post the original content. Pat, thanks for letting us log in under you. Everyone, thanks for helping edit it.</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100218">Hidden / Per page discussions</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-199738/theorem-7-2-3">Theorem 7.2.3</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-199852#post-642470</guid>
				<title>Re: how....</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-199852/how#post-642470</link>
				<description></description>
				<pubDate>Thu, 26 Nov 2009 02:15:58 +0000</pubDate>
				<wikidot:authorName>Dana Ernst</wikidot:authorName>				<wikidot:authorUserId>406396</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>Hey Allie, don't get too frustrated. Have you taken a look at the <a href="http://ma3110fall2009.wikidot.com/quick-latex-guide">Quick LaTeX Guide</a>? There are a few examples there that you should try to mimic. In general, any mathematical notation is of the form</p> <blockquote> <p><span style="white-space: pre-wrap;">[[$&#32;insert&#32;LaTeX&#32;equation&#32;here&#32;$]]</span></p> </blockquote> <p>Between the dollar signs is where you place specific <span class="math-inline">$\LaTeX$</span> commands for whatever math symbol(s) you want. All <span class="math-inline">$$\LaTeX$</span> commands begin with the <span style="white-space: pre-wrap;">\</span>-symbol. For example, if you wanted to typeset &quot;square root of x squared plus y squared&quot;, you would type the following in the page editor.</p> <blockquote> <p><span style="white-space: pre-wrap;">[[$\sqrt{x^2+y^2}$]]</span></p> </blockquote> <p>The result of the above is code is:</p> <blockquote> <p><span class="math-inline">$\sqrt{x^2+y^2}$</span></p> </blockquote> <p>Also, notice that when you are in the page editor, among the many buttons above the text box are two labelled <span class="math-inline">$\sqrt{x}$</span> and <span class="math-inline">$x/2$</span>, respectively. The first of these inserts initial code for a mathematical expression or equation that you want to display on its own line and centered. The second button inserts the initial code for an inline mathematical expression. Using these buttons can save you a bit of typing.</p> <p>Just try it out and see what happens. The beauty of the wiki is that you can go back and fix and/or edit things at any later date. It doesn't have to be perfect on the first go. Let me know if you have more questions.</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100308">technical questions / typesetting mathematics</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-199852/how">how....</a>
				 	]]>
				</content:encoded>							</item>
					<item>
				<guid>http://ma3110fall2009.wikidot.com/forum/t-199852#post-642151</guid>
				<title>how....</title>
				<link>http://ma3110fall2009.wikidot.com/forum/t-199852/how#post-642151</link>
				<description></description>
				<pubDate>Wed, 25 Nov 2009 17:56:06 +0000</pubDate>
				<wikidot:authorName>Alyson Sewell</wikidot:authorName>				<wikidot:authorUserId>407204</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>how exactly so I make the symbols on the editor, i'm so lost and beyond frustrated :(</p> <br/>Forum category: <a href="http://ma3110fall2009.wikidot.com/forum/c-100308">technical questions / typesetting mathematics</a><br/>Forum thread: <a href="http://ma3110fall2009.wikidot.com/forum/t-199852/how">how....</a>
				 	]]>
				</content:encoded>							</item>
				</channel>
</rss>