#groups-rings-fields
406252 messages · Page 456 of 407
thanks ann
Z_12 = Z mod 12
congratulations that's the most obtuse way to write $e^{i \pi}$ in existence
Ann:
а еще ты не в том канале постишь @mortal stream
Fk that C/d just looks stupid
если это просто мем, то #chill
если это серьезный вопрос, то в один из каналов #❓how-to-get-help
I need some guidance on these sorts of equations
I don't understand how c was solved for
Or any of them for that matter
Do you understand why the lambdas exist?
They're not eigenvalues
Ya I think they are used to denote sonething for mod 11 but I'm lost on how its solved
In this video I speak about the early life of Bartel Leendert van der Waerden, from the university to Amsterdam, over Göttingen and Groningen. This covers Martina R. Schneider's book "Zwischen zwei Disziplinen", the content from about page 70 to 120.
Here' some notes as .md...
for a relaxing Saturday evening, here's some 20's German University Life reflections
The man is most famous for this book, putting together innovations from Noether, Artin, etc.:
https://en.wikipedia.org/wiki/Moderne_Algebra
now that ive finished abstract algebra i will be retiring from this channel
thank you all for your help
you guys have been great
onto Complex Anal
Gl
I will start studying abstract algebra on 7th of January. Topic at the first course/module is rings and fields.
strange you usually do groups before rings
I don't find it too strange, dealing with one operation might be easier than dealing with 2
@fading wagon Eats, shoots, and leaves
@jade sky ??
@fading wagon I think @late sedge meant to include a period after "strange", and it seems (from your response) that you read it instead as "strange that you usually do groups before rings"
^
oh that explains it
yea exactly @jade sky
does anyone happen to know of a construction of $R$ such that $R^m\cong R^n$ and $m\neq n$ for some $m,n$?
Ariana:
Are you looking for a ring R
yea
Just take countably many infinite direct product of Z
right oops
Smh
brainlet moment
How do I show 3 isn't prime in Z[sqrt(-5)]?
define a norm?
sorry, isn't prime
try factorizing 6 in 2 ways
ok, but is there a different way? Or why did you choose 6?
6 is the easiest option /shrug
Is that sth you see after you do enough problems because of norm?
its like a really common example on why Z[sqrt(-5)] isnt a ufd
k thx
3 is irreducible isnt it?
Oh yeah I'm dumb
try playing around with f(x) = 1/x
thats not the isomorphism, but you may be able to tweak it to get the correct one @chilly ocean
and then remember that the check for f being an isomorphism (after you know its bijective) is f(a)f(b)=f(ab)
I double checked and x + 1 is an isomorphism
i might be being stupid here
but f(a)*f(b) = (a+1)*(b+1) = a + 1 + b + 1 + (a+1)(b+1)
= a + b + 2 + ab + a + b + 1
= ab + 2a + 2b + 3
whereas f(a*b) = f(a + b + ab) = a + b + ab + 1
@chilly ocean
(a+1)*(b+1) = a + 1 + b + 1 + (a+1)(b+1)
🤔
it's a bijection, you just need to show that it's a homomorphism
i.e. f(a)f(b) = f(a*b)
make sure you did your foil right
also the operation * in G is different from the multiplication operation in R* [the set of nonzero real numbers]
that's what might be confusing you
fields!:
If I have proved phi is a homomorphism, and have constructed f st f(phi(x)) = x do I need to prove f is a homomorphism separately?
what are you trying to prove in the end? it's easy to prove that f is a homomorphism
Phi is an isomorphism
i don't see why you need f for that
You need phi to be a bijection and the easiest way is to construct an inverse
so you haven't proven yet that phi is a bijection
If f the inverse of phi exists then f is a bijection
It's the quick way to show a set function is bijective
and yes, you need to prove it separately
Let's consider phi : A -> B just as a function between sets no group structure.
Let's show that a function f between sets f:B ->A exists such that f(phi(x)) = x
Then, just as a function between sets, phi is bijective
Now separately we throw away f and show phi is a homomorphism.
Because the definition of an isomorphism is a homomorphism that is also bijective as a set function, phi is an isomorphism.
wait
you didn't even show that there exists a function f
in the end, i prefer showing that phi is bijective
In my story I constructed such a set function f.
that works i guess
Thanks I needed to double check
I'm trying to solve the following. Does anybody have any hints? I'm not sure to use the hint given in the book to be honest.
I mean, sure, assuming that $1/2\in A$, we have $(y+\frac{a}{2})^2-\frac{a^2}{4}+b=(z+\frac{c}{2})^2-\frac{c^2}{4}+d$. Not sure how that helps me though.
gustavn64:
@chilly ocean f(phi(x)) = x doesn't guarentee a bijection, because it's just a one sided inverse
a left-inverse only guarentees injectivity
if you can show that phi(f(x)) = x also holds then it's a complete inverse
which guarentees bijectivity
Rigorously, how do you prove that for an integral domain $A$ and a nonzero element $f\in A$, the ring $A[f^{-1}]$ is isomorphic to $A[x]/(xf-1)$, where $x$ is an indeterminate?
gustavn64:
My guess is that I should look at the map $A[x]\to A[f^{-1}]$ which sends $x$ to $f^{-1}$, and prove that its kernel is $(xf-1)$, but this is precisely where I am stuck.
gustavn64:
You could just use the universal property of localization on $A\mapsto A[x]/(xf-1)$ to induce the unique homomorphism of the localization at f which is trivially surjective and is also easy to see that the kernel is 0
gabe:
Or galaxy brain proof is that quotienting out by xf-1 is setting it to 0 and therefore x = 1/f and by handwave we have our isomorphism
Hi i have the following question:
I want to implement a bignum program and want to do it formally correct. For that I want to declare a few algebraic structures which I am not sure if they are mathematically correct:
Let $(\mbb{Z}^{\infty}, +, \cdot)$ be the countable infinite dimensional standardmodule over the ring $(\mbb Z, +, \cdot)$ such that the following requirements are met:
$\$1: $\forall (s, v_1,...,v_n,v_{n+1},..)\in \mbb{Z}^{\infty} : v_{n+1} \neq 0 \implies v_n = 2^{64} -1\$
2: $\forall (s, v_1,...) \in \mbb{Z}^\infty : s = 1 \vee s=0 \vee s=-1\$
3: $\phi : \mbb{Z}^\infty \rightarrow \mbb Z , (s,v1,..) \mapsto s\cdot (v_i)_{i\in\mbb N \setminus {0}}$ isomorphism
The exercise in this book is asking me to prove that given a monoid A the set $A_L$ of left translations $a_L \colon x \to ax$ is the centralizer of the set of right translations (same thing but with xa) in the monoid of transformations of A but this seems flat out false? the transformation x -> $x^1, x1$, etc are not in $A_L$ but are clearly in the centralizer
hegel:
Hegels
Rip
Lol
Now it's good
@maiden ocean can you describe your transformation?
wdym
What do you mean x^1, x1
as in, the translation from x to x1
I'll ask later
Don't the left and right multiplications have the same identity?
Yeah
hegel:
Is some element in Z[n] a unit iff its norm is 1?
A unit needs to have its norm = 1 right?
Prove this
ok yeah I think I got it, cause norm of any element needs to be an integer in this ring, and if ab=1 then a and b are both units and N(1)=N(a)N(b) which menas both need to be 1
is that right?
Yes
would there be an algorithm to solve linear systems of equations over an arbitrary ring? i was thinking about when i saw a post online when someone asked if they could solve a system of linear equations where the variables and coefficients are both square matrices.
there was some stuff i saw online for solving single linear equations over arbitrary rings so i could try reading those
Gauss Jordan requires inverses
Smith normal form only requires that your ring is a PID
if you assume the matrices are nonsingular gauss jordan would still apply?
If I recall, in general there's not a ton you can do
Can def do some things, but rings are a lot less well behaved compared to fields
since
factorization
ideals
zero divisors
inverses don't exist
(or at least in general, of course)
yeah, but for the specific case of equations where the equation is over nonsingular square matrices, it seems like there should at least be some way to see if there isn't a solution. I get that it isn't a PID because 0 divisors.
I mean, I don't know a way, but that doesn't mean a way doesn't exist
There might be something online about this/some article
OR, of course, working on it some yourself in your free time
(though I have no idea how hard this would be to do, so take that with a grain of salt)
What is generally covered in an undergraduate intro (abstract) algebra course? I know the definitions for a group, ring, field, and algebra as well as their motivation and have some basic intuition for them, but I imagine that I'm nowhere close to what I would have from completing a proper course.
So basically I know I'm missing a lot, I just don't know exactly what. Is it intuition from solving lots of problems? Knowing and being comfortable with relevant theorems? General mathematical maturity?
@ivory dust how much algebra have you covered?
have you done anything like lagrange's theorem, symmetric groups, isomorphisms, homomorphisms, isomorphism theorems etc
if you feel like you need to go through a course, maybe find a course on youtube or something and go through it with whatever textbook and assignments they give
this is what's covered in cambridge's course
that would be an "upper bound" for what you would reasonably expect to cover in an intro course
Nothing really. I've just picked up on the basic definitions and intuitions since a lot of things reference them. Of what you mentioned, I know lagranges theorem, but not a proof. I know isomorphisms, and I've seen the definition of symmetry groups, but never really worked with them
Idk about homomorphisms but I imagine they're related to isomorphisms
they're isomorphisms that aren't bijective
i'd say it would be reasonable to cover the first 6 chapters in this book
https://homepages.warwick.ac.uk/~maseap/teaching/aa/aanotes.pdf these notes are also pretty fun to read through, and good if you're self teaching @ivory dust
I'm not sure yet if I'll self teach or not. I have a long list of things I want to teach myself, and it really comes down to motivation and need
as someone who has self-taught, i can recommend abstract algebra
its very satisfying to work through, and has plenty of cool results
Like I need to teach myself Java and E&M so I can test into more advanced courses in the fall
I might add Abstract algebra to the list idk. It doesn't seem that hard especially since I'm a lot more comfortable with the algebra/discrete side of math
Continuous things are scary
Idk yet
I know I really like math. Honestly I'm interested in physics for the same reason most people are: QM and relativity. I just want to learn the actual math. Idk how far I'll get though
fair
i was tempted to try and learn GR over summer, then i realised that it wasn't happening with my level of maths lmao
esp given that im doing a comp sci degree lol
GR seems terrifying given what I've heard
yep
compared with special rel which has fairly simple maths from what ive seen
GR seems like an entirely new playing field
Like special relativity just takes highschool algebra 2 and maybe a little linear
anyways, with algebra, defo have a look at the warwick notes i linked
they're very readable, and will probably give you enough of a taste to see if you want to continue with it
Yeah I added it to my long list of "math texts I should read"
👍
the other one is better if you are seriously getting into it
but worse as a taster
I downloaded both
@ivory dust even if you like discrete things more, discrete and continuous structures are very often linked, one example being the prime number theorem.
Yeah I know I need to get more comfortable with continuous things
I imagine taking both real and complex analysis next semester will help with that
i was going to try to learn about algebraic geometry, but when i started reading a free book about it, it got into the connections to differential geometry/complex analysis right away, so i realized i needed to learn about those first
or at least complex analysis
Let's move this to #math-discussion
ok
I'm trying to prove the following statement: let $f\in A:=k[x]$, where $k$ is a field, and let $B=k[x,y]/(y^2-f)$. Then $B$ is an integral domain if and only if $f$ has a square root in $A$. So this is equivalent to proving that $(y^2-f)$ is prime in $k[x,y]$ if and only if $f$ has a square root, and one direction is pretty easy: if $f$ has a square root $g\in A$, then $(y+g)(y-g)=y^2-f\in (y^2-f)$, despite none of the factors being in the ideal. But what about the other direction?
gustavn64:
One idea I have is that if $gh\in (y^2-f)$, where $g,h\in k[x][y]\subseteq k(x)[y]$, we can write $gh=p\cdot (y^2-f)$ with $p\in k[x,y]$ and then the relation $\frac{g}{p}\cdot h=y^2-f$ holds in $k(x)[y]$.
gustavn64:
But I'm not sure how to deduce a relation in $k[x,y]$ from this
gustavn64:
oops, that's not true really, it should be in $k(x,y)$
gustavn64:
$k[x,y]$ is a UFD, so $k[x,y]/(y^2 - f)$ is a domain iff $y^2 - f$ is a prime in $k[x,y]$ iff $y^2 - f$ is irreducible in $k[x,y]$. So if $k[x,y]/(y^2 - f)$ were not a domain, then $y^2 - f$ is reducible, i.e. there exists $a,b \in k[x,y]$ such that $y^2 - f = a(x,y)b(x,y)$ (so use the UFDness to kill that $p$ factor above) with $a(x,y),b(x,y)$ both non-units in $k[x,y]$. There are two choices: degree _y of $a$ = 0 and deg_y $b$ = 2 or deg_y $a$ = 1 = deg_y $b$. The former is ruled out because $y^2 - f$ has unit coefficient for $y^2$. In the latter case, say $a(x,y) = a_0(x) + a_1(x)y$ with $a_1(x) != 0$ in $k[x]$.then setting $y = -a_0 / a_1$ you have $f = (a_0/a_1)^2$, or $a_1^2 * f = a_0^2$. Use UFDness of $k[x]$ this time to deduce that $f = g^2$ for some $g \in k[x]$.
actually in the last step, the factorization has to be of the form $y^2 - f(x) = (a_0 + y)(a_1 + y)$ for some $a_0, a_1 \in k[x]$ by comparing the coefficient of $y^2$, so now set $y = -a_0$ and you obtain (-a_0)^2 - f(x) = 0$, or $f(x) = (a_0)^2$ as desired.
hochs:
Compile Error! Click the
reaction for details. (You may edit your message)
so that should be slightly quicker
I got an A in Abstract Algebra
The professor was really good
50% of the grade was hw, 25% was take home final, and 25% was midterms
I was really discouraged from taking by the department it at the beginning of semester but I'm so glad I did
I can't wait to do it 🙂
Yeah man
I still have the second sequence I'm gonna take next semester
That's gonna go over rings, fields, vector spaces, modules, and galios theory
Though I'm kinda worried for next semester because I'm taking linear algebra, abstract Algebra, and topology
Oof i guess if you study hard enough, you'll be fine
I can't wait to do all that stuff, it sounds very cool
Abstract algebra and topology are like the best undergrad classes you can take
altho it's very weird not to take linear algebra earlier than those two 🤔
depends on how ready you are to jump into abstract notions
weird but not the strangest
some people feel ready after taking discrete math and learning sets, which is technically all you need to have a background in for AA and topology
linear algebra is just nice to see that you can put structure onto things that aren't really numbers anymore
linear algebra is a nice source of examples for abstract algebra
yeah
when i learned linear algebra it was the "highest" math i knew
so i really liked it, and being able to put structure into things that aren't numbers was probably a big part of it
Yeah I could've taken linear algebra instead of abstract Algebra, but my advisor recommended that I have a better chance of getting research if I did Abstract Algebra
And by research I mean research in math
one could do abstract algebra without much lin alg
Yeah iirc you don't need any until you get to modules and vector spaces
And even then you don't need to know linear algebra as a prerequisite. You'll be learning (a more general version of) it
Having a good understanding on matrix manipulation from linear algebra would give a good mental model though.
As examples to fall back on.
Is the linear algebra covered in Abstract Algebra more about vector spaces in general rather than vectors within those spaces?
What are you thinking of when you say "about vectors within those spaces"?
Linear algebra is always about vector spaces (including subspaces and relations between them) and linear transformations between vector spaces
Like abstract Algebra would focus more on properties about vector spaces themselves, instead of focusing on things like Eigenvalues, orthogonality etc
The latter is an more or less an inseparable part of linear algebra (inasmuch as linear transformations and operators are). But I guess if you're primarily focusing on those, then it's more appropriately called matrix theory or operator theory
What did you mean when you said a more general version of linear algebra
I'd say that linear algebra is just a kind of abstract algebra. You can ask abstract algebra questions about vector spaces, linear transformations, isomorphisms, things like that and it's pretty clearly still just another flavor of abstract algebra, even though it's still a proper subject of linear algebra. But specific notions like eigenvalues and orthogonality are not going to be covered in abstract algebra, but perhaps just referenced instead.
Orthogonality requires an inner product
https://discordapp.com/channels/268882317391429632/496784958430380033/659451142614417470
Oh I was referring to this ↑
I meant you wouldn't technically need to know linear algebra beforehand in order to study modules and vector space. Modules are generalisations of vector spaces, and you'll be studying them in a different way than you would normally study linear algebra (because things are a lot simpler in the latter case). But many of results from module theory imply results you usually prove in vector spaces as well
Eigenvalues are still mentioned in abstract algebra
Modules over a PID are generally nice
Especially if finitely generated
Linear algebra is usually about solving linear systems. It is a basic tool. Abstract algebra then comes along and says, "hey... linear algebra, you are making too many assumptions! I can strip you down to a bare minimum and still get the same result!"
how lewd
😅
I'll try using that line at a bar / pub next time
Linear algebra (at the right level of generality) is just the study of abelian categories
I am sure that clears things up a lot!
The techniques you use with modules (resolutions, tensor product, hom) make sense in a general context
Hi everyone, can smb gives me a geometrical intuition for ideals in polynomials ring ? Actually, I really don't know how to deal with it, for instance I have to find a generating set for the ideal defined by {P in R[X,Y] st for all t in R, P(sin(t),cos(t)) = 0}. I have the intuition that P is cancelled on the circle, so I can consider the polynomial X²+Y²-1. But I don't know how to use it, I can look at the quotient ring R[X,Y]/(X²+Y²-1) but it isn't the circle, cl(X) and cl(Y) are coordinates for the circle but I don't see how would it be the whole circle.
a prison contained n amount of prisoners, if
2/7 of the prisoners are women
4/7 of the prisoners like the colo(u)r blue
there is 79% more men that like the colo(u)r blue then women.
can you find out how much men are in the prison.
(this question is just a joke i just made it up on the spot so it doesn't make sense)
just ignore my question if you want
since it's impossible (probably)
idk
also find out what n equals
now it's impossible
Idk why but I think that the ideal I've defined is generated by X²+Y²-1. If my quotient was the circle, I would have P=0 in this quotient, so P is in (X²+Y²-1).
But that's false, this isn't the circle x)
are you expecting an ideal of R[X,Y] to literally be a subset of R² ?
no
or a quotient ring to be a subset of R² ?
But I see R[X,Y]/(X²+Y²-1) as a ring containing reals where there's a curve like a circle
I see R[x,y]/(x²+y²-1) as the ring of algebraic functions on the circle
what's an algebraic function ?
ooh
ok
just a polynomial function defined on the circle
it's just a word I put so I could conveniently say that things like exponentials or discontinuous functions aren't algebraic functions
typically, it's ${P_{|S¹} s.t. P \in R[X,Y]}$ ?
Zak:
I suppose there are bijections between the two, yes
assuming there's a good bijection which respects algebraic equations, could I prove with this that my ideal is generated by X²+Y²-1 ?
well you have to prove that if P vanishes on the circle then it's a multiple of X²+Y²-1
that's what I'm trying to prove
by showing that the class of P is zero in R[X,Y]/(X²+Y²-1)
and you could, I dunno, pick such a P and then look at a representative of its class of the form f(x) + yg(x)
and try to prove that f and g are both 0 ?
don't you mean f(x) + yg(x,y) ?
no
oh
that wouldn't be any helpful
ok that's a good representative ok
because Y² = -X²+1
oh ok, bc we have f(sin(t)) - cos(t)g(sin(t)) = 0 for all t, we have f(sin(t))² = (1-sin(t)^2)g(sin(t))², thus f² = (1-X²)g², f and g are necessarly zero bcp (1-X²) isn't a square. I think this works. Thank you.
@wind steeple the ring you define is the ring of functions on the circle
As a subscheme of the plane
yup ok
The nullstellensatz doesnt hold over R
and if I define R[X,Y]/(X²+Y²+1) ?
The second ring is still the ring of functions on some subscheme of the plane
Plane as in R^2
Except this scheme has no R-points
idk what's a scheme x)
It should have many C-points though
if the field is algebraic closed, this is exactly function over the curve with "the field"-points ?
it is the function field of P^0. it can't be a "curve" over k because the function field of "curve" would have transcendental degree 1 over the base field
of what are you talking about ?
@wind steeple of "if the field is algebraic closed, this is exactly function over the curve with "the field"-points ?"
"this" refers to the field?
if k is the field, I refered to k[X,Y]/(X²+Y²+1) by "this"
then sure, the field of fractions of that is going to be the "function field" of the curve defined by x^2 + y^2 - 1.
x^2 + y^2 + 1
we were talking about for instance, R[X,Y]/(X²+Y²-1) which can be seen geometrically as polynomial functions on the circle. But R[X,Y]/(X²+Y²+1) has no geometrical point of view bcp there's no curves on R² defined by X²+Y²+1 = 0.
I was asking if this intuition is always present when the field is algebraic closed
why do you consider the field of fractions ?
for birational classifications.
generally speaking it's easier to classify varieties up to birational maps (defined on some open dense subsets rather than the whole thing) and that's classified by looking at the function fields or the "field of fractions" of varieties
@wind steeple : Yes, one nice feature of going to algebraic closure is that you have nice intersection theory theorems (bezout's and its generalizations). one sacrifices a bit of intuition for that (as you have noted)
uh ok thanks. I don't really know about birational classifications and all the stuff aroud that. I'll probably read more about this once I finish reading my books x)
btw $k[x,y]/(x^2 + y^2 + 1) \cong k[x,y]/(x^2 + y^2 - 1)$ for $k = \mathbb{C}$ but not for $k = \mathbb{R}$.
hochs:
What's your isomorphism ? P -> P(ix,iy) ?
You can show that any smooth conic is isomorphic to $\mathbb{P}^1$
abstract nonsense:
@wind steeple : That works, though there are other things that can work too.
Anything I should practice and get used to before dealing with algebra? I find mod addition and multiplication needs to be brushed up. Also proofs
Set theory
Set theory
Set theory
matrices, depends on your course content
Have you tried using homotopy type theory?
Edit: mb, I meant set theory @tranquil creek
Any branch of set theory? How much of the basics should I know for an introduction to groups? A list of topics in it would help.
And thankyou already, I think you guys have pointed out a great weakness I have been aware of but havnt been able to address
personally, my knowledge in set theory isn't that deep but i get alone just fine with abstract algebra
Set theory
Just the basic definitions. What defines a set. Order of a set. Bijection. May be cartesian products?
And intersections unions, equivalence classes
Although do practice on some element chasing proofs.
I think.. most of the things are simple enough to be covered in the course itself.
They are simple once understood. But for a newcomer, the shift and the mindset to settle in requires some time
thancc for support incompleteness guy
lmao
It does take time to adapt your thinking, yes. I still don't see why that cannot be done why learning group theory. It even provides a way to use those concepts from set theory.
I mean it would just make the course more obscure. Instead of trying to connect say a symmetric group with something more material for more intuition, one would be struggling with what a set is. And even if one can recite the definition of a set by heart, the set-theoretic proof techniques should be studied in their own and requires some time.
I don't think your examples really help your point, but I think I see what you want to say about proof.
I'll consider this dialogue in preparing for my upcoming course, ty
Well, I said what I did mostly because that was how I learnt group theory. I did struggle through it, but I have always just assumed it was part of the learning process.
Perhaps I would have had an easier time if there was a separate module.
Guys I need help, I think my book made a mistake in one solution: How many divisors does $z=-3\left(1-i\right)^3\left(2+i\right)\left(2-i\right)^3$ have? (Working in Z[i], these are all irreducible already, just need to find the combinations)
I got 2^7, the answer seems to be 2^8
Godel:
my solution was: divisors are all subsets of a set -3, (1-i), (1-i)^2, (2+i), (2-1), (2-1)^2 (6 elements) and then multiply by 2 (can be + or -)
multiply by 4
in Z[i], 1,-1,i and -i are invertible
your subset representation seems to work but it is not natural: hou would you do for,for instance, (1+i)^4 ?
ohhh yeah true
The good way to count divisors with the factorized form is tu factor powers : the number of divisor here is (1+1)*(3+1)*(1+1)*(3+1)*4
and (1+i)^4 doesnt divide
so it works fine
the subset representation
(1-i)^3 would be (1-i( and (1-i)^2
yes but you wouldn't do this representation if you were needed to sudy the number of divisors of (1+i)^4
And how did you get +1 in each of these terms?
you can see divisors as elements of {0,...,v3(n)}x{0,...,v(1+i)(n)}x...
bc each prime divisor of a divisor of your number is a prime factor of your number
and the power must be less than the powers of your number
yep
👍
okay what the fuck i am so confused
I assume $C_{13}$ is the cyclic group of order 13.
Intel:
But that would mean $C_{13} \cross C_{13}$ is of order 169
Intel:
which clearly does not divide $|S_{27}| = 27!$
Intel:
27 factorial is divisible by 13 exactly once, right?
13*26 = 13*13*2 divides 27!
i am, actually
why doesnt 2-2i sqrt3 have unique factorization in Z[sqrt(-3)]
obviously one way is 2(1-i sqrt3)
whats the second one
yeah its 16
only way is 4 * 4
maybe I forgot 1 case of +/- sign
but its gotta be sth +/- 1 +/- isqrt3 times the same thing
?
-(1+isqrt(3))^2
btw, if I want to show that there is unique factorization do I have to like check all the possibilites in +/- signs?
and just calculate and show only 1 of thsoe works
im asking cuz its very boring
if I want to check factorization of element x in lets say Z[i] I check its norm and find elements a,b,c,d such that x = (a +bi)(c+di) or N(x) =(a^2 +b^2)(c^2 + d^2)
and I deduce (a^2 + b^2) has to be lets say 9
that gives me few possibilities: a=3 and b=-3 , both positive etc.
there will be few cases of that
yea you prob have to check al of them
yeah thats what I was thinking, I remember reading some properties but that worked only in gaussian integers, but in any ring probly need to calculate all
I thnik nobody will never ask you to check taht
And if I find 2 of those factorizations this way would need to check if they are conjugated or whatver the word in eglish for it is
it's very annoying
I would only recall that if N(x) is prime then x is irreductible and x in invertible iff N(x)=1
it's works in all rings
in all number rings
uh maybe you didn't study number rings yet
OK what if we had 40+40i how many divisors does it have in Z[i]
if Im notmistaken its factorization is (2-i)(2+i)(1+i)* 2^3
answer is 112
2^3 can be reduced further
but its (1-i)^3 (1+i)^4 (2-i)(2+i)
just noticed (1+i)= i(1-i) but still not sure how they got 112
Has anyone in here by any chance a physical softcover copy of Eisenbud’s commutative algebra book
It’s sale on springer so I can get the softcover for like 10$ to accompany A&M but I heard that the softcover binding for it is terrible as the book is so thick
Does anyone in here have any experience with that?
i'd figure as long as you're careful with it, it shouldn't tear apart, though a crease in the binding is probably unavoidable
So I'm trying to prove that if G1 and G2 are simple groups and G is a proper normal subgroup of G1 x G2, G is isomorphic to G1 or G2
i feel pretty lost
my first intuition was projective map or something but :/
consider {h : (h, g2) in G for some g2 in G2} @maiden ocean
oh wait that's probably projective map
it would make sense for it to be at least
yea
coolcool
also i just checked our mutual servers and we have the same first name 
lol nice
had to check that was a server where it was my actual first name but it is
oh wait hmm the problem statement is slightly wrong
G also needs to be non-trivial
first name doxed
it doesn't count if you go to uni with me smh
i definitely do not go to uni with you 
you successfully both got wooshed

I knew what you actually meant :^)
my detection is getting dull sorry
yes that is a word
no its not
gustavn64:
Which page does Dummit and Foote introduce index, I've been looking for 15 mins
i think it's in chapter 3 section 2
Does an isomorphism between $(\mbb{Z}^2,+)$ and $(\mbb Z, +)$ exist?
N/𝔄:
I know a bijection exists since $\mbb Z\sim\mbb N\sim\mbb{N}^2\sim\mbb{Z}^2$
N/𝔄:
Z is cyclic, Z² is not. There's no iso between them
Alternatively if you tensor both with Q, they they are not isomorphic as vector spaces @chilly ocean
That would make them a module, would it not?
Sorry I'm quite unsure about the word tensor, maybe it's an english thing
Or my course isn't this far yet
@chilly ocean
In mathematics, the tensor product V ⊗ W of two vector spaces V and W (over the same field) is itself a vector space, endowed with the operation of bilinear composition, denoted by ⊗, from ordered pairs in the Cartesian product V × W onto V ⊗ W in a way that generalize...
It's a bit of abstract nonsense, so the username before is quite applicable.
Wow an understandable explanation from wikipedia
Usually I just skip down to the definition section, but to each their own.
Under abstract tensor product?
yes.
So what does "tensor both with Q" mean?
Q as a vector space over Q?
Also since Z is a ring that would make it a module over Z
Or a group with addition
Z, Q, and Z \otimes Q all satisfy the axioms of many algebraic structures. We usually focus on the highest structure they satisfy and call them that.
Which one?
They are all vector spaces over Q.
Yeah. I don't actually know a nice argument about those two vector spaces to show they are different, I personally like the cyclic (generated by a single element) argument better.
Hmm it can probably be shown that they have a basis of differing cardinality
But thanks for your time
The arguments in this case for Z modules and Q modules are the same
Tensoring with Q doesn't make it easier or harder
I meant take Z \otimes Q and Z^2 \otimes Q as vector spaces
Over Q
They have different dimension
Alternatively you can find an endomorphism of Z^2 that is not multiplication by a scalar
Z and Z^2 have different rank as Z modules
Did you end up buying any book @bleak abyss? In that case, which one? 
Fulton and Harris
Fulton is the book qbout algebraic curves?
Or sorry
Are they coauthors?
Which book?
Nevermind, it is the representation theory book I guess 
if i have a polynomial ring what are the conditions on the evaluation map p(x) such that it's 1-1
It has to be surjective and injective
@chilly ocean lol wut
You gotta say a little more about the evaluation map. \phi: R \times \mathbb{R} \rightarrow \mathbb{R} ? this is the normal evaluation. My guess is that you're asking about \phi_{p(x)} : \mathbb{R} \rightarrow \mathbb{R}. I suppose you want some statement like, "all the coefficients of p(x) are positive." You should think about how it can fail to be 1-1 (for instance x^2), and how to avoid that circumstance.
Just trying to get second opinions, but how is the harvard course on abstract algebra from the 2000s?
Pretty good
e🅱️ ic
https://discordapp.com/channels/268882317391429632/576511723574525962/660200016606003231
anyone have any clue if theres some alternative instead evaluating trashy binoms
this doesn't look like AA, unless those are commutators
wait how does this work multiplying numbers by a and b
are a, b matrices?
a and b are arbitrary elements
oops forgot to mention, yes they are commutators, [a,b]=ab-ba
what arbitrary elements? Do you use a pair (number, group element)?
can I just treat them like matrices?
ah prob wasnt clear a,b are 2 elements of a ring
which ring, any ring?
yup
noncommutative ring huh
$a^{(0)}=a, a^{(1)}=ab-ba, a^{(2)}=(ab-ba)b-b(ab-ba)=abb-bab-bab+bba$
Element118:
hmm, all these expressions are $b^xab^y$
Element118:
okay so that's where all of that is coming from
$a^{(k)}=\sum_{i=0}^{i=k}{k \choose i}(-1)^ib^iab^{k-i}$
Element118:
I guess? { x²∈ℤₚ : x∈ℤₚ } would be well-defined, and you can remove the zero if you want. I am probably missing the point of your question. Are you looking for quadratic residues?
yes
I know there will be (p-1)/2 of them
and if k is one then p-k too, are there any other interesting properties that help me find them?
Closed under product. Legendre symbols might be of interest.
I believe the squares form a subgroup themselves
yeah @coarse storm im trying to study legendre stuff actually thats why im asking
I don't really see an actual question 😅
"Is there an explicit way to write the squares?"
No. But there's a lot of tips that help
Oh sorry, I sort of ignored that one, because... well, I felt it was a little broad.
mb
Still a very good question under research
Like, I'm reading this old intro NT books and its so cool. Wrote in like 1940s, there's a lot of elementary approach, a lot of interesting results that are quite elementary to prove as well
And in my NT class we use a lot of group theory to get some results which is sometimes confusing for me as I'm pretty bad at it
And book's at times funny, cuz many things hes talking about being unproven are in fact now proven. And the biggest prime number known at the time was like 2^3000 or sth
Fermat's last theorem I'm sure gets a mention somewhere
yep, being unproven for few hundred yrs
My advice is get better at group theory lol. Elementary number theory can be better learned as abelian group theory instead
Because there's nothing special about the integers at this level
I mean, I know the basics, but like it gets hard to compute and remember all the facts from group theory. fortunately most of the ones we use are just some trivial facts
'Because there's nothing special about the integers at this level' what do you mean
There's a lot of interesting things you can prove without using group theory
We are looking elementary abelian groups. So they are by definition elementary group theory~!
A bad pun to start the decade!
I've seen that one but it's not the kind of question I'm looking for
it is related to group theory but it's not very group theoretic if you know what I mean
Why can $k[X,Y]/(XY)$ be considered as a subring of $k[X]\times k[Y]$? Here's exercise 1.3:
gustavn64:
It's not
The exercise asks you to prove that every element has a representative of the given form (easy, just wipe out all mixed monomials)
Maybe this is a soft question, but is it considered "more standard" if we define a ring as already having unital multiplication? I first read about rings as being only semigroups multiplicatively, but the wiki page states a ring as being defined with unity.
no, not even the ring of even integers would satisfy that standard
idk maybe I actually do implicitly use that standard you describe now that you mention it, I would just call this an ideal and not a ring, meh idk it's not important to me I guess
@clear obsidian it’s a mess. I’ve seen “unitary ring” for people that think a ring doesn’t need one and are specifying, I’ve seen “rng” for people that think a ring does need one and want to name the other thing
I think it depends on the field/area you are studying, department convention, or the lecturer's area of research if you are in a course. Same question can also come up for commutativity.
non-associative rings are a thing apparently
i have literally never seen associativity dropped in a ring
just use a magma or some shit
or a near-ring, whatever the equivalent is for rings
So long as you're consistent and your convention is clear it's fine imo
but if you drop associativity i'm going to throw you into the p i t
yes
I have this problem about ideals in gaussian integers: Given two elements a,b in Z[i] check if aZ[i] + bZ[i] is a maximal ideal. My question is whats the usual strategy to solve these kind of problems?
I was thinking, but not sure if this is true, that this ideal is isomorphic to GCD(a,b)Z[i], maybe then it would be easier for me, but not sure if thats true
maybe that works only in PIDs?
Z[i] is a PID
I know, just asking if my reasoning works
and what would be needed for that to work
or if theres another approach
it works
(my idea was to write is as one ideal and check if Z/gcdZ is a field, not sure if thats the easiest approach)
you could also use that an ideal $(d) \subset \mathbb Z[i]$ is maximal iff $(d)$ is prime and not zero iff $d$ is a prime element, and there is a pretty easy characterization of the primes of $\mathbb Z[i]$
killer_memestar:
ok I got gcd of those 2 ideals is (2+i)
gcd works for gcd domains
which is stronger than PID
and slightly weaker than euclidean
yep
good to see you sir
I have to show that if d is not a square and a+b*sqrt{d} is irreducible in Z[sqrt{d}] then so is a - b*sqrt{d}
any hint?
Prove the contrapositive
What do elements of Z[sqrt(d)] look like
(a+b *sqrt(d))
for a and b integers
ok I think I got it but not sure, I'll latex it
$x- y \sqrt{g} = \left(a + b \sqrt{g}\right) \left(c + d \sqrt{g} \right) \implies ac +bdg = x, bc + ad = -y \implies x + y\sqrt{g} = \left(-a + b \sqrt{g}\right)\left(-c + d \sqrt{g}\right)$
Godel:
but idk there's probably a better way
How do I calculate the inner automorphisms of a group
you conjugate group elements
That gives me the number of possible inner isomorphisms, but a few of those will be the same.
idk what you mean, you have a fixed element, call it a, and to calculate the inner automorhpism you just do a^-1 x a for all x in G right
Listing all functions of the form g^{-1}xg (there are |G| such functions) might give functions that are defined by distinct g's but nonetheless are the same.
Oh wait I know what you're saying now
no wait I misunderstood your question I think, dont listen to me
is $I = 3i \mathbb Z \left[i\right]$ a prime ideal?
Godel:
in Z[i] ofc
Like I tried to show Z[i]/3i is field/integral domain but not sure how
maybe theres a different way
Think about 3 * i in Z[I]/3i
3i = 3*i
3i is 0 in this ring
I don't know how to describe cosets of this
maybe then I would be able to find an isomorphism
like I thought that its isomorphic to Z/3Z but I have a feeling it was a faulty logic
@mild laurel the issue is 3 = 3i(-i)
But there is something to note here, namely that the ideal generated by 3i is the ideal generated by 3
So this ring is just Z[i]/(3). But Z[i] is Z[x]/(x^2+1)
So Z[i]/(3) = Z[x]/(3,x^2+1) = (Z/3[x])/(x^2+1)
So now you just need to find out whether x^2 + 1 is irreducible mod 3 or not. Turns out it is
Just check that 0, 1, and 2 aren't roots
So actually this ideal is prime, in fact maximal
(To be fair in Z[i] all non-zero prime ideals are maximal)
The quotient is gonna be a finite field of order 9
@chilly ocean
So Z[i]/(3) = Z[x]/(3,x^2+1) = (Z/3[x])/(x^2+1) - can u explain how are those true?
is this just some iso theorems?
I dont see it quite yet, but thx
Godel you can reason about them even without high level theorems
Its like relations and generators are important
Well okay I don't really believe in coset reps
But the coeffs cant be multiples of 3!
So your choices for coeff are 0,1,2
But thats just the polynomial ring over Z/3
Come up with a map outta Z[x] such that 3 and x^2 + 1 are in the kernel
they even cant be multiples of 3
Yeah thats my point
Lmao
Youre secretly working mod 3
You got factorial'd Max
ok I think I see it now, I'll try to formalize tomorrow
anyways thanks for help guys
Polynomials rings are so cute
Yeah whoops my bad
V fun ti work with
Tru
yeah I like rings
They feel like, really nice, all of their data is very explicit
And they represent cool stuff
Dem universal properties doe
Whooo dont get me started
But yeah actually speaking of cosets
I prob mentioned this here before
But in my algebra class in office hours
Someone had a proof of CRT
Which was super explicit on cosets
But it worked
And my prof was like holy shit
We had it as a pset problem and we were meant to do it the usual way
R->(R/I)\times (R/J)
I\cap J is in the kernel
But the way it was written was backwards, I guess to provide a slight mental roadblock or something
And the guy was like okay
I'm gonna map (x+I,y+J)
To their intersection
As sets
And I will never get over that for the rest of my life
Yee
I mean, sometimes I go way more explicit than necessary
like i just quickly tried to throw down CRT and i took up like ~1/3 of a page
*also looked up what the actual statement was because i'm a brainlet :^)
took me way too long and too much looking at the original integer version tbh I gotta step it up
Lol not knowing a statement doesn't make you a brainlet
Pretending you knew the statement while not knowing it makes you a brainlet
Tbh I forget the statement of things all the time, but it's fine usually
Because you can just look shit up
not knowing a statement doesn't make you a brainlet
CRT is lowkey kinda common
and i've literally never seen the actual statement afaik
(not counting looking it up a moment ago)
When I was in high school I didn't know what a ring was lol
smh
Hey, I have a small doubt
When defining a normal subgroup,
they say that gH = Hg
do they mean that left coset is equal to right coset of the subgroup
or do they mean that each element of H does this?
(in which case wouldn't it just be the centre?)
left coset equal to right coset
oh, thanks a lot!!
im bad with permutation groups
thanks for letting us know
how do I prove that if R=S/I then R/J = S/(I+J) where S,R rings, I,J ideals
because I dont believe Z[i]/(3) = Z[x]/(3,x^2+1) = (Z/3[x])/(x^2+1)
how do you even make sense out of I+J if I is an ideal of S and J is an ideal of (?) S/I ?
true
It is almost true though
If $\pi: S \twoheadrightarrow R$ is a surjective morphism of rings, $I = \ker \pi$ and $J$ another ideal of $S$, then $S/(I+J) \simeq R/\pi(J)$
trex:
as a corollary, if $K$ is an ideal of $R$, we have $K = \pi(\pi^{-1}(K))$ (this is just restating surjectivity), and therefore $R/J \simeq S/(I+\pi^{-1}(K))$
trex:
Basically, the only identity that makes sense also happens to be true here. The reason is very simple: We have a surjective composition $\pi': S \overset{\pi}{\twoheadrightarrow} R \twoheadrightarrow R/\pi(J)$. There remains to prove that $\ker \pi' = I+J$.
We check directly that $I + J \subset \ker \pi'$.
Now, if $x \in \ker \pi'$, then $\pi(x) \in \pi(J)$. This means that there exists $y \in J$ such that $\pi(x) = \pi(y)$. In other words $x - y \in I$. Hence $x \in J + I$
trex:
Ok that makes sense!!! Thanks
If the order of a group is prime, can I say it's the only one (excluding isomorphisms)?
Are $\mathbb R\left[x\right] / \left(x^2+3\right) \mathbb R[x] $ and $ \mathbb R\left[x\right] / \left(x^2+2\right) \mathbb R[x] $ isomoprhic?
Godel:
Oh, of course, from Lagrange's we know it's cyclic, and if it's cyclic it must be the only one
Many thanks!
@chilly ocean they are both iso to C
thats what I thought but how do I prove it
Like I thought that elements of each are some polynomials of the form ax+b so there's R^2 possibilites which is isomoprhic to C
but how do I show that the elements of those quotient rings are like the possible remainders after division?
is that obvious enough?
ok thats obvious
what groups are $\Delta(N)$ and $\Sigma(N)$? they're in this paper im reading but they dont give a name. from context, theyre discrete groups
Not sure here but sometimes $\Delta$ refers to the simple roots of a root system of in a cartan subalgebra of a lie algebra of a lie group
N/𝔄:
That's the only connection to groups that comes to mind for me
Whats N ?
Can someone explain to me why use $\pi^{-1}$?
Intel:
Intel:
they probably want phi(pi) ° phi(sigma) = phi(pi ° sigma)
Hello,
If I have $[\mathfrak{S}_3:G]=3$,
how to prove that $G\cong\mathfrak{S}_2$ with a simple argument ?
Matplotlib:

Is there a way to assign a unique identifier to a member of a group?
I'm specifically looking at permutation groups (Rubik's cube)
what does unique identifier mean
Attempt at a formal definition:
given a permutation group with cardinality n, can I assign an identifier, x_n, to all elements 1-n such that all x_i are unique?
effectively give an identifier to every element of the group
For example the permutation group of order 3 ex. (1, 2, 3) has 8 elements
Could I uniquely identify and compute this identifier easily for all 8 elements?
And could I generalize this to groups of larger order (specifically, I'm thinking about n=48) and still remain easily computable?
You might be interested in group presentations
damn, I'm already reaching my limits in understand of group theory lol. Time to burrow down the wikipedia rabbit hole...
This does seem to do what I need I think
I guess I could also just hash the element too?
ex:
the more I fiddle with Rubik's cube related programs the more I wihs I'd paid more attention in Group theory
this isn't a group theory question
you're asking if we can give names to objects
which is a very weird question

@wind steeple a natural number
ah, i found this (in case anyone cared what the answer to my question is) https://arxiv.org/abs/1101.2308
Many finite subgroups of SU(3) are commonly used in particle physics. The
classification of the finite subgroups of SU(3) began with the work of H.F.
Blichfeldt at the beginning of the 20th...
Cycle notation bothers me
Like I much prefer the normal permutation notation
But like omit the top row since it's always just 1234...
So like the "shift by 1" permutation in S_4 would be (2341)
Not (1234)
And like "flip 1 and 3 would be (3214) not (13)
It feels much more intuitive to me
For composition of permutations
you'll grow out of it
multiplying group elements is just easier, you read through the cycles and write where it lands
plus shorter to write
It certainly isn't easier for me now
Like I keep messing up
But I imagine that'll just change with practice
I can show some example maybe you don't know how it works or something
I know how it works
Like you just apply the cycles in order
I think I'm tripping myself up because part of my brain wants to be using the other notation
@ivory dust conjugating a permutation by another is equivalent to performing the permutation on the cycle notation of what’s getting conjugated
Which is awesome
There's a lot of information that you can glean from the cycle notation that isn't immediately obvious from writing it the way you'd want it to
Like the order of the element, its conjugacy class, whether its even or odd etc
Wait so let's say I have (1234) and (13)
And I apply (13) to (1234)
I get (23) (14)
But if I do it your way @shrewd halo I would get (3214)
Which if you "break it down the middle" is equivalent to (23) (14)
But if you don't it's not the same
If you conjugate 1234 by 13 you do get 3214, as expected
Oh so it's the other way around
Correct, the thing conjugating is what gets applied to the cycle notation of the thing getting conjugated
And you can't apply it the other way around
Since there is no 3rd or 4th place to reference in (13)
Hm?
You can apply it the other way around, nothing should change
If you apply (1234) to (13) you get (14)(23)
Not if you conjugate it
Define conjugate
g conjugating h would be ghg’
Oh
Where g’ is g’s inverse
Right
Wait so what if you conjugate (1234) with (13)
Like that's not the same as multiplying by (13) right?
Actually I'm dumb
Nevermind
Yeah that works out
(13)(1234)(13) = (3214)
Sorry if this is the wrong place to ask but I couldn't find anywhere about books, I am taking an abstract algebra class in uni and the text book is trash, nothing is explained, everything is rushed and the teacher is not helping either, I reached a chapter about groups and I am strugelling with it so can anyone recommend any book that explains stuff like groups and rings well?
Fraleigh is a rather slow and wordy book, perfect for someone first learning.
But it's a bit surface level and if you're looking for advanced group theory, dummit and foote is good too
@woven cloak
My suggestion is to use the books to be sure you are looking at everything, but use YouTube for what you don't understand
@stone fulcrum Do you think dummit and foote would be good for a first timer?
a friend has it and I can borrow it if I want, I don't need mcuh tbh, my text book has a chapter about groups and another about rings so I don't need many advanced stuff
It's thick. I get sidetracked reading it. It may be too in depth for your course
But it's accepted as a good algebra textbook, it has a "reference like" nature to it
Ok, thanks alot!
So I had this to prove " If p and q are to prime numbers such that (pq , (p - 1)(q - 1)) = 1, then there's only one group of order pq, excluding isomorphisms "
I used Sylow's theorem's and... well, I got to "proof" that is obviously wrong. I didn't even use the condition.
I hope it's readable
I got that basically every group whose order is a product of primes is cyclic, which is obviously wrong
My thinking was:
There's only 4 cases possible:
1º 1 (sylow p) subgroup of order p and 1 subgroup of order q
2º 1 subgroup of order p and p subgroups of order q
3º q subgroups of order p and 1 subgroup of order q
4º q subgroups of order p and p subgroups of order q
The 2º,3º amd 4º are not possible since they lead to number of elements bigger then the group itself
And the 1º case implies that there are elements not in any of the subgroups. By Lagrange's theorem they must of order 1, p, q or G
There's only 1 element of order 1, and the Sylow subgroups take care of orders p and q. So all it remains is order G, meaning G is cyclic.
But groups like D5 shut down this reasoning since it has 10 elements and it's order is a product of primes 5*2
For 2º we got 1*p+p *q elements
Oh... I forgot to subtract the identity
That explains it
But just to make sure, the other elements are all different right?
By Sylow's second theorem
I'm not sure what you're saying
The only intersection between different Sylow-p subgroups is the identity
This is true, but it's not by Sylow's second theorem
Or at least, I don't see how Sylow's second theorem would imply this
Especially if you're considering the intersection of a sylow p subgroup and a sylow q subgroup
Right, you're correct, I was getting what the 2º theorem says wrong.
Thanks for pointing that the identity is in all of them, completely forgot!
Makes way more sense now
It's not always true that the only intersection between different Sylow p-subgroups is the identity
But in this case, this fact is true
You should think about why
Will do!
Many thanks again for the help!
@woven cloak I got Jacobson on Daminark's recommendation and I really like it so far
1, he's learning the very basics
yo sloth king daminkak
what is the book aimed at
like what audience
prerequisits ?
linear algebra and a decent amount of mathematical maturity
it requires linear algebra
actually maybe not requires at least for the first chapter
which is all I've read
but familiarity with the concepts of linear will still help a lot
and they also might be assumed for the later chapters
it doesnt require linear algebra
uh
did you actually look at the book before you said this?
In the preface it says "is intended to serve as a text for a first course in algebra beyond linear algebra"
No Artin?
wtf is linear algebra
artin oh boy
Yeah Artin's the book if you don't know linear algebra
Or if you "know" it but not well
linear algebras so boring do i have to know it lmao
bruh moment
Math is linear algebra lol
if you think linear algebra is boring you probably didn't get far enough to learn about eigenvalues and eigenvectors
Linear algebra was my favorite math class do far
Such a fascinating subject
Also I think you overestimated the amount of linear required for Jacobson @bleak abyss
Like I think your original statement about the amount of linear was correct
But I also don't think you have to know it really well either
Like just having completed an introductory course where you covered more than how to manipulate matrices
At least that's my impression of Jacobson so far. I'm pretty early into it though. I haven't even finished chapter 1
X requires linear algebra \ne X requires knowing linear algebra from page 3
call me a nerd but when i was learning math in school algebra was my favorite
??
I mean like, I think Jacobson is gonna require more as it goes on
But beyond like, the stuff in linear algebra that it references, there is the problem that it doesn't cover certain things in linear algebra that people should know
Like what
Because "the proof that in an algebraically closed field, all matrices are diagonalizable" wouldn't be covered in a linear class
At least not an intro one
Because they wouldn't even know what a field is
So I never had a linear algebra "class" per se but I did two different things which both did not assume you knew any linear algebra and demanded you knew it by the end
And both of them covered fields
If you had a class which didn't do that proof then it's a subpar class
I mean like
If nothing nothing else
Prove it over C
but
Also wait wait wait I just reread your statement and that's wrong
Triangularizable
Not diagonalizable
I was getting worried
Look I don't read sentences in detail, I just read enough words to get the gist and interpolate based on what makes sense
Oh I misspoke
I meant to say triangularizable
Obviously not all matrices are diagnonalizable
I think you overestimate what's typically covered in an intro linear algebra class
Or what needs to be covered imo
I mean idk maybe there are a bunch of LA lite classes out there
But they need to be followed up
Obviously
"Or what needs to be covered" I strongly doubt you have any actual perspective on what needs to be covered
Yes but math departments do
Not all math departments are good lol
I'd wager most undergrad math curricula are actually kinda shit
I'd agree





