<?xml version="1.0"?>
<?xml-stylesheet type="text/css" href="http://helmut.knaust.info/mediawiki/skins/common/feed.css?303"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://helmut.knaust.info/mediawiki/index.php?action=history&amp;feed=atom&amp;title=CRN_11378%3A_HW_1</id>
		<title>CRN 11378: HW 1 - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://helmut.knaust.info/mediawiki/index.php?action=history&amp;feed=atom&amp;title=CRN_11378%3A_HW_1"/>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;action=history"/>
		<updated>2026-05-02T21:49:05Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.19.1</generator>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2777&amp;oldid=prev</id>
		<title>HelmutKnaust at 19:01, 9 October 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2777&amp;oldid=prev"/>
				<updated>2019-10-09T19:01:36Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class='diff diff-contentalign-left'&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
			&lt;tr valign='top'&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;← Older revision&lt;/td&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;Revision as of 19:01, 9 October 2019&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 3:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 3:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (This shows that a set can have at most one supremum.)&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (This shows that a set can have at most one supremum.)&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 3.''' Suppose that every non-empty set that is bounded &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;form &lt;/del&gt;above has a supremum. Show that then every non-empty set that is bounded form below has an infimum.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 3.''' Suppose that every non-empty set that is bounded &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;from &lt;/ins&gt;above has a supremum. Show that then every non-empty set that is bounded form below has an infimum.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 4.''' A real number $m$ is called maximum of the set $A\subseteq\mathbb{R}$, if $m\in A$ and $m\geq a$ for all $a\in A$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 4.''' A real number $m$ is called maximum of the set $A\subseteq\mathbb{R}$, if $m\in A$ and $m\geq a$ for all $a\in A$.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2734&amp;oldid=prev</id>
		<title>HelmutKnaust at 05:12, 3 September 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2734&amp;oldid=prev"/>
				<updated>2019-09-03T05:12:44Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class='diff diff-contentalign-left'&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
			&lt;tr valign='top'&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;← Older revision&lt;/td&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;Revision as of 05:12, 3 September 2019&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 1.''' Let $A$ and $B$ be two non-empty sets that are bounded from above. Show: If $\sup A &amp;lt; \sup B$, then $B$ contains an element that is an upper bound of $A$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 1.''' Let $A$ and $B$ be two non-empty sets that are bounded from above. Show: If $\sup A &amp;lt; \sup B$, then $B$ contains an element that is an upper bound of $A$.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Suprema are unique&lt;/del&gt;.)&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;This shows that a set can have at most one supremum&lt;/ins&gt;.)&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 3.''' Suppose that every non-empty set that is bounded form above has a supremum. Show that then every non-empty set that is bounded form below has an infimum.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 3.''' Suppose that every non-empty set that is bounded form above has a supremum. Show that then every non-empty set that is bounded form below has an infimum.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2733&amp;oldid=prev</id>
		<title>HelmutKnaust at 05:09, 3 September 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2733&amp;oldid=prev"/>
				<updated>2019-09-03T05:09:02Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class='diff diff-contentalign-left'&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
			&lt;tr valign='top'&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;← Older revision&lt;/td&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;Revision as of 05:09, 3 September 2019&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 1.''' Let $A$ and $B$ be two non-empty sets that are bounded from above. Show: If $\sup A &amp;lt; \sup B$, &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;show that &lt;/del&gt;$B$ contains an element that is an upper bound of $A$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 1.''' Let $A$ and $B$ be two non-empty sets that are bounded from above. Show: If $\sup A &amp;lt; \sup B$, &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;then &lt;/ins&gt;$B$ contains an element that is an upper bound of $A$.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (Suprema are unique.)&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (Suprema are unique.)&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 3.''' Suppose every non-empty set that is bounded form above has a supremum. Show that then every non-empty set that is bounded form below has an infimum.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 3.''' Suppose &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;that &lt;/ins&gt;every non-empty set that is bounded form above has a supremum. Show that then every non-empty set that is bounded form below has an infimum.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 4.''' A real number $m$ is called maximum of the set $A\subseteq\mathbb{R}$, if $m\in A$ and $m\geq a$ for all $a\in A$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 4.''' A real number $m$ is called maximum of the set $A\subseteq\mathbb{R}$, if $m\in A$ and $m\geq a$ for all $a\in A$.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2732&amp;oldid=prev</id>
		<title>HelmutKnaust at 05:07, 3 September 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2732&amp;oldid=prev"/>
				<updated>2019-09-03T05:07:27Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class='diff diff-contentalign-left'&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
			&lt;tr valign='top'&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;← Older revision&lt;/td&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;Revision as of 05:07, 3 September 2019&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 1.''' If $\sup A &amp;lt; \sup B$, show that $B$ contains an element that is an upper bound of $A$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 1.''' &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Let $A$ and $B$ be two non-empty sets that are bounded from above. Show: &lt;/ins&gt;If $\sup A &amp;lt; \sup B$, show that $B$ contains an element that is an upper bound of $A$.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (Suprema are unique.)&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (Suprema are unique.)&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2731&amp;oldid=prev</id>
		<title>HelmutKnaust at 05:06, 3 September 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2731&amp;oldid=prev"/>
				<updated>2019-09-03T05:06:27Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class='diff diff-contentalign-left'&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
			&lt;tr valign='top'&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;← Older revision&lt;/td&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;Revision as of 05:06, 3 September 2019&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 1.''' If $\sup A &amp;lt; \sup B$, show that $B$ contains an element that is an upper bound of $A$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 1.''' If $\sup A &amp;lt; \sup B$, show that $B$ contains an element that is an upper bound of $A$.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del style=&quot;color: red; font-weight: bold; text-decoration: none;&quot;&gt;&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (Suprema are unique.)&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (Suprema are unique.)&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2730&amp;oldid=prev</id>
		<title>HelmutKnaust: Created page with &quot;'''Problem 1.''' If $\sup A &lt; \sup B$, show that $B$ contains an element that is an upper bound of $A$.   '''Problem 2.''' Let $A$ be a non-empty set of real numbers that is b...&quot;</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_11378:_HW_1&amp;diff=2730&amp;oldid=prev"/>
				<updated>2019-09-03T05:06:13Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Problem 1.&amp;#039;&amp;#039;&amp;#039; If $\sup A &amp;lt; \sup B$, show that $B$ contains an element that is an upper bound of $A$.   &amp;#039;&amp;#039;&amp;#039;Problem 2.&amp;#039;&amp;#039;&amp;#039; Let $A$ be a non-empty set of real numbers that is b...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Problem 1.''' If $\sup A &amp;lt; \sup B$, show that $B$ contains an element that is an upper bound of $A$.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Problem 2.''' Let $A$ be a non-empty set of real numbers that is bounded from above. Show: If $s$ and $t$ both are suprema of $A$, then $s=t$. (Suprema are unique.)&lt;br /&gt;
&lt;br /&gt;
'''Problem 3.''' Suppose every non-empty set that is bounded form above has a supremum. Show that then every non-empty set that is bounded form below has an infimum.&lt;br /&gt;
&lt;br /&gt;
'''Problem 4.''' A real number $m$ is called maximum of the set $A\subseteq\mathbb{R}$, if $m\in A$ and $m\geq a$ for all $a\in A$.&lt;br /&gt;
# Show: If $m$ is the maximum of $A$, then $m$ is also the supremum of $A$.&lt;br /&gt;
# Let $A=\{x\in\mathbb{Q}\ |\ x^2\leq 5\}$. Show that A is bounded from above, but that $A$ has no maximum. &lt;br /&gt;
&lt;br /&gt;
'''Problem 5.''' Show that the ''Nested Interval Property'' together with the ''Archimedean Principle'' implies the ''Axiom of Completeness''.&lt;/div&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	</feed>