<?xml version="1.0" encoding="iso-8859-1" ?> 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN" 
"http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd" > 
<?xml-stylesheet type="text/css" href="fcla-xml-1.08.css"?> 
<html  
xmlns="http://www.w3.org/1999/xhtml"  
><head><title>Appendix P  Preliminaries</title> 
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" /> 
<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)" /> 
<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)" /> 
<!-- xhtml,mozilla,3,html --> 
<meta name="src" content="fcla-xml-1.08.tex" /> 
<meta name="date" content="2007-03-29 11:58:00" /> 
<link rel="stylesheet" type="text/css" href="fcla-xml-1.08.css" /> 
</head><body 
>
   <!--l. 467--><div class="crosslinks"><p class="noindent">[<a 
href="fcla-xml-1.08li70.xml" >next</a>] [<a 
href="fcla-xml-1.08li62.xml" >prev</a>] [<a 
href="fcla-xml-1.08li62.xml#tailfcla-xml-1.08li62.xml" >prev-tail</a>] [<a 
href="#tailfcla-xml-1.08li66.xml">tail</a>] [<a 
href="fcla-xml-1.08li13.xml#fcla-xml-1.08li66.xml" >up</a>] </p></div>
   <h2 class="likechapterHead"><a 
 id="x67-331000"></a>Appendix P&#x00A0;&#x00A0;Preliminaries</h2>
<!--l. 467--><p class="noindent"><a 
 id="appendix.P"></a> <a 
 id="x67-331000doc"></a><a 
 id="dx67-331001"></a>
</p><!--l. 10--><p class="indent">   This appendix contains important ideas about complex numbers, sets, and
the logic and techniques of forming proofs. It is not meant to be read
straight through, but you should head here when you need to review these
ideas.
</p><!--l. 12--><p class="indent">   We choose to expand the set of scalars from the real numbers,
<!--l. 12--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>&#x211D;</mi></mrow><mrow 
></mrow></msup 
></math>, to the set of
complex numbers, <!--l. 12--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>&#x2102;</mi></mrow><mrow 
></mrow></msup 
></math>.
So basic operations with complex numbers (like addition and division) will be
necessary. This can be safely postponed until your arrival in <a 
href="fcla-xml-1.08li27.xml#section.O">Section&#x00A0;O</a>, and a
refresher before <a 
href="fcla-xml-1.08li45.xml#chapter.E">Chapter&#x00A0;E</a> would be a good idea as well.
</p><!--l. 14--><p class="indent">   Sets are extremely important in all of mathematics, but maybe you have not
had much exposure to the basic operations. Check out <a 
href="fcla-xml-1.08li68.xml#section.SET">Section&#x00A0;SET</a>. The text will
send you here frequently as well. Visit often.
</p><!--l. 18--><p class="indent">   This book is as much about <span 
class="cmti-12">doing </span>mathematics as it is about linear algebra.
The &#x201C;Proof Techniques&#x201D; are vignettes about logic, types of theorems, structure
of proofs, or just plain old-fashioned advice about how to <span 
class="cmti-12">do </span>advanced
mathematics. The text will frequently point to one of these techniques
in advance of their first use, and for specific instructions there will be
additional references. If you find constructing proofs difficult (we all did once),
then head back here and browse through the advice for second or third
readings.
</p>
   <div class="likesectionTOCS">
   &#x00A0;<span class="likesectionToc"><a 
href="fcla-xml-1.08li67.xml#x68-332000">Section CNO Complex Number Operations</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li67.xml#x68-333000" id="QQ2-68-333">Subsection CNA: Arithmetic with complex numbers</a></span>
                                                                          

                                                                          
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li67.xml#x68-334000" id="QQ2-68-334">Subsection CCN: Conjugates of Complex Numbers</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li67.xml#x68-335000" id="QQ2-68-335">Subsection MCN: Modulus of a Complex Number</a></span>
<br />   &#x00A0;<span class="likesectionToc"><a 
href="fcla-xml-1.08li68.xml#x69-336000">Section SET Sets</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li68.xml#x69-337000" id="QQ2-69-337">Subsection SC: Set Cardinality</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li68.xml#x69-338000" id="QQ2-69-338">Subsection SO: Set Operations</a></span>
<br />   &#x00A0;<span class="likesectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-339000">Section PT Proof Techniques</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-340000" id="QQ2-70-340">Proof Technique D: Definitions</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-341000" id="QQ2-70-341">Proof Technique T: Theorems</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-342000" id="QQ2-70-342">Proof Technique L: Language</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-343000" id="QQ2-70-343">Proof Technique GS: Getting Started</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-344000" id="QQ2-70-344">Proof Technique C: Constructive Proofs</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-345000" id="QQ2-70-345">Proof Technique E: Equivalences</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-346000" id="QQ2-70-346">Proof Technique N: Negation</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-347000" id="QQ2-70-347">Proof Technique CP: Contrapositives</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-348000" id="QQ2-70-348">Proof Technique CV: Converses</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-349000" id="QQ2-70-349">Proof Technique CD: Contradiction</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-350000" id="QQ2-70-350">Proof Technique U: Uniqueness</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-351000" id="QQ2-70-351">Proof Technique ME: Multiple Equivalences</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-352000" id="QQ2-70-352">Proof Technique PI: Proving Identities</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-353000" id="QQ2-70-353">Proof Technique DC: Decompositions</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-354000" id="QQ2-70-354">Proof Technique I: Induction</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-355000" id="QQ2-70-355">Proof Technique P: Practice</a></span>
<br />   &#x00A0;&#x00A0;<span class="likesubsectionToc"><a 
href="fcla-xml-1.08li69.xml#x70-356000" id="QQ2-70-356">Proof Technique LC: Lemmas and Corollaries</a></span>
   </div>


                                                                          

                                                                          
   <!--l. 483--><div class="crosslinks"><p class="noindent">[<a 
href="fcla-xml-1.08li70.xml" >next</a>] [<a 
href="fcla-xml-1.08li62.xml" >prev</a>] [<a 
href="fcla-xml-1.08li62.xml#tailfcla-xml-1.08li62.xml" >prev-tail</a>] [<a 
href="fcla-xml-1.08li66.xml" >front</a>] [<a 
href="fcla-xml-1.08li13.xml#fcla-xml-1.08li66.xml" >up</a>] </p></div>
<!--l. 483--><p class="indent">   <a 
 id="tailfcla-xml-1.08li66.xml"></a> </p> 
</body> 
</html> 
