+<isbn>978-0-9844175-5-1</isbn>
<version>3.00-beta1</version>
<title>A First Course in Linear Algebra</title>
<shortlicense>Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the appendix entitled <q>GNU Free Documentation License</q>.</shortlicense>
-<canonicalsite>The most recent version of this work can always be found at <miscref type="booksite" />.</canonicalsite>
+<canonicalsite>The most recent version can always be found at <miscref type="booksite" />.</canonicalsite>
<coverdesigner>Aidan Meacham</coverdesigner>
-Robert A. Beezer is a Professor of Mathematics at the University of Puget Sound, where he has been on the faculty since 1984. He received a B.S. in Mathematics (with an Emphasis in Computer Science) from the University of Santa Clara in 1978, a M.S. in Statistics from the University of Illinois at Urbana-Champaign in 1982 and a Ph.D. in Mathematics from the University of Illinois at Urbana-Champaign in 1984. He teaches calculus, linear algebra and abstract algebra regularly, while his research interests include the applications of linear algebra to graph theory. His professional website is at \url{http://buzzard.ups.edu}.
+<p>Robert A. Beezer is a Professor of Mathematics at the University of Puget Sound, where he has been on the faculty since 1984. He received a B.S. in Mathematics (with an Emphasis in Computer Science) from the University of Santa Clara in 1978, a M.S. in Statistics from the University of Illinois at Urbana-Champaign in 1982 and a Ph.D. in Mathematics from the University of Illinois at Urbana-Champaign in 1984.</p>
+<p>In addition to his teaching at the University of Puget Sound, he has made sabbatical visits to the University of the West Indies (Trinidad campus) and the University of Western Australia. He has also given several courses in the Master's program at the African Institute for Mathematical Sciences, South Africa. He has been a Sage developer since 2008.</p>
+<p>He teaches calculus, linear algebra and abstract algebra regularly, while his research interests include the applications of linear algebra to graph theory. His professional website is at \url{http://buzzard.ups.edu}.</p>
<contributorinfo codename="davidbeezer">
Jinshil Yi, <!-- version 2.20 -->
Cliff Berger, Preston Van Buren, <!-- version 2.30 -->
Duncan Bennett, Dan Messenger, Caden Robinson, Glenna Toomey, Tyler Ueltschi and Kyle Whitcomb. <!-- version 3.00 -->
+All the students of the Fall~2012 Math 290 sections were very helpful and patient through the major changes required in making Version 3.00.</p>
<p>I have tried to be as original as possible in the organization and presentation of this beautiful subject. However, I have been influenced by many years of teaching from another excellent textbook, <i>Introduction to Linear Algebra</i> by L.W. Johnson, R.D. Reiss and J.T. Arnold. When I have needed inspiration for the correct approach to particularly important proofs, I have learned to eventually consult two other textbooks. Sheldon Axler's <i>Linear Algebra Done Right</i> is a highly original exposition, while Ben Noble's <i>Applied Linear Algebra</i> frequently strikes just the right note between rigor and intuition. Noble's excellent book is highly recommended, even though its publication dates to 1969.</p>
<p>Incorporation of Sage code is made possible by the entire community of Sage developers and users, who create and refine the mathematical routines, the user interfaces and applications in educational settings. Technical and logistical aspects of incorporating Sage code in open textbooks was supported by a grant from the United States National Science Foundation (DUE-1022574), which has been administered by the American Institute of Mathematics, and in particular, David Farmer. The support and assistance of my fellow Principal Investigators, Jason Grout, Tom Judson, Kiran Kedlaya, Sandra Laursen, Susan Lynds, and William Stein is especially appreciated.</p>
+<p>David Farmer and Sally Koutsoliotas are responsible for the vision and initial experiments which lead to the knowl-enabled web version, as part of the Version 3 project.</p>
<p>General support and encouragement of free and affordable textbooks, in addition to specific promotion of this text, was provided by Nicole Allen, Textbook Advocate at Student Public Interest Research Groups. Nicole was an early consumer of this material, back when it looked more like lecture notes than a textbook.</p>
-<p>Finally, in almost every aspect, the production and distribution of this book has been accomplished with open source software. The range of individuals and projects is far too great to pretend to list them all. This project is an attempt to pay it forward.</p>
+<p>Finally, in every respect, the production and distribution of this book has been accomplished with open source software. The range of individuals and projects is far too great to pretend to list them all. This project is an attempt to pay it forward.</p>
<title>How to Use This Book</title>
-<p>While the book is divided into chapters, the main organizational unit is the thirty-seven sections. Each contains a selection of definitions, theorems, and examples interspersed with commentary. If you are enrolled in a course, read the section <em>before</em> class and then answer the section's reading questions.</p>
+<p>While the book is divided into chapters, the main organizational unit is the thirty-seven sections. Each contains a selection of definitions, theorems, and examples interspersed with commentary. If you are enrolled in a course, read the section <em>before</em> class and then answer the section's reading questions as preparation for class.</p>
-<p>The version available for viewing in a web browser is the most complete, integrating all of the components of the book. Consider acquainting yourself with this version. Knowls are indicated by a dashed underlines and will allow you to seamlessly remind yourself of the content of definitions, theorems, examples, exercises, subsections and more. Use them liberally. The PDF and print versions of the book contain fewer cross-references.</p>
+<p>The version available for viewing in a web browser is the most complete, integrating all of the components of the book. Consider acquainting yourself with this version. Knowls are indicated by a dashed underlines and will allow you to seamlessly remind yourself of the content of definitions, theorems, examples, exercises, subsections and more. Use them liberally.</p>
-<p>Historically, mathematics texts have numbered definitions and theorems. We have instead adopted a strategy more appropriate to the heavy cross-referencing, linking and knowling afforded by modern media. Mimicking an approach taken by Donald Knuth, we have given items short titles and associated acronyms. You will become comfortable with this scheme after a short time, and might even come to appreciate its inherent advantages. Each chapter has a list of ten or so important items from that chapter, and you will find yourself recognizing some of these acronyms with no extra effort beyond the normal amount of study.</p>
+<p>Historically, mathematics texts have numbered definitions and theorems. We have instead adopted a strategy more appropriate to the heavy cross-referencing, linking and knowling afforded by modern media. Mimicking an approach taken by Donald Knuth, we have given items short titles and associated acronyms. You will become comfortable with this scheme after a short time, and might even come to appreciate its inherent advantages. In the web version, each chapter has a list of ten or so important items from that chapter, and you will find yourself recognizing some of these acronyms with no extra effort beyond the normal amount of study.</p>
-<p>Exercises come in three flavors, indicated by the first letter of their label. <q>C</q> indicates a problem that is essentially computational. <q>T</q> represents a problem that is more theoretical, usually requiring a solution that is as rigorous as a proof. <q>M</q> stands for problems that are <q>medium</q>, <q>moderate</q>, <q>midway</q>, <q>mediate</q> or <q>median</q>, but never <q>mediocre</q>. Their statements could feel computational, but their solutions require a more thorough understanding of the concepts or theory, while perhaps not being as rigorous as a proof. Of course, such a tripartite division will be subject to interpretation. Otherwise, larger numerical values indicate greater perceived difficulty, with gaps allowing for the contribution of new problems from readers. Many, but not all, exercises have complete solutions. These are indicated by daggers in the PDF and print versions, with solutions available in an online supplement, while in the web version a solution is indicated by a knowl right after the problem statement. Resist the urge to peek early. Working the exercises diligently is the best way to master the material.</p>
+<p>Exercises come in three flavors, indicated by the first letter of their label. <q>C</q> indicates a problem that is essentially computational. <q>T</q> represents a problem that is more theoretical, usually requiring a solution that is as rigorous as a proof. <q>M</q> stands for problems that are <q>medium</q>, <q>moderate</q>, <q>midway</q>, <q>mediate</q> or <q>median</q>, but never <q>mediocre.</q> Their statements could feel computational, but their solutions require a more thorough understanding of the concepts or theory, while perhaps not being as rigorous as a proof. Of course, such a tripartite division will be subject to interpretation. Otherwise, larger numerical values indicate greater perceived difficulty, with gaps allowing for the contribution of new problems from readers. Many, but not all, exercises have complete solutions. These are indicated by daggers in the PDF and print versions, with solutions available in an online supplement, while in the web version a solution is indicated by a knowl right after the problem statement. Resist the urge to peek early. Working the exercises diligently is the best way to master the material.</p>
-<p>The Archetypes are a collection of twenty-four archetypical examples. The open source lexical database, WordNet, defines an archetype as <q>something that serves as a model or a basis for making copies.</q> We employ the word in the first sense here. By carefully choosing the examples we hope to provide at least one example that is interesting and appropriate for many of the theorems and definitions, and also provide counterexamples to conjectures (and especially counterexamples to converses of theorems). Each archetype has numerous computational results which you could strive to duplicate as you encounter new definitions and theorems. There are some exercises which will guide you in this quest, though these are not comprehensive.</p>
+<p>The Archetypes are a collection of twenty-four archetypical examples. The open source lexical database, WordNet, defines an archetype as <q>something that serves as a model or a basis for making copies.</q> We employ the word in the first sense here. By carefully choosing the examples we hope to provide at least one example that is interesting and appropriate for many of the theorems and definitions, and also provide counterexamples to conjectures (and especially counterexamples to converses of theorems). Each archetype has numerous computational results which you could strive to duplicate as you encounter new definitions and theorems. There are some exercises which will help guide you in this quest.</p>
<title>To the Instructor</title>
-<p>The first half of this text (through <acroref type="chapter" acro="M" />) is basically a course in matrix algebra, though the foundation of some more advanced ideas is also being formed in these early sections (such as <acroref type="theorem" acro="NMUS" />, which presages invertible linear transformations). Vectors are presented exclusively as column vectors (not transposes of row vectors), and linear combinations are presented very early. Spans, null spaces, column spaces and row spaces are also presented early, simply as sets, saving most of their vector space properties for later, so they are familiar objects before being scrutinized carefully.</p>
+<p>The first half of this text (through <acroref type="chapter" acro="M" />) is a course in matrix algebra, though the foundation of some more advanced ideas is also being formed in these early sections (such as <acroref type="theorem" acro="NMUS" />, which presages invertible linear transformations). Vectors are presented exclusively as column vectors (not transposes of row vectors), and linear combinations are presented very early. Spans, null spaces, column spaces and row spaces are also presented early, simply as sets, saving most of their vector space properties for later, so they are familiar objects before being scrutinized carefully.</p>
<p>You cannot do everything early, so in particular matrix multiplication comes later than usual. However, with a definition built on linear combinations of column vectors, it should seem more natural than the more frequent definition using dot products of rows with columns. And this delay emphasizes that linear algebra is built upon vector addition and scalar multiplication. Of course, matrix inverses must wait for matrix multiplication, but this does not prevent nonsingular matrices from occurring sooner. Vector space properties are hinted at when vector and matrix operations are first defined, but the notion of a vector space is saved for a more axiomatic treatment later (<acroref type="chapter" acro="VS" />). Once bases and dimension have been explored in the context of vector spaces, linear transformations and their matrix representation follow. The predominant purpose of the book is the four sections of <acroref type="chapter" acro="R" />, which introduces the student to representations of vectors and matrices, change-of-basis, and orthonormal diagonalization (the spectral theorem). This final chapter pulls together all the important ideas of the previous chapters.</p>
<p>Our vector spaces use the complex numbers as the field of scalars. This avoids the fiction of complex eigenvalues being used to form scalar multiples of eigenvectors. The presence of the complex numbers in the earliest sections should not frighten students who need a review, since they will not be used heavily until much later, and <acroref type="section" acro="CNO" /> provides a quick review.</p>
-<p>Linear algebra is an ideal subject for the novice mathematics student to learn how to develop a subject precisely, with all the rigor mathematics requires. Unfortunately, much of this rigor seems to have escaped the standard calculus curriculum, so for many university students this is their first exposure to careful definitions and theorems, and the expectation that they fully understand them, to say nothing of the expectation that they become proficient in formulating their own proofs. We have tried to make this text as helpful as possible with this transition. Every definition is stated carefully, set apart from the text. Likewise, every theorem is carefully stated, and almost every one has a complete proof. Theorems usually have just one conclusion, so they can be referenced precisely later. Definitions and theorems are cataloged in order of their appearance (<miscref type="definition" text="Definitions" /> and <miscref type="theorem" text="Theorems" /> in the reference section of the book). Along the way, there are discussions of some more important ideas relating to formulating proofs (<miscref type="technique" text="Proof Techniques" />), which is partly advice and partly a primer on logic.</p>
+<p>Linear algebra is an ideal subject for the novice mathematics student to learn how to develop a subject precisely, with all the rigor mathematics requires. Unfortunately, much of this rigor seems to have escaped the standard calculus curriculum, so for many university students this is their first exposure to careful definitions and theorems, and the expectation that they fully understand them, to say nothing of the expectation that they become proficient in formulating their own proofs. We have tried to make this text as helpful as possible with this transition. Every definition is stated carefully, set apart from the text. Likewise, every theorem is carefully stated, and almost every one has a complete proof. Theorems usually have just one conclusion, so they can be referenced precisely later. Definitions and theorems are cataloged in order of their appearance (<miscref type="definition" text="Definitions" /> and <miscref type="theorem" text="Theorems" /> in the Reference chapter at the end of the book). Along the way, there are discussions of some more important ideas relating to formulating proofs (<miscref type="technique" text="Proof Techniques" />), which is partly advice and partly a primer on logic.</p>
-<p>Collecting responses to the Reading Questions prior to covering material in class will require students to learn how to read the material. Sections are designed to be covered in a fifty minute lecture. Later sections are longer, but as students become more proficient at reading the text, it is possible to survey these longer sections at the same pace. With solutions to many of the exercises, students may be given the freedom to work homework at their own pace and style (individually, in groups, with an instructor's help, etc.). To compensate and keep students from falling behind, I give an examination on each chapter.</p>
+<p>Collecting responses to the Reading Questions prior to covering material in class will require students to learn how to read the material. Sections are designed to be covered in a fifty-minute lecture. Later sections are longer, but as students become more proficient at reading the text, it is possible to survey these longer sections at the same pace. With solutions to many of the exercises, students may be given the freedom to work homework at their own pace and style (individually, in groups, with an instructor's help, etc.). To compensate and keep students from falling behind, I give an examination on each chapter.</p>
<p><miscref type="sage" text="Sage" /> is a powerful open source program for advanced mathematics. It is especially robust for linear algebra. We have included an abundance of material which will help the student (and instructor) learn how to use Sage for the study of linear algebra and how to understand linear algebra better with Sage. This material is tightly integrated with the web version of the book and will become even easier to use since the technology for interfaces to Sage continues to rapidly evolve. Sage is highly capable for mathematical research as well, and so should be a tool that students can use in subsequent courses and careers.</p>