#groups-rings-fields
1 messages ¡ Page 363 of 1
how is the quotient space induced by this relation isomorphic to a subspace of random variables with mean 0?
That looks more like a job for #probability-statistics?
oh damn okay đ
equivalence relations aren't group theory
lol
or are they
fun fact equivalence relations on G that form a subgroup of G x G are in bijection with normal subgroups of G
yes, congruences
congruence relations
calling that group theory is like calling set theory topology lmao
ya I like the congruence perspective b/c it gives a bit more intuition on where normal subgroups come from
you'd like universal algebra
ya ik
it's basically the study of congruence relations
no one likes subalgebras
they're badly behaved
i do
I like subalgebras
the only time I work with subalgebras is when they're the image of a homomorphism, so I can act as if they're a quotient
and finiteness conditions
you can't quotient subthings
but you can quotient congruences
checkmate
true but really being able to quotient sub things is kinda a happy coincidence
not really as natural
Tbh I think the congruence relation perspective should be shown
b/c I think it's normal for ppl to get confused about normal subgroups and ideals
yeah totally
but it's actually all just congruence relations!
and really every quotient in math is a quotient by a suitably nice equivalence relation
congruences are just super nice objects, and it's crazy just how much more they say about an algebraic structure than their subalgebras
why are the probability people all asleep at this time
It's one extra concept for people to get used to, and I don't think people learning group theory (and also any kind of abstract algebra) for the first time are usually ready to handle that one more abstract thing.
đ
Moreover, normal subgroups are very useful in group theory - i.e., when doing group theory specifically, you really want to think that quotients are classified by normal subgroups and not congruence relations (e.g. because you might be inducting on size of a finite group and want to apply the inductive hypothesis to the normal subgroup).
you called?
đ
So it makes sense that in a group theory course, one would introduce normal subgroups whether or not the students know congruence relations already, and one would not introduce congruence relations at all, really.
what does it mean for a variance of a random variable to be zero
const
but why
Otherwise it would vary. If you want to be more technical, then Var(X) = E[(X - E[X])^2)] is the expectation of a non-negative random variable and can be 0 iff the random variable is (almost surely) 0, i.e., with probability 1, X = E[X], which is some constant.
Why this channel BTW
If you look at this definition of variance:
$$\text{Var}[X] = \mathbb E[(X - \mathbb E[X])^2]$$
you can intuitively imagine it as the average distance of the random variable X to its mean. If the average distance is zero, that means the random variable does not vary at all.
or you can do that
ÂŻ_(ă)_/ÂŻ reading is hard
oh yeah
clorox_1g
well i started off asking here because i had a question on an isomorphism in some probability space but then they told me to ask in the probability section but they're all sleeping rn
so i came back here đ
yeahhh that intuitively makes sense
I was just looking at variance-covariance matrices and realised i needed a little bit of patchwork in my fundamentals
just play around with normal random variables and you're good. Everything's a normal anyway 
wdym everythings a normal đ
Central Limit Theorem with n=1 
âotherwise it would varyâ is hilarious lmfao
i'm getting onto that in a couple lectures time
fair enough, basically you'll learn that the normal distribution is the one true overlord of distributions and nothing else matters (approximately)
sure, but I would argue they are much easier to understand than normal subgroups
and the equivalence between the two is quite simple
(if H is any subgroup, then the equivalence relation it generates is a congruence relation iff H is normal, and if ~ is a congruence relation then the set of elements with x ~ 1 is a normal subgroup)
Hello, is there a theory on approximate homomorphisms, like on modular rings?
Is it subsumed by lattice theory
what is a modular ring in this context?
Rings like Z/qZ
More generally, Z[X]/(q, f) (ofc can go more general, but this one is what I am interested in)
I will elaborate later
We know that if R is a commutative ring with unity and I, J are ideals such that I + J = (1) then IJ = I \cap J.
Is the converse true if both I and J are non-zero ideals?
How crt helps me here?
No idea where to put this, but does this proof work?
Say you have finitely many maximal ideals, what happens then?
You have to use isomorphism here
You havenât proven every polynomial equation in F_2 can be written in the form x^n + f(a_n-1)x^n-1 + âŚ
It is not
Take an idempotent ideal I and J=I
Yes got it
Say M1,..,M_k are the only maximal ideals so I can say R \ ( \cup M_i) is finite.
And I am thinking different question in the same context, say if there is only one maximal ideal M, then R/M is field but R/M has only one element so can I say in this new question that it is not possible that R is local ring with finitely many units.
It's not possible that R is an infinite local ring with finitely many units
Try to describe what the units of a local ring are
So that's an argument correct?
R-M
All elements outside of maximal ideals
And why is that infinite?
No idea
I see
R is infinite ring
If R\M is finite then M has to be infinite
But in local ring, every 1 + x, where x in M is an unit element
Then we will get infinitely many units elements
Any hint here?
Jacobson radical
Iirc it has a characteristic similar to this
If you have finitely many you can use CRT
@rocky cloak can this work?
Yeah, if you can show the Jacobson radical is infinite you're done
Yeah like I went to a group theory talk a couple weeks ago and it was kinda just this. A seemingly completely synthetic definition (I think itâs a vast generalisation of something that someone was kinda interested in before) and it was just working out what groups fit that definition
Fun, for sure, but like it just feels like a nice toy problem Iâm not sure why I should really be all that bothered
I was talking about this with some people the other day. I donât know that Iâd want to introduce quotient things via groups because normal subgroups are really opaque. At least with like rings you can clearly write down some elements and youâre saying these are the exact relations were introducing, but I think a lot of people get confused because normal subgroups are kinda weird
Like I donât know how to motivate normal subgroups beyond âtheyâre the subgroups such that when you partition the group by them, the operation is still well definedâ which is true and what you want, but Iâm not sure thatâs super motivating for your first introduction
They are exactly the kernels of homomorphisms, just like ideals.
That also motivates the definition as gKg^-1 = K is clearly true for a kernel.
Or how are you motivating ideals?
Yes x in J iff 1 + xy is an unit for all y in R
Thereâs a few different ways you can motivate normal subgroups
Theyâre derived from congruences on groups for starters
Theyâre also highly âsymmetricâ subgroups in that they look the same from all perspectives
Kernels of homomorphisms is also a good motivator
So it gives me that R/(M_1...M_k) isomorphic to R/M1 Ă..Ă R/M_k
Indeed, so what happens if R/(M1...) is infinite? And what happens if it is finite?
I think the kernel pair perspective is good too
If it is infinite then one of them R/M_i needs to be infinite and if it is finite then all of them R/M_i needs to be finite
probably too categorical lol
this is first year UG
Well you donât have to give the full abstract def
but then it's literally the same as a congruence relation
But I think itâs quite intuitive to think of quotients as âidentify these things if they have the same propertyâ
Indeed, so maybe first consider if they're all finite, what does that say about
(M1...Mk)
And thatâs all a kernel pair is
I don't know why you'd use kernel pairs rather than just the kernel tbh
why introduce fiber products
(kernel as equivalence relation i.e. congruence relation)
What actually is the issue, I genuinely donât understand
All you need is
Given a homomorphism f : G -> H
You consider the subset of G x G given by {(g, h) | f(g) = f(h)}
(M1..M_k) is infinite
this is called the congruence relation perspective, they are the same
then
Not as far as I know
And then you're able to construct infinitely many units, yes?
A congruence relation is an equivalence relation that respects the group operation
the congruence relation perspective in my eyes includes the correspondence of congruences <-> kernels of homomorphisms
A kernel pair arises from a homomorphism
You can look it up on nlab, they are not the same definition
I know they're not the same definition, but they are the same perspective
because congruences are kernels
I donât agree with that either
Equivalence relations and partitions are different perspectives
Even if they turn out to be equivalent
I really donât understand your point
A kernel pair arises from a homomorphism
A congruence does not
?? how does a congruence not arise from a homomorphism
When you specify a congruence, all you are doing is specifying an equivalence relation on G that respects the group operation
You donât need to first define a homomorphism out of G to do this
I guess? but the fact that every congruence is a kernel and every kernel is a congruences makes the two equivalent in my book
Then I can go back to the equivalence relation and partition thing
Honestly just forget it
but both congruences and kernels are equivalence relations
I canât understand you algebraists sometimes
lol
They arise from different things but I guess you canât understand that
And if they are infinite, then one of them is infinite say R/M1 is infinite field, so how it helps me here?
maybe it's a concept with an attitude thing for me
I donât care
Think about the units in R/M1 x... x R/Mk
alright, alright, noted
uh huh
Infinitely many
And what do they correspond to in R?
I am not sure about it
None of this is a fully formed thought FWIW, just something I was thinking about the other day.
Ok yeah only way I know to motivate it is silly because I do know other ways, but I donât know how much I love this as an introduction.
I also agree that itâs basically the way you want to introduce ideals, but I think my issue is more that I donât know how, maybe âillustrativeâ that is, at least as to what theyâre actually doing.
This kinda came off the back of a conversation with someone (another MSc student, mostly did logic but still knew a fair amount of algebra) mentioning that he still didnât really âgetâ normal subgroups, and it made me think about how when theyâre first introduced you typically only really know like S_n, D_n, maybe A_n and so when you see an example like S_4/A_4, I donât know how clear it is whatâs happening there?
At least when I compare it to quotients in rings, where you can very explicitly write down the relations youâre introducing, or topology where you have a very visual representation of whatâs happening, so I wonder if the concept of normal subgroups either as a kernel or just being the condition such that your operation is still well defined is possibly more satisfying after some more experience with the other objects
I can say there are infinitely many x_i such that for each there are y_i such that 1-x_iy_i in (M1...M_k)
Are you saying ideals are easier to grok than normal subgroups
if he's into logic then quotients (rather, congruences) have a very nice logic-y meaning
Because this was not at all the case for me
This was an idea I was considering, I was wondering if thereâs some nice interpretation from how they act on the Cayley graph of your group or how they look in there, but Iâm pretty bad at that kinda thinking and wasnât sure if thereâs something or not
You can do this for symmetry groups of shapes
Any subgroup can be interpreted as a stabiliser
I'm not sure I follow what you mean by "very explicitly write down the relations". Are the relations for groups less explicit?
But it depends on whether the thing youâre stabilising looks the same from all perspectives or not
For me, yes, I have found them to be. I think for quotients especially. This could just be a me thing though
I guess Iâll chalk that up to another thing I donât understand about algebraists
once I got normal subgroups, intuition for ideals followed so it was not at all the case for me as for Nope
Trying to understand the definition of an ideal only really clicked once I compared them to normal subgroups
I can see rings and ideals being more intuitive, since you have a lot more examples of them than groups before going into an algebra course.
But just in terms of the definitions I don't see a big divide
So like, comparing S_4/A_4 to for example, R[x]/<x^2-1>, or <a,b,c>/<a+b-c> or whatever, yes you can kinda unpack things for the groups example but in the typical presentation for these things, I find the ring examples far easier to understand
This could all just be a me thing, as I said this was just kinda my feelings, somewhat also felt by the guy I was talking to
maybe its weird that conjugation seemingly comes outta nowhere? where for ideals you've got the idea of "multiple of element"
I wouldnât generalise this to anyone past me lol
And what do you know about elements with 1-z in the Jacobson radical?
Ok I think I agree here in the sense itâs easier to get an intuition for quotients being âintroducing relationsâ in the ring setting
Yeah to me, at first anyway, the definition of a normal subgroup felt a bit odd (learning it was just because this is how we partition and still get a well defined operation satisfied me though, so maybe thatâs enough) but ideals always felt pretty natural.
That being said I had already taken group theory at that point so maybe I just had better intuition
Idk, me not being able to understand algebra is a very general phenomenon
So I guess you're saying that you usually consider rings that are free or have simple presentations, but you consider groups with complicated presentations. Hence when you think in terms of presentations, the ring perspective is easier?
Which is kinda my point, I wonder if this is a nicer starting point? Because the situation is the same in topology I guess, I can show you how to make a torus as a quotient space, by introducing some relations, and this is the generic idea you âshouldâ (at least this is how I think about it) have in mind for quotient objects
Who up quotienting they fundamental polygon
well rings are in general better behaved wrt quotients than groups imo
like, it feels easier to work with ideals than with normal subgroups
I think thatâs because youâre CRAZY
Yeah that could be case, I think it could be that
Genus g surfaces my belovèd
esp comm rings but that's kinda cheating because normal subgroups of abelian groups are also well-behaved
z are units
but what if x1y1 = x2y2
If x1y1 is a unit, what does that tell you about x1
Well this could also be the point I guess haha, I did only give commutative examples there. But I think even if you get into the nitty gritty of left ideals you can still make the idea clear of relations
I mean this is kinda how I think about (some) noncom rings anyway, you take something like k<x,y>, and you say ok I donât want total non commutativity, thatâs not very interesting, so lets look at k<x,y>/<xy-1+yx> or something
Jagr may be right though that itâs just the case that the first rings you meet typically have much more simple presentations than the groups you tend to first meet
x1 is an unit, thank you @rocky cloak

You helped me a lot, nice exercise
Wait, I have to show more things
so x_i's are unit elements
But but
$\langle x_1, âŚ, x_n \mid (x_i x_{i+1})^3, x_i^2, x_ix_j = x_j x_i, |i - j| > 1 \rangle$
If itâs a Coxeter group itâs presentation is simple enough đ
Lot of peoples first groups are Z/n, but I suppose these are too simple to be enlightening
only real reflections
Cowardice
Yeah I think quotients of Z are almost so nice they can be deceptive, but theyâre certainly good examples to have in mind, usually the first thing Iâll go to for a sanity check
mico the group birb
I think the first groups I saw in my courses were like the symmetric, alternating and dihedral groups though, I donât think my first course introduced anymore than those and like GL_n
Iâd assume some other matrix groups (SO, O, SL, U, SU, maybe Sp if youâre very lucky)
I guess another thing is that normal subgroups are also groups.
Like A4 is a group people care about that has a name, etc. So you're sort of thinking about two groups when doing S4/A4.
Ideals don't do anything else besides being kernels. No one has given a name to or care anything about <xy-1+yx> by itself
Yeah probably, if you introduce one the others just make sense , but my point is we mostly stuck to the first 3 and ran with those
ideals are R-modules I suppose lol
Introduce surface and free groups and Coxeter groups and RAAGs andâŚ
That's more left ideals
yeah they're R-bimodules is more accurate
Yeah I think this is true, i do have a slightly more complex idea of normal subgroups in my head than ideals, which I literally just think of as relations (perhaps as curves if someoneâs forcing me to do AGâŚ)
But yeah, idk, this was just a thought I was having the other day, pondering how I would introduce quotient objects if I was teaching intro algebra to someone
But if you're thinking about that, then R is probably fixed and then the context is totally different
Absolute Galois Groups đż
Yeah I was debating giving a talk that involved absolute galois groups for my uni's maths society
However I'd also like my talk to be understandable
woe
What other type of Galois group is there
Non absolute i imagine
uncommon for a math talk
Potato when finite field extensions of non separably closed fields that arenât real closed (or whatever the term is)
Well the intended audience is ideally 2nd years and above. Iâm considering doing something on monodromy
It's good to pace your talk so that there is a part for everyone. You start out with some things everyone understands, then ramp up the difficulty slowly until only experts can follow. Then you should ramble for about 5 minutes about something only you understand and finish it of with about 5 minutes of rambling about something even you doesn't understand.
Recipe for a perfect talk
Any questions?
oh i asked this Q in #alg-top-geo-top
what is monodromy
I currently think of it as essentially being representations of the fundamental group. I can yap more when Iâm next at my computer
2nd year undergrads? damn i need to start grinding
Ye I meme
The 2nd year undergrads whoâd attend an optional talk here should know what a group/ring/module is, and if in the second semester they should also know some Galois theory and some point set
Oh and I guess some complex analysis
But thereâs a difference between knowing some stuff and understanding it
i am so behind damn
i wanted to take galois theory in a few days but it's only offered every other year 
Itâs probably some of my favourite maths
Galois theory is amazing
Has someone got a good video on Smith Normal form ?
I can't understand jack shit
or maybe a pdf that is very pedagogical
Specifically, I learn galois theory from Borcherd's lectures, and I remember when he drew up the subgroup diagram (labeled with indices of subgroups) and then the subfield diagram (labeled with degrees) and they were the same diagram, and that was probably the first time I've understood the idea of mathematics being beautiful as opposed to just like a fun puzzle
you learn from lectures? I have never learnt any piece of math from a lecture
or anything meaningful at least
Uhhh I mean I take the opinion that you use lectures to learn stuff for the first time and then if you want to learn it deeply you read it
oh you're not meant to just skip all lectures and read the book
huh i see..
is it more efficient than just reading the book more deeply
?
Yes
In a recent lecture I went to, over 3h we covered some basic category theory and almost a whole section of Hartshorne, including some exercises
Oh man
Phd?
MSc student interested in algebra and topology who doesnât know Galois theory here!
Any hint for part b?
I just sent you a small essay, my apologies
why apologies
I view it as lectures are a more efficient way to see lots of things which is important to get an idea of the mathematical landscape
Because now you have to read it :P
Yeah the way my university sets things up is undergrads basically have to do Galois theory to do any further algebra past intro abstract
I donât have to
idk it just seems like a weird thing to apologise for
Yeah it was very much optional at my UG, and after going to the first lecture and realising the notes were some 150 pages I decided to drop it and take a quantum computing/monoidal category theory course lol
First time I heard about the Galois correspondence was in my AT class and I was somewhat lost
I am currently learning Galois theory though, I feel like I should probably know it
mandatory galois in 2nd year can i ask where or what your institution is ?
I donât think thatâs massively unreasonable, assuming youâre at a uni that just jumps straight into LA
Australia
It is quick but I think doable
Maybe it is or isn't, but mandatory Galois in 2nd year I haven't seen in many places at least
oh its not mandatory
its just the expected pathway if you're achieving high grades and want to go into algebra
Half the reason I didnât end up taking Galois in UG was because it seemed pretty straightforward and I was very confident that I could just do it myself whenever I needed to
since you're locked out of algebra classes past the introduction if you haven't done the galois theory class
since it is "Algebra 2"
Then my masters uni deleted half the algebra courses and so Iâm now currently taking it lol
interesting, i thought australia was generally more americanish
with calc 1- calc 4 sequence
before any pure math
My institution is irregular
ig it is a very good university
is it true they have 26 weeks of college per year in aus
For instance our first sem math class is Spivak calculus/rudin (and some more computaitonal linear algebra class) and then the next sem is axler linear algebra (and a collection of misc multivariable books)
The dedicated will also do an "intro to proof" class in first sem which does a lot of like discrete stuff and then in the second sem you typically take introductory abstract algebra
my institution is 24 weeks of lecture per year
pick a countable set of points in the interval that drifts toward the endpoint zero so it has no accumulation point inside the interval consider all continuous functions that are zero on that set this is a proper ideal so it sits inside some maximal ideal that maximal ideal is not an evaluation at a point ideal because you can build a continuous function that is zero on the whole set but equals one at any chosen point of the interval to get infinitely many such maximal ideals split the chosen set into infinitely many disjoint infinite subsequences and repeat
Itâs like this in the UK and it kinda annoys me, you could learn so much more if you werenât off half the year. Granted it means academics get to do a bit more research and I got to work over summer so I could actually afford to live, but eh
At my UG it was 22 and I think at my masters itâs 20
At least here its 24 weeks of lectures per year but then like 8 weeks of the year are the exam periods
i can't lie having that time off to sort of study math at your own pace and do what you want seems nice but it's very low
Yeah that was kinda how my UG was
Ig mine was 16 lol
Yeah that would be true if I ever really did any maths over the summers lol
Oxbridge moment
my uni doesn't have courses over the summer but they have retake exams for previous courses, so my plan is to just sign up for courses i'm not going to do and do the exam in summer
Does oxford not do any lectures during the 3rd term where you half ass lecture attendance?
I know camb at least used to run classes during a 3rd term but I don't really follow camb too closely now that most people I knew there have graduated
Yeah 3rd term was basically just exam prep and exams
Same at cam
There are also sometimes misc. courses but like 1/2 a course rather than multiple lol
yeah that's what I was thinking of
wtf do you think lectures are for vro
an excuse to pay professors
So that you can skip them and feel superior
superior until you're in the exam hall
then you feel inferior

skill issue git gud
Tbh I did not go to lectures much through uni but they had very thorough lecture notes for (essentially) everything
lecture notes > book
for some reason
idrk why
Though it was bad when profs deviated a lot from the notes and then like I found out too close to the exam
me in probability fr
because the lecture notes go more in depth with more examples or diagrams, a textbook usually has wayy more to cover
E.g. my pointset topology exam was not great
why tf even have notes then
books i've read had more examples than lecture notes
the Zariski incidentâ˘
Same at Notts RAAAAAAAHHHH Nottingham mentioned RAAAAAHHHH đŚ đŚ đŚ đş đş
Deleting your postâŚ. A craven manoeuvre
soundcloud ban enpeace 'music'
Nottingham is the only place south of Durham I will defend as not being a shithole
scandinavia is the only place north of germany that i will defend as not being a shithole in europe
Places south of Durham donât exist
Anyway 40 weeks of lectures is crazy. Are your undergrads like 1 year
This is fair
it's not 40 more like 38
âItâs not 69 itâs more like 67â thats still basically double what it is here
but no it's just that our exam studying periods include lectures wheras in other unis they typically just study a similar amount since it's before exams
fs
AI use mods mods
real
you didnt calculate shit
nah I did, skill issue
Nice one, thanks
Is there any ring where no factorization exists, means there is an non unit element which cannot be written as product of irreducible elements
And why we do factorization as a product of irreducible elements, why not as a product of prime elements?
Manchesterâs nice
Literally why use AI for this lmao
wahhh i cant add numbers wahhhh i cant look stuff up wahhh
Why was it poppin at Groups Rings Fields wee early in the mornin
Iâm pretty sure Google has like a built in function for exactly that anyway
For example
k[[x]][x^-2^i : i in N]
wahh i get emotionally triggered when i see someone use ai
Why use the often wrong, more expensive less efficient version of something that there are already better ways to do though? Iâm not triggered I just donât understand
im not triggered lol
Primes are (in an integral domain anyway) irreducible, so a product of primes is in particular a product of irreducibles.
Typically we do care about things being products of primes, but it's easier to ensure something is a product of irreducibles
Yeah the ring of continuous functions in that question is an example
say on the closed interval [0,1]
then the function f(x)=x you can keep splitting it again and again forever into products of smaller power roots
I believe you cannot write it in any way as a product of irreducibles
in general rings that are very "large" you may fail to have factorization
I think you need (or at least it's enough) to have the ascending chain condition for principal ideals
problem with this is that (and I still don't have an entirely satisfying answer) not every normal subgroup is a characteristic subgroup (which are fixed under all automorphisms rather than just inner ones)
I suppose you could say that for a quotient you only need to to respect internal symmetries but
not sure if that's entirely satisfying
This is why congruences are nice, because they are the same for groups, rings, algebras, and basically every structure in math
Your can have some weirdness like if x^2 = x, then x is not irreducible even though it's principal ideal might be
But what if we are in non integral domain?
But what if we are in non integral domain?
Oh man
How can I think about such a counterexample?
notice that both of our counterexamples are actually quite similar (involving an element that can be forever broken up into increasing powers in some sense)
I mean, it's just you have an irreducible element x. Then you make it not irreducible by adjoining sqrt(x). Now sqrt(x) is irreducible, so you adjoin sqrt(sqrt(x)), etc
I see
there are a lot of standard counterexample rings that are good to know about
$Z[-\sqrt5]$ is the certified hood classic, but may i suggest the coordinate ring of the circle:
$k[x,y]/(x^2+y^2-1)$?
sergeEmbedding
p sure z root -5 still has factorization it's just not unique
Still a good example to have though
actually if you relax this condition to say, measurable functions (or all functions) on [0,1] then you can easily prove that there is no nonzero elements that can be factored
p sure that's true for cts functions as well but maybe a bit harder to show
Yes
But in Z[â-5] every element has factorization, right?
if f is a function, you can write it as $e^{i\theta}|f|$ where theta is some phase function. Then write f = $(e^{i\theta}|f|^\frac{1}{2})|f|^\frac{1}{2}$ and if f is not a unit, then neither of these two factors will be a unit either
try a field
rings are ufds
If I want to show x+3 is irreducible in Z/8Z [X], how do I show?
(vacuously)
Blake
Its a polynomial of degree 1
In the field, we can get vacuously
And the leading coefficient is invertible
Yes but the ring is not an integral domain
fields dont work
We should start teaching UA before intro abs
true and based
The deg 0 element in any factorization is invertible because the leading coefficient of x+3 is invertible
this also proves every matrix ring over C has this property I believe
using the polar decomposition and taking matrix roots
(which ultimately just means there are no irreducible elements in either of these rings)
those I suppose these are not integral domains so I guess it's not surprising
Let Z/6Z[X], then 5x + 1 = (2x+1)(3x+1)
And i think 2x +1 and 3x+1 are not unit
Tbh I think the definition of irreducible is just not really used much for non domains because its poorly behaved like this
Yeah i think so
However as for this question I'm guessing it has something to do with the specific numbers 1 and 3 and their relation to 8 so maybe you can rule out certain factorizations
So your example of ring of continuous function, it is non integral, right?
Yeah
because you can have a nonzero function that is zero on [0,0.5] and another that's zero on [0.5,1]
How?
I put it below
it's just easier to prove for all functions because you can do a polar decomposition and then use square roots
for arbitrary elements
Can anyone like explicitly explain what are the <g>-orbits here? I know what orbits are, but what exactly are these <g>-orbits? This Isaacs book give 0 explanation
orbit of the subgroup generated by g?
what does it mean precisely? Like why is <g>-orbits suddenly popping up in a discussion about permutation groups
<g> is a particular permutation group.
In general, "why is this lemma here?" is best answered by reading on and finding out which theorem the lemma helps prove.
I have to show iff ACC holds on all principal ideals of A, integral domain and any two elements of A has a GCD, then A is ufd.
ACC implies existence of factorization, how do I show the uniqueness of factorization by GCD?
assume you have two different factorizations and calculate their gcd
Where is the first line from?
This is the lemma.
God I hate this book it skips so many explanations. Uses words like "trivial" or gives zero elaboration on many of its steps. Honestly looks like its goal is to make each chapter as short and as frustrating to learners as possible.
well it says lemma 4.2 so
oh wait I can't read
Well yes I mean where does it get the theta not in Alt Omega from
by assumption g induces an odd permutation
if a book doesn't elaborate on something and you don't understand, it can be frustrating but it's a sign that there's a "standard" argument you haven't yet internalized, and working through the details is very important
yeah that's probably right i still have a long way to go
Can you remind me again what does it mean for g to 'induce' an odd permutation? Like the map of g?
I can't really picture it
so a group action on a set basically means for each element of the group you get a permutation of the set
given by the action of g
the axioms of a group action mean that this defines a homomorphism from G into Sym(Omega) as mentioned in the lemma
but the important thing is that an action is just a way of viewing any element of your group as a permutation on the set
ohh i see
thanks blake
Sorry, i don't see any progress here
Can I show every irreducible element is prime?
Say, q is irreducible element and q divides ab
this isn't enough to show it's a UFD tho
I think it is
Every element product of irreducibles and every irreducible prime is enough for ufd
Because ACC gives us that existence of factorization
ah okay I forgor about the first part
sorry I thought you meant like totally forgetting the factorization thing lol
yeah this is the way to show that every irreducible element is prime
Basically you wanna assume that some irreducible q|ab, and then calculate what GCD(q,a) and GCD(q,b) can be
this basically solves it ig lol
but it doesn't gives gcd(q,a) = q or gcd(q,b) = q, on contradiction we can assume they are 1.
well I mean you wanna show that gcd(q,a) = q or gcd(q,b) = q that proves your claim
oh wait I see your point
oh no I mean it doesn't change anything
still works
So I think a good approach is say
q divides ab. Then consider the gcd of ab and qa. both q and a divide both, so there must be an element that is a multiple of both.
If qa divides ab, then q divides b and you can do induction on the number of irreducibles in a decomposition of b
So here are two things gcd(ab, qa) = d is a multiple of qa.
If qa divides ab we are done.
If qa doesn't divide ab
Isn't d divides qa and qa divides d?
Oh my bad
d is not a multiple of qa
q and a divides d.
I don't understand the case, qa doesn't divide ab
I'm saying d is a multiple of both a and q, and it divides ab.
If d = qa, then q divides b.
If d = ab, then b divides q, so they are associate.
If d is a proper divisor of ab, then you can write d as ab' where b' is a proper divisor of b, and continue by induction
I guess you can probably assume b irreducible from the onset to avoid induction
How do I show that if an abelian group is divisble by p then it contains an element of p
ik i can use FTAG
but i'm not sure howt o
I don't fully understand ftag
Well, from FTAG you just need to note what the order of a product of cyclic groups is, to reduce it to that case.
You can also prove this by induction if you don't won't to involve as complicated machinery as FTAG
So FTAG states that every abelian group is isomorphic to cyclic groups with order of a power of a prime
I'm not sure if i'm understanding it correctly
It is the product of those yeah.
And do you know what the order of a product of groups is?
The order of each group multiplied
i don't see how to use it
So hold on
So then if the order is divisible by p, what does that say about the order of the cyclic groups appearing in the product
wait maybe i do
So I know that there must be a subgroup of order of power of p right
Yup
So now I just have to show that if a group contains order p^n it contains element of order p
I reckon it's a contradiction proof then
Well even more specifically you have to show that the cyclic group Z/p^k has an element of order p
So of course it has an element of order p^k, say A^{p^n} = 1
Would it be correct to say
(A^{p^{n-1}}) has order p ?
Since
Yeah exponenet laws
I'm not sure if this correct
What part?
A^{p^{n-1}} is our element of order p
if b is irreducible then we can say, since d is a multiple of a then d = at, and d divides ab implies ab = ats implies b = ts implies d associate with a or d associate with ab.
$A^{p^{n-1}}$
mq
Indeed, if d associate with a, then q divides a.
If d associate with ab, that means ab divides qa
Well, try to prove what the order of A^p^n-1 is. Start by unwrapping the definition
i'm 98% sure it's correct since if it's anything less than that would contradict A's order
If it's more well it doesn't matter because exponenet laws already give 1 before
Yes
b' is a proper divisor of b, is it necessary that b' is the some reduced form of factorization of b?
I'm not entirely sure what you mean, but probably not.
It's just that if you have a chain of proper divisors
b -> b' -> b'' -> ...
it must terminate
I see
I have one question for you guys, how do you maintain yourself to touch within all mostly areas of mathematics?
I don't think that is humanly possible for the last 100 years or so.
But as you, you know undergraduate and postgraduate concepts very well
how can i show that there's a subgroup of order p^n-1 inside a group of order p^n?
thats far from all areas of mathematics
atom vs universe type shit
My bad
You can show in a group of order p^n there is subgroup of order p^i, for all iâ¤n.
Use induction and use the fact centre of p group is non-trivial
Okay ignore that, but if you get what I mean you can answer 
do lots of math
also, once youve learn something usually you can reread the definitions to refresh your brain
reminds me of the cool properties of p^n groups
Center is non trivial
Every normal group has non trivial intersection with the center
Every subgroup is properly contained in its normalizer,
what did I miss ?
almost every group is a 2-group
I remember looking at the table of number of groups of a given size
It jumps up so much for powers of 2
my dumbass thought you meant a 2-group instead of a 2-group there - that would've made be look silly!
there must be an element of order p by cauchy's theorem. So let H = <p> and let H act on Z(G). We have that H is contained in Z(G), so H is normal. So consider G/H which has order p^{n-1} and therefore has a normal subgroup Q of order p by the same reasoning. I want to then send Q back to G... idk if this is possible
99% of the first 50 billion groups have order 1024 I think I saw that stat somewhere
right? and statistically it makes sense but its still crazy
2-group instead of 2-group uhuh right
I genuinely thought you meant "monoidal groupoid with all objects invertible" for a solid 2 minutes and I tried to think of a group that couldn't be viewed like that
Itâs weird that a group object in Grpd and a group of order 2 have the same name
Brother lay down the nlab
the answer is any non-abelian group if you do the standard delooping thing btw. It has to be abelian by eckman-hilton
It makes sense for me because like
Thereâs a lot less restrictions (from Sylow, Cauchy, etc) on what your group can look like if you only have one prime
And powers of 2 are exponentially smaller than the same powers of higher primes
yes that's what I meant by "statistically"
And finite group theory is basically Combi /hj
One day I will learn how to use eckman Hilton. May be the only result Iâve ever proven without understanding literally anything about it
its basically when the thingy and thing and then abelian
I mean this is the extend of my understanding
The funniest thing I remember about Eckmann Hilton is when one of my friends called it would be on our algtop exam despite it not being taught in the course (although it was of the form âtopological group has abelian fundamental groupâ)
The proof I did was draw this diagram, play with it and prove these things commute
Yeah I know itâs got something to do with homotopy groups but Iâve no idea what
it's for proving higher homotopy groups (n > 1) are abelian
But hey, Iâve proven itâs true in any monoidal category with sufficiently many adjectives
cuz you've got two+ compatible operations and that satisfies the hypothesis
Ah I see
I like the cute visual moving squares arguement
yeah
how can you construct a homomorphism from Q to G?
yum
this is the actual homotopy

we are in an algebra channel. MY algebra channel. You will write down SYMBOLS in your proof and not COLOUR IN your PRETTY PICTURES as a SUBSTITUTE
maybe this is obvious but i can't think of any nice maps from Q to G that are well defined
Q is normal so you can go to G/Q, use the induction hypothesis, and then take the preimage via the surjection mapping p : G -> G/Q
Q is a subgroup of G/H
Suppose we have a path connected covering p: G -> H where H is a topological group
Prove that there is a unique group structure on G (if we fix a preimage of e_H) where p is a group homomorphism, with this structure, ker p is abelian
so G/(Q) isnt defiend is it
ah well then use the induction hypothesis on G/H
this gives a subgroup of order p^n-2
then you take the preimage of that subgroup via the projection p : G -> G/H to get a subgroup of order p^n-1, as desired
totalitarian dictator
how do you guarantee the preimage is a subgroup though đ
that's always true..?
is it
like not even just for groups but for general algebraic structures
oh wait
How do you feel about this as a proof
Or, well, a statement of the theorem
Yuh
I've forgotten how to read these icl
Yes, you see the braiding in the second diagram
Ok yeah so the preimage is a subgroup (since (q1 * q2) -> q1q2H implies q1q2 are in the preimage, and same for inverses).
Though, the graphical calculus is only known to be sound and complete for braided categories in like up to 3 dimensions IIRC
I love it when stuff can get braided
quandle-pilled
I remember reading some insaneo paper where they attempted string diagram esque constructions for 4-categories
I love drawing things which cannot be pictured
This looks like my first intro to abstract algebra
operad-pilled first year UG course
If you started out with "Categories for Quantum Theory" then fair play lol
eckman-hilton? i heard that in one of the g++ videos
but gee, you might say
How do I work out Inn(Sn)
Hint: For any group G, we have an isomorphism G/Z(G) = Inn(G) (why?). So, it suffices to find the center of Sn
Let G be a finite group and let N be a normal subgroup, with |N|=3 and N is not contained in the center of G. Show that G contains a subgroup with |G:H|=2.
no idea how to start on this
i'm thinking about N acting on G by conjugation
if u know how to do don't tell me yet just give hint if u can đľ
you should probably do it the other way around
G acting on N
then that should give you some information about G
exactly
every group G of order 99 is abelian.
n_3 = 1 mod 3
n_3 | 11
so n_3 = 1
n_11 = 1 mod 11
n_11 | 9
n_11 = 1
so P_3 x P_11 = G
= C_11 x P_3
P_3 is abelian since it has order p^2.
C_11 is abelian since ithas order p.
so the product is abelian
yep
sylow computations are so fun fr
Let |G| = 168=7*2^3*3 and G is simple.
a) Then n_7 = 1 mod 7
and n_7 | 24
so n_7 = 8
So there are 8(6) elements of order 7.
b) G has a subgroup of order 21 since:
|G: N_G(P_7)| = 8 -- so N_G = 21.
c) Suppose G has a subgroup of order 14, H.
n_7 = 1 mod 7
n_7 | 2
so n_7 = 1 in H
We know that H is in the normalizer of P_7 so 14 | N_G(P_7) which is a contradiction
Let |G| = 7 x 43 x 17 and suppose the center contains an element of order 7. Show G is abelian.
n_7 = 1 mod 7
7 | 43 * 17
7 could equal 1 or 43
n_43 = 1 mod 43
n_43 | 7*17 => n_43 = 1
n_17 = 1 mod 17
n_17 = 1.
The center contains an element s of order 7. so <s> is a p-sylow subgroup and s is in the center which implies <s> is normal. So G is isomorphic to P_7 x P_17 x P_43 which we know is cyclic since they have relatively prime orders.
an easier conclusion is that G is abelian because its the product of abelian groups
external direct product u mean right
like we still have to show normality
but yeah i agree thats nicer
i mean technically this ones internal
but i havent seen someone care about the difference between internal and external direct product in a while
yeah i just mean direct product đľ
well we dont have to show normality
why
unique sylow subgroups are normal
im confused
like
whats the problem
no problem xd
oh
i mean yes you are right
if they werent normal we couldnt do a direct product
Let G be a group of order 5x11x17.
n_5 = 1 mod 5
n_5 | 11*17 so n_5 = 1 or 11
n_11 = 1 mod 11
n_11 | 5 * 17
(5*17)mod 11 = 5 * 6 mod 11 = (30 mod 11) != 1
so n_11 is 1
n_17 = 1 mod 17
n_17 | 5 * 11
n_17 is 1
G must contain an element of order 187 = 11*17 since there is a subgroup of order 187 (the normalizer of P_5) and we have that any group of order 187 is the direct product of C_11 x C_17 so its cyclic so theres an element of order 187.
I want to show that if G has an element of order 55 G is cyclic
not rlly sure why
somehow i want to show that n_5 is normal
if s has order 55 <s> = C_5 semidirect C_11 (C_11 is the normal one)
pretty sure some slight number theory can be done here but idk
actually wait no nvm
normal one goes first
at least how i learned it
it depends which way u point the triangle đ
hiidostuff
in class i see both a lot
wait
oh this is obvious
wait no this isn't obvious đ
im wrong
I was thinking we could take the element of order 55 and element of order 187
and say G = C_55 x C_187
but we don't know that <s> where |s| = 55 is a normal subgroup
wait
we can semidirect product shit tbh
then G would have order 5 11^2 17
C17 semi C55 could work
we can do G = C_55 x C_17.
We know 17 is normal
yeah
and then since 17 doesnt divide 54
yeah
we get that G = C_(55*17)
damn i have to relearn all of the semi direct product stuff
Why is every cyclic subgroup of Q_8 (the quaternion group) x C_n where n is odd normal?
oh
every subgroup of Q_8 is normal since they all have index 2
and then the rest follows
fun fact Q8 is one of the only nonabelian groups with all normal subgroups
In group theory, a Dedekind group is a group G such that every subgroup of G is normal.
All abelian groups are Dedekind groups.
A non-abelian Dedekind group is called a Hamiltonian group.
The most familiar (and smallest) example of a Hamiltonian group is the quaternion group of order 8, denoted by Q8.
Dedekind and Baer have shown (in the finite ...
Thatâs pretty cool
and in a sense its the only one since all others are Q8 times some abelian stuff
(not anything abelian, they have a specific form)
One of them has index 4, but that one's the center, so it's also normal
Yeah <-1>
So far I havenât been convinced the typical groups that we work with in group theory are very interesting
I like doing stuff in cyclic groups and arbitrary finite groups and Sn and S_\infty
but i dont like the dihedral group very much
the infinite dihedral group is p cool
matrix groups over finite fields are also quite cool and imo underrepresented in courses on group theory
although I believe that saying a lot about them is more advanced which maybe explains why
i dread doing stuff in matrix groups
Matrix groups over finite fields are also cool, they give you a proof of the sylow theorems for example
yeah that's my favorite proof of the sylow theorems
whats the proof?
so basically because every group can be embedded into some general linear group over Fp for any prime p
you can do some reductions and its enough to prove the sylow theorems for the prime p in GL(Fp)
this is probably the least intuitive step tbh and requires a bit of work
but once you have GL(Fp) the proof is really nice (if you are familiar with some linear algebra)
suppose H is a p-subgroup of GLn(Fp)
then H acts on the nonzero elements of Fp^n (since invertible matrices don't map anything other than zero to zero)
but since there are p^n-1 nonzero elements and the order of H is a multiple of p, there must be a fixed point by orbit stabilizer
i.e. a vector v fixed by the entire action of H
then you quotient out by v and basically repeat this argument
and what you get is a basis v1, v2, v3, ... , vn for Fp^n
such that v1 is fixed by H, v2 is fixed by H up to a multiple of v1, v3 is fixed by H up to a linear combinatino of v1 and v2, etc...
and if you think about it, that just means the with respect to this basis, the group H is upper triangular
so in particular choosing some change of basis matrix P
you find that PHP^{-1} is a subgroup of the upper triangular matrices
if you just compute orders, its easy to see that the upper triangular matrices form a sylow p-subgroup
thats pretty crazy actually
and so you automatically get that every p-subgroup is a subgroup of a sylow p-subgroup and that every sylow p-subgroup is conjugate
I believe you should be able to get the rest of sylow but you might have to just use the same argument as in the usual proof
math is wild
wait can you explain to me the importance of O(n) and SO(n)
SO(n) is the group of rotations in n dimensional space
and O(n) is rotations + reflections
Yeah
which are nice because they preserve length
and SO(n) also preserves orientation
so they show up a lot in physics just because rotations are useful
they're also nice because they are compact groups, which makes them a lot easier to deal with mathematically (this is in the theory of topological groups)
What do the finite subgroups of SO(n) represent
finite rotation groups of the sphere, of which there aren't actually that many. I believe they correspond to nice shapes in 3D
platonic solids have a group of their rotations and there are some more
also fun fact: the finite subgroups of O(n) are exactly the finite groups that admit a planar cayley graph
which is a really awesome theorem proved by Maschke
I did a preserntation on that for a 4th year group theory class
although in hindsight I put wayyyy more effort into it than I'm pretty sure the prof was ever intending
these are all of them
S4 is the group of rotations of a cube or octohedron and S4 x C2 is the group of reflections + rotations
A5 and A5 x C2 are the groups of rotations and reflections + rotations respectively of the dodecahedron and icosahedron
or sorry
understanding stuff like this is probably where i'm the weakest out of the group theory content i've covered so far
i always want to actually imagine rotating the cube đ
but im bad at doing that in my head
i need a physical cube in real life or something lmfao
its alright its kinda hard for everyone I think to orient shapes in their head
you can see A4 as the symmetry of the tetrahedron by imagining the symmetries of the vertices - you can't rotate a tetrahedron so that you just swap two vertices
i just envisioned a 3 dimensional cow with a helmet on doing a sick ass kickflip in the middle of the street i live on in my head
i can imagine cows rotating but i cant keep track of the vertices lol
S4 you can maybe imagine via the space diagonals, but thats less clear to see imo
i dont know of a nice way to see symmetries of the icosahedron as "even permutations of 5 elements"
I think there's probably some way
even-ness corresponds to the fact that orientation is preserved
isnt this only clear after knowing that the icosahedron can be given as an embedding of 5 congruent cubes in a certain way
i have seen a way but its not nice
like you could color the faces in a certain way with 5 colors
this is probably that
if you want groups that are really impossible to visualize, you can take each of the group of rotations of the sphere and take their double cover in SU(2)
rip i havent done covering spaces yet
learned about the fundamental group on wednesday tho so were getting there
you don't entirely need to know covering spaces, just the fact that SU(2) maps onto SO(3) with kernel {+-1}
there is a pretty elementary way to "see" that SU(2) double covers SO(3)
i have some homework assignment on the universal covering space of SO(2)
i mean i dont know what SU(2) or double covering means
SU(2) im guessing is the unital subgroup of SO(2)
its a subgroup of 2x2 complex matrices
its 2 by 2 unitary matrices
unitary matrices
with det 1
^
oh wait sorry
oh ok
oof thats a nasty space if I recall
yeah the homework is to show it's not a linear lie group
but no spoilers please
damn u guys know so much abt math
idk how to prove it dw
lfg
I just heard about it in a borcherds video
the hint our prof gave us is half a page long lol
by the way, his group theory lecture series is quite good (although lacks a lot of details)
is this the symmetries of a circle
its the symmetries of the integers
if you think about it, if you take a polygon with infinitely many sides you basically get a big line
but on a circle you can have rotations at irrational angles
you can essentialy see that SU(2) is isomorphic to a 3-sphere, and SO(3) is a ball with antipodal points identified. this gives you a double cover
so the symmetry group of the circle is at least uncountable
where you include both shifts (rotations) and reflection (multiplication by -1)
so its actually isomorphic to the group of functions from Z to Z of the form x -> ax+b where b is an integer and a is plus or minus 1
its a subgroup iirc
it is not, since the symmetries of the circle are abelian
fr?
even if you include reflections I believe it isn't
no yeah ur right
yeah I meant just the rotations
but I don't think you get a copy of the infinite dihedral group even with reflections
wait so isnt the shifts of Z also abelian
but like
oh
Z is a subgroup of the circle
your point about abelianity doesnt make sense anymore at least to me
the infinite dihedral group is nonabelian, so cannot be a subgroup of rotations of the circle
but it can be of the symmetries of a circle right
or if it isnt then its for a different reason
I don't believe so
to have a copy of the integers you would need an irrational rotation
lets call this irrational rotation r
then lets let s be a reflection
to obtain a copy of the infinite dihedral group we would need srs = r^{-1}
actually maybe you can do this
and we do have this correct
i remember accidentally creating this subgroup on accident on my first ever algebra hw iirc
ahh look at me screw up
where has the time gone
(this was 5 months ago)
noooo
hey it was a good screw up at least
yeah actually it does give a copy of the infinite dihedral group that's nice
although you are going to have uncountably many subgroups isomorphic to it so
perhaps less nice
tbf this is expected
yeah
not expected by me 5 months ago but it is expected now
anyway probably my favorite finite groups are the symmetry groups of mobiles
mobiles like baby mobiles?
yeah
my math ice breaker is usually favorite group and favorite soup
heres a mobile and its symmetry group
PGL_n i guess
its actually a really good conceptual exercise to convince yourself that this is actually the correct group
and also to figure out what the action is
that's a complex mobile lol
we gotta get the babies started on semidirect products early
is this also C3 wreath C3
yeah its an iterated wreath product
oh the bottom things are also triangles
yeah its (C3 wreath C3) wreath C3
i know my least favorite group
but wreath products are just semidirect products
i love K4 the klein 4 group
delightfully many coincidences because its so small
what is it
soup
my least favorite group is SL_3
frobenius group of order 20
at least for mobiles you couuld continue infinitely (in theory) but idk how to actually write down the resulting group
reason being i had an exam on it last week and am 90% sure i got a C on that jawn
the group would be ((((C3 W C3) W C3) W C3) W C3) ...
exam on one group
where W is wreath
this looks like an owl face
i hate SL_3 because i've been learning algebraic groups and all the examples i've done are GL_3 and SL_3
and i'm sick of seeing those damn 3x3 matrices
like semidirects, groups acting on themselves by conjugation, and nilpotency/solvability
the frobenius group is quite nice
in my sleep im probably mumbling some bullshit like "let G be SL3 and B its borel of upper triangular matrices and T the maximal torus and P a parabolic"
how do u show that {f : f(0)=0} is a maximum ideal for R^R
Show that the quotient by it is a field
and why can u do that?
Because the quotient by an ideal is a field if and only if the ideal is maximal (if you havenât seen this, try and prove it from the correspondence theorem)
ok ty
stalks o.O
But if you want to prove it from first principles, it's straightforward to show that an ideal that contains {f:f(0)=0} and at least one g with g(0)!=0 must contain everything.
Hey all, I plan on reading about rings, fields, and modules in D&F. I already did most of the chapters on groups, probably around 60 exercises so far in total. For rings, fields, modules, in D&F, that would include chapters 7, 8, 9, 10. I want to do some exercises from each chapter to test my knowledge. A minimum of 1 exercise per section. Iâm having trouble figuring out which problems to do. Anyone here familiar with D&F have any recommendations or old homeworks from those chapters that I can go over?
I have some psets I can send you when I was taking algebra
we were following D&F
I'll send the links here
That would be great!
Awesome, thank you
How do we know that this equation is minimal
If s had a smaller minimal polynomial, then you would also get a smaller minimal polynomial for y
(because y = sx)
are you guys familiar with "mind maps" they're like VERY short notes connecting the dots in a subject. does someone have one for introductory group theory? because i get soo confused with the theorems and results.
the whole point of mind maps is to do them yourself
Yeah, it's not having the resulting diagram that helps any; it's the mental effort of deciding how it should go.
I would argue both are useful
But i agree trying to find the connections yourself and building the mind map is the key benefit of mind maps
Yeah having it definitely still helps, but itâs kinda just like less effective flash cards
Which Iâve decided to start experimenting with this year, Iâve never done it before but Iâm enjoying it so far. It makes reviewing what ive been up to recently much easier. I just start every day by quickly flipping through them
Weâll see if it translates to tangible exam benefits, but Iâm hoping yes. One of my biggest issues in maths is recall, I lose things quite quickly if Iâm not actively using them
nahh i'd say they have quite different purposes, flashcards are primarily for recall, wheras ind maps are trying to see how different ideas connect to each other, of course you do both in either, but i'd say the key purpose of each one is different
Yeah thatâs fair
I started anki for ring theory, it is amazing
I used Anki throughout my undergrad
Anki is good
Anki is like ÂŁ20 on Apple, fuck that
Iâve just got some classic little flip books, Iâm liking it so far though
I use it free on computer instead
Cant believe it costs money on ios
Yeah and itâs a kinda silly amount as well
quizlet on sheaf theory concepts đĽ
this is so funny because I always associate flash cards with highschool stuff

Iâve never used them for anything before, but Iâve decided to give them a go haha
It usually takes me a while to warm up to doing actual work in the morning so this is a nice way to drill definitions and proof outlines while I had my coffee but yeah like spaces with polynomial cohomology is a crazy flash card
yurrr
geology was genuinely one of the more fun parts of geograph
y
Aw Hell Nah
lmao yeah 
there was a guy here who was named OH HELL NAH!!
I do the linked in games when I first wake up
But it still takes me a while to get to maths readiness
i am most motivated in the morning by far
first person ive ever talked to that actually plays linkedin games
yeah but it's linkedin
ya f dat shi
Iâve got beef with the word games and the sudoku is whatever
we hate jobs we hate the real world
when I wake up I drag myself out of bed, die, resurrect, eat cornflakes (straight out of the box), then die and rebirth
that's my morning routine
good routine
you guys have linked in?
i do but i dont use it
I should get my head in the game
i finally did make one this year
I genuinely just got it for the games
i used to be an engineering physics major so i had a linkedin
then i changed to math before my first semester lol
linkedin games
Wait but I think the desktop app is (was?) free? How do they manage to charge for a mobile app with that?
OMG I'm yellow!!!?
Why?
People want both apps
Afaik the mobile app is their only source of income
Also
The web version kind of sucks on iOS
Also congrats on pissing
Have you considered dihydrogen monoxide supplements?
scary words that must be bad element
I mentioned you ask really cool questions and give helpful answers a couple weeks back when they were discussing the updates to honourable, well deserved!
-# noted, I ask bad Qs and give unhelpful answers 
the dichotomy fallacy
or something
THE DICHOTOMY CONJECTURE HAS BEEN PROVEN RAHHH ANOTHER WIN FOR UNIVERSAL ALGEBRA
the what
How u do that weird subtext?
-# thatâs for me to know, and for you to find out~
dichotomy is when only two options
so you (jokingly) implied that the only options were good questions and good answers or bad questions and bad answers
Honour has been bestowed
holy crap
well they are! /s
in all seriousness i know i'm not the honourable type
I'm not even sure who decides the honour role or on what grounds
gojo be like
purely vibes
I'm sure
I alone am the honored one-
unfortunately you're not pissy enough for that enpeace
Can i be dishonourable
I think that's just called banned
I do not have white hair, nor the rizz of gojo mcgojoguy
There is a slight in between with the minus role
Annoying enough to be banned from all the actual channels but not enough to be from the server
