Having learned about separable polynomials today in class, I tried to do the following exercise concerning separable polynomials, namely:
Suppose $f$ is the minimal polynomial of $a$ over a field $F$ of prime characteristic. Let $K = F[a]$. Then $f$ is separable iff $F[a^p] = K$.
Now one di...
@ymar you can assume right from the start that your vectors are multiples of the standard generators for which both the implications seem obvious. If they are linearly (in)dependent over $\mathbb{Z}$ then they are linearly (in)dependent over $\mathbb{Q}$.
@ymar That's what the Smith normal form tells you: let $A$ be the matrix having the vectors you're interested in as entries. Smith's algorithm gives you invertible $S$ and $T$ such that $SAT$ is diagonal.
i'm saying a linear combination of arbitrary vectors can be considered as a (different) linear combination of the $e_i$ so we may as well consider those from the get-go
Prove: If $\rm X=SAT$ with $\rm S,T$ invertible, then $\rm \exists v: Xv=0 \iff \exists w:Aw=0$. Use smith normal form and invoke this equivalence - this is the approach t.b. suggested. What's not to like about this?
Because they were even more incapable of typesetting than of getting an argument straight. Focusing on the LaTeX bit distracted attention from the more important part. Both in the write-up as well as in the grading.
A novice was trying to fix a broken Lisp machine by turning the power off and on. Knight, seeing what the student was doing, spoke sternly: "You cannot fix a machine by just power-cycling it with no understanding of what is going wrong." Knight turned the machine off and on. The machine worked.
Re: your comment on the Kleiman reference request: I think the reason simply is that G.'s articles rely on the others, so they had to include them to make the articles comprehensible.