Two-Factor Authentication
by djmathman, Feb 19, 2017, 3:49 AM
So recently CMU asked us (or at least all faculty and student employees) to switch over to a 2fa login system, which basically means that we need to have our phones with us to log in for security purposes
unfortunately my parents did not realize this, and so now I am temporarily blocked from my CMU account due to excessive login attempts
RIP
Solution
unfortunately my parents did not realize this, and so now I am temporarily blocked from my CMU account due to excessive login attempts
RIP
21-238 Math Studies Algebra II Homework 2 Problem 5 wrote:
(a) Suppose that
is a commutative ring with
and that
is a nonzero
-module such that for all
and
, we have that
if and only if
or
. Show that
is an integral domain.
(b) Suppose that
and
are as in part (a), and that
is an
-module homomorphism. Suppose also that we have a set
and an injection
such that for all
,
. Show that
is
-linearly independent.










(b) Suppose that










Solution
Part (a)
Part (b)
Suppose
for
. Remark that since
is given to be a nonzero module, there must exist some
with
. Now
so either
or
. Hence
implies either
or
, and so
is an integral domain.





![\[0 = (ab) \cdot x = a\cdot (b\cdot x),\]](http://latex.artofproblemsolving.com/f/f/7/ff762bf0cf62cc076d4dcc7f15eb9916aabc9e04.png)






Part (b)
Note that
generates
practically by definition. It suffices to show that
freely generates
. To do this, it suffices to show that for any
,
, and
, we have
To do this, we will use induction on
. For the base case of
, we have
; from the previous problem and the fact that
, we obtain
. Now suppose the result holds true for some
, and consider
and
such that
. WLOG assume
. Note that
Additionally, since
is a
-module homomorphism, we have
, so
Combining both of these observations yields that
Note that in fact the
term goes away, since
. Thus, this is a linear combination of
elements of
which equals zero, so by the inductive hypothesis, we have
for all
. From the fact that
is an ID, we have either
or
. But recall that since
is an injection, the latter case cannot occur. Hence
for all
, and now running reasoning similar to that from the base case yields
as well. By induction, we're done.







![\[\sum_{j=0}^{k-1}r_j\cdot x_j = 0\quad\implies\quad r_j = 0\text{ for all }j.\]](http://latex.artofproblemsolving.com/1/a/7/1a79a5eef7a47512a740d71387bbb2b53736690e.png)










![\[0 = f(x_0)\cdot 0 = f(x_0)\cdot\sum_{j=0}^k(r_j\cdot x_j) = \sum_{j=0}^kf(x_0)\cdot(r_j\cdot x_j) = \sum_{j=0}^k(f(x_0)r_j)\cdot x_j.\]](http://latex.artofproblemsolving.com/c/f/c/cfc78021e2027ad496b505641d3104c6c5c1a333.png)




![\[\sum_{j=0}^k(f(x_0)r_j)\cdot x_j = \sum_{j=0}^k(r_jf(x_j))\cdot x_j\quad\implies\quad \sum_{j=0}^k\left[r_j(f(x_0) - f(x_j))\right]\cdot x_j = 0.\]](http://latex.artofproblemsolving.com/f/6/1/f6119f6502700f1ecc6c5aa96a4dc862efc2a060.png)













This post has been edited 2 times. Last edited by djmathman, Feb 19, 2017, 4:09 AM