Contact
CoCalc Logo Icon
StoreFeaturesDocsShareSupport News AboutSign UpSign In
| Download
Project: Peter's Files
Views: 437
Visibility: Unlisted (only visible to those who know the link)
Image: ubuntu1804
1
\documentclass[11]{article}
2
\usepackage{latexsym}
3
\usepackage{amsfonts}
4
5
%% Some Useful Packages
6
\usepackage{hyperref, amsmath, amsthm, pgf, latexsym, amsfonts, graphicx, enumerate, float, amssymb}
7
8
%% Useful commands-- use the syntax \newcommand{\what you want to type}{real command}
9
\newcommand{\N}{\mathbb{N}}
10
\newcommand{\Z}{\mathbb{Z}}
11
\newcommand{\R}{\mathbb{R}}
12
\newcommand{\PP}{\mathbb{P}}
13
\newcommand{\dabba}{\partial}
14
\newcommand{\e}{\epsilon}
15
\newcommand{\bs}{\blacksquare}
16
\newcommand{\lb}{\left\lbrace}
17
\newcommand{\rb}{\right\rbrace}
18
19
20
\topmargin -1in
21
\textheight 9.5in
22
\evensidemargin 0in
23
\oddsidemargin 0in
24
\textwidth 6.5in
25
\parskip .1in
26
27
\thispagestyle{empty}
28
29
\begin{document}
30
31
\hrule
32
\vspace{.2cm}
33
34
{\Large \noindent Math 212\hfill Common Errors in Homework \# 3}
35
36
\vspace{.3cm}
37
\hrule
38
39
\begin{enumerate}
40
\item Unnecessary notation is distracting. A common example of this is introducing variables such as $A$ and $\vec{b}$ or $\vec{x}$ to label matrices and vectors when it is not needed.
41
\item If you are attempting to prove the equivalence of two expressions, do not start with the equality that you are trying to prove. Instead, begin with one side and write a chain of equalities that ends with the other side.
42
\item Write complete sentences. Everything you write should be able to be read from top to bottom. Equations are sentences too, so make sure to use punctuation properly! Don't use symbols like $\therefore$ or $\to$ (which is not the same as $\implies$, and should not be used to direct a reader's attention) in a sentence mostly words.
43
\item Do not turn in rough drafts! Check your work and write your solutions neatly and clearly before turning them in. Make sure that every word or symbol you put on the paper is necessary. Do NOT include work that you did to think through the problem unless it is necessary to the solution.
44
\item If it is possible to prove or explain something without using a contradiction technique, it is better to avoid doing so. That being said, if you are trying to \textit{disprove} something, it is usually simplest to provide a counterexample.
45
\item Quantify variables that you are using for your proofs in the proper place. For example, ``for all $b\in\R,\ 0\neq b$'' is not equivalent to ``$0\neq b$ for all $b\in\R$.''
46
\item If a system has a free variable, this does not imply that the system has infinitely many solutions.
47
\item \textit{Matrices} don't have solutions: \textit{systems} do.
48
\item Do not confuse sets and matrices: $$\begin{bmatrix}a& b& c\end{bmatrix}\neq \{a,b,c\}.$$
49
\item When writing the components of a \textit{vector}, they themselves are not also vectors, they are scalars, so do not have vector arrows above them. For example, $$\begin{bmatrix}\vec{a}&\vec{b}&\vec{c}\end{bmatrix}$$ is a matrix whose columns are the vectors $\vec{a}$, $\vec{b}$, and $\vec{c}$, while
50
$$\begin{bmatrix}a&b&c\end{bmatrix}$$ is a matrix whose three entries are scalars. Write $\vec{a}$ for a vector (include the arrow).
51
\item Doing row reductions horizontally is better organizationally, and remember to put the row operations above the similar symbol between matrices like this: $\overset{R_1\to R_1+R_2}{\sim}$.
52
\item When writing down an arbitrary matrix, do not change the letter of the entries. Instead, use two subscripts. For example, write, $$\begin{bmatrix}\vec{a}_{1}&\vec{a}_{2}&\dots&\vec{a}_{n}\end{bmatrix}=\begin{bmatrix}a_{1,1}&a_{2,1}&\dots&a_{n,1}\\ a_{1,2}&a_{2,2}&\dots&a_{n,2}\\ \vdots&\vdots& & \vdots\\ a_{1,m}&a_{2,m}&\dots&a_{n,m}\end{bmatrix}.$$
53
\item Cite theorems with proper references to chapters. For example, everyone's favorite, Theorem 4 from Chapter 1 can be written Theorem 1.4.
54
\item Do not start talking about a matrix for a transformation before you have noted that one even exists. Also not confuse the matrix for a transformation with the function iteslf. For example, do not say ``the transformation $T$ has $n$ pivots'' or ``$A$ maps from $\R^m$ to $\R^n$.''
55
\item Sets of vectors or columns (or rows) of a matrix can be linearly (in)dependent, not matrices themselves.
56
\item Do not use the word `it' unless you are 100\% sure that it is clear what \textit{it} is referring to. It is best practice to eliminate `it' (and other words like `it') from your proofs.
57
\item $\R^n=\{(x_1,x_2,\dots,x_n)\ : \ x_1,x_2,\dots,x_n\in\R\}$ is the set of all ordered tuples of $n$ real numbers, not $R^n$.
58
\item The word multiplied can take on many different meanings, so be clear in what sense you are using it. For example, to say that you ``multiply a row of $A$ and a column of $B$'' is vague.
59
\item If transformation $T$ is linear, then $T(\vec{0})=\vec{0}$. The converse of this statement, if $T(\vec{0})=\vec{0}$, then $T$ is linear, is false. That is, it is not true for all transformations $T$ that $T(\vec{0})=\vec{0}$ implies that $T$ is linear. There are plenty of non-linear transformations that send 0 to 0.
60
\item Don't do this: ``Write $I_n=\begin{bmatrix}I_1&I_2&\dots&I_n\end{bmatrix}$.'' This would imply that $I_n$ is somehow recursively defined. You mean to write $$I_n=\begin{bmatrix}e_1&e_2&\dots&e_n\end{bmatrix}=\begin{bmatrix}1&0&0&\dots&0\\0&1&0&\dots&0\\0&0&1& & 0\\ \vdots &\vdots& & \ddots &\vdots\\ 0 & 0 & 0 & \dots & 1\end{bmatrix}.$$
61
\item Never draw $\dots$ where it is unclear what it means. For example, you can write $(1,0,\dots,0)$ for $(1,0,0,0,0,0,0,0,0)$, but not $(1,0,1,\dots,0)$ for $(1,0,1,0,0,0,0,0,0)$. Usually dots can be drawn when there is some arithmetic progression that is very obvious like $(1,2,3,4,\dots,104)$, or between entries that are identical like $(1,0,1,\dots,0)$ for $(1,0,1,0,0,0,0,0,0)$.
62
Always justify answers unless it is specifically stated not to do so.
63
\end{enumerate}
64
65
66
\end{document}
67
68
69
70
71
% \item A matrix-vector product is written $$\begin{bmatrix}a_1&a_2\\ a_3&a_4\end{bmatrix}\begin{bmatrix}x_1\\ x_2\end{bmatrix}=\begin{bmatrix}b_1\\ b_2\end{bmatrix} \ \ \ \ \ \ \text{not} \ \ \ \ \ \ \begin{bmatrix}a_1&a_2\\ a_3&a_4\end{bmatrix}\times\begin{bmatrix}x_1\\ x_2\end{bmatrix}=\begin{bmatrix}b_1\\ b_2\end{bmatrix}.$$
72
% \item The word `assume' is not used in place of `let' or `write'. If you are proving something about an arbitrary vector $\vec{u}\in\R^n$, you may say,
73
74
% $$\text{let } \vec{u}=\begin{bmatrix}u_1\\\vdots\\ u_n\end{bmatrix}\ \ \ \ \ \ \text{or}\ \ \ \ \ \ \text{write } \vec{u}=\begin{bmatrix}u_1\\\vdots\\ u_n\end{bmatrix}.$$
75
% \item It is \textbf{not} generally true that for all $a,b\in\R$ and all $\vec{x},\vec{y}\in\R^n$, $$a\vec{x}+b\vec{y}=0 \implies a=0 \text{ and }b=0.$$
76
% \item It is possible that a linearly dependent set of vectors in $\R^n$ spans $\R^n$.
77