<?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.05.css"?> 
<html  
xmlns="http://www.w3.org/1999/xhtml"  
><head><title>Theorems</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.05.tex" /> 
<meta name="date" content="2007-02-27 18:20:00" /> 
<link rel="stylesheet" type="text/css" href="fcla-xml-1.05.css" /> 
</head><body 
>
   <!--l. 249--><div class="crosslinks"><p class="noindent">[<a 
href="fcla-xml-1.05li9.xml" >next</a>] [<a 
href="fcla-xml-1.05li7.xml" >prev</a>] [<a 
href="fcla-xml-1.05li7.xml#tailfcla-xml-1.05li7.xml" >prev-tail</a>] [<a 
href="#tailfcla-xml-1.05li8.xml">tail</a>] [<a 
href="fcla-xml-1.05.xml#fcla-xml-1.05li8.xml" >up</a>] </p></div>
   <h2 class="likechapterHead"><a 
 id="x9-8000"></a>Theorems</h2>
<a 
 id="x9-8000doc"></a>
<!--l. 249--><p class="noindent"><span 
class="cmbx-12x-x-207">Theorems</span>
</p><!--l. 1--><p class="noindent">&#x00A0;
<br class="newline" />Section&#x00A0;WILA
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;SSLE
<br class="newline" /><a 
href="fcla-xml-1.05li16.xml#theorem.EOPSS">Theorem EOPSS Equation Operations Preserve Solution Sets</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;RREF
<br class="newline" /><a 
href="fcla-xml-1.05li17.xml#theorem.REMES">Theorem REMES Row-Equivalent Matrices represent Equivalent Systems</a>
<br class="newline" /><a 
href="fcla-xml-1.05li17.xml#theorem.REMEF">Theorem REMEF Row-Equivalent Matrix in Echelon Form</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;TSS
<br class="newline" /><a 
href="fcla-xml-1.05li18.xml#theorem.RCLS">Theorem RCLS Recognizing Consistency of a Linear System</a>
<br class="newline" /><a 
href="fcla-xml-1.05li18.xml#theorem.ISRN">Theorem ISRN Inconsistent Systems, <!--l. 9--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>r</mi></math>
and <!--l. 9--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math></a>
<br class="newline" /><a 
href="fcla-xml-1.05li18.xml#theorem.CSRN">Theorem CSRN Consistent Systems, <!--l. 10--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>r</mi></math>
and <!--l. 10--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math></a>
<br class="newline" /><a 
href="fcla-xml-1.05li18.xml#theorem.FVCS">Theorem FVCS Free Variables for Consistent Systems</a>
<br class="newline" /><a 
href="fcla-xml-1.05li18.xml#theorem.PSSLS">Theorem PSSLS Possible Solution Sets for Linear Systems</a>
<br class="newline" /><a 
href="fcla-xml-1.05li18.xml#theorem.CMVEI">Theorem CMVEI Consistent, More Variables than Equations, Infinite
                                                                          

                                                                          
solutions</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;HSE
<br class="newline" /><a 
href="fcla-xml-1.05li19.xml#theorem.HSC">Theorem HSC Homogeneous Systems are Consistent</a>
<br class="newline" /><a 
href="fcla-xml-1.05li19.xml#theorem.HMVEI">Theorem HMVEI Homogeneous, More Variables than Equations, Infinite
solutions</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;NM
<br class="newline" /><a 
href="fcla-xml-1.05li20.xml#theorem.NMRRI">Theorem NMRRI Nonsingular Matrices Row Reduce to the Identity matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li20.xml#theorem.NMTNS">Theorem NMTNS Nonsingular Matrices have Trivial Null Spaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li20.xml#theorem.NMUS">Theorem NMUS Nonsingular Matrices and Unique Solutions</a>
<br class="newline" /><a 
href="fcla-xml-1.05li20.xml#theorem.NME1">Theorem NME1 Nonsingular Matrix Equivalences, Round 1</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;VO
<br class="newline" /><a 
href="fcla-xml-1.05li22.xml#theorem.VSPCV">Theorem VSPCV Vector Space Properties of Column Vectors</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;LC
<br class="newline" /><a 
href="fcla-xml-1.05li23.xml#theorem.SLSLC">Theorem SLSLC Solutions to Linear Systems are Linear Combinations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li23.xml#theorem.VFSLS">Theorem VFSLS Vector Form of Solutions to Linear Systems</a>
<br class="newline" /><a 
href="fcla-xml-1.05li23.xml#theorem.PSPHS">Theorem PSPHS Particular Solution Plus Homogeneous Solutions</a>
<br class="newline" /><a 
href="fcla-xml-1.05li23.xml#theorem.RREFU">Theorem RREFU Reduced Row-Echelon Form is Unique</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;SS
<br class="newline" /><a 
href="fcla-xml-1.05li24.xml#theorem.SSNS">Theorem SSNS Spanning Sets for Null Spaces</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;LI
<br class="newline" /><a 
href="fcla-xml-1.05li25.xml#theorem.LIVHS">Theorem LIVHS Linearly Independent Vectors and Homogeneous Systems</a>
<br class="newline" /><a 
href="fcla-xml-1.05li25.xml#theorem.LIVRN">Theorem LIVRN Linearly Independent Vectors,
<!--l. 33--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>r</mi></math> and
<!--l. 33--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>n</mi></math></a>
<br class="newline" /><a 
href="fcla-xml-1.05li25.xml#theorem.MVSLD">Theorem MVSLD More Vectors than Size implies Linear Dependence</a>
<br class="newline" /><a 
href="fcla-xml-1.05li25.xml#theorem.NMLIC">Theorem NMLIC Nonsingular Matrices have Linearly Independent Columns</a>
<br class="newline" /><a 
href="fcla-xml-1.05li25.xml#theorem.NME2">Theorem NME2 Nonsingular Matrix Equivalences, Round 2</a>
<br class="newline" /><a 
href="fcla-xml-1.05li25.xml#theorem.BNS">Theorem BNS Basis for Null Spaces</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;LDS
<br class="newline" /><a 
href="fcla-xml-1.05li26.xml#theorem.DLDS">Theorem DLDS Dependency in Linearly Dependent Sets</a>
<br class="newline" /><a 
href="fcla-xml-1.05li26.xml#theorem.BS">Theorem BS Basis of a Span</a>
                                                                          

                                                                          
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;O
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.CRVA">Theorem CRVA Conjugation Respects Vector Addition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.CRSM">Theorem CRSM Conjugation Respects Vector Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.IPVA">Theorem IPVA Inner Product and Vector Addition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.IPSM">Theorem IPSM Inner Product and Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.IPAC">Theorem IPAC Inner Product is Anti-Commutative</a>
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.IPN">Theorem IPN Inner Products and Norms</a>
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.PIP">Theorem PIP Positive Inner Products</a>
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.OSLI">Theorem OSLI Orthogonal Sets are Linearly Independent</a>
<br class="newline" /><a 
href="fcla-xml-1.05li27.xml#theorem.GSPCV">Theorem GSPCV Gram-Schmidt Procedure, Column Vectors</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;MO
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.VSPM">Theorem VSPM Vector Space Properties of Matrices</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.SMS">Theorem SMS Symmetric Matrices are Square</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.TMA">Theorem TMA Transpose and Matrix Addition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.TMSM">Theorem TMSM Transpose and Matrix Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.TT">Theorem TT Transpose of a Transpose</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.CRMA">Theorem CRMA Conjugation Respects Matrix Addition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.CRMSM">Theorem CRMSM Conjugation Respects Matrix Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.CCM">Theorem CCM Conjugate of the Conjugate of a Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.MCT">Theorem MCT Matrix Conjugation and Transposes</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.AMA">Theorem AMA Adjoint and Matrix Addition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.AMSM">Theorem AMSM Adjoint and Matrix Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li29.xml#theorem.AA">Theorem AA Adjoint of an Adjoint</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;MM
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.SLEMM">Theorem SLEMM Systems of Linear Equations as Matrix Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.EMMVP">Theorem EMMVP Equal Matrices and Matrix-Vector Products</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.EMP">Theorem EMP Entries of Matrix Products</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMZM">Theorem MMZM Matrix Multiplication and the Zero Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMIM">Theorem MMIM Matrix Multiplication and Identity Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMDAA">Theorem MMDAA Matrix Multiplication Distributes Across Addition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMSMM">Theorem MMSMM Matrix Multiplication and Scalar Matrix Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMA">Theorem MMA Matrix Multiplication is Associative </a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMIP">Theorem MMIP Matrix Multiplication and Inner Products</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMCC">Theorem MMCC Matrix Multiplication and Complex Conjugation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMT">Theorem MMT Matrix Multiplication and Transposes</a>
                                                                          

                                                                          
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.MMAD">Theorem MMAD Matrix Multiplication and Adjoints</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.AIP">Theorem AIP Adjoint and Inner Product</a>
<br class="newline" /><a 
href="fcla-xml-1.05li30.xml#theorem.HMIP">Theorem HMIP Hermitian Matrices and Inner Products</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;MISLE
<br class="newline" /><a 
href="fcla-xml-1.05li31.xml#theorem.TTMI">Theorem TTMI Two-by-Two Matrix Inverse</a>
<br class="newline" /><a 
href="fcla-xml-1.05li31.xml#theorem.CINM">Theorem CINM Computing the Inverse of a Nonsingular Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li31.xml#theorem.MIU">Theorem MIU Matrix Inverse is Unique</a>
<br class="newline" /><a 
href="fcla-xml-1.05li31.xml#theorem.SS">Theorem SS Socks and Shoes</a>
<br class="newline" /><a 
href="fcla-xml-1.05li31.xml#theorem.MIMI">Theorem MIMI Matrix Inverse of a Matrix Inverse</a>
<br class="newline" /><a 
href="fcla-xml-1.05li31.xml#theorem.MIT">Theorem MIT Matrix Inverse of a Transpose</a>
<br class="newline" /><a 
href="fcla-xml-1.05li31.xml#theorem.MISM">Theorem MISM Matrix Inverse of a Scalar Multiple</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;MINM
<br class="newline" /><a 
href="fcla-xml-1.05li32.xml#theorem.NPNT">Theorem NPNT Nonsingular Product has Nonsingular Terms</a>
<br class="newline" /><a 
href="fcla-xml-1.05li32.xml#theorem.OSIS">Theorem OSIS One-Sided Inverse is Sufficient</a>
<br class="newline" /><a 
href="fcla-xml-1.05li32.xml#theorem.NI">Theorem NI Nonsingularity is Invertibility</a>
<br class="newline" /><a 
href="fcla-xml-1.05li32.xml#theorem.NME3">Theorem NME3 Nonsingular Matrix Equivalences, Round 3</a>
<br class="newline" /><a 
href="fcla-xml-1.05li32.xml#theorem.SNCM">Theorem SNCM Solution with Nonsingular Coefficient Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li32.xml#theorem.UMI">Theorem UMI Unitary Matrices are Invertible</a>
<br class="newline" /><a 
href="fcla-xml-1.05li32.xml#theorem.CUMOS">Theorem CUMOS Columns of Unitary Matrices are Orthonormal Sets</a>
<br class="newline" /><a 
href="fcla-xml-1.05li32.xml#theorem.UMPIP">Theorem UMPIP Unitary Matrices Preserve Inner Products</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;CRS
<br class="newline" /><a 
href="fcla-xml-1.05li33.xml#theorem.CSCS">Theorem CSCS Column Spaces and Consistent Systems</a>
<br class="newline" /><a 
href="fcla-xml-1.05li33.xml#theorem.BCS">Theorem BCS Basis of the Column Space</a>
<br class="newline" /><a 
href="fcla-xml-1.05li33.xml#theorem.CSNM">Theorem CSNM Column Space of a Nonsingular Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li33.xml#theorem.NME4">Theorem NME4 Nonsingular Matrix Equivalences, Round 4</a>
<br class="newline" /><a 
href="fcla-xml-1.05li33.xml#theorem.REMRS">Theorem REMRS Row-Equivalent Matrices have equal Row Spaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li33.xml#theorem.BRS">Theorem BRS Basis for the Row Space</a>
<br class="newline" /><a 
href="fcla-xml-1.05li33.xml#theorem.CSRST">Theorem CSRST Column Space, Row Space, Transpose</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;FS
<br class="newline" /><a 
href="fcla-xml-1.05li34.xml#theorem.PEEF">Theorem PEEF Properties of Extended Echelon Form</a>
<br class="newline" /><a 
href="fcla-xml-1.05li34.xml#theorem.FS">Theorem FS Four Subsets</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;VS
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.ZVU">Theorem ZVU Zero Vector is Unique</a>
                                                                          

                                                                          
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.AIU">Theorem AIU Additive Inverses are Unique</a>
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.ZSSM">Theorem ZSSM Zero Scalar in Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.ZVSM">Theorem ZVSM Zero Vector in Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.AISM">Theorem AISM Additive Inverses from Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.SMEZV">Theorem SMEZV Scalar Multiplication Equals the Zero Vector</a>
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.VAC">Theorem VAC Vector Addition Cancellation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.CSSM">Theorem CSSM Canceling Scalars in Scalar Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li36.xml#theorem.CVSM">Theorem CVSM Canceling Vectors in Scalar Multiplication</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;S
<br class="newline" /><a 
href="fcla-xml-1.05li37.xml#theorem.TSS">Theorem TSS Testing Subsets for Subspaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li37.xml#theorem.NSMS">Theorem NSMS Null Space of a Matrix is a Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li37.xml#theorem.SSS">Theorem SSS Span of a Set is a Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li37.xml#theorem.CSMS">Theorem CSMS Column Space of a Matrix is a Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li37.xml#theorem.RSMS">Theorem RSMS Row Space of a Matrix is a Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li37.xml#theorem.LNSMS">Theorem LNSMS Left Null Space of a Matrix is a Subspace</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;LISS
<br class="newline" /><a 
href="fcla-xml-1.05li38.xml#theorem.VRRB">Theorem VRRB Vector Representation Relative to a Basis</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;B
<br class="newline" /><a 
href="fcla-xml-1.05li39.xml#theorem.SUVB">Theorem SUVB Standard Unit Vectors are a Basis</a>
<br class="newline" /><a 
href="fcla-xml-1.05li39.xml#theorem.CNMB">Theorem CNMB Columns of Nonsingular Matrix are a Basis</a>
<br class="newline" /><a 
href="fcla-xml-1.05li39.xml#theorem.NME5">Theorem NME5 Nonsingular Matrix Equivalences, Round 5</a>
<br class="newline" /><a 
href="fcla-xml-1.05li39.xml#theorem.COB">Theorem COB Coordinates and Orthonormal Bases</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;D
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.SSLD">Theorem SSLD Spanning Sets and Linear Dependence</a>
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.BIS">Theorem BIS Bases have Identical Sizes</a>
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.DCM">Theorem DCM Dimension of <!--l. 134--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msup><mrow 
><mi 
>&#x2102;</mi></mrow><mrow 
><mi 
>m</mi></mrow></msup 
></math></a>
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.DP">Theorem DP Dimension of <!--l. 135--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>P</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></math></a>
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.DM">Theorem DM Dimension of <!--l. 136--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><msub><mrow 
><mi 
>M</mi></mrow><mrow 
><mi 
>m</mi><mi 
>n</mi></mrow></msub 
></math></a>
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.CRN">Theorem CRN Computing Rank and Nullity</a>
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.RPNC">Theorem RPNC Rank Plus Nullity is Columns</a>
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.RNNM">Theorem RNNM Rank and Nullity of a Nonsingular Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li40.xml#theorem.NME6">Theorem NME6 Nonsingular Matrix Equivalences, Round 6</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;PD
                                                                          

                                                                          
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.ELIS">Theorem ELIS Extending Linearly Independent Sets</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.G">Theorem G Goldilocks</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.PSSD">Theorem PSSD Proper Subspaces have Smaller Dimension</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.EDYES">Theorem EDYES Equal Dimensions Yields Equal Subspaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.RMRT">Theorem RMRT Rank of a Matrix is the Rank of the Transpose</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.DFS">Theorem DFS Dimensions of Four Subspaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.DSFB">Theorem DSFB Direct Sum From a Basis</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.DSFOS">Theorem DSFOS Direct Sum From One Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.DSZV">Theorem DSZV Direct Sums and Zero Vectors</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.DSZI">Theorem DSZI Direct Sums and Zero Intersection</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.DSLI">Theorem DSLI Direct Sums and Linear Independence</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.DSD">Theorem DSD Direct Sums and Dimension</a>
<br class="newline" /><a 
href="fcla-xml-1.05li41.xml#theorem.RDS">Theorem RDS Repeated Direct Sums</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;DM
<br class="newline" /><a 
href="fcla-xml-1.05li43.xml#theorem.EMDRO">Theorem EMDRO Elementary Matrices Do Row Operations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li43.xml#theorem.EMN">Theorem EMN Elementary Matrices are Nonsingular</a>
<br class="newline" /><a 
href="fcla-xml-1.05li43.xml#theorem.NMPEM">Theorem NMPEM Nonsingular Matrices are Products of Elementary
Matrices</a>
<br class="newline" /><a 
href="fcla-xml-1.05li43.xml#theorem.DMST">Theorem DMST Determinant of Matrices of Size Two</a>
<br class="newline" /><a 
href="fcla-xml-1.05li43.xml#theorem.DER">Theorem DER Determinant Expansion about Rows</a>
<br class="newline" /><a 
href="fcla-xml-1.05li43.xml#theorem.DT">Theorem DT Determinant of the Transpose</a>
<br class="newline" /><a 
href="fcla-xml-1.05li43.xml#theorem.DEC">Theorem DEC Determinant Expansion about Columns</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;PDM
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DZRC">Theorem DZRC Determinant with Zero Row or Column</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DRCS">Theorem DRCS Determinant for Row or Column Swap</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DRCM">Theorem DRCM Determinant for Row or Column Multiples</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DERC">Theorem DERC Determinant with Equal Rows or Columns</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DRCMA">Theorem DRCMA Determinant for Row or Column Multiples and Addition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DIM">Theorem DIM Determinant of the Identity Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DEM">Theorem DEM Determinants of Elementary Matrices</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DEMMM">Theorem DEMMM Determinants, Elementary Matrices, Matrix Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.SMZD">Theorem SMZD Singular Matrices have Zero Determinants</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.NME7">Theorem NME7 Nonsingular Matrix Equivalences, Round 7</a>
<br class="newline" /><a 
href="fcla-xml-1.05li44.xml#theorem.DRMM">Theorem DRMM Determinant Respects Matrix Multiplication</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;EE
                                                                          

                                                                          
<br class="newline" /><a 
href="fcla-xml-1.05li46.xml#theorem.EMHE">Theorem EMHE Every Matrix Has an Eigenvalue</a>
<br class="newline" /><a 
href="fcla-xml-1.05li46.xml#theorem.EMRCP">Theorem EMRCP Eigenvalues of a Matrix are Roots of Characteristic
Polynomials</a>
<br class="newline" /><a 
href="fcla-xml-1.05li46.xml#theorem.EMS">Theorem EMS Eigenspace for a Matrix is a Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li46.xml#theorem.EMNS">Theorem EMNS Eigenspace of a Matrix is a Null Space</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;PEE
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.EDELI">Theorem EDELI Eigenvectors with Distinct Eigenvalues are Linearly
Independent</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.SMZE">Theorem SMZE Singular Matrices have Zero Eigenvalues</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.NME8">Theorem NME8 Nonsingular Matrix Equivalences, Round 8</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.ESMM">Theorem ESMM Eigenvalues of a Scalar Multiple of a Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.EOMP">Theorem EOMP Eigenvalues Of Matrix Powers</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.EPM">Theorem EPM Eigenvalues of the Polynomial of a Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.EIM">Theorem EIM Eigenvalues of the Inverse of a Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.ETM">Theorem ETM Eigenvalues of the Transpose of a Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.ERMCP">Theorem ERMCP Eigenvalues of Real Matrices come in Conjugate Pairs</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.DCP">Theorem DCP Degree of the Characteristic Polynomial</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.NEM">Theorem NEM Number of Eigenvalues of a Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.ME">Theorem ME Multiplicities of an Eigenvalue</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.MNEM">Theorem MNEM Maximum Number of Eigenvalues of a Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.HMRE">Theorem HMRE Hermitian Matrices have Real Eigenvalues</a>
<br class="newline" /><a 
href="fcla-xml-1.05li47.xml#theorem.HMOE">Theorem HMOE Hermitian Matrices have Orthogonal Eigenvectors</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;SD
<br class="newline" /><a 
href="fcla-xml-1.05li48.xml#theorem.SER">Theorem SER Similarity is an Equivalence Relation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li48.xml#theorem.SMEE">Theorem SMEE Similar Matrices have Equal Eigenvalues</a>
<br class="newline" /><a 
href="fcla-xml-1.05li48.xml#theorem.DC">Theorem DC Diagonalization Characterization</a>
<br class="newline" /><a 
href="fcla-xml-1.05li48.xml#theorem.DMFE">Theorem DMFE Diagonalizable Matrices have Full Eigenspaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li48.xml#theorem.DED">Theorem DED Distinct Eigenvalues implies Diagonalizable</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;LT
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.LTTZZ">Theorem LTTZZ Linear Transformations Take Zero to Zero</a>
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.MBLT">Theorem MBLT Matrices Build Linear Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.MLTCV">Theorem MLTCV Matrix of a Linear Transformation, Column Vectors</a>
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.LTLC">Theorem LTLC Linear Transformations and Linear Combinations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.LTDB">Theorem LTDB Linear Transformation Defined on a Basis</a>
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.SLTLT">Theorem SLTLT Sum of Linear Transformations is a Linear Transformation</a>
                                                                          

                                                                          
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.MLTLT">Theorem MLTLT Multiple of a Linear Transformation is a Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.VSLT">Theorem VSLT Vector Space of Linear Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li50.xml#theorem.CLTLT">Theorem CLTLT Composition of Linear Transformations is a Linear
Transformation</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;ILT
<br class="newline" /><a 
href="fcla-xml-1.05li51.xml#theorem.KLTS">Theorem KLTS Kernel of a Linear Transformation is a Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li51.xml#theorem.KPI">Theorem KPI Kernel and Pre-Image</a>
<br class="newline" /><a 
href="fcla-xml-1.05li51.xml#theorem.KILT">Theorem KILT Kernel of an Injective Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li51.xml#theorem.ILTLI">Theorem ILTLI Injective Linear Transformations and Linear Independence</a>
<br class="newline" /><a 
href="fcla-xml-1.05li51.xml#theorem.ILTB">Theorem ILTB Injective Linear Transformations and Bases</a>
<br class="newline" /><a 
href="fcla-xml-1.05li51.xml#theorem.ILTD">Theorem ILTD Injective Linear Transformations and Dimension</a>
<br class="newline" /><a 
href="fcla-xml-1.05li51.xml#theorem.CILTI">Theorem CILTI Composition of Injective Linear Transformations is Injective</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;SLT
<br class="newline" /><a 
href="fcla-xml-1.05li52.xml#theorem.RLTS">Theorem RLTS Range of a Linear Transformation is a Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li52.xml#theorem.RSLT">Theorem RSLT Range of a Surjective Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li52.xml#theorem.SSRLT">Theorem SSRLT Spanning Set for Range of a Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li52.xml#theorem.RPI">Theorem RPI Range and Pre-Image</a>
<br class="newline" /><a 
href="fcla-xml-1.05li52.xml#theorem.SLTB">Theorem SLTB Surjective Linear Transformations and Bases</a>
<br class="newline" /><a 
href="fcla-xml-1.05li52.xml#theorem.SLTD">Theorem SLTD Surjective Linear Transformations and Dimension</a>
<br class="newline" /><a 
href="fcla-xml-1.05li52.xml#theorem.CSLTS">Theorem CSLTS Composition of Surjective Linear Transformations is
Surjective</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;IVLT
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.ILTLT">Theorem ILTLT Inverse of a Linear Transformation is a Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.IILT">Theorem IILT Inverse of an Invertible Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.ILTIS">Theorem ILTIS Invertible Linear Transformations are Injective and Surjective</a>
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.CIVLT">Theorem CIVLT Composition of Invertible Linear Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.ICLT">Theorem ICLT Inverse of a Composition of Linear Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.IVSED">Theorem IVSED Isomorphic Vector Spaces have Equal Dimension</a>
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.ROSLT">Theorem ROSLT Rank Of a Surjective Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.NOILT">Theorem NOILT Nullity Of an Injective Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li53.xml#theorem.RPNDD">Theorem RPNDD Rank Plus Nullity is Domain Dimension</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;VR
<br class="newline" /><a 
href="fcla-xml-1.05li55.xml#theorem.VRLT">Theorem VRLT Vector Representation is a Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li55.xml#theorem.VRI">Theorem VRI Vector Representation is Injective</a>
                                                                          

                                                                          
<br class="newline" /><a 
href="fcla-xml-1.05li55.xml#theorem.VRS">Theorem VRS Vector Representation is Surjective</a>
<br class="newline" /><a 
href="fcla-xml-1.05li55.xml#theorem.VRILT">Theorem VRILT Vector Representation is an Invertible Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li55.xml#theorem.CFDVS">Theorem CFDVS Characterization of Finite Dimensional Vector Spaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li55.xml#theorem.IFDVS">Theorem IFDVS Isomorphism of Finite Dimensional Vector Spaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li55.xml#theorem.CLI">Theorem CLI Coordinatization and Linear Independence</a>
<br class="newline" /><a 
href="fcla-xml-1.05li55.xml#theorem.CSS">Theorem CSS Coordinatization and Spanning Sets</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;MR
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.FTMR">Theorem FTMR Fundamental Theorem of Matrix Representation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.MRSLT">Theorem MRSLT Matrix Representation of a Sum of Linear Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.MRMLT">Theorem MRMLT Matrix Representation of a Multiple of a Linear
Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.MRCLT">Theorem MRCLT Matrix Representation of a Composition of Linear
Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.KNSI">Theorem KNSI Kernel and Null Space Isomorphism</a>
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.RCSI">Theorem RCSI Range and Column Space Isomorphism</a>
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.IMR">Theorem IMR Invertible Matrix Representations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.IMILT">Theorem IMILT Invertible Matrices, Invertible Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li56.xml#theorem.NME9">Theorem NME9 Nonsingular Matrix Equivalences, Round 9</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;CB
<br class="newline" /><a 
href="fcla-xml-1.05li57.xml#theorem.CB">Theorem CB Change-of-Basis</a>
<br class="newline" /><a 
href="fcla-xml-1.05li57.xml#theorem.ICBM">Theorem ICBM Inverse of Change-of-Basis Matrix</a>
<br class="newline" /><a 
href="fcla-xml-1.05li57.xml#theorem.MRCB">Theorem MRCB Matrix Representation and Change of Basis</a>
<br class="newline" /><a 
href="fcla-xml-1.05li57.xml#theorem.SCB">Theorem SCB Similarity and Change of Basis</a>
<br class="newline" /><a 
href="fcla-xml-1.05li57.xml#theorem.EER">Theorem EER Eigenvalues, Eigenvectors, Representations</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;OD
<br class="newline" /><a 
href="fcla-xml-1.05li58.xml#theorem.PTMT">Theorem PTMT Product of Triangular Matrices is Triangular</a>
<br class="newline" /><a 
href="fcla-xml-1.05li58.xml#theorem.ITMT">Theorem ITMT Inverse of a Triangular Matrix is Triangular</a>
<br class="newline" /><a 
href="fcla-xml-1.05li58.xml#theorem.UTMR">Theorem UTMR Upper Triangular Matrix Representation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li58.xml#theorem.OBUTR">Theorem OBUTR Orthonormal Basis for Upper Triangular Representation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li58.xml#theorem.OD">Theorem OD Orthonormal Diagonalization</a>
<br class="newline" /><a 
href="fcla-xml-1.05li58.xml#theorem.OBNM">Theorem OBNM Orthonormal Bases and Normal Matrices</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;NLT
<br class="newline" /><a 
href="fcla-xml-1.05li59.xml#theorem.NJB">Theorem NJB Nilpotent Jordan Blocks</a>
<br class="newline" /><a 
href="fcla-xml-1.05li59.xml#theorem.ENLT">Theorem ENLT Eigenvalues of Nilpotent Linear Transformations</a>
                                                                          

                                                                          
<br class="newline" /><a 
href="fcla-xml-1.05li59.xml#theorem.DNLT">Theorem DNLT Diagonalizable Nilpotent Linear Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li59.xml#theorem.KPLT">Theorem KPLT Kernels of Powers of Linear Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li59.xml#theorem.KPNLT">Theorem KPNLT Kernels of Powers of Nilpotent Linear Transformations</a>
<br class="newline" /><a 
href="fcla-xml-1.05li59.xml#theorem.CFNLT">Theorem CFNLT Canonical Form for Nilpotent Linear Transformations</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;IS
<br class="newline" /><a 
href="fcla-xml-1.05li60.xml#theorem.EIS">Theorem EIS Eigenspaces are Invariant Subspaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li60.xml#theorem.KPIS">Theorem KPIS Kernels of Powers are Invariant Subspaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li60.xml#theorem.GESIS">Theorem GESIS Generalized Eigenspace is an Invariant Subspace</a>
<br class="newline" /><a 
href="fcla-xml-1.05li60.xml#theorem.GEK">Theorem GEK Generalized Eigenspace as a Kernel</a>
<br class="newline" /><a 
href="fcla-xml-1.05li60.xml#theorem.RGEN">Theorem RGEN Restriction to Generalized Eigenspace is Nilpotent</a>
<br class="newline" /><a 
href="fcla-xml-1.05li60.xml#theorem.MRRGE">Theorem MRRGE Matrix Representation of a Restriction to a Generalized
Eigenspace</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;JCF
<br class="newline" /><a 
href="fcla-xml-1.05li58.xml#theorem.UTMR">Theorem UTMR Upper Triangular Matrix Representation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li61.xml#theorem.GESD">Theorem GESD Generalized Eigenspace Decomposition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li61.xml#theorem.DGES">Theorem DGES Dimension of Generalized Eigenspaces</a>
<br class="newline" /><a 
href="fcla-xml-1.05li61.xml#theorem.JCFLT">Theorem JCFLT Jordan Canonical Form for a Linear Transformation</a>
<br class="newline" /><a 
href="fcla-xml-1.05li61.xml#theorem.CHT">Theorem CHT Cayley-Hamilton Theorem</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;CNO
<br class="newline" /><a 
href="fcla-xml-1.05li67.xml#theorem.PCNA">Theorem PCNA Properties of Complex Number Arithmetic</a>
<br class="newline" /><a 
href="fcla-xml-1.05li67.xml#theorem.CCRA">Theorem CCRA Complex Conjugation Respects Addition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li67.xml#theorem.CCRM">Theorem CCRM Complex Conjugation Respects Multiplication</a>
<br class="newline" /><a 
href="fcla-xml-1.05li67.xml#theorem.CCT">Theorem CCT Complex Conjugation Twice</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;SET
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;PT
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;F
<br class="newline" /><a 
href="fcla-xml-1.05li97.xml#theorem.FIMP">Theorem FIMP Field of Integers Modulo a Prime</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;ROD
<br class="newline" /><a 
href="fcla-xml-1.05li99.xml#theorem.ROD">Theorem ROD Rank One Decomposition</a>
<br class="newline" />&#x00A0;
<br class="newline" />Section&#x00A0;TD
                                                                          

                                                                          
<br class="newline" /><a 
href="fcla-xml-1.05li100.xml#theorem.TD">Theorem TD Triangular Decomposition</a>
<br class="newline" /><a 
href="fcla-xml-1.05li100.xml#theorem.TDEE">Theorem TDEE Triangular Decomposition, Entry by Entry</a>
<br class="newline" />
                                                                          

                                                                          
</p>
   <!--l. 250--><div class="crosslinks"><p class="noindent">[<a 
href="fcla-xml-1.05li9.xml" >next</a>] [<a 
href="fcla-xml-1.05li7.xml" >prev</a>] [<a 
href="fcla-xml-1.05li7.xml#tailfcla-xml-1.05li7.xml" >prev-tail</a>] [<a 
href="fcla-xml-1.05li8.xml" >front</a>] [<a 
href="fcla-xml-1.05.xml#fcla-xml-1.05li8.xml" >up</a>] </p></div>
<!--l. 250--><p class="indent">   <a 
 id="tailfcla-xml-1.05li8.xml"></a> </p> 
</body> 
</html> 
