-
Notifications
You must be signed in to change notification settings - Fork 5
/
overview.html
129 lines (129 loc) · 18.2 KB
/
overview.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
<!DOCTYPE html>
<!--********************************************-->
<!--* Generated from PreTeXt source *-->
<!--* *-->
<!--* https://pretextbook.org *-->
<!--* *-->
<!--********************************************-->
<html lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>Sage and Linear Algebra Worksheets</title>
<meta name="Keywords" content="Authored in PreTeXt">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
inlineMath: [['\\(','\\)']]
},
asciimath2jax: {
ignoreClass: ".*",
processClass: "has_am"
},
jax: ["input/AsciiMath"],
extensions: ["asciimath2jax.js"],
TeX: {
extensions: ["extpfeil.js", "autobold.js", "https://pretextbook.org/js/lib/mathjaxknowl.js", "AMScd.js", ],
// scrolling to fragment identifiers is controlled by other Javascript
positionToHash: false,
equationNumbers: { autoNumber: "none", useLabelIds: true, },
TagSide: "right",
TagIndent: ".8em",
},
// HTML-CSS output Jax to be dropped for MathJax 3.0
"HTML-CSS": {
scale: 88,
mtextFontInherit: true,
},
CommonHTML: {
scale: 88,
mtextFontInherit: true,
},
});
</script><script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js?config=TeX-AMS_CHTML-full"></script><script xmlns:svg="http://www.w3.org/2000/svg" src="https://pretextbook.org/js/lib/jquery.min.js"></script><script xmlns:svg="http://www.w3.org/2000/svg" src="https://pretextbook.org/js/lib/jquery.sticky.js"></script><script xmlns:svg="http://www.w3.org/2000/svg" src="https://pretextbook.org/js/lib/jquery.espy.min.js"></script><script xmlns:svg="http://www.w3.org/2000/svg" src="https://pretextbook.org/js/0.13/pretext.js"></script><script xmlns:svg="http://www.w3.org/2000/svg" src="https://pretextbook.org/js/0.13/pretext_add_on.js"></script><script xmlns:svg="http://www.w3.org/2000/svg" src="https://pretextbook.org/js/lib/knowl.js"></script><!--knowl.js code controls Sage Cells within knowls--><script xmlns:svg="http://www.w3.org/2000/svg">sagecellEvalName='Evaluate (Sage)';
</script><link xmlns:svg="http://www.w3.org/2000/svg" href="https://fonts.googleapis.com/css?family=Open+Sans:400,400italic,600,600italic" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://fonts.googleapis.com/css?family=Inconsolata:400,700&subset=latin,latin-ext" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://pretextbook.org/css/0.31/pretext.css" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://pretextbook.org/css/0.31/pretext_add_on.css" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://pretextbook.org/css/0.31/banner_default.css" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://pretextbook.org/css/0.31/toc_default.css" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://pretextbook.org/css/0.31/knowls_default.css" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://pretextbook.org/css/0.31/style_default.css" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://pretextbook.org/css/0.31/colors_default.css" rel="stylesheet" type="text/css">
<link xmlns:svg="http://www.w3.org/2000/svg" href="https://pretextbook.org/css/0.31/setcolors.css" rel="stylesheet" type="text/css">
<!-- 2019-10-12: Temporary - CSS file for experiments with styling --><link xmlns:svg="http://www.w3.org/2000/svg" href="developer.css" rel="stylesheet" type="text/css">
</head>
<body class="mathbook-article">
<a class="assistive" href="#content">Skip to main content</a><div xmlns:svg="http://www.w3.org/2000/svg" id="latex-macros" class="hidden-content" style="display:none">\(
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\)</div>
<header id="masthead" class="smallbuttons"><div class="banner"><div class="container">
<a id="logo-link" href=""></a><div class="title-container">
<h1 class="heading"><a href="overview.html"><span class="title">Sage and Linear Algebra Worksheets:</span> <span class="subtitle">Overview</span></a></h1>
<p class="byline">Robert Beezer</p>
</div>
</div></div>
<nav xmlns:svg="http://www.w3.org/2000/svg" id="primary-navbar" class="navbar"><div class="container">
<div class="navbar-top-buttons">
<button class="sidebar-left-toggle-button button active" aria-label="Show or hide table of contents sidebar">Contents</button><div class="tree-nav toolbar toolbar-divisor-3"><span class="threebuttons"><span id="previousbutton" class="previous-button button toolbar-item disabled">Prev</span><span id="upbutton" class="up-button button disabled toolbar-item">Up</span><span id="nextbutton" class="next-button button toolbar-item disabled">Next</span></span></div>
</div>
<div class="navbar-bottom-buttons toolbar toolbar-divisor-4">
<button class="sidebar-left-toggle-button button toolbar-item active">Contents</button><span class="previous-button button toolbar-item disabled">Prev</span><span class="up-button button disabled toolbar-item">Up</span><span class="next-button button toolbar-item disabled">Next</span>
</div>
</div></nav></header><div class="page">
<div xmlns:svg="http://www.w3.org/2000/svg" id="sidebar-left" class="sidebar" role="navigation"><div class="sidebar-content">
<nav id="toc"><ul></ul></nav><div class="extras"><nav><a class="mathbook-link" href="https://pretextbook.org">Authored in PreTeXt</a><a href="https://www.mathjax.org"><img title="Powered by MathJax" src="https://www.mathjax.org/badge/badge.gif" alt="Powered by MathJax"></a></nav></div>
</div></div>
<main class="main"><div id="content" class="pretext-content"><section xmlns:svg="http://www.w3.org/2000/svg" class="article" id="overview"><section class="frontmatter" id="frontmatter-1"><h2 class="heading">
<span class="title">Sage and Linear Algebra Worksheets:</span> <span class="subtitle">Overview</span>
</h2>
<div class="author">
<div class="author-name">Robert Beezer</div>
<div class="author-info">Department of Mathematics and Computer Science<br>University of Puget Sound</div>
</div>
<div class="date">Spring 2021</div></section><article class="paragraphs" id="paragraphs-1"><h5 class="heading"><span class="title">Introduction.</span></h5>
<p id="p-1">This is an overview, and Table of Contents, for the worksheets distributed here. This work is licensed under a <a class="external" href="https://creativecommons.org/licenses/by-sa/4.0/" target="_blank">Creative Commons Attribution-ShareAlike 4.0 International License</a></p>.</article><article class="paragraphs" id="paragraphs-2"><h5 class="heading"><span class="title">Section RREF: Reduced Row-Echelon Form.</span></h5>
<p id="p-2">Construct two matrices, learning Sage syntax. Row-reduce each.</p>
<p id="p-3">Short: 5-10 minutes, 2 exercises. [<a class="external" href="RREF/RREF.html" target="_blank">HTML</a>] [<a class="external" href="RREF/RREF.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-3"><h5 class="heading"><span class="title">Section NM: Reduced Row-Echelon Form.</span></h5>
<p id="p-4">Demonstrate Definition NM, Theorem NMRRI, Definition NSM, Theorem NMUS. Experiment with random vectors of constants. Foreshadow the column space of a matrix. Preliminary work with vector spaces (membership).</p>
<p id="p-5">Medium to Long: 20 minutes, 6 exercises. [<a class="external" href="NM/NM.html" target="_blank">HTML</a>] [<a class="external" href="NM/NM.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-4"><h5 class="heading"><span class="title">Section SS: Spanning Sets.</span></h5>
<p id="p-6">For Section LC, I illustrate Theorem VFSLS by writing the row-reduced version of an augmented matrix with white chalk for the pivot columns (first columns of an identity matrix), white chalk for the zero rows, and then different colors for each of the remaining columns. Then the vectors that describe the solution get the same numbers, or their negatives, in the same colors. But first I place the “pattern of zeros and ones” in place in white. Part of the entries in white is that they are known from just knowledge of the sets \(D\) and \(F\text{.}\) This example gets recycled in this Sage worksheet on the following day. This is similar to Example VFSAI.</p>
<p id="p-7">Null spaces, spans and membership round out the topics. There is some foreshadowing of bases for subspaces.</p>
<p id="p-8">Medium: 15 minutes, 2 exercises. [<a class="external" href="SS/SS.html" target="_blank">HTML</a>] [<a class="external" href="SS/SS.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-5"><h5 class="heading"><span class="title">Section MISLE: Matrix Inverses and Systems of Linear Equations.</span></h5>
<p id="p-9">A computational illustration of Theorem CINM and its proof. A nonsingular matrix versus a singular matrix.</p>
<p id="p-10">Medium: 15 minutes, 4 exercises. [<a class="external" href="MISLE/MISLE.html" target="_blank">HTML</a>] [<a class="external" href="MISLE/MISLE.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-6"><h5 class="heading"><span class="title">Section CRS: Column and Row Space.</span></h5>
<p id="p-11">A detailed demonstration of Theorem CSCS, in both directions. You could do this quickly, or you could linger a while and drive the point home.</p>
<p id="p-12">Short to Medium: 10 minutes, 2 exercises. [<a class="external" href="CRS/CRS.html" target="_blank">HTML</a>] [<a class="external" href="CRS/CRS.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-7"><h5 class="heading"><span class="title">Section FS: Four Subspaces.</span></h5>
<p id="p-13">Computations of all the constituent matrices of extended echelon form, and exercises exploring the matrices \(J\) and \(L\) for an \(8\times 10\) matrix.</p>
<p id="p-14">Medium: 15 minutes, 2 exercises. [<a class="external" href="FS/FS.html" target="_blank">HTML</a>] [<a class="external" href="FS/FS.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-8"><h5 class="heading"><span class="title">Section B: Bases.</span></h5>
<p id="p-15">Theme: express vectors from \(\mathbb{C}^n\) as (unique) linear combinations of basis vectors. Techniques include solving systems, inverting matrices, obtaining a <dfn class="terminology">coordinatization</dfn> from Sage, and Theorem COB for an orthonormal basis. The second and fourth exercises each has several parts.</p>
<p id="p-16">Long: 20-25 minutes, 4 exercises. [<a class="external" href="B/B.html" target="_blank">HTML</a>] [<a class="external" href="B/B.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-9"><h5 class="heading"><span class="title">Section PDM: Properties of Determinants.</span></h5>
<p id="p-17">This worksheet is different from all the others. It uses elementary matrices and triangular matrices to construct the <dfn class="terminology">LU decomposition</dfn> of a \(5\times 5\) matrix. It follows the logic of a constructive proof of the existence of such a decomposition, and uses some properties of determinants as checks along the way. The conclusion discusses how to solve a linear system by first constructing an LU decomposition, then <dfn class="terminology">forward-solving</dfn> and <dfn class="terminology">back-solving</dfn> .</p>
<p id="p-18">This topic is not in the textbook, though all the prerequisites are. It is meant as a demonstration of the utility of elementary matrices and a glimpse at topics that might be part of a more advanced course.</p>
<p id="p-19">Long: 20 minutes, no exercises. [<a class="external" href="PDM/PDM.html" target="_blank">HTML</a>] [<a class="external" href="PDM/PDM.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-10"><h5 class="heading"><span class="title">Section EE: Eigenvalues and Eigenvectors.</span></h5>
<p id="p-20">Just two exercises to experiment with, but lots of other things to demonstrate. The theme of this worksheet is really just to show all the computational tools for various computations related to eigenvalues and eigenvectors that we would never want to do by hand. The later sections have some impressive examples of how fast Sage can be, for both exact and numerical linear algebra.</p>
<p id="p-21">Long: 15-20 minutes, two exercises. [<a class="external" href="EE/EE.html" target="_blank">HTML</a>] [<a class="external" href="EE/EE.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-11"><h5 class="heading"><span class="title">Section SD: Similarity and Diagonalization.</span></h5>
<p id="p-22">A similarity check, diagonalization of a diagonalizable matrix, an attempt to diagonalize a defective matrix, Jordan canonical form, and rational canonical form. The two canonical forms can be skipped, they are present just to help answer the question of what is possible for a matrix that does not diagonalize.</p>
<p id="p-23">Medium: 15 minutes, four exercises. [<a class="external" href="SD/SD.html" target="_blank">HTML</a>] [<a class="external" href="SD/SD.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-12"><h5 class="heading"><span class="title">Section LT: Linear Transformations.</span></h5>
<p id="p-24">Three ways to create linear transformations from \(\mathbb{Q}^n\) to \(\mathbb{Q}^m\text{,}\) in addition to basic queries and operations for Sage linear transformations.</p>
<p id="p-25">I do not present any of the four linear transformation worksheets in class, but instead suggest students work through them themselves, if they are interested. So they are mostly not organized with exercises.</p>
<p id="p-26">Medium: no exercises. [<a class="external" href="LT/LT.html" target="_blank">HTML</a>] [<a class="external" href="LT/LT.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-13"><h5 class="heading"><span class="title">Section ILT: Injective Linear Transformations.</span></h5>
<p id="p-27">Two linear transformations, one injective, the other non-injective. Checks on injectiveness and images, along with a demonstration of the non-injective linear transformation failing the definition.</p>
<p id="p-28">Short: no exercises. [<a class="external" href="ILT/ILT.html" target="_blank">HTML</a>] [<a class="external" href="ILT/ILT.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-14"><h5 class="heading"><span class="title">Section SLT: Surjective Linear Transformations.</span></h5>
<p id="p-29">Two linear transformations, one surjective, the other non-surjective. Checks on surjectiveness and images, along with a demonstration of the non-injective linear transformation failing the definition.</p>
<p id="p-30">Some work with preimages, including three exercises.</p>
<p id="p-31">Medium: three exercises. [<a class="external" href="SLT/SLT.html" target="_blank">HTML</a>] [<a class="external" href="SLT/SLT.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-15"><h5 class="heading"><span class="title">Section IVLT: Invertible Linear Transformations.</span></h5>
<p id="p-32">An invertible linear transformation, its inverse, and the composition of the two. Twice. There is some work with the rank and nullity of a Sage linear transformation.</p>
<p id="p-33">Medium: no exercises. [<a class="external" href="IVLT/IVLT.html" target="_blank">HTML</a>] [<a class="external" href="IVLT/IVLT.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-16"><h5 class="heading"><span class="title">Section VR: Vector Representations.</span></h5>
<p id="p-34">Two examples, one in \(\mathbb{Q}^6\text{,}\) and the other in \(P_3\text{.}\)</p>
<p id="p-35">Short, 10 minutes: no exercises. [<a class="external" href="VR/VR.html" target="_blank">HTML</a>] [<a class="external" href="VR/VR.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-17"><h5 class="heading"><span class="title">Section MR: Matrix Representations.</span></h5>
<p id="p-36">A random linear transformation from \(\mathbb{Q}^6\) to \(\mathbb{Q}^4\) is used to build a matrix representation with random bases of the domain and codomain. The first construction mirrors Definition MR, and uses it to demonstrate Theorem FTMR. The second construction is semi-automatic with the right linear transformation commands in Sage. Everthing is then in place for a sneak preview of Theorem MRCB of Section CB, so we go ahead and do the relevant computation.</p>
<p id="p-37">Medium, 15 minutes: no exercises. [<a class="external" href="MR/MR.html" target="_blank">HTML</a>] [<a class="external" href="MR/MR.pdf" target="_blank">PDF</a>]</p></article><article class="paragraphs" id="paragraphs-18"><h5 class="heading"><span class="title">Section CB: Change of Basis.</span></h5>
<p id="p-38">One random linear transformation (from \(\mathbb{Q}^3\) to \(\mathbb{Q}^7\)), four random bases, two matrix representations, and two change-of-basis matrices, all rolled into a demonstration of Theorem MRCB.</p>
<p id="p-39">Then an engineered linear transformation from \(\mathbb{Q}^8\) to \(\mathbb{Q}^8\) provides a diagonal representation with a basis of eigenvectors. Eigenvalues and eigenvectors are investigated as properties of the linear transformation (rather than as properties of a matrix). The connections to similarity and Section SD are made explicit.</p>
<p id="p-40">Medium, 20 minutes: one simple exercise. [<a class="external" href="MR/MR.html" target="_blank">HTML</a>] [<a class="external" href="MR/MR.pdf" target="_blank">PDF</a>]</p></article><section class="conclusion" id="conclusion-1"><p id="p-41">This work is Copyright 2016–2019 by Robert A. Beezer. It is licensed under a <a class="external" href="https://creativecommons.org/licenses/by-sa/4.0/" target="_blank">Creative Commons Attribution-ShareAlike 4.0 International License</a>.</p></section></section></div></main>
</div>
</body>
</html>