<?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=23666%3A_HW_7</id>
		<title>23666: HW 7 - 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=23666%3A_HW_7"/>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=23666:_HW_7&amp;action=history"/>
		<updated>2026-05-16T05:32:16Z</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=23666:_HW_7&amp;diff=2687&amp;oldid=prev</id>
		<title>HelmutKnaust at 22:24, 30 April 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=23666:_HW_7&amp;diff=2687&amp;oldid=prev"/>
				<updated>2019-04-30T22:24:29Z</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 22:24, 30 April 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 30.''' Consider the lexicographical order on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x',y')$ if $x\leq x'$ or ($x=x'$ and $y\leq y'$). Does every subset of $\mathbb{R}\times\mathbb{R}$ that is bounded from above with respect to this order have a least upper bound? Give a proof or provide a counterexample!&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 30.''' Consider the &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;''&lt;/ins&gt;lexicographical order&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;'' &lt;/ins&gt;on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x',y')$ if $x\leq x'$ or ($x=x'$ and $y\leq y'$). Does every subset of $\mathbb{R}\times\mathbb{R}$ that is bounded from above with respect to this order have a least upper bound? Give a proof or provide a counterexample!&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 31.''' Let $\underline{a}&amp;lt;\overline{a}$ and $\underline{b}&amp;lt;\overline{b}$ be real numbers, and let $R$ denote the rectangle \[R=\{(x,y)\in\mathbb{R}^2\ |\ \underline{a}\leq x\leq \overline{a}, \ \underline{b}\leq y\leq \overline{b}\}.\] Denote by $\mathcal{H}$ the collection of all rectangles $S$ such that (1) $S$ is contained in $R$, (2) $S$ has sides parallel to the coordinate axes, and (3) $S$ has positive area. &amp;#160;&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 31.''' Let $\underline{a}&amp;lt;\overline{a}$ and $\underline{b}&amp;lt;\overline{b}$ be real numbers, and let $R$ denote the rectangle \[R=\{(x,y)\in\mathbb{R}^2\ |\ \underline{a}\leq x\leq \overline{a}, \ \underline{b}\leq y\leq \overline{b}\}.\] Denote by $\mathcal{H}$ the collection of all rectangles $S$ such that (1) $S$ is contained in $R$, (2) $S$ has sides parallel to the coordinate axes, and (3) $S$ has positive area. &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 6:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 6:&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 32.'''&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 32.'''&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;Let $X$ be a fixed non-empty set. A function $f:X\to\mathbb{R}$ is called a characteristic function if there is a subset $A\subseteq X$ such that $f(x)=1$ if $x\in A$, and $f(x)=0$ if $x\not\in A$. In this case we write $f=\chi_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;Let $X$ be a fixed non-empty set. A function $f:X\to\mathbb{R}$ is called a &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;''&lt;/ins&gt;characteristic function&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;'' &lt;/ins&gt;if there is a subset $A\subseteq X$ such that $f(x)=1$ if $x\in A$, and $f(x)=0$ if $x\not\in A$. In this case we write $f=\chi_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;div&gt;#Show that the product of two characteristic functions is a characteristic function.&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;#Show that the product of two characteristic functions is a characteristic function.&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;div&gt;#Show that the sum $\chi_A+\chi_B$ of two characteristic functions is a characteristic function if and only if $A\cap B=\emptyset$. In this case $\chi_A+\chi_B=\chi_{A\cup B}$.&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;#Show that the sum $\chi_A+\chi_B$ of two characteristic functions is a characteristic function if and only if $A\cap B=\emptyset$. In this case $\chi_A+\chi_B=\chi_{A\cup B}$.&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=23666:_HW_7&amp;diff=2686&amp;oldid=prev</id>
		<title>HelmutKnaust at 22:24, 30 April 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=23666:_HW_7&amp;diff=2686&amp;oldid=prev"/>
				<updated>2019-04-30T22:24:00Z</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 22:24, 30 April 2019&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 6:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 6:&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 32.'''&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 32.'''&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;Let $X$ be a fixed non-empty set. A function $f:X\to\mathbb{R}$ is called a &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;characteristice &lt;/del&gt;function if there is a subset $A\subseteq X$ such that $f(x)=1$ if $x\in A$, and $f(x)=0$ if $x\not\in 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;Let $X$ be a fixed non-empty set. A function $f:X\to\mathbb{R}$ is called a &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;characteristic &lt;/ins&gt;function if there is a subset $A\subseteq X$ such that $f(x)=1$ if $x\in A$, and $f(x)=0$ if $x\not\in A&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;$. In this case we write $f=\chi_A&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;div&gt;#Show that the product of two characteristic functions is a characteristic function.&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;#Show that the product of two characteristic functions is a characteristic function.&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;div&gt;#Show that the sum $\chi_A+\chi_B$ of two characteristic functions is a characteristic function if and only if $A\cap B=\emptyset$. In this case $\chi_A+\chi_B=\chi_{A\cup B}$.&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;#Show that the sum $\chi_A+\chi_B$ of two characteristic functions is a characteristic function if and only if $A\cap B=\emptyset$. In this case $\chi_A+\chi_B=\chi_{A\cup B}$.&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=23666:_HW_7&amp;diff=2685&amp;oldid=prev</id>
		<title>HelmutKnaust at 22:22, 30 April 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=23666:_HW_7&amp;diff=2685&amp;oldid=prev"/>
				<updated>2019-04-30T22:22:10Z</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 22:22, 30 April 2019&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 6:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 6:&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 32.'''&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 32.'''&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&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;&lt;ins style=&quot;color: red; font-weight: bold; text-decoration: none;&quot;&gt;Let $X$ be a fixed non-empty set. A function $f:X\to\mathbb{R}$ is called a characteristice function if there is a subset $A\subseteq X$ such that $f(x)=1$ if $x\in A$, and $f(x)=0$ if $x\not\in A$.&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;div&gt;#Show that the product of two characteristic functions is a characteristic function.&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;#Show that the product of two characteristic functions is a characteristic function.&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;div&gt;#Show that the sum $\chi_A+\chi_B$ of two characteristic functions is a characteristic function if and only if $A\cap B=\emptyset$. In this case $\chi_A+\chi_B=\chi_{A\cup B}$.&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;#Show that the sum $\chi_A+\chi_B$ of two characteristic functions is a characteristic function if and only if $A\cap B=\emptyset$. In this case $\chi_A+\chi_B=\chi_{A\cup B}$.&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=23666:_HW_7&amp;diff=2684&amp;oldid=prev</id>
		<title>HelmutKnaust at 22:18, 30 April 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=23666:_HW_7&amp;diff=2684&amp;oldid=prev"/>
				<updated>2019-04-30T22:18:09Z</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 22:18, 30 April 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 30.''' Consider the lexicographical order on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x',y')$ if $x\leq x'$ or ($x=x'$ and $y\leq y'$). Does every subset of $\mathbb{R}\times\mathbb{R}$ that is bounded from above with respect to this order have a least upper bound?&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 30.''' Consider the lexicographical order on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x',y')$ if $x\leq x'$ or ($x=x'$ and $y\leq y'$). Does every subset of $\mathbb{R}\times\mathbb{R}$ that is bounded from above with respect to this order have a least upper bound? &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Give a proof or provide a counterexample!&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 31.''' Let $\underline{a}&amp;lt;\overline{a}$ and $\underline{b}&amp;lt;\overline{b}$ be real numbers, and let $R$ denote the rectangle \[R=\{(x,y)\in\mathbb{R}^2\ |\ \underline{a}\leq x\leq \overline{a}, \ \underline{b}\leq y\leq \overline{b}\}.\] Denote by $\mathcal{H}$ the collection of all rectangles $S$ such that (1) $S$ is contained in $R$, (2) $S$ has sides parallel to the coordinate axes, and (3) $S$ has positive area. &amp;#160;&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 31.''' Let $\underline{a}&amp;lt;\overline{a}$ and $\underline{b}&amp;lt;\overline{b}$ be real numbers, and let $R$ denote the rectangle \[R=\{(x,y)\in\mathbb{R}^2\ |\ \underline{a}\leq x\leq \overline{a}, \ \underline{b}\leq y\leq \overline{b}\}.\] Denote by $\mathcal{H}$ the collection of all rectangles $S$ such that (1) $S$ is contained in $R$, (2) $S$ has sides parallel to the coordinate axes, and (3) $S$ has positive area. &amp;#160;&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=23666:_HW_7&amp;diff=2683&amp;oldid=prev</id>
		<title>HelmutKnaust at 22:17, 30 April 2019</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=23666:_HW_7&amp;diff=2683&amp;oldid=prev"/>
				<updated>2019-04-30T22:17:12Z</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 22:17, 30 April 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 30.''' Consider the lexicographical order on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x',y')$ if $x\leq x'$ or ($x=x'$ and $y\leq y'$). Does every subset of $\mathbb{R}\times\mathbb{R}$ that is bounded from above &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;in &lt;/del&gt;this order have a least upper bound?&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 30.''' Consider the lexicographical order on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x',y')$ if $x\leq x'$ or ($x=x'$ and $y\leq y'$). Does every subset of $\mathbb{R}\times\mathbb{R}$ that is bounded from above &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;with respect to &lt;/ins&gt;this order have a least upper bound?&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 31.''' Let $\underline{a}&amp;lt;\overline{a}$ and $\underline{b}&amp;lt;\overline{b}$ be real numbers, and let $R$ denote the rectangle \[R=\{(x,y)\in\mathbb{R}^2\ |\ \underline{a}\leq x\leq \overline{a}, \ \underline{b}\leq y\leq \overline{b}\}.\] Denote by $\mathcal{H}$ the collection of all rectangles $S$ such that (1) $S$ is contained in $R$, (2) $S$ has sides parallel to the coordinate axes, and (3) $S$ has positive area. &amp;#160;&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 31.''' Let $\underline{a}&amp;lt;\overline{a}$ and $\underline{b}&amp;lt;\overline{b}$ be real numbers, and let $R$ denote the rectangle \[R=\{(x,y)\in\mathbb{R}^2\ |\ \underline{a}\leq x\leq \overline{a}, \ \underline{b}\leq y\leq \overline{b}\}.\] Denote by $\mathcal{H}$ the collection of all rectangles $S$ such that (1) $S$ is contained in $R$, (2) $S$ has sides parallel to the coordinate axes, and (3) $S$ has positive area. &amp;#160;&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=23666:_HW_7&amp;diff=2682&amp;oldid=prev</id>
		<title>HelmutKnaust: Created page with &quot;'''Problem 30.''' Consider the lexicographical order on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x',y')$ if $x\leq x'$ or ($x=x'$ and $y\leq y'$). Does every subset of $\m...&quot;</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=23666:_HW_7&amp;diff=2682&amp;oldid=prev"/>
				<updated>2019-04-30T22:16:03Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Problem 30.&amp;#039;&amp;#039;&amp;#039; Consider the lexicographical order on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x&amp;#039;,y&amp;#039;)$ if $x\leq x&amp;#039;$ or ($x=x&amp;#039;$ and $y\leq y&amp;#039;$). Does every subset of $\m...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Problem 30.''' Consider the lexicographical order on $\mathbb{R}\times\mathbb{R}$: $(x,y)\preceq (x',y')$ if $x\leq x'$ or ($x=x'$ and $y\leq y'$). Does every subset of $\mathbb{R}\times\mathbb{R}$ that is bounded from above in this order have a least upper bound?&lt;br /&gt;
&lt;br /&gt;
'''Problem 31.''' Let $\underline{a}&amp;lt;\overline{a}$ and $\underline{b}&amp;lt;\overline{b}$ be real numbers, and let $R$ denote the rectangle \[R=\{(x,y)\in\mathbb{R}^2\ |\ \underline{a}\leq x\leq \overline{a}, \ \underline{b}\leq y\leq \overline{b}\}.\] Denote by $\mathcal{H}$ the collection of all rectangles $S$ such that (1) $S$ is contained in $R$, (2) $S$ has sides parallel to the coordinate axes, and (3) $S$ has positive area. &lt;br /&gt;
&lt;br /&gt;
Show that every non-empty subset $\mathcal{K}$ of $\mathcal{H}$ has a least upper bound.&lt;br /&gt;
&lt;br /&gt;
'''Problem 32.'''&lt;br /&gt;
#Show that the product of two characteristic functions is a characteristic function.&lt;br /&gt;
#Show that the sum $\chi_A+\chi_B$ of two characteristic functions is a characteristic function if and only if $A\cap B=\emptyset$. In this case $\chi_A+\chi_B=\chi_{A\cup B}$.&lt;br /&gt;
&lt;br /&gt;
'''Problem 33.'''  &lt;br /&gt;
#Find a function whose domain is the set of real numbers $\mathbb{R}$ and whose range is the set of rational numbers $\mathbb{Q}$. &lt;br /&gt;
#Find a function whose domain is the set of natural numbers $\mathbb{N}$ and whose range is the set of integers $\mathbb{Z}$.&lt;br /&gt;
&lt;br /&gt;
'''Problem 34.''' &lt;br /&gt;
#Find functions $f:B\to C$, $g:A\to B$ and $h:A\to B$ such that $f\circ g=f\circ h$, yet $g\ne h$.&lt;br /&gt;
#Suppose $f:A\to B$ is a surjective function. Prove or disprove: If $g:B\to C$ and $h:B\to C$ satisfy $g\circ f=h\circ f$, then $g=h$.&lt;/div&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	</feed>