#groups-rings-fields
1 messages · Page 107 of 1
polynomials of degree 1 or higher
ill dm u rn
I love when I write a proof and just divide all my deltas and epsilon by a fitting number after the fact.
oh do you mean semigroup and monoid
fwiw it's ||roots of unity in Q(sqrt(2)) x Z||
looooool
yea looks like it
ok sweet
nah i mean it's pretty easy
omfg duhhhhh wow i cannot believe i missed that
yeah duh
true standard definitions
in general like
@solar glacier do you know what the ring of integers of a number field is
show there is no identity element (impossible) [almost died]
havent heard of this term before no
i wanna say its analgous
to ring of fractions
but integers
a number field is a finite extension of Q
LMAO
the ring of integers contains all elements that are the root of a monic polynomial with integer coefficients
e.g. for Q, the roi is Z
for Q(sqrt(2)) it's Z[sqrt(2)]
oh gomen >.<
lol i thought the same for rad any square free integer

daijoubuweeb
hi gauss
and now there's this funny theorem that the unit group of the ring of integers of a number field is something something, and in the case of a quadratic number field, i.e. K = Q(sqrt(d)) (assuming d is square free), it's mu(K) i.e. finite when d < 0, and mu(K) x Z for d > 0. mu(K) here are the roots of unity in K
do it for a cubic now 
Now I get to say that the ring of integers of Q(sqrt(5)) is Z[(1 + sqrt(5))/2]
You can't make me!!!!
ty
anytime!
my masters asvisor wreote the text
i wrote up the solutions that you see
not all solutions are complete yet
(i actually read "masters" as "mastews"
)
maybe read regular analysis first
p-adic number suystems and p-adic (induced)topology

I don't know what I don't know
except like a million sequence convergence criteria
u have a copy of baby rudin
I've skimmed through the p-adic analysis book and it doesn't require more than basic real analysis / complex analysis
(singular analysis
)
thats the god of all undergrad analkysis (inequality theory) texts
you should try the one by Serre
my prof said we should base our presentations on this one
Nullstellensatz
Der Satz über die Nullstellen
Watch how to say and pronounce "nullstellensatz"!
Listen our video to compare your pronunciation!
The video is produced by yeta.io.
Genau
my fav theorem
i hear this word very often 
ahh gotcha
hilbert zero theorem
Nullstellensatz is just assuming all polynomials have roots then all polynomials have roots
💀
LMFAO hi potato
Hi My Math Your Math
its functions that are zero on zero set of ideal some power of them is in that ideal
*if all the loner single variable polynomials have roots then all the social polynomials do too
i had to STATE it on my alg geo final and not prove it
i had prepared for the proof smh
precisely
i know the proove like the back of my hand
lol
one direction is trivial
I am take comm alg exam in 2 weeks
Gg
good luck uwu 
lol
$\sqrt(J) = \pm J$
Wew
Yh

I mean, it's not wrong...
it's VERY wrong
it is wrong lol
You defined minus ideal as something already?
rad J is the a \in R such that there is a k >=1 so a^k \in J
cumbersome definition
LOL
giga chads prefer the intersection over prime ideals one
Oh wait, i read that very wrong
it really is but hey its true lol
thats more of a proposition i feel like
rad j^2
DEFINITION
Yes fair
who needs 10 pages of sheaf theory
exactly lol
sheaves are cute tho >.<
hartshorne was too hard for me 
I switched to uh
geometry of schemes
is easier
but they do so much sheaf theory at the beginning
i jus tpurchased it
i have the pdf
hartshorne hard >.<
yes chapter 2
try Bosch
why purchase it if you can just read the first book of the bible
is there any ties w p adic and alg geo
yes
invented by algebraists to sell more theorems (weak nullstellensatz)
i need a hard copy lol
YES LOL
idk I like this one
REALLY?!?!?!?!?!?!?
I've been reading some scheme/sheaf stuff on the side for a casual reading group and bosch has been good
timo tell me what a noetherian scheme is
sorry yeah i mean uh
For example pyramid schemes, they only work for finitely many steps of geometric growth before they collapse as well and the founder stabilizes in wealth
I quite like Noether Normalisation => Zariski's lemma and show that f.g. algebra over a field is Jacobson
i like to phrase it differently, liek show given f in I(V(a)) then you wanna show f is nilpotent in k[x1, ..., xn]/a, so instead show (k[x1, ..., xn]/a)[1/f] is the zero ring. then it doesn't feel like a trick at all 
because uh
theoyr of jacobson rings gives u another way to think about rabinowitch too
all very cool
the proof goes as follows
which proof
let $I=(f_1,...,f_m)$ where $f_i \in k[x_1,...,x_n]$
MyMathYourMath
for Nullstellen
the proof
Ah okay
MyMathYourMath
then consider the ideal
MyMathYourMath
Then the zero set for this is empty
MyMathYourMath
okay tbf like what is ur favourite proof of weak nullstellensatz lol that's probs more interesting
cause weak => strong is fairly easy
let $y = \frac{1}{x_{n+1}}$
MyMathYourMath
lol
then for large enough N letting y = g we get g^N \in I so g \in rad I
i'm a little bit confused about (iv), why are all the left cosets of the form a^-1H? or is it because the set of left cosets partition G so that each coset necessarily contains a^-1 for all a in G?
because taking the inverse of all the elements in G gives u G
ah ok got it thanks!
how is it possible for E to be contained in an algebraic closure Zp of Zp if the algebraic closure of Zp is less than equal to p and if n > 1? like how can a field of p^2 elements be contained in a field of p elements
or am i reading this wrong
the algebraic closure of Zp is not p elements
Zp is p elements, the algebraic closure of Zp has infinitely many elements (countably many to be precise)
oh wait the algebraic closure is just all elements in some extension that are zeros of polynomials with coefficients from Zp?
Not with coefficients from Zp
It's the smallest algebraically closed field which contains Zp
So Zp-bar also contains all the zeros of polynomials with coefficients from Zp-bar (and thus any subfield of Zp-bar too)
So Zp-bar definitely contains p^n zeros of x^(p^n) - x
But it also contains the roots of polynomials with coefficients in, say, Z_p^2, Z_p^3, etc
Since those are all splitting fields of polynomials over Zp
Can someone explain why all p-subgroups of a finite group G are contained in a Sylow p-subgroup? I understand that Sylow p-subgroups are p-subgroups of maximal size, but why can't there just exist a smaller p-subgroup outside of the sylow subgroup?
Like if G is a group of order p^n(k), where p isn't a factor of k, then why can't there exist a p-subgroup of order p^2 (assuming n>2) that isn't contained in a sylow p-subgroup, which would have order p^n?
Is it just from counting the elements of order p, or am I missing something?
I found this online, but there's no explanation (that I can see) for the highlighted line?
If you have Dummit–Foote, this is part 2 of Theorem 18 of 4.5 (Sylow's Theorem), lemme try to paste the relevant bits of the proof
So let P be a Sylow p-subgroup and {P1, P2, ..., Pr} be the set of all conjugates, let Q act on this set via conjugation and let O1, ..., Os be the distinct orbits
that's pretty impressive that you can just pull that citation out so quickly
Lol I found my copy and looked through the index for Sylow's theorem
Sure enough this statement is part 2 of it in Dummit–Foote
Of course the proof itself is a pain...
I should really get my hands on a copy, I've heard its name tossed around so many times now
I like it a lot
I don't like that proof
It's not digesting well with me lol
If you have a p-subgroup H of G, then you can show the index of H in the normalizer of H is equivalent to the index of H in G mod p
That implies p divides the order of the quotient N_G(H) / H so you can apply Cauchy again, as in the proof of Sylow I
To see this, let H act on the set of left cosets of H in G by multiplication. Then a coset gH is fixed if and only if g is in the normalizer of H. Then you apply the result about actions of p-groups on sets to say that the number of fixed points is congruent to the order of the set mod p
Group theory is so cool
If P is a sylow p-subgroup and Q is just a p-subgroup, does a conjugate of Q being a subgroup of P imply that Q is a subgroup of some conjugate of P?
Like does $g^{-1}Qg \subseteq P\implies Q\subseteq gPg^{-1}$ or does that require something more, like normality?
(𒀭)
yeah okay cool thanks
It's 1am and I'm dead inside, so I just wanted wanted a second set of eyes lol
Is there a nice way to show that if G has a sylow p-subgroup, P, of order p^n, then P contains a p-subgroup of order p^n-1 without showing that P contains subgroups for all powers of p?
Divide by center until abelian, then divide by order p subgroups until you're left with an order p group
And take the kernel of all that
Center is nontrivial by class equation and order p subgroups exist by Cauchy
By that point it's just easier to show that the sylow p-subgroup contains p-subgroups for all powers of p
Both are not too hard
showing all is just fairly straightforward induction and like only one quotient
well I guess one quotient per step
which I'm now realizing could just be applied to the sylow p-subgroup to begin with
and then just ignore the induction outright
P of order p^n (n>1) and take an element g of the centre of order p. Then <g> is a normal subgroup and P/<g> has subgroups of order p^k for each 0 <= k < n by induction, so that P has subgroups of order k for each 1 <= k <= n by the correspondence theorem
That's how I'd do it lol
what is the analog of euler's criterion in an arbitrary finite field?
what Euler theorem
Sorry, the euler criterion for determining whether an element of $Z_p$ is a quadratic residue: if $a^\frac{p-1}{2}=1$ then a is a quadratic residue, if $a^\frac{p-1}{2}=-1$ then a is a non-residue
Cauchy
All finite field of char 2 has a square root
As for other characteristics, It’s just counting argument
what do you mean by counting problem
thanks 🙂
Question about this exercise from Dummit & Foote: In the question I have been asked to show that a certain map is a homomorphism, but to do that do I not need to know the operation which defines the group?
The group is a subgroup of the nonzero complex numbers under multiplication.
Yeah tbf would've been clearer if they emphasised C^x rather than C
Interesting thank you! How were you able to deduce this?
By my intuition
This is a common group
it's very obvious that set is not closed under addition
1 is in that set, 1+1 is not
Very fair
This is not the circle group.
yur
Anyone have some cool examples of wreath product acting on some interesting sets
C_p as in cyclic group with p elements and S_m symmetric group over m elements
yes
What does the "complex" part have to do with things
is there a natural way elements of the group map to some sort of complex functions
you need pth roots of unity
if p = 2 they're called real reflection groups cause, well
R has the 2nd root of unity
actualyl wait it doesn't even need to be a prime
sorry mb
yus, which acts in the natural way - permuting the entries of the tuple
Yeah idk, my course is specifically on permutation groups and group actions
actually no it doesn't matter, S_n is finite
he's only introduced 1 wreath product, but I've seen multiple definitions online
yeah if all of your groups/sets involved are finite it doesn't matter
restricted just means you take the direct sum instead of the direct product iirc
so they're iso for finite sums
right okay
Nevertheless. So we have the elements of our complex reflection group:
Each element is either a tuple of m roots of unity OR it's a permutation of the m indices
no it's both at once
Yeah
or it's one of the 34 exceptional cases 
yeah
not there yet
Now presumably this has some relevance to the real world or something
(a_1, ... a_n|\sigma) (or just (f|\sigma) where f is a map f : {1,...,n} -> C_p, which is a neater way of working with it imo)
- real world being geometry or smth
yep, that's exactly what my prof does
yeah, I can tell you that if you want
but that's less to do with the wreath product and more to do with the groups themselves
True, I guess I have just learnt the 2 natural actions of the wreath product
but was looking for maybe a connection/use outside of group theory
IMO the "imprimitve" action of the wreath product seems like it would naturally model many symmetries
Where it acts on tuples from (a, b) f,x = (a^f(b), b^x)
that looks very semidirect product-y yeah
I don't know of any applications outside of algebra though
so a regular, real reflection, works by fixing a hyperplane (subspace of codimension 1 or whatever) and then mapping the normal vector through the plane to it's "negative" kinda
Okay, so this is a reflection on R^n what you're describing. And I guess the wreath product somehow represents reflections in C^n somehow
it would be the wreath product C_2 \wr S_n
C_2 because if you do the reflection twice you don't do anything
n because there's n reflections
anyway a complex reflection group is just generated by n transformations of order m (instead of 2) that fix a hyperplane
I should clarify, there are exceptional real reflection groups as well
like G_2, E_6, E_7, E_8 blah blah blah
Why do we need the additional permutation bit?
fix it pointwise, btw - I have a habit of missing out important words
The element (1, 0, 1) representing: reflect x axis, reflect z axis
these elements don't commute with each other, it's not a direct product
you must be familiar with how you can generate S_n with just 2-cycles
yeah okay, was literally typing that it's probably to do with the structure of reflections
yeah
yeah it's exactly the same thing
and it makes S_n a coexter group but that's for a different time
Same thing in what sense sorry 😅
2-cycles can be seen as reflections if you let S_n act on the basis vectors, and their negatives in R^n
I'm gonna check a book for the actual construction, this seems wrong
OH
ok this is how it actually works 
if e_1, ..., e_n are the basis vectors of R^n
then the 2-cycle (ij) is the reflection that sends $e_i-e_j$ to $e_j-e_i$
Wew
so it's not quite as nice but meh it's not that bad
Right, so you're reflecting between basis vectors
Still a very "symmetrical" action tbh
yeah you're taking the line that goes "between" the basis vectors and flipping them according to that
so for n=2 this would be the reflection around y = x
ya
I read the book a bit further, the action I described before and said didn't sound right is the action of C_2 \wr S_n on R^n 
and this one is just S_n
and now the reason I started this whole discussion is to COMPLAIN
C_2 \wr S_n are called reflection groups of type B_n ok ok no complaints there
S_n is of type A_n.....
WHY
THAT'S ALREADY USED YOU FOOLS
lmao
damn, that is quite confusing. S_n has reflection type of its normal subgroup
lololol
Group theory is so vast
yeah it's so cool
Literally feels like we are walking into the open ocean lol
this just so happens to be one little corner I know something about 
It's completely wild that people can literally study this stuff for a lifetime
yeah there's very very deep connections here to stuff like representation theory of lie groups
All i know about rep theory is matrices
which I do not know much about
groups elements become matrices or something
you take the corrisponding Weyl group of the root system associated to the lie group and it's a real reflection group that's basically all I know
ah yes
of course
This course is supposed to culminate with the O'Nan Scott Theorem
If you know her
oh it's about maximal subgroups of S_n, nifty
OH that's why people care about S_n \wr S_m so much
I think the sole reason we are learning this is that Prof Praeger used to work at our uni
and literally all her phd students now lecture
so we all learn permutation groups 
all you need 
very jealous, my undergrad uni was starved of algebra content
don't worry, our analysis has been hijacked
as a rep theorist I must agree
I don't think my uni had any geometry at all
fair
GF(4) has a Galois field with 4 elements. These are it's tables for + and *
a) what's the identity element for +
b) what's the inverse element for +
c) whats the identity element for *
d) what's the inverse element for *
can you guys teach me how to read these fields?
the identity element is the one that doesn't change anything when applied to it
so, in the oplus table on the left, which one doesn't change anything
Quick clarification, it says "Let GF(4) be the Galois field with 4 elements" not has a Galois field
To find out what (c\oplus d) is (for example), you check the row corresponding to (c) and the column corresponding to (d), and the entry there reads (b), so (c\oplus d=b)
boolean_satisfiERIC
ok
ii can see that a + anything is itself
and anything + itself is a
so a is the neutral element for +
and some itself is the inverse
ahh ok i didn't know it was this easy to read them
- is more complicated though ^^
i'll thell you when i get it
a* anything is a. b * anything is itself so i guess b is the neutral
yes!
but dunno what the inverse of * would be
cause the a is so weird
for b inverse is b, for c inverse is d, for d it's c
yeah a doesn't have an inverse
Remember in a field, 0 doesn't have a multiplicative inverse
ahh it's like [0]?
Yes
a is 0 yeah
niiice
yup
Z_n is not a group, right?
Z_n = {-n, ..., -1, 0, 1 , ... , n}, where n>=2
n * n = n^2 which is not in Z_n
Or is this the modular group?
Z \ {nZ} ?
Z/nZ
Does anyone know what we refer to as Schreier method? Googling it, it gives me Schreier–Sims algorithm or schreier's lemma or Reidemeister Schreier method but i guess it isnt one of the above
Can you provide some context? I've heard of the Reidemeister Schreier method shortened to just Schreier's method before
I saw it in the Artin's theorem about the presentation of group of braids . It says the proof uses the Schreier method. Maybe its the Reidemeister Schreier then ?
Depends on how you defined the addition here
same here
oh ok good to know, thanks
Why is any subset with the induced topology a noetherian topological space also noetherian?
pretty much a definition chase with the fact that countable intersections of closed are closed.
Countable intersections of closed sets are closed in noetherian spaces?
bruh, mixed up open and closed sets
that's in arbitrary top spaces 
take a decreasing chain B_n of closed subsets in the subspace Y of X, you can write B_n = A_n intersect with Y for A_n closed in X. now sadly A_n is not really decreasing anymore, but that's super easy to fix... replace A_n with intersection of A_i for i <= n
Hm is that rly true
arbitrary intersect of closed = closed
thats in the definition

Shame on you det for making your msg's so misreadable smh
hehe :p
hi det
hi illu 
topology
I have to do even more classic algebraic geometry now 
I thought my newton okounkov theory course would only do algebraic curves stuff
but now we introduced the coordinate ring
the homework is finally getting fun though
but my latest homework sheet is just "apply bezout a bunch of times" lol
me know very little classical ag
I only know like very very basic stuff
But yeah, that alr took care of itself. Currently dealing with the irreducible components of the intersection of affine variety Y with dim r and a hyperplane H (dim n-1) having dimension r-1 when Y isn't in H. Trying to pull towers of prime ideals around the coordinate rings rn
Which isn't really working out
now that you say it, i realize i only needed finite intersections 
Classical
idk if this should go in this channel or adv nt. my prof said "O_K^times = mu(K) x Z^(r + s - 1) as abelian groups, where mu(K) are the roots of unity in K, the torsion subgroup of O_K^times" what does torsion subgroup mean in this context? is it just elements of finite order?
Yes
where does the name come from
if we view it as a Z-mod?
then it's just torsion elements innit
Yes
thanks
it is periodic 😮
scary non comm alg
Well this was actually coincidentally commutative lol
I never understood how people identified like matrix groups over finite fields with various groups arising from studying symmetries of polyhedra
Like give an example of a finite dimensional C-algebra A such that dim Z(A) > r, where r is the number of isomorphism classes of simple A-modules
what does it mean for a group action to be "simple transitive"?
hm
for context
I've seen it for free + transitive
"If K/Q is galois, then G_(K/Q) acts simple transitive on Hom(K, C)"
Action of group on itself lol
I keep forgetting group actions
for some x
yeah also transitive group action
I always confuse that one with uh
that other group action
transitive is the only one i can remember lol
well faithful makes sense but comes up in other contexts anyway
also like, why is this true
and uh
how does this help us classify Hom(K, C)
my prof continues by saying that
complex conjugation operates on H = Hom(K, C) by left composition
and that if sigma bar = conjugation circ sigma = sigma then sigma factors as K -> R
and in that case sigma is a real embedding, and otherwise a complex embedding
and therefore H = { f_1, ..., f_r, sigma_1, sigma bar_1, ..., sigma_s, sigma bar_s }
where the f_is are the real embeddings and the sigma_i, sigma bar_is are the complex embeddings
and so [K : Q] = r + 2s
how do we even know that Hom(K, C) is finite?
so in general, say F/k is an algebraic extension, you define [F:k]_s = |Hom_k(F, k bar)|.
you then show this behaves multiplicatively in towers and for simple extensions, [F:k]_s <= [F:k]
free-ness is immediate, then a counting argument
better to use the word "pre composition" as left/right are confusing.
how can we use this here? k needs to be a subset of F, but if e.g. F = Q then k bar won't be C
oh right, should have said that...
if L is any alg-closed thing containing k, then you have a map
Hom_k(F, k bar) --> Hom_k(F, L)
but if you assume that F/k is algebraic then this is an iso. the image of any f in Hom_k(F, L) would consist of stuff in L that are algebraic over k, so f factors through k bar.

What’s your favorite algebraic structure? Groups, rings, modules, varieties, algebras, whatevers
In mathematics, racks and quandles are sets with binary operations satisfying axioms analogous to the Reidemeister moves used to manipulate knot diagrams.
While mainly used to obtain invariants of knots, they can be viewed as algebraic constructions in their own right. In particular, the definition of a quandle axiomatizes the properties of con...
i was only exposed to groups and rings (and a little bit of fields and vector spaces)
Because its ridiculous that theyd be useful
but i prefer rings and fields over groups
Groups are cool
Wow I’ve never seen this before LOL
They’re pretty funny
i prefer abelian grapes
quivers
I wanted to read a bit on quiver reps but never really got around to it
Quivers show up in topological data analysis. I tell everyone that fun fact without actually knowing what a quiver is though 😦
Is this a marketing ploy by Gwyneth Paltrow?
vegitables
tambara module
it's what is behind your minecraft updates (no joke)
Groups rings, modules varieties and Galois
Wtf am I reading

if you have a burrito, you can often replace the ingredients in it without damaging the wrap
the tambara module is a vast generalization of that simple concept
😉
is the field of complex numbers an infinite extension of the rationals because there's no way to express an irrational number with any scalars involving rationals?
No it's not possible, C is an extension of Q but not an algebraic one. Think of Q(x) as a field, C is that but with uncountable variables (and some algebraic ones)
oh right because pi is transcendental over Q
ah ok i'll think of that thx
Yeah note that [Q(a): Q] is finite iff a is algebraic over Q
So you can just pck anything non-algebraic
Howeever even just appealing to transcendent numbers is kinda overkill like
For example Q(2^1/n)/Q is an extension of degree n
How much blur do you want? Yes
this is a screenshot at max resolution
my lecturer just doesn't know how to record lectures lol
Lol
It's funny cause all I can read is like
Complex lie algebras classifed by Killing

simple complex lie algebras classified by killing/c[some other author] 1880s
then some graphs
And there they are
Cartan?
yep
the scribble is an s
Killing and Cartan on a date
K-I-S-S-I-N-G
K I L L I N G
form
whats the deal with these dynkin diagrams anyway
what does it even mean lol never understood
Shows how reflections compose with each other
Encodes the structure of a root system basically
The edges tell you the order of the product of two basis elements
ah
No edge => the product is another reflection, and then you label the edge with either 3,4 or 6 to show the order of the product
If you remove the restriction on the possible edge labels you get a Coexter diagram which classifies general coexter groups rather than just root systems
whats a painless way of seeing the polytope st the Weyl group is reflection about the faces of it? something something Weyl chamber but this I also never really understood
Oh uhh
It’s sitting in the Cartan subalgebra I assume
Yeah I really can’t tell you more than “something something Weyl chamber”
I don’t really think about them geometrically that much
gotcha
np, this was helpful
These stupid diagrams appear everywhere thats why I’m intrigued
Although I think B_n acts on an n-cell, just from memory
For example, singularities of maps f : C^2 -> C
interesting
Wtf are they doing there
ask Arnol’d lol
I shall be having a word
f(x, y, z) = x^2 + y^2 + z^n+1 is A_n, iirc?
x^2 + y^3 + z^5 is E_8
In algebraic geometry, a Du Val singularity, also called simple surface singularity, Kleinian singularity, or rational double point, is an isolated singularity of a complex surface which is modeled on a double branched cover of the plane, with minimal resolution obtained by replacing the singular point with a tree of smooth rational curves, w...
Spooky
Bro how did you get access to my profs handwritten script?
plot twist, he is your prof
@molten silo Corollary of Nakayama (this is the version I remember): If (R, m) is a local ring, M is an fg R-module, a set {x1, …, xk} generates M as an R-module if their images generate M/mM as a R/m vector space
Apply to your case with the maximal ideal (x, y, z) of C[[x, y, z]]
okay thank you
@delicate orchid wtf is even going on, this feels like pokemon except for weird creatures its groups
yeah so those are the only graphs which are positive definite, meaning if you take the associated matrix which is some mess involving a cosine, it's positive definite
the proof I've seen involved just finding all postitive definite coexter graphs and then taking out the ones that aren't dynkin diagrams
which is just like
17 different observations where you eliminate cases 
this seems really trivial but it feels like it's wrong
given an irreducible polynomial f in C[x, y, z], its partial derivative wrt x and itself do not share a common factor as its pd has degree < degree f and f would then no longer be irreducible
This is true
This is essentially at the heart of why every extension in char 0 is separable, you can’t share a root with your derivative
right
This is possible in char p only because d/dx(x^p) = px^p-1 = 0
Yes, in fact this is true for derivatives in A[x] whenever A has characteristic 0
Oh bruh
Piece of shit………
wait
can differentiating introduce repeated factors
like if f has no repeated factors/is irreducible, will f' wlog wrt x also have no repeated factors?
In char p, x^p+1
and in C[x, y, z]?
Idk, try and prove it can’t or find an example
K[x²] generated by one element
<x^2>?
when can you say R[s] is an integral extension over R?
When its contained in R and k[x^2] is integral over k[x]
i just cant find a standard f
Cant i just use f(y) = y-f , where f=y and f is in R{X}?
what polynomial does x² satisfy over k[x]
think of a something say a(x²)t²+b(x²)t+c(x²) s.t. putting t=x gives you 0
there's a very trivial one
which one is larger? k[x] or k[x²]? in the inclusion sense
k[x]
so which one is the extension
k[x]
a=0, b=-c*x
nevermind
you are close
c=1
(t = x i think)
oops*
i'll suggest to write X = x^2
have I been messing up the entire time?
prolly not
ok cool
so you're trying to find an monic polynomial over K[X] such that x = sqrt(X) is a root
(try looking at the situation Z --> Z[sqrt2] if that makes thinking easier
)
ye
hi det
so does what i said work. c=1 b =0 and a=-x^2
cool
i got confused what was the coefficient and which the variable
yeah happens, the trick det mentioned might help you
^
@molten silo here's a follow-up. Can you show for any polynomial p(x) in k[x], k[p(x)] ⊂ k[x] is an integral extension
Hi, I study the Tic-Tac-Toe's grid and I wonder about the vocabulary to use...
For example, let us consider these four grids :
Are you wanting to know the terminology of group actions?
We understand that these grays are equivalent and that they have a similar structure.
Yes.
OK yeah, we would say those are in the same orbit
If a group G acts on a set X, then we say X is a "G-set"
Is it correct to say that these grids are "isomorphic"? Or maybe "equivalent" is more accurate? Or just "similar"?
No
You could draw attention to the equivalence relation x ~ y iff x = g.y for some g in G, and then you could say equivalent more precisely
(they are literally equivalent in the sense of an equivalence relation)
You could simply define the terminology 'similar' for that case. It would be a bit of a faux pas to call them isomorphic
Yes, I have a definition that looks like it!
Ok I was also thinking, isomorphism is more for sets or algebraic structures, isn't it?
Yes
Finally what I would like is that if A and B are equivalents then:
- There exists f such that A = f(B).
- There exists f^-1 such B = f^-1(A).
- If C is playable on A then f^-1(C) is playable on B.
- If C is playable on B then f(C) is playable on A.
But (normally) it corresponds to the symmetries and rotations of the square.
A and B are grids and C a move.
The first two are by definition. The second two you will have to prove.
The group of symmetries and rotations of the square is the dihedral group of order 8, aka Dih(8) or D_8, or sometimes D_4 depending on who you ask. You may find it helpful to look that up.
I really have no idea how to do this...
By studying the noughts and crosses I made this truth table:
Is it the symmetry group of the square?
Yes, this is Dih(8)
Oh sorry, I used to say "table de vérité" but it is indeed confusing with tables in Boolean algebra...
I think I stumbled upon it unintentionally 😅...
Quick stupid question, suppose we have a field $k$, $f(x) \in k[x]$ and F is the splitting field for $f(x)$ over $k$.
If $k \subseteq K$ is an extension such that f(x) splits as a product of linear factors, then I need to show there is a homomorphism $F \rightarrow K$ extending the identity on $k$.
This is just using the theorem on the uniqueness of splitting fields to get an iso between $F = k(\alpha_1,...,\alpha_d)$ (where $\alpha_i$ are the roots of $f(x)$ in $F$) and $G = k(\beta_1,...,\beta_d)$ (where $\beta_i$ are the roots of $f(x)$ in $K$), that extends the identity on $k$. This iso then extends to a homomorphism between $F$ and $K$, the latter of which contains $G$ right?
Eternal Way
Ah ok, thanks!
can somebody give me a hint for this question other than the one they gave? LOL i'm using the fact that if N is a proper normal subgroup of G then {e} < N < G, and so there exists a composition series containing N and trying to find a contradiction but so far can't come up with anythign
like i don't see how i'm supposed to use exercise 23 if i don't know if Hi+1/Hi is finite
like am i missing something? are simple groups finite?
oh wait can i just let M be a maximal proper normal subgroup of G
and show that there's no composition series which contains it because it's maximal
bruh i'm lost
Suppose you have a composition series for an infinite abelian group. If each quotient were finite, then the order of G would be finite, contradicting the assumption. Thus, at least one of the quotients is infinite
Happy to help
Nice
I want to show L/K finite and E/K any extension => LE/E finite, does this work: take some finite generating set x_1,...,x_n s.t. L=K(x_1,...,x_n) (e.g. K-basis), then E(x_1,...,x_n)/E is finite (since the x_i are algebraic over K => over E) and E(x_1,...,x_n) contains E and L => LE/E finite.
I suppose the same way one could show L/K algebraic => LE/E algebraic.
yee 
(just the thing that to talk about LE you need both L, E to be subfield of some large enough field)
I think up to iso you can embed them in an alg closure and it won’t change
ofc
a in an extension field E being algebraic over a field F imply that [F(a) : F] is finite? all we know is that it's the zero of some polynomial with coefficients in F, correct? or are there no polynomials of minimal infinite degree (sounds stupid, but just a clarification)
A polynomial has finite degree
ah ok thanks i suppose i must have missed that in the definition
How do you even make sense of evaluating a power series at an element of the field?
Try to make sense of this for an arbitrary field and you’ll see that it’s a nonsensical notion, there’s no way to interpret it in full generality
so in general if a and b are in an extension E of F such that a and b are algebraic over F then F(a, b) is finite since the dimension of F(a, b) is at most max{deg(a, F), deg(b, F)}?
That isn’t the correct bound, but it’s still finite yes
I think it would. Like E = L = Q(cbrt2) and now [EL:E] would change depending on whether you embed them in the same way or not.
Relabel E as Q[x]/(x^3-2) if that looks weird.
Base is Q tho
what would the correct bound be
This is weird tho because
Shouldn’t they both be iso to the tensor product as Vector Spaces
Tensor prod need not be a field
Figure it out, it’s more instructive than me just telling you
Yeh I know
And can have multiple max ideals
.<
E ⊗_k F is a field iff it's dimension = dimE * dimF
ok that doesn't sound right, let me check
It’s some shit about transcendence degree and crap I think
GF(2), F2, Z/2Z are all the same thing? The vectorial space of that is used for bits in computer science?
i don't think i'd really call the field with 2 elements any more related to bits than... anything else with 2 elements
the important property of bits is just that there are two of them
Someone familiar with very elementary knot theory here? I am supposed to show that two out of three reidemeister moves leave the group of the knot diagram unchanged up to isomorphism. I worked it out with for the first and third now but showing it for the second kind got me stuck.
I'd obtain the relation x2 = x2-bar, so by slight abuse of notation I know that short of this new a and the relation x1 a x1-inverse = x2 the group is unchanged. But I have to somehow get rid of this new generator. In the special case I'd have some crossing which gives me the relation x2 = x1 xk x1-inverse in which case a is just equal to some existing generator and can be removed, but I don't see why such crossings must always exist or why the relation would emerge algebraically out of the other relations.
sorry if this is an obvious question, so if a R-module G is just a homomorphism R -> End_Ab(G), is it true that R-Mod is just a (appropriately restricted) coslice category of arrows under R?
I don’t think this category has the same morphisms
maybe ask in topology
Just write the relation the other way around, a = x1^-1 x2 x1. In the Wirtinger presentation you’re adding a to the list of generators, along with the above relation which expresses a in terms of already existing generators.
So the group is unchanged, upto isomorphism. Its a redundant relation
Theres no need for a to be literally equal to another generator for it to be removable from the set of generators.
I am only adding that relation (x1^-1 x2 x1) if my knot diagram has a crossing involving x2 going under x1 while having the right orientation tho?
Nvm I misunderstood you, yeah okay.
That's literally a tietze transformation, 1=a(x1^-1 x2 x1)^-1 at least
Indeed
Thanks
not sure if this is the correct channel
but what does conv mean in the context of newton polygons?
more specifically
$$\on{conv}\left\lbrace \bigcup_{(i, j) \in \on{supp}(f)} (i,j)\text{-quadrant} \right\rbrace$$
Hey, does the dimension of the double dual of a vector space differ from the original vector space differ when the dimension is infinite?
Yes
The dimension of the dual of a vector space with countable basis will be uncountable
(if I'm not terribly mistaken lol)
Came up with the double dual functor being a naturally isomorphic to the identity functor only when the vector spaces are finite, but vector spaces of the same dimension are isomorphic.
this is true
dim(V*) = dim(V) iff dim(V) is finite
Yeah, why though?
the dual is F^kappa where F is the base field and kappa the dimension of V. If it had dimension kappa, then |F|*kappa=|F|^kappa as cardinals
to be clear, that's a direct product
assuming the axiom of choice, any vector space V over F is a direct sum of some number of copies of F; let kappa be that cardinal. then you can prove (it's not too hard) that the dual is the direct product of kappa-many copies of F
so what's left is to do some cardinal arithmetic to show that if kappa is infinite then the direct product is larger than the direct sum
Also clear that F^kappa embeds in it using the dual consrtuction right
(So at least the bound in cardinality is easier I mean)
F^kappa is functions kappa-->F. FIx a basis B (of size kappa) for V. Then the dual is of course the set of functions B-->F, which is the same as kappa-->F (tho you have to choose a basis, so maybe its not so natural)
is this still true even without the axiom of choice?
Hom( \oplus k,k)= \prod Hom(k,k)= \prod k
like let's say that we had a vector space V over F which doesn't have a basis; in particular it's not finite-dimensional. what can we say about V*
interesting
i guess what i'm asking is if there's a constructive proof that "V = V* implies dim(V) is finite" without assuming that V has a basis
hmm
so apparently the statement "every subspace has a complementary subspace" in fact implies axiom of choice
if you could get an example where no 1-dimensional subspace has a complement
(a complement of W in V is another subspace U with V = W + U)
then the dual would be trivial
okay so apparently here is an example
there is a model of ZF where the dual of R as a Q-vector space is trivial
yeah
thats what I was thinking
but no idea how you would prove it
the Q-vector space R is my favourite vector space by far, so cool
i think the idea is that you can set up a model which basically forces everything to be continuous, but there's no continuous projections from R to Q
or something idk
The Q-vector space C is my favourite too
xdd
also, some more weird stuff here https://mathoverflow.net/questions/142609/linear-algebra-without-choice?rq=1
wtf I just learned that C is the only algebraically closed topological field that is both Hausdorff and locally compact
yeah, had read that in the past
shouldn't this be a geq i, b geq j?
yeah seems like a typo
thanks
in the definition of the newton polygon of a polynomial: "the 'compact part' of the edge of the convex hull of the union of all quadrants" what exactly does "compact part" mean? do we just remove the x and y axis? (cuz then it's closed and bounded so by heine borel it's compact)
can somebody give me a hint to show that the finite direct product of solvable groups is solvable?
Can you think of how to construct a composition series for the direct product of two groups
yes i was thinking about it but i'm not so sure it's right
gimme a sec i'll upload my attempt at a constrution
construction
like this feels a bit hand-wavy idk
Make sure you got a good handle on the structure of (normal) subgroups of direct products and the quotient group of direct products.
ah yea i kinda had to prove that the direct product of normal subgroups of two groups is a normal subgroup on the fly
I guess work out the other fact about the quotient groups of direct products, then once you have done that you just apply those facts and make live a lot easier
well i could use this i think right
because i could just consider the additive group structure
Only the factor groups are required to be abelian and in the general case you won't be able to apply it.
Actually, what's your definition of solveable here? Subnormal with abelian facto group or the derived one?
subnormal with abelian factor groups
No, a similar fact does not hold for product groups.
ah rip
Cool cool, but yeah. The next term in the series are just normal subgroups of the previous term, so you can't use the ring version
The problem here is similar to the subring counterexample that I mentioned around when I posted the proposition about the ideals of the product ring
maybe i can proceed by induction of some sort? the base case is clearly true, since H1 and K1 are abelian (H1/{0} iso to H1 and is abelian and similarly for K1) and then consider the two cases for when i = j and when i \neq j
because n does not have to equal m
ok let me look back
and the direct product of abelian groups is abelian
You mean the subnormal series of the groups have various lengths?
ye because they're not the same group
if they were the same group they would have the same length right because all composition series of a group G are iso
That's fine, just extend their series with trivial groups until they match
wait so does my construction work? i'm assuming that m < n and i'm just fixing m when the m groups "run out" (then i just count up the His until I get to Hn)
like for example H0 x K0 < H1 x K1 < H2 x K2 < ... < Hm-1 x Km - 1 < Hm < Km < Hm+1 < Km <Hm+2 <Km < ... <Hn-1 x Km < Hn x Km
Looks fine to me
Simpler in what sense? Gluing together the individual series together seems pretty simple
H_0 x K_0 < H_0 x K_1 < ... < H_0 x K_n < H_1 x K_n < ... < H_m x K_n is a composition series
it's worth noting that this is a composition series, not simply a subnormal series
if you wanted only to prove that H x K is solvable, this would be the simplest way
I think that's what they wrote, just with different indexing convention
No that's not what they wrote at all
Ah, true that
In general (H1 x K1) / (H0 x K0) \cong (H1/H0) x (K1/K0) will not be a simple group
But yeah again this is immaterial for this proof
ah so you counted with the Ks first and then the Hs
wait this looks similar to zassenhaus
but zassenhaus involved intersections
You can use this to show that the derived length of H x K is the maximum of the derived lengths of H and K
('this' being the construction given in the image, not mine)
derived length?
wait i feel like i could possibly use the third isomorphism theorem here?
For what? For the quotients of a direct product?
yea
The derived length is the smallest number n for which G^(n) is the trivial group. Here, G^(0) is defined as G and G^(x+1) = [G^(x), G^(x)]. A group is solvable if and only if such a number n exists
idk i'm looking at it now and maybe it could apply??
First isomorphism theorem will be more helpful actually
because i'm using induction rn and assuming that Hi x Ki / Hi-1 x Ki-1 is abelian for all i, j <= m - 1 where i = j and trying to show that Hi+1 x Ki+1/Hi x Ki is abelian, and i know that Hi-1 x Ki-1 is a normal subgroup of Hi x Ki which is a normal subgroup of Hi+1 x Ki+1 by construction
oh interesting ok
maybe it's time for good ol' contradiction
i'll prolly come back to this problem it's kicking my ass but thanks for the help guys
if K is an extension of a field F and E is a subfield of K that is the algebraic closure of F, how do we know that any f(x) in F[x] splits in E? because E doesn't necessarily have to contain all of the zeros of f(x), because it's just the set of elements that are algebraic over F in the extension K (or is the extension K assumed to contain all of the elements algebraic over F)
What's your definition of 'algebraic'?
Depending on the definition it could be trivial
a is algebraic over F if it's the zero of some f(x) in F[x]
And your definition of algebraic closure?
So it's the zero of some irreducible, monic f(x) in F[x], no?
And your other polynomial, let's now call it g(x), factors into some element of F times irreducible polynomials in F[x]
the subfield of all elements in an extension E of F that are algebraic over F
oh right i forgot about existence
me too I often forget about reality
lol
i think this works
Hey folks. I'm trying to teach myself some Abstract Algebra and as such I'm working through the Dummit and Foote textbook. I found some answer keys online which I use to check my work, but I'm not understanding this step:
In one of those answer keys
I recognize I'm probably being a little slow here, but if anyone could clarify I'd appreciate
Isn't that what I'm aiming to prove in the first place though? Contextually, the question is:
- Use the generators and relations above to show that every element of D_2n which is not a power of r has order 2. Deduce that D_2n is generated by the two elements s and sr, both of which have order 2.
With the presentation being:
D_2n = <r, s | r^n = s^2 = 1, rs = sr^-1>
I'm being silly
You're right
I just presumed I couldn't use that fact
Because I'm being asked to show that the elements have order 2
Ty
chinese remainder theorem
also is there a way to tell whether it is odd or even?
is 4k+1 odd or even
for some natural number k
odd yes i understand 🙂
thanks
well the same number can't be both odd and even
doesn't this imply that our n's have to be coprime
and 4 and 10 def aren't coprime lol
although if it's something like x = 2 mod 5 and x = 1 mod 4 then that does have a solution because 5k+2 isn't necessarily even just because 2 is even
i see
how do u apply chinese remainder theorem for that system of congruence
i know how to do it for 3
like this
well yes the chinese remainder theorem does require a set of numbers that are coprime, but you don't necessarily have to put in 4 and 10
can divide 10 by 2 to get a solution in the least residue system
lcm(5, 4) = 20
then by crt you get x = 13 mod 20
which is the correct solution
this one actually meets the condition for directly applying crt
7 9 and 11 are all coprime
they said "for part a" though
walk me through it pls?
which is this one
part a yes
part b was designed for chinese remainder theorem
in lecture i was taught to use tabular method
which im so confused about
you can like
take the lcm
of the residues
then see which numbers you can like reduce to get to that lcm by multiplying and which gets you to coprimeness
then apply crt
in this case the lcm is 20
so you divide 10 by 2
to get 5
5 and 4 are coprime
so you do crt with those residues
how does this work
I'm horrible at like basic NT so I'm actually curious
(...wait why are we in the abstract algebra channel for this?)
i think the idea is like
we know x = 3 mod 10, which implies x = 3 mod 5
and then "x = 1 mod 4, x = 3 mod 5" is something you can apply crt to
(and the existence of x = 1 mod 4 in there means we haven't accidentally lost the information that x is supposed to be odd)
someone halppp




