#groups-rings-fields

406252 messages · Page 597 of 407

oblique river
#

plug in (0,0) and all that's left is psi(0,0)

#

i.e. the constant term of psi

maiden ocean
#

Oh yeah duh product rule

#

Ok

#

So right yeah

#

and then when we pass to the local ring f is gonna look like 0 and we know that phi is non-zero at 0

#

so you get y = gx = - phi psi^{-1} x

#

(abusing notation a bit bit yea)

#

then M_P is generated by (x, y) = (x, gx) = (x) and thus is principal and so O_X, P is local with non-zero principal maximal ideal and thus dedekind

oblique river
#

yeah that sounds right ot me

maiden ocean
#

epic

#

thanks buncho nozoomi

oblique river
#

np!

#

how is szamuely going overall?

maiden ocean
#

Sorry wifi lmfao

#

its going well!

#

I think

chilly ocean
#

is any (finite?) symmetric group a non trivial product?

woven delta
#

No, the only nontrivial normal subgroup of the symmetric groups for n>=5 is A_n

#

@chilly ocean

chilly ocean
#

what about infinite ones?

woven delta
#

Apparently for the symmetric group on countably many elements there are only 2 nontrivial normal subgroups (according to Wikipedia). These are the set of permutations that fix all but finitely many elements, as well as the even permutation subgroup of that

#

I think this is pretty interesting, I wonder if the reason for this is because the thing that determines if 2 elements are congugate in this group are the cardinality of the set of elements that are fixed as well as the cardinality of the set of elements that are not fixed

#

Actually probably it's a bit more complicated than that

oblique river
#

is it?

woven delta
#

I think you just need a bijection between orbits

oblique river
#

that seems reasonable to me

#

yeah, I agree

#

it's basically just cycle type decomposition

vestal snow
#

Can someone explain to me what I have to prove here?

#

The book only defines the Zariski tangent space for local rings and schemes, and in this exercise, A is an arbitrary and "the Zariski tangent space of A" makes no sense

oblique river
#

Its common to just use A to refer to Spec A

#

I think thats what theyre doing

vestal snow
#

Oh okay

#

But they need to specify a point right?

#

Can you write out exactly what the exercise wants me to prove?

oblique river
#

The point is the point m

vestal snow
#

What does the "cut out" part mean?

oblique river
#

Imagine like R^2 and some curve through a point P

#

R^2 has a tangent space at P

#

And so does the curve

#

And the tangent spacr of the curve is a subspace of the tangent space of R^2

#

That’s the picture

#

R^2 is spec A, P is m, and the curve is spec A/f

vestal snow
#

And it wants me to consider the tangent space cut out by f in the tangent space of A

#

What exactly is that?

oblique river
#

Write down the tangent space of A/f at m

#

And there should be a natural map

vestal snow
#

The tangent space of A/f at m is just Hom(m_f/m_f^2, (A/f)/(m_f) where m_f is the image of m in A/f

#

Of course, (A/f)/m_f = A/m

oblique river
#

Write down a specific example where there’s easy geometry you can see

#

Like the picture I gave earlier

#

Consider R^2 and the origin and the curve y=0

#

A = R[x,y]

#

Or C instead of R if you prefer

#

m = (x,y)

#

f = f(x,y) = y

#

Now you can see that A/f = R[x] and its spec is just the x axis

#

Sitting inside R^2

#

And the tangent spacr has dimension one less than the tangent space of R^2

#

Now write down all the homs and keep track kf all the maps

vestal snow
#

I think you're misunderstanding my question

#

You know how we say that f cuts out a portion of Spec A which is Spec A/f

#

Here it's saying that f cuts out a portion of the tangent space of Spec A which is ...?

#

I don't know what ... is referring to

oblique river
#

The tangent space of A/f

#

The tangent space of A/f is a subspace of the tangent space of A (at a point)

vestal snow
#

Like what is ... exactly

oblique river
#

No, what you have to prove is that the tangent space of A/f is cut out by f

#

In some sense

vestal snow
#

Yes

#

But what does it mean by "the tangent space of A cut out by f"?

#

Like what is this thing as a set/topological space/scheme

oblique river
#

It’s just describing an algebraic operation

vestal snow
#

Do you know of a proof?

#

I think it would be better if I just see it

oblique river
#

Like, f mod m^2 is an element of m/m^2

#

And you can quotient by it

#

And get a map on tangent spaces

vestal snow
#

Essentially I need to prove A = B but I don't have a description for B

oblique river
#

And that inclusion is exactly the inclusion of the tangent space of A/f

vestal snow
#

*a formal description

oblique river
#

I am giving you one lol

vestal snow
#

The one you are giving me is A

#

which is exactly what we have to prove

#

Unless i'm misunderstanding

#

which is possible

oblique river
#

No…

#

There is the tangent space of A/f at m

vestal snow
#

Yes

oblique river
#

And there is the subspace of Hom(m/m^2, A/m) induced from the quotient of m/m^2 by the element f mod m^2

#

m/m^2 —> m/(f + m^2)

#

Induces a map on homs going the other way

#

Those are the two things

vestal snow
#

Ah okay

#

Now I understand

#

I think

#

Let me write this down

oblique river
#

So like stepping back for a sec, this is an occasion where i think you should try to fill in the holes a little bit yourself

#

There is not much that “subspace of tangent space of A cut out by f” can mean interms of like

#

Algebraic operations

#

Also, assuming the problem is correct (which is a good assumption)

#

Even if you dont know what B is exactly

vestal snow
oblique river
#

You know what A is and you know A = B

#

So you can use that to sort of back-solve for B

#

And a good way to do this is to write down explicit examples

#

When youre doinf research, youre not always going to have someone who can tell you these things

#

And learning how to fill in holes on your own is more important than just trying to learn a bunch of statements

oblique river
#

M^2 + f contains m^2

vestal snow
#

Yeah I usually try and do that but this particular exercise was a bit confusing

oblique river
#

So once you wuotient m by m^2

#

You can quotient further by m^2 + f

vestal snow
#

Mostly because the book just introduced (co)tangent spaces and then used a couple of new vocab at once

azure plinth
#

Might seem dumb but I am stuck with this one: Write $x_1^2x_2+x_2^2x_3+x_3^2x_1$ in terms of elementary symmetric functions in $x_1,x_2,x_3$.

cloud walrusBOT
#

AidenM27

azure plinth
#

I got the representation in that form for $\sum_{i\neq j}x_i^2 x_j$ for $i,j\in{1,2,3}$, but have had no luck with this special case of it, so to speak

cloud walrusBOT
#

AidenM27

hidden haven
azure plinth
#

Oh. Boy. Thanks a bunch, I will go down that route mate

#

Ah I got stuck again in that train of thought. What I did in my first attempt was this

hidden haven
#

Do you know how to write Σᵢ xᵢ³ in terms of elementary symmetric polynomials? You'd need that for what I'm doing

#

You can try to figure that out separately, then plug things into the above

azure plinth
#

$s_1=x_1+x_2+x_3, s_2=x_1x_2+x_2x_3+x_1x_3, s_3=x_1x_2x_3\implies s_1s_2=x_1^2x_2+x_1x_2x_3+x_1^2x_3+x_1x_2^2+x_2^2x_3+x_1+x_2+x_3+x_1x_2x_3+x_2x_3^2+x_1x_3^2)\implies s_1s_2=3s_3+x_1x_2^2+x_1^2x_3+x_2x_3^2+(x_1^2x_2+x_2^2x_3+x_3^2x_1)$

#

Ah I can attempt that but what I am concerned about is ending up with the terms $x_1x_2^2, x_2x_3^2, x_3x_1^2$, which I cannot seem to resolve to arrive at an answer

cloud walrusBOT
#

AidenM27

hidden haven
#

Wait so did you just get s_1s_2 = 3s_3 + twice the polynomial that you need?

azure plinth
#

Not twice actually

hidden haven
#

And the intermediate calculations seem wrong, everything in between should be degree 3 homogeneous

azure plinth
#

Ah that's a typo

cloud walrusBOT
#

AidenM27

hidden haven
#

oh damn I didn't realize that the original thing isn't completely symmetric

azure plinth
#

Exactly, that's what happened to me as well

hidden haven
#

But you can't write non symmetric polynomials as products and sums of symmetric ones

#

For anything written in terms of symmetric polynomials, you could apply a permutation on the variables and the expression should remain unchanged

azure plinth
#

Right, that's what struck me now

hidden haven
azure plinth
#

Yeesh, gonna have to take it up with the prof then. Some problem set (not for grades though). I will let you know if I make any progress

unique juniper
#

there is an algorithm to write it in terms of elementary symmetric functions

maiden ocean
#

so im kind of confused here

#

K(X) is the field of fractions of O_X, P

latent anvil
#

Yup

maiden ocean
#

so i think here we need K(X) a finite extension of k(t)

#

but im not sure why thats true?

latent anvil
#

hmm

#

So we have a dvr A = O_X,p

#

And we're taking the field of fractions K = K(X)

#

Yeah?

maiden ocean
#

Right

latent anvil
#

So choose t as in there

maiden ocean
#

in K(X)?

#

or O_X, p

latent anvil
#

No this is in A

#

Yeah O_X,p

maiden ocean
#

Ok yea

#

generator for the maximal ideal m

latent anvil
#

What do elements of A look like?

#

They're like a t^n for some unit a

#

Yeah?

maiden ocean
#

I think so?

#

OK yea

#

i remember this

latent anvil
#

Yup

maiden ocean
#

so then the field of fractions is like at^n/bt^m with b(p) non-zero

latent anvil
#

Yeah

#

So why is this finite over k(t)...

#

The only variance is like, a unit

maiden ocean
#

er just backing up for a sec:

latent anvil
#

yup

maiden ocean
#

are the a, b in k?

#

shouldnt they be in O(X)?

latent anvil
#

They are not in k

#

If they were in k we'd have K = k(t)

#

They're units of A

#

So functions on X which don't vanish at p

maiden ocean
#

yeah so how exactly do we think of at^n/bt^m as an element of k(t) since the coefficients themselves arent in k

#

Unless im being really dumb

latent anvil
#

It isn't an element of k(t), it's an element of K(X)

maiden ocean
#

Oh wait

#

Im dumb

latent anvil
#

?

maiden ocean
#

Right it just contains k(t) by taking the case where a and b are constant functions right

latent anvil
#

Yup

maiden ocean
#

okay that makes more sense lmfao

latent anvil
#

That's the way we extend it

maiden ocean
#

exactly

latent anvil
#

And I agree that we want to show K/k(t) is finite

maiden ocean
#

so we need finiteness and then char 0 will imply by the primitive element thm that K(X) = k(t)(s) = k(t, s)

latent anvil
#

We're in char 0 so separable isn't an issue

#

yup

#

Oh maybe this is easy

#

hmm

#

I'm thinking we can choose finitely many functions generating the coordinate of X overall

maiden ocean
#

Ummm i think

#

that makes sense

latent anvil
#

Hm but when we localize to get O_X,p we like, lose some amount of finiteness

#

Okay so backing up a sec

#

Do you know Zariski's lemma?

maiden ocean
#

if X is integral then O(X) is finitely generated

#

as a k[x] module

#

Uh no i do not

latent anvil
#

oh, I meant finitely generated as a k algebra

#

Zariski's lemma says that a field which is a finitely generated algebra over another field is actually finite over that field

maiden ocean
#

wait yes i have heard this

latent anvil
#

Nice!

maiden ocean
#

This is a problem in the AM chapter that i paused AM doing becuase it was boring opencry

latent anvil
#

So we can make the goal a little easier

maiden ocean
#

chapter 5

#

Ok yeah

#

we need to show that its finitely generated as a k(t) algebra

latent anvil
#

so choose finitely many generators f1,...,fn for the coordinate ring of X

#

These are generating it as an algebra over k

#

Hm

maiden ocean
latent anvil
#

I thought I saw an easier proof but it didn't work

#

So lets continue

maiden ocean
#

so ur claim that when we write 1 = a1f1 + ... + anfn the ai are constant?

latent anvil
#

No

maiden ocean
#

and can be regarded as elements of k?

latent anvil
#

That would be generating it as a module

#

Generating it as an algebra means that any element is a polynomial in f1,...,fn

#

With k coefficients

maiden ocean
#

wait O(X) is literally a quotient of k[x] im silly

#

Ok yes

latent anvil
#

No!

#

the only (reduced) quotients of k[x] are an affine line or finitely many points

#

A curve like y^2 = x^3 is not a quotient of k[x]

maiden ocean
#

uhhh

#

oh wait right fuck

#

i mixed it up its a quotient of k[x, y]

latent anvil
#

Why?

maiden ocean
#

umm we're working with integral plane curves arent we

latent anvil
#

Take the curve parameterized by (t^3, t^4, t^5)

#

Oh it said plane curve?

#

I don't see where it says that

#

The result you're trying to show is about plane curves

#

But it doesn't restrict X to be such

#

Right?

maiden ocean
#

er affine curve

latent anvil
#

So the thing is, we know X can be embedded as a closed subset of some affine space

#

yeah?

maiden ocean
#

omg wait theres like 6 notions of dimension at play here that im mixing up

#

integral affine curve means K(X) is of transcendence degree 1 over k

latent anvil
#

It's the vanishing locus of an ideal I of k[f1,...,fn] and then the coordinate ring is k[f1,...,fn]/I

#

Oh!

#

I hadn't thought about that

#

I think that's important here

#

It says K(X)/k(t) is algebraic

#

But why finite...

maiden ocean
#

Ok so wait to clarify

#

affine plane curve means that its a quotient of k[x, y]

#

integral affine curve means that K(X) has transcendence degree 1 over k

latent anvil
#

Yes

#

Equivalently, any prime ideal of the coordinate ring is either 0 or maximal

#

Yeah?

maiden ocean
#

and specifically for plane curve it has to be defined as the locus of zeroes of a single polynomial f in k[x, y]

#

but an integral affine curve is not necessarily either a quotient of k[x, y] or the zero of a single function

latent anvil
#

Yes, that is correct

maiden ocean
latent anvil
latent anvil
# maiden ocean

This stuff is super hard without examples. Make sure you have things in your back pocket you can check definitions against

maiden ocean
#

I think I will need to sleep on this and come back tomorrow

latent anvil
#

hahaha

#

goodnight

maiden ocean
#

This is weird because like

latent anvil
#

,ti moth

cloud walrusBOT
#

21 members found matching moth!

Page 1/2
========
1.   64Timothy121#8816 
2.   motherless midget (𝓂𝑜𝓉𝒽𝑒𝓇𝓁𝑒𝓈𝓈 𝓂𝒾𝒹𝑔𝑒𝓉#3905)
3.   Sammoth_Mammoth#5557 
4.   Moth In Shambles (Moth#5340)
5.   space moth#5392 
6.   Mothra#4839 
7.   LunaMoth#2131 
8.   Moth#5717 
9.   motherlover#0679 
10.  Smothyp#0001 
11.  fluffy moth#0696 
12.  Silamoth#6094 
13.  Mother Russia#3907 
14.  frozenmammoth#8083 
15.  Behemoth#1007 
16.  Venmoth#1280 
17.  timothyfebb#6864 
18.  Emile Timothy#8219 
19.  moth#5390 
20.  Motheo#2190 ```
Please type the number corresponding to your selection, or type `c` now to cancel.
latent anvil
#

,ti moth in shambles

cloud walrusBOT
#

The current time for Moth is 04:11 AM (EDT) on Wed, 07/07/2021.
shamrock is 3 hours behind, at 01:11 AM (PDT) on Wed, 07/07/2021.

latent anvil
#

go to sleep

maiden ocean
#

there are certain terms here in each definition that i associate mentally with things

#

and then when theyre involved in other terms they dont mean the things i associate them with

latent anvil
#

So keep in mind that like

maiden ocean
#

and i get mixed up opencry

latent anvil
#

"affine integral curve"

#

Is two adjectives and a noun

#

Don't think of it as a unit

maiden ocean
#

Yeah so like

cloud walrusBOT
#

Member selection timed out.

latent anvil
#

"plane curve" means "curve whcih is embedded in the plane"

maiden ocean
#

curve means it is defined as the zeroes of m polynomials in n variables

#

just in general

#

?

latent anvil
#

that's what a variety is

#

A curve is one of those which is 1 dimensional

maiden ocean
#

In what sense

#

like defined by 1 function or transcendence degree 1

latent anvil
#

The dimension of a variety is defined by looking at the longest chain of irreducible subvarities (or dually primes of the coordinate ring), because intuitively to drop down an irreducible variety you need to decrease the dimension by at least 1

#

It is a result that this can be calculated via transcendence degree for integral things

latent anvil
maiden ocean
#

Ok i see

latent anvil
#

It is unfortunate for this explanation that being defined by 1 equation is actually a big deal

#

But it means the opposite of what you're thinking. It means that your codimension is 1

#

The codimension of a variety X in A^n is just n - dim X

#

Think about concrete examples here

#

A single equation in R^3 gives a plane, or a paraboloid, or a cone

#

not a line!

maiden ocean
#

so:
variety - solutions to m functions in n variables
affine variety - variety where the m functions and their combinations are the only functions for which the points are solutions
integral - coordinate ring is integral
curve - transcendence degree 1 (using this defn cause its the only one the book supplied)
plane curve - curve given by 1 function in 2 variables

#

so affine integral curve implies its an affine variety of dimension 1 with integral coordinate ring

latent anvil
#

Okay sorry back up

#

I was being imprecise about variety vs affine variety

#

And using them interchangeably

maiden ocean
#

yeah i know theyre different like

latent anvil
#

I'm not sure what your definition of affine variety means here

maiden ocean
#

if I = (f1, ..., fm) then V(I) is the set of solutions the variety

latent anvil
#

Your definition of a variety is the correct definition of affine variety

maiden ocean
#

and affine is when the V(I) being a solution to some arbitrary f implies f in I

latent anvil
#

A general variety is something which locally looks like an affine variety

#

Like projective space

maiden ocean
#

That is uh

latent anvil
#

It's locally like affine space, but globally weird

maiden ocean
#

not the way szamuely defined it

latent anvil
#

wtf

#

I need to see that definition, then

maiden ocean
#

Oh wait im dumb

#

ok so he actually calls V(I) affine closed sets and then its an affine variety when the thingy holds

latent anvil
#

Which thingy?

maiden ocean
#

uh the solutions to the functions in the ideal are the affine closed set

latent anvil
#

So like, I = (f1,...,fn)? Or what?

maiden ocean
#

and the affine closed set is an affine variety when those solutions also define the ideal in the sense that the ideal contains the only functions for which the points are all solutions

#

Yeah

latent anvil
#

This does not make sense to me

maiden ocean
latent anvil
#

I'm very uncertain about the case he has in mind

#

Does he give a non-example

maiden ocean
#

uhhh like

#

I = ((x - a)^2)

#

wouldnt work

latent anvil
#

Yeah, but what does that have to do with X?

#

X doesn't have the data of I

maiden ocean
#

because every point in X is a solution to f = x - a but f is not in I

latent anvil
#

like he writes a condition on I and then says it's about X

maiden ocean
#

I think hes saying its an affine variety when it does have the data

#

like when you dont just get that I defines V(I) but that V(I) defines I

latent anvil
#

If X = V(x) and Y = V(x^2), then X = Y and X is an affine variety but Y is not

#

I find this at best unclear

maiden ocean
latent anvil
#

You can always just take the radical of the ideal

#

And get a thing making the set an affine variety

#

Bizarre

maiden ocean
#

yeah i think thats what hes saying

#

Idk

#

Gamerm oment

latent anvil
#

Whatever

#

Go to bed

#

I'll think about your problem

maiden ocean
#

ok fine sadcat

#

cyberbullied by baby algebraic geometry

latent anvil
#

lol

#

Ah

#

I think I have a proof

#

Something slightly more general

thorny flame
#

How do I approach the question?
x^(25)=2mod(133)

hidden haven
unique juniper
#

for part (d)

#

idrk how to do it

#

ive got this: $\alpha\beta = -(\alpha^2 + \alpha) = -(\beta^2 + \beta)$ and $\zeta^{p-1}$ is a part of alpha if p=1 (4) and in beta if p=3 (4)

cloud walrusBOT
#

Yes ツ

lapis aurora
unique juniper
#

all the seperable elements + all elements in K will make up L

#

since L is algebraic and normal over K

#

(i think)

dusty river
#

That's not true, L could have non separable elements

unique juniper
#

oh

#

i thought normal extensions were seperable extensions

dusty river
#

normal + separable = Galois

lapis aurora
#

if it helps, i managed to show that K_s / K is separable and K_i / K is purely inseparable

#

and L/K_s should also be purely inseparable

#

mhm, guess i will take a look at galois extensions in my book but this exercise is from the chapter before that when they werent introduced yet

dusty river
#

nice pfp btw

lapis aurora
#

thanks :)

unique juniper
#

an element is separable if the minimum polynomial that it generates is separable right?

dusty river
#

yep

unique juniper
#

maybe char != 0 is important

rustic crown
#

yep

dusty river
#

char = 0 makes the problem trivial

#

because everything is separable

rustic crown
#

(if you're working over fields :P)

unique juniper
#

oh yea

dusty river
#

Suppose c is in L - K_s. Let f(x) be its minimal polynomial over K. By pure inseparability of L/K_s, there is some d such that c is a p^nth root of d, where p is the characteristic. The powers of x that occur in f(x) should then all be multiples of p^n. Then replacing the coefficients of f(x) with their p^nth roots, and x^kp^n with x^k, we should get a polynomial polynomial for c, separable over K_i. Idk how to proceed though lol

#

actually idk if my claims about p^n are legit but I hope they are stare

#

And I think this only shows that L/K_i is separable? Is that even right? lol

lapis aurora
#

yea

#

i also got L/K_i is separable

#

my argument was a little different tho

#

my problem is that L/K_i separable doesnt really help me so far xd

dusty river
#

yeah opencry

frank fiber
#

left derived functors of a exact functor $F$ are defined by $L_iF(A)=H_i(F(P))$ where $A$ is an object and $P$ is a proyective resolution of $A$, but the proyective resolutions are exact secuences and so $F(P)$ is exact, this implies that $L_iF(A)=H_i(F(P))=0$ ?

cloud walrusBOT
wraith obsidian
#

Sounds right to me

#

I mean left derived functors are constructed to measure failure of exactness of F

#

so if F is exact, they should vanish

frank fiber
#

thanks

maiden ocean
#

So contextually here n is the number of indeterminates in k[x1, ..., xn] for k algebraically closed and m is the number of generators of the ideal

#

and the affine closed set is just the points that are solutions to all generators

#

im kind of confused as to the claim here because if n = 2, m =1 implies V(I) is a plane curve then the affine closed set in A^2 thats a union would have to be the case m = 2 right?

#

But then you're adding more generators which means you'll have less points in your affine closed set

#

i just can't come up with an example where the intersection of 2 plane curves is a plane curve + finite points

#

or is it that the plane curve example requires both generators to be non constant and then you can consider like f = (x - 2)(x - 3) with y always 0 or something

latent anvil
#

The union of two plane curves is a plane curve

#

yeah?

maiden ocean
#

So then f is a finite set of points, g is a plane curve where x and y are both non constant and you take the intersection of (f) and (g)

#

yeah V(I1) cup V(I2) = V(I1 cap I2)

latent anvil
#

If you have curves f = 0 and g = 0, the union is fg = 0. Now take the intersection of the curves fg = 0 and fh = 0 for appropriately chosen f, g, h

#

So I'm thinking like, two perpendicular lines each union the same parabola

#

intersect the two sets and you get the parabola and the single intersection point of the lines

maiden ocean
#

Uhhh

#

would it be ok if u drew this

#

cause im not sure i get what u mean exactly

latent anvil
#

I'll just write it or

maiden ocean
#

that works too

latent anvil
#

Take A = V((y-x^2-1)y) and B = V((y-x^2-1)x)

#

The intersection is V(y-x^2-1) union V(x, y)

#

So this is two plane curves which intersect at the union of a plane curve and a point

maiden ocean
#

Oh I see

#

(y - x^2 - 1) gets you a parabola

#

and then x and y respectively get you vertical and horizontal lines

#

and their intersection is the parabola plus (0, 0)

#

?

latent anvil
#

💯

maiden ocean
#

Ok this makes sense

#

Its weird to think about but you can get very "non curve like" plane curves by taking products of various functions

latent anvil
maiden ocean
#

which is the same thing as just taking the union of their curves

#

I see hmmCat

lapis aurora
#

@dusty river @unique juniper update on my galois theory question from earlier: i managed to write a proof by showing that L/K_s(K_i) is both separable and purely inseparable, and therefore the fields are the same. thanks again for the help :)

maiden ocean
#

Moth is now slightly less owned then they were yesterday

#

this conversation really helped sham i think i kinda get how to construct examples now

#

thanks nozoomi

latent anvil
#

Yay!

#

It's funny that you started asking about the same stuff at the moment I opened discord on my phone

maiden ocean
#

I summoned you smugsmug

ionic drum
#

anybody here familiar with representations of algebraic groups?

maiden ocean
#

Shouldnt f circ (h1, h2) be 0

#

since Im (h1, h2) has to be in X and by definition points of X are mapped to 0 by f

fossil shuttle
amber stag
maiden ocean
#

doesnt it have to be X

amber stag
#

If we restrict the domain to Y, then yes, the composition is 0 on Y

#

Since it’s a multiple of h

maiden ocean
#

in the defn i got the domain was Y specifically

amber stag
#

Yeah, then the composition is indeed 0 on Y

maiden ocean
#

weird

amber stag
#

Y is the set of zeros of h, and the composition is a multiple of h, so

#

Anyway, it’s not hard to give an example. f = x1-x2, h = x1-x2^2, h1 = x1, h2 = x2^2

#

Haven’t touched algebraic geometry for ages I feel I explained badly lmao

#

f circ (h1, h2) isn’t 0 as a polynomial (whose domain is K^2)

maiden ocean
#

@oblique river i was thinking about the thing we talked about yesterday and i realized that im not actually sure why when you localize f is 0?

#

repasting the image for context but like

#

Why would the image of f be 0 in O_X, p?

#

and if its not how does the y = gx claim work?

latent anvil
#

isn't f identically 0 on X? Like it's the zero element of O_X(X)?

oblique river
#

I agree with shamrock here I think

#

X is sort of defined as like "the thing where f is 0"

#

so in O_X, f should be 0

maiden ocean
#

Oh wait yeah im dumb

#

Lmfao

chilly ocean
maiden ocean
#

Im confused about the part where the morphism from U to V(f) is defined

#

like t and s are functions so i dont really see whats happening...

oblique river
#

It does seem to be going backward to me

#

Or something

light tusk
#

I think instead of "$(t,s) \mapsto (x,y)$ defines an isomorphism", the author means "the homomorphism given by sending $t \mapsto x$ and $s \mapsto y$ and extending linearly to all of $K(X)$". But they wrote a pair as if it were part of a cartesian product, ie the underlying space.

cloud walrusBOT
#

Apopheniac

light tusk
#

If $u\in U$, then $\rho:U \to V(f)$ is given by $\rho(u) = (t(u),s(u)) \in \mathbf{A}_k^2$.

Then $f(t(u),s(u)) = 0$ by definition of $f$, so $(t(u),s(u))\in V(f)$.

This is locally (U is open) given by polynomials, hence a morphism $\rho: U \to V(f)$.

cloud walrusBOT
#

Apopheniac

latent anvil
#

book is bad

maiden ocean
timber sun
#

I have trouble with the only if direction of this statement. I Know that $\alpha$ is injective and $\sigma$ is surjective, as their composition is the identity. But how do i get the isomorphism? It feels like im missing something simple.

cloud walrusBOT
#

Cloud63

wraith obsidian
timber sun
valid shoal
#

hi! im trying to understand U(1) in the context of astrophysics, usually its followed by the word gauge. someone already explained abelian groups in a more philosophical context to me, but i'm still struggling with understanding its meaning in my field and in the papers ive seen it in -- i can send screenshots of the sentences in the papers if that's helpful

valid shoal
#

got it, so what would U(1)x gauge boson Z’ or U(1)Lµ−Lτ bosons look like?

prisma ibex
#

so what you've written looks like electroweak theory already

#

for U(1) there is only one gauge boson, the photon

#

The U(1) gauge field, the electromagnetic field, is a gauge field because it's invariant under these phase rotations by U(1)

#

certainly you can do this globally without much issue: for example you can negate the sign on all electric charges and physics doesn't change so much

#

but you can also do this locally: you can apply any phase rotation at any point of space and let these phase rotations vary smoothly, then the physics is still fine

maiden ocean
#

kay posting this here in case someone else sees this

#

I'm very confused by the part of the example where they talk about taking the tensor product of C with itself

#

I dont understand why we're taking A/M otimes C rather than A otimes C

#

Like points of X_C over a maximal ideal m of X are going to be maximal ideals m1 and m2 with i^1(m_i) = m

#

the only thing i can think of is that for some reason here we can say that quotient by tensor product = tensor product with quotient which isnt usually true and im not sure why it would be here...

#

But even then like.

#

I guess the idea is that we have i: A -> A otimes C and for each point p in X corresponding to a maximal ideal m it induces a map A/M -> A/M otimes C so C -> C otimes C? and choices of such a map look like choices of a maximal ideal m_i in A otimes C to quotient by so having two natural maps C -> C otimes C means that there are two ideals m_i with spec(i)(m_i) = m?

latent anvil
#

@maiden ocean I'm having trouble understanding what your q is

maiden ocean
#

Im just confused as to how it relates to the points over m

amber stag
#

So M is a closed point in X. If we want to write M as spec( ), what should we put in the parentheses?

#

Or what’s the coordinate ring of M?

bleak perch
#

Can anyone help with this problem? I'm in an introductory abstract alg course and we just got to groups. I assume that I would need to use some group properties, maybe the exponent rules, however I am stuck.

upper pivot
#

what did you try?

carmine fossil
#

If you want a refresher on exponents,
(x^m)^r=x^(mr)

#

And x^a x^b=x^(a+b)

bleak perch
#

Do I then just directly assume x = y to be true and try to manipulate the exponents? I'm really not sure

upper pivot
#

so try manipulating the equations given, so for a hint

#

like try combining two equations in some way

bleak perch
#

Since x^n is equal to y^n, could i create an equation where its just x^n - x^n = 0, and work from there?

dusty river
#

write x = x^1

#

see what you can do from here

bleak perch
#

Ok thanks for the help people, I'll try to dig into it some more

snow cedar
#

Hello, I am working on a simple proof from Dummit and Foote abstract algebra (3e). The problem with solution goes like this:

#

My question is: Is it fair to assume that matrix multiplication is associative? I obviously know that this is true from LA, but the textbook has not covered associativity of matrices yet, and feel like the "correct" proof should use the definition of multiplication of 2x2 matrices since that was clearly defined in the problem.

upper pivot
#

I mean if it bothers you, you could go ahead and prove associativeness once

#

but in general, you really shouldnt worry about this

quaint tree
#

Matrix multiplication is associative.

#

I'm assuming the book asked you to do this problem because matrices are a common example of a group.

#

(That said I haven't read D&F yet so maybe I'm mistaken)

dusty river
#

Not sure what you were saying about 2x2 matrices in your question. You can prove associativity in general

snow cedar
#

Thanks for the replies. There is no official solutions (as far as I am aware), so I have a hard time understanding if something is fair game or not. The solution is straightforward if we just assume associativity. I just find it strange that they included the definition of matrix multiplication if we aren't even going to use it in the proofs.

dusty river
#

It seems that matrix multiplication was defined before, but the problem is saying that "by PQ we mean matrix multiplication of P and Q which you already know"

#

In which case either they are assuming you already know it in which case it's fair game to use basic properties of it, or they defined it somewhere earlier

bleak perch
hidden haven
#

This is correct but I don't think it'll lead anywhere

bleak perch
#

hmm..

hidden haven
#

What I was hinting at was starting at x, and have a chain of equalities ending at y. The starting point is x = x^1 = ....
Can you use something given in the problem statement now, to get further equalities?

bleak perch
#

x = x^1 = y^1 ?

#

I'm not sure

hidden haven
#

You are given that there exist s and r such that rm+sn = 1

bleak perch
#

Do i try to rearrange exponents to follow the linear combination? I just don't see how having a chain of equalities helps here

hidden haven
#

x = x^1 = x^(rm+sn). Do you see it now?

#

You will have to use the given facts that x^m = y^m, x^n = y^n

#

And exponent laws

bleak perch
#

oh wow.. that makes sense.. I was staring at my paper for 30 minutes and just wasn't able to catch that.. It's my first proof heavy course, any advice on how to get better at proofs other than practicing problems? or is that it lol

hidden haven
#

Yeah I guess practising problems is the way to go, it's about learning to put together all the given facts

bleak perch
#

Hey Moldilocks, I think i figured out the proof, how do I use the LaTeX bot so I can run it by you to see if its logically sound?

hidden haven
#

If you just type latex code it will catch it (it detects the dollar signs) or you can start your message with ,tex to explicitly tell it tex your message

bleak perch
#

Ok cool

#

$x^1 = x^{rm + sn} = x^{rm} \cdot x^{sn} = (x^m)^r \cdot (x^n)^s$, since $x^m = y^m \land x^n = y^m$, we replace x with y, such that; $(y^m)^r \cdot (y^n)^r = y^{mr} \cdot y^{ns} = y^{mr + ns} = y^1 = y$

cloud walrusBOT
#

bigheavyballs

bleak perch
#

forgot to start with x instead of x^1

hidden haven
#

Yep, nice

hidden haven
bleak perch
#

awesome man. Thank you so much, not a better feeling than getting a proof right

hidden haven
#

True catKing

chilly ocean
#

moldi for honorable

wooden ember
#

im a little confused here: i did exercise 4,a) using the permutation representation of the action,but apparently that was not the way to go considering question 5. I don't understand because the group action can only be considered a homomorphism (and hence have a kernel) if you look at its permutation representation. The kernel of the action as a map from G x A to A doesn't mean anything right?

#

Okay nvm i really can't read, they defined the kernel again a little differently for an action...

#

i read through the theory a few days ago and forgot about that detail

hidden haven
#

I'm guessing the kernel is defined as the kernel of the group homomorphism that the action corresponds to, from G to Aut(A)? catThink ie set of all group elements that act the same way as identity

wooden ember
#

no see i thought that's what it meant but they had simply defined it as ${g\in G : \forall a\in A, ga=a }$ i just didnt see that

#

but the definitions are equivalent

cloud walrusBOT
#

Little Narwhal

hidden haven
#

That is what I said stareFlushed

wooden ember
#

no what i mean is they didnt explicitly state it like you did

#

and exercise 5 is meant to make you see it's the same

hidden haven
#

Ahh I see, didn't read that

wooden ember
#

"permutation representation" is the group homomorphism you're mentioning

hidden haven
#

Right

wooden ember
#

also did you mean to say Aut(A)?

#

because isnt that only defined if A is a group?

#

in here they have it from $G \to S_A$

cloud walrusBOT
#

Little Narwhal

hidden haven
#

Automorphism is a general term, not just used for groups

#

A set automorphism is just a bijection from the set to itself

wooden ember
#

i see

hidden haven
#

The collection of automorphisms of anything always form a group though

wooden ember
#

but if G were to act on another group H wouldnt wouldnt Aut(H) be more restrictive than the set of permutations on H?

#

oh i guess not

hidden haven
#

How would a group act on another group?

wooden ember
#

S_H is always a subset of Aut(H) right?

hidden haven
#

Do you mean act on the underlying set of H?

wooden ember
#

yeah

hidden haven
wooden ember
#

ah but then Aut(H) would refer to automorphisms on the underlying set

#

i see

wooden ember
#

yeah so isnt using Aut a little confusing

#

idk the S notation just feels less confusing to me

hidden haven
#

Usually you wouldn't make a distinction between a group and it's underlying set, but it's always useful to keep it in mind

#

Well mostly it is clear from the context, if you see Aut(A) and nothing is known about A other than it being a set, then you can be sure that it's just S_A

wooden ember
#

fair enough

hidden haven
#

Also you would often see Aut_Set(A) or Aut_Grp(G)

wooden ember
#

right

hidden haven
#

If disambiguation is needed

wooden ember
#

the notation is just longer then

hidden haven
#

Yeah lol

#

But for sets yeah sym(A) or S_A is more standard it's just that Aut is also kind of universal notation

#

You can take Aut for any kind of structure, graphs, categories, rings, fields, top spaces etc

wooden ember
#

true

#

is there a meaningful way in which a group can act on any of these structures, not just the underlying set?

hidden haven
#

I guess you could define a group G acting on a structure A to be any group homomorphism G → Aut(A)

#

But that's then also the same as a homomorphism G→Aut(underlying set of A) by composing with the inclusion

wooden ember
#

the inclusion?

hidden haven
wooden ember
#

right

hidden haven
#

We do study groups acting on other things but ig the theory from groups acting on sets is sufficient for most purposes

#

You just have an additional condition that the action of each element of the group is an automorphism of the structure which can be studied separately

wooden ember
#

alright

chilly ocean
#

group actions catThink

#

geometry is group actions

chilly ocean
#

group action on a non concrete category

#

Are all (locally?) small categories equivalent to a subcategory of Set?

dusty river
#

small and locally small would both be necessary

#

sorry locally would be

chilly ocean
#

do you know counterexample for small?

dusty river
#

Set

chilly ocean
#

Set is a subcategory of Set tho

dusty river
#

I think you are confusing necessary and sufficient

chilly ocean
#

huh?

#

im asking if there's a small category not equivalent to a subcat of Set

dusty river
#

ah yeah

chilly ocean
#

cmon barbie lets go party, ah ah ah yeah

dusty river
#

wait nvm

#

I confused myself KEK

chilly ocean
dusty river
#

I think for any given C you can do something with hom sets, since they determine C upto isomorphism

#

Map every object c to product of hom(a,c) (a varies). Every morphism a→b determines a map from every hom(x,a) to hom(x,b), so you get a morphism from every hom(x,a) to product_x of hom(x,b)'s, and this you can compose with the projections from product_x hom(x,a) to each hom(x,a) to get a morphism from product to product

#

Let me check if this works KEK

#

nvm that actually gives you a lot of morphisms from product for a to product of b stare not a single one

#

ah this works I think. What I have described on the morphisms is essentially defining a map on each coordinate. So the functor is $F: C \to Set$, on objects, $c\mapsto\prod_{x\in \text{obj} C} \hom(x,a)$, and the morphism $f:a\to b$ maps to the morphism which acts on the coordinate corresponding to each $x$ by post composition. That it is a functor is obvious. Faithfulness comes from $Ff = Fg\Rightarrow\hom(-,f)=\hom(-,g)\Rightarrow f=g$

cloud walrusBOT
#

Moldilocks

thorny flame
#

What does this mean?

scarlet estuary
#

wtf

dusty river
#

I am guessing it is a typo and it is supposed to be (12)

scarlet estuary
#

i mean <(1, 2)> is probably the subgorup generated by (1, 2)

#

except thats silly

#

yeah (1 2) makes more sense

#

but i have no clue why theyd denote it .H

#

$\langle (1 2) \rangle$ indicates the subgroup generated by $(1 2)$, and $\leq S_3$ denotes it being a subgroup of $S_3$

cloud walrusBOT
#

Namington

scarlet estuary
#

and theyre using <> instead of langle rangle because laziness i guess

lavish spoke
#

my abstract algebra course this year used notation like (1, 2), i prefer it tbh

scarlet estuary
#

huh i really dislike that

#

maybe thats just me but like

#

that makes me think its storing elements

#

like a vector

#

permutations dont store elements

#

they move them

dusty river
#

product group lol

scarlet estuary
#

commas "separate" them but permutations arent about "separating things"

#

theyre about "moving" things

#

feels counterintuitive

#

that might just be my bias though

lavish spoke
#

i just think its more readable personally

dusty river
chilly ocean
#

i have to reread it carefully, am noob at category theory

dusty river
#

I was being a bit silly. The functor I have defined is exactly the composition of all the covariant hom functors with the "product over objects of c" multifunctor

thorny flame
scarlet estuary
#

{e, (1, 2)}

thorny flame
#

{e, 1, 2}?

scarlet estuary
#

no

#

the subgroup has two elements

#
  • e, the identity permutation
  • (1, 2), the permutation representing swapping 1 and 2
#

this is isomorphic to every other group of 2 elements of course

#

we could use the symbols 0 and 1 instead, in which case we'd call it Z/2Z

thorny flame
#

That I understood

#

However how does it show for groups is bewildering

delicate bloom
#

you're being too vague

wooden ember
thorny flame
#

What does this mean?

hidden haven
#

Is 𝕌 defined somewhere?

chilly ocean
#

wild guess - group of units?

thorny flame
#

Math group says it's the set of reversible remainders.

hidden haven
#

Modulo some fixed integer?

#

I guess then U = Z/nZ. U* = group of invertible things in this, and f is then a homomorphism from U* to itself

thorny flame
#

What?

hidden haven
#

What does reversible remainders mean?

thorny flame
#

Trying to understand. Dm'd the guy who answered

hidden haven
#

That's just every number

#

gcd(a,a+1) = 1 for all a

thorny flame
#

True, It's a function on modulo groups

#

Apperantly

hidden haven
#

Right, Z/nZ right?

#

Integers modulo some number n

thorny flame
#

IDK what Z/nZ means

hidden haven
#

0,1,...,n-1

thorny flame
#

Ohh. THat's what you meant

#

Sorry

hidden haven
#

So in that set there are some things which don't have inverses

#

Like if n=4, then 2 doesn't have an multiplicative inverse

thorny flame
#

right

hidden haven
#

A cross in superscript means you take the subset of things which are invertible

#

Which is the same as taking the set of things that have gcd 1 with n

#

(by Chinese remainder theorem)

#

And then this becomes a group under multiplication

#

So you can talk about group homomorphisms

chilly ocean
#

Freyd-Mitchell's embedding theorem says every small abelian category is equivalent to a (full) subcategory of the category of left-modules over a ring.

#

I wonder: is there something fundamentally very different about non-small abelian categories? Or are they also in some sense "like" categories of left-modules over a ring

hidden haven
#

If you use Tarski's axiom (any set can be contained in some universe) then any abelian category C is small with respect to some universe U. You can then take R-mod_U to be the category of all small (wrt U) R modules, and then C has a full and exact embedding into R-mod_U

#

The problem with non small categories in general is that they could be too large, so we are just enlarging our universe here

#

I am not sure how this would work without Tarski's axiom though, I think then you'd just have to leave it at "this only works for small categories"

#

@chilly ocean

chilly ocean
#

well categories are algebraic structures, and so are modules lol

hidden haven
#

What does algebraic mean to you cocatThink

chilly ocean
#

actually no, categories aren't, they're partial algebras tho

hidden haven
bleak perch
#

Does anyone have any advice as to how to prove 4d? My first assumption was to prove it via double inclusion using the assumption that 4b and 4c are true. Is this on the right track?

amber stag
#

I think 4b and 4c are more like hints.

#

To prove lhs \subset rhs, we can express a symmetry in terms of tau and sigma by studying what the images of -1,0,1 are.

bleak perch
#

As in try to show that there is a bijection? like an identity function?

hidden haven
#

You have to show that every symmetry has one of those 2 forms. Take a symmetry y. Look at b and c and try to use a similar strategy like terrific said (you only need to know where 0 and 1 go)

bleak perch
#

so every symmetry has the form of either i + 1 or -(i + 1)?

hidden haven
#

Nope, the forms are given to you in d, there are infinitely many

#

0 and 1 can go to a lot of things

#

And you'll be able to prove that if 2 symmetries do the same thing to 0 and the same thing to 1, they will be equal everywhere

bleak perch
#

hmm i see

#

Why is it that I only need to prove what happens to 0 and 1?

#

If thats the case can't I plug in 0 to each symmetry and see its output? because if thats the case sigma^1 == sigma^1 o tau for 0

hidden haven
#

0 alone isn't enough

#

But 0 and 1 together determine the symmetry

#

Proving that images of 0, 1 are enough: ||Symmetries preserve distances. Given a number x, you can write its distance from 1 and from 0 on the number line. Then apply the symmetry, and these distances should stay the same. Solving these equations you will get a unique choice for x which could satisfy these. This proves that there is at most 1 symmetry that has the given effect on 0 and 1||

bleak perch
#

So given x, its distance to 1 should be x - 1 = 0, x = 1 , distance to 0 should be x - 0 = 0, x = 0. If I apply then the symmetries sigma^i and sigma^i o tau, to the values of x, they should be the same?

hidden haven
#

Why =0?

#

The distance to 1 should just be x-1

bleak perch
#

ah my mistake youre right

hidden haven
#

Also don't apply symmetries of the given form, assume that you are given some arbitrary symmetry y

#

So you can write (distance between x and 1) = d(x,1) = x-1, and similarly d(x,0) = x

#

Preserving distances means that if
d(a,b) = n,
Then d(y(a), y(b)) = n as well. ie distance between a pair is the same as the distance between its image

bleak perch
#

I suppose a follow up question would be how can some arbitrary symmetry y be related to sigma/tau, is that something i need to explicitly find? Why even define arbitrary y? Because if we found preserved distances with y how can we know for sure that it translates to sigma/tau. I hope I'm not completely missing some symmetry axiom that would answer my question lol

hidden haven
#

Well suppose 0 goes to a, 1 goes to b. Then can you come up with a symmetry made from the sigma and tau that does exactly that to 0 and 1?

carmine fossil
bleak perch
#

hmmm.. Thanks for the help you two. I'm gonna try to work on it some more by myself and ask questions if I need help again

carmine fossil
#

||The idea is to consider the symmetry t= (\sigma)^(-s(0)) s. This new symmetry t has this property that t(0)=0 and t(1) is either 1 or -1. Now use b and c parts to find t and hence s||

#

||Note that everything here is forced by the fact that s is a symmetry||

bleak perch
#

How exactly did you come up with that specific symmetry?

#

I understand everything up until that point tbh

carmine fossil
#

I didn't like that s(0) was nonzero

#

So I made a symmetry such that it will be zero

#

Which turned out to work perfectly

dusty river
#

Try to picture what this is saying. It says that all symmetries of Z are either translations, or translations + reflection

#

From this you can try to guess what the symmetry would be in terms of σ and τ

carmine fossil
#

So,If you negate the translation,you get identity or reflection

bleak perch
#

Right, but since (\sigma) is raised to zero wouldn't this imply that t = 1?

carmine fossil
#

\sigma is raised to -s(0)

#

not 0

#

Applying $\sigma^{-s(0)}$ moves everything to the left by s(0) units

cloud walrusBOT
#

Buncho Dragons

bleak perch
#

but isn't s(0) equal to 0 based on 4b/4c?

dusty river
#

That's not what 4b and 4c say

#

They say that if s(0) = 0 then certain things happen not that s(0) = 0

bleak perch
#

So the symmetry t, because the way it was set up, t(0) = 0, but now we need to figure out whether t(1) = 1 or -1?

dusty river
#

Yeah

bleak perch
#

I have a feeling its 1, but cant prove it

dusty river
#

It can be either. You have to relate it to s

bleak perch
#

I'm not sure... I just don't know how to to relate it to s, when the mapped values of s are unknown

hidden haven
#

s(1) and t(1) will be related

#

And s(1) is related to s(0) as ||s(1) = s(0) ± 1||

trim grove
#

the group of order 4 non cyclic can be of type $D_2$ , but further how to procede?

cloud walrusBOT
#

honey99

unique juniper
#

do you know the sylow theorems?

steady axle
#

can someone take a look at my solution to this problem and tell me if its ok?

#

Consider ideal $J=(x^2+x+1,5)$ of $Z[x]$. Note that $(x^4+x^2+1)\subset I$ in $Z[x]$ as $(x^2+x+1)(x^2-x+1)=x^4+x^2+1$. So $I=J/(x^4+x^2+1)$ is an ideal of $A$. $A/I\cong Z[x]/J$ by fourth isomorphism theorem. We note that $J$ is kernel of $Z[x]\rightarrow \frac {Z/5Z[x]}{(x^2+x+1)}$. The RHS is degree 2 extension of $F_5$ - a field of degree 25.

cloud walrusBOT
steady axle
#

also, $R[x]/((x^2+1)(x^2+x+1))\cong C \times C$ right?

cloud walrusBOT
hidden haven
#

Yes, by the Chinese remainder theorem

thorny flame
#

Is there a way to calculate this?

hidden haven
#

Calculate as in simplify?

thorny flame
#

yeah

hidden haven
#

Or numerically calculate

thorny flame
#

both

hidden haven
#

I don't think you can simplify the expression

#

Numerically it is x^(a^b)

#

So you compute the 2 exponents

thorny flame
#

I see

scarlet estuary
chilly ocean
thorny flame
#

Sorry, it was the part I had stuck in an abstract algebra in permutations

#

I was looking for pemutation to timer of 5^25

#

I've got a diffrent question anyway

#

How do I calculate? I'm keep getting 8 as a solution

delicate bloom
#

24=25-1 = -1 mod 5 so just need to know if 101 is even or odd

thorny flame
#

Sorry. wrong one

delicate bloom
#

do you know euler's theorem?

thorny flame
#

yeah

#

Do I need to implement it?

delicate bloom
#

with the chinese remainder theorem too, probably

thorny flame
#

Okay

delicate bloom
#

unless you see some other trick, it might have an easy way out

thorny flame
#

Right. I'll try it

#

How do I break it down?

#

Chinese remainder theorem has a few broken modulos and their remainder and tries to find a common modulo

delicate bloom
#

solve it mod 4 and mod 25

thorny flame
#

ohh. I thought of using their primes 2 and 5

#

that was the mistake

delicate bloom
#

that's a good strategy too sometimes, but here you don't have to

thorny flame
#

no I got 8 instead of 24

#

posted there now

frank fiber
#

Let $A$ and $B$ abelian categories, what condition should a functor $F:A \rightarrow B$ satisfy for its left derived functor $L_i F$ exist?

#

F must be aditive or right exact?

cloud walrusBOT
sturdy marsh
#

F must be additive, and you need enough projectives @frank fiber

#

you can get away with "enough acyclics" if defined properly

frank fiber
#

thanks

chilly radish
#

By the fundamental theorem of finitely generated abelian groups, determining the number of groups of a given order just comes down to a combinatorial factoring problem right?

hollow imp
#

the number of abelian groups only

#

you can't say anything about non-abelian groups with that theorem

oblique river
#

just to add on to this, we dont have a good way of answering the full question "how many groups are there of a given order"

#

we do know like, groups of order p^k where p is a prime number and k < 8

#

but i dont think we know like, how many groups of order 5^8 there are

chilly radish
#

Oh yea

#

I meant abelian groups

#

the word just slipped from my fingers

quaint tree
#

For small orders, it often comes down to trying things with Sylow's theorems, showing that certain groups are impossible, factoring the order and looking for simple groups whose orders are factors and doing direct and semidirect products, etc.

#

At least in my experience doing problems like "find all groups of order 2223" as homework problems

oblique river
#

yeah you can do things in large swaths too

chilly radish
oblique river
#

like "groups of order pq"

#

there are either 1 or 2 depending on p mod q (wlog p > q)

#

there are some interesting patterns if you look at like

#

groups of order p^k for some fixed k

chilly radish
#

we've done all of the standard results in my group theory class

quaint tree
chilly radish
#

The first dozen or so is the keyword

oblique river
#

for example, for p > 3, the number of groups of order p^6 is 3p^2 + 39p + 344 + 24 gcd(p - 1,3) + 11 gcd(p-1,4) + 2 gcd(p-1,5)

quaint tree
oblique river
#

no idea I just read it on groupprops

#

haha

quaint tree
#

Oh yeah that's the other method of finding all groups of a given order

#

The most powerful method mathematicians have

#

Look it up on the internet

#

And hope someone's already done it

oblique river
#

there's the paper

chilly radish
#

On an unrelated note, i'm currently trying to prove that $F_2$ contains $F_n$ for all $n\in \mathbb N$. I have the subgroups
$$H_n = \langle {b^iab^{-i}: i \in [n]}}\rangle$$
I want to prove that this is subgroup is free. I already have a surjective homomorphism $f:F_n\rightarrow H_n$ from the universal property of the free group. I'm wondering if it would be easier to prove injectivity of this homomorphism, or try to show that $H_n$ satisfies the universal property itself. Or maybe show that every word in the generators of $H_n$ has a unique reduced form and from there show injectivity

cloud walrusBOT
#

ShiN
Compile Error! Click the errors reaction for more information.
(You may edit your message to recompile.)

chilly ocean
#

\bN

oblique river
#

beez nuts

chilly radish
oblique river
#

That’s why youre getting a compile error

#

\N is not a default command

chilly radish
#

I changed it but it didn't recompile

oblique river
#

Do you not need braces around the N?

#

It should recompile if you edit

chilly radish
#

If it's a single char latex will just take it as input

#

I think it timed out on the editing or smth

#

I omit braces all the time, saves a lot of time typing

oblique river
#

Oh I thought that there might be an issue with spacing

#

I do things like 2^4 without braces

#

And single-character subscripts

chilly radish
#

Nah latex doesn't care about spaces

#

Actually not doing a space might make it think it's a different command

#

And cause an error

oblique river
#

That’s right

barren sierra
#

The answer is I think yes but I can't think of an example. Can you have a homomorphism that doesn't preserve commutativity? So let's say we have groups G and H, G abelian. Now say we have a homomorphism f: G -> H. Can we have f(x + y) = f(x) + f(y) and f(y + x) = f(y) + f(x) and x + y = y + x but f(x) + f(y) =/= f(y) + f(x)???

#

Also this would never be the case for isomorphisms right?

#

Due to isomorphisms being bijections, specifically due to then being injective.

chilly ocean
#

f(x) + f(y) = f(x + y) = f(y + x) = f(y) + f(x)

#

@barren sierra

#

this has nothing to do with f being injective

chilly radish
#

the image of an abelian group under homomorphism must be abelian

#

because of what tterra said

barren sierra
#

Oh

#

Yes duh 💀

#

Idk what I was thinking

chilly ocean
#

you probably mixed up well defined (a = b implies f(a) = f(b)) with injective (f(a) = f(b) implies a = b)

barren sierra
#

Yea

thorny flame
#

Can 2 infinite sub groups be isomorphic?
Can for example a subgroup of Q/Z be isomorphic to Z?

kind temple
#

so yes. just gave you countably many instances

thorny flame
#

right but that's due to them having the same infinite

kind temple
#

due to them being infinite and cyclic

thorny flame
#

what if you have 2 groups A and B
one is |A| = aleph_0; |B| = Aleph_3

#

is A isomorphic to B?

kind temple
#

ok then they can’t be isomorphic

#

there literally isn’t a bijection on the level of sets

thorny flame
#

I see

#

|Q| = aleph_1
|Z| = aleph_0
ASFAIK

kind temple
#

?

thorny flame
#

Z is the intergers

kind temple
#

Q and Z both have the same cardinality

#

|R| is aleph_1

thorny flame
#

Oh...

#

so what is aleph_0?

kind temple
#

|N|

hollow imp
#

Countable

thorny flame
#

ohh

#

So how do I prove that there's no subgroup of Q/Z that is isomorphic to Z?

#

multiplication and sum

chilly ocean
#

R and R^2 are isomorphic as groups and these two are isomorphic to those, so this doesn't work. a better example is Z and Z^2.

#

don't worry it's not intuitive at all why they should be isomorphic KEK

kind temple
#

huh what the

chilly ocean
#

axiom of choice fuckery

kind temple
#

dude u gotta be joking rn

south storm
#

If you want to prove that (Z,+) cannot be embedded into (Q,+)/Z you can use that Z is a torsion free group and that Q/Z is a torsion group. That means all elements of Q/Z have finite order and all but the identity of Z have infinite order.

chilly ocean
south storm
#

And order has to be preserved under embedding

kind temple
#

i quit

chilly ocean
#

lol

#

math is eternal suffering

south storm
#

Are Q_p and Q_p^n under addition also isomorphic?

chilly ocean
#

ask merosity

kind temple
#

wait that’s R and R^2 as vector spaces over Q

chilly ocean
#

"in particular as additive groups"

urban ice
#

Hang on, isn't ℚ/ℤ isomorphic to [0,1) ∩ ℚ ?

south storm
#

I think so

urban ice
#

ok, good

south storm
#

(Mod 1)

#

When adding I mean

south storm
urban ice
#

ℤ/ℤ ≅ {0}
multiply by ℤ and thus ℤ ≅ {0}
easy 😎

south storm
#

Funny enough here this is actually valid if you take the coset appropriately

kind temple
south storm
#

Oh wait right lol

kind temple
#

as additive groups

chilly ocean
#

additive groups doesn't care about underlying field...

south storm
#

But it‘s over Q

kind temple
#

unless i’m o

#

mehhh

south storm
#

With R there’s a dimension problem but the dimension of R over Q and R^2 over Q is the same, though infinite

kind temple
#

right

urban ice
#

sometimes i hate axiom of choice because
"that can't possibly be true, right?"
"nope... well, except with AC"
"huh... and so what does the counterexample look like?"
"no idea"

chilly ocean
south storm
#

I mean there‘s a lot of counterintuitive things that are true, intuition isn’t perfect

#

That‘s not only a thing about the axiom of choice

#

Like that (R,+) and (R^2,+) are isomorphic is also counterintuitive

#

Oh wait lmao

south storm
#

And isn’t provable in ZF

chilly ocean
south storm
urban ice
#

I was confused about how R was a vector space over Q, but an MO post rightfully noted that a basis can be uncountable

kind temple
south storm
#

Why

chilly ocean
#

how could you not dislike this sully

south storm
#

I don’t dislike this

chilly ocean
#

this plays with your emotions

south storm
#

It‘s interesting that it is true

kind temple
#

it’s so gross

#

like why are they the same

south storm
#

From my experience, if you look at the gross maths there‘s a lot of interesting there

chilly ocean
#

i am very familiar with gross math

#

opencry

kind temple
#

sure it’s interesting and all, it just makes me wanna vomit

chilly ocean
#

(im joking)

south storm
#

I don’t find it gross tbh

#

This is just that R and R^2 are bijective on steroids

kind temple
#

jk but idk. i just don’t like that R and R^2 are isomorphic

urban ice
#

Doesn't this also mean that (ℝ,+) and (ℝ^ℝ,+)

south storm
#

I think R^R has bigger cardinality

#

Because the power set of R can be injected into it

urban ice
#

right

south storm
#

So they are not isomorphic

urban ice
#

thank god

south storm
#

I think it follows though that (R^R,+) and ((R^n)^(R^n),+) are isomorphic

kind temple
#

if X is countable is R^X still in bijection with R?

south storm
#

Yes I think so

kind temple
#

aw bruh

#

R^N and R are isomorphic then (just assuming, have no idea)

south storm
#

I‘m not sure whether that is, I guess some nonstandard analyst would know

urban ice
#

let's pull out cardinal arithmetic

#

yeah that works

hidden haven
#

For countable N yeah

south storm
#

I think it is true that AC is equivalent to that for nonempty X, X^n and X are bijective iff X is infinite

hidden haven
#

|X^X| > |X| if |X| > 1

#

You need bounds on the exponent

south storm
#

For n a finite ordinal bigger 0

hidden haven
#

The bound is exactly the cofinality of |X| assuming generalised continuum hypothesis

urban ice
#

|R^N|=|R|^|N|=(2^ℵ₀)^ℵ₀=2^(ℵ₀^2)=2^ℵ₀=|R|

#

i have no idea what they did in the third case but whatever

hidden haven
#

It's very weirdly written

urban ice
#

This is kind of horrendous, but fun at the same time

hidden haven
hidden haven
#

You separately so all of those

urban ice
#

Indeed, but I have no ideas how they got their equalities

south storm
#

And X bijective with X^2 trivially implies for all finite ordinals n>0 X bijective with X^n

urban ice
#

specifically c^ℵ₀ = ℵ₀^ℵ₀

hidden haven
#

Rather than finite

urban ice
#

my bad

south storm
hidden haven
south storm
urban ice
#

lmaooo

south storm
#

Lol

hidden haven
#

Well the first 2 are just equalities so I didn't need to do the last 2

quaint tree