« first day (3563 days earlier)      last day (1755 days later) » 

01:08
A general philosophy question: I am reading through Stacks Project Chapter 10 on Commutative Algebra but feel somewhat unmotivated with just the algebraic machinery in hand. Should I do some parallel reading for others chapters as well? Are there any geometry that I can apply these algebra on? Thank you.
01:22
Hi, Anyone can help me on this very basic question will be welcome and appreicated. What is all the assumption and condition required to making sure that T has continuous partial derivatives in Two variables when applying changing of variables formula?
0
Q: What is all the assumption that T has continuous partial derivatives in Two variables changing of variables formula?

VictorWhat is all the assumption and condition required to making sure that T has continuous partial derivatives in Two variables when applying changing of variables formula? Reference link: http://sites.millersville.edu/bikenaga/calculus/change-of-variables/change-of-variables.html

@WilliamSun i think it’s very hard to learn from stacks project and would recommend you learn commutative algebra through other sources instead. The typical recommendation is atiyah macdonald which i is good but i personally prefer ones with a geometric flavour
01:43
I have had a first course in Atiyah from all chapters except for the dimension theory/valuation rings.
The reason why I learn stacks project is because it has more categorical constructions/homological techniques.
I feel comfortable with the algebraic materials but I am trying to apply it to, say some modules over the ring $C^{\infty}(M)$. Maybe I should just examine the examples one by one...
02:35
@feynhat That makes no sense.
03:24
Wow, I can't even subtract.
5 hours ago, by feynhat
Weird. I set my timezone to America/Vancouver (its 15:10 now). And now google says "Due 8:30PM, tomorrow"
^ This would mean that its actually due tomorrow. Because when its 8:30 PM in 'Vancouver's today', it will be 9:00 AM in "here's tomorrow".
ugh... whatever.
04:24
Hello @TedShifrin I have returned to SE again! And I just got a Macbook Air. First time using Apple laptop!
Heya @Jasper !! Welcome to the dark side with the rest of us :P
@Victor This will guarantee that the function you have to integrate when you change variables is still continuous. There are stronger theorems, but you don't see them in a calculus class.
04:50
Guten Morgen
Lmao @feynhat
Also VSRP sent an email. Did you check it?
Yeah.
Who is your advisor?
Mine is Roushon.
Mahan
Oh nice!
05:05
Great. Mahan visited NISER once. He talked about hyperbolic geometry.
Is that what you'll be working on?
Haha yeah he gives the same talk everywhere
Also, do you know Roushon?
I have met him yeah
@feynhat Nah I don't think I'll be doing hyperbolic geometry. I told them I wanted to study h-principles, but we'll see.
Cool.
What about you
05:21
I am not sure. I will probably do some textbook-y stuff in algebraic topology.
In Q7 of en.wikipedia.org/wiki/Hilbert_system#Logical_axioms, why can't $x$ be a free variable of $\phi$?
Anonymous
05:56
I'm trying to solve this exercise: "If |G| is odd and has a normal C_17 subgroup, then it is central". I know and understand the proof of the fact that "If $H$ be a normal subgroup of prime order $p$ in a finite group $G$ and if $p$ is the smallest prime that divides the order of $G$, then $H \leq Z(G)$" (see here). But I'm not sure how to approach this exercise.
Anonymous
Say, $|G| = 17.3 = 51$. Then any conjugacy class within the subgroup $C_{17}$ must divide $3$ I think. So any conjugacy class within $C_{17}$ can either have size 3 or size 1. So we can't directly conclude that $C_{17}$ necessarily lies in the center of $G$. Could someone help me a bit with this?
06:08
@TedShifrin Are there aplenty or is there vast majority of cases that look simple like the one took in Calculus courses gnerate by computer ramdomly yet it is very challenging to verifing it by hand? What are their features? Appreicate in advance
Edited for Typos @TedShifrin Are there aplenty or is there vast majority of cases that look simple just like the one took in Calculus courses randomly generate by computer yet it is very challenging to verifing it by hand? What are their features? Appreicate in advance
@Balarka wanna answer a super noob question while I take a cigarette break from my lecture?
Let $X = \ell^2(\Bbb R)$ and let $K := \lbrace e^{(n)} : n\in \Bbb N\rbrace \subset X$ with $e_k^{(n)} = \delta_{kn}$. I'm trying to show that $K$ is closed and bounded but not compact (think this might be a standard example of Heine-Borel failing). Obviously $K$ is bounded because $\lVert e^{(n)}\rVert = 1$ in the $\ell^2$-norm. My lecturer then says "Since $\lVert e^{(i)} - e^{(n)}\rVert = \sqrt{2}$ for all $i \neq n$, all convergent sequences in $K$ become constant after finitely many terms"
I'm being a mong and not understanding the last statement lol
or maybe I'm not being stupid but it's just so obvious that I think it's not as obvious as it is
It's what you think it is; if a sequence in $K$ converges then it'd be Cauchy. But $\|e^{(i)} - e^{(j)}\| = \sqrt{2}$ for $i \neq j$ implies that's never possible!
Unless you are eventually constant that is.
If a sequence $\{e^{(i_k)}\}_k$ was Cauchy you'd of course be able to find $k_1, k_2 \in \Bbb N$ such that $\|e^{i_{k_1}} - e^{i_{k_2}}\| < \sqrt{2}$.
Lol okay, I think I'm trying to make things complicated because I'm scared of analysis
thanks :P
06:23
I tend to avoid inequalities etc. I'd just write it as, the open ball $B_{\sqrt{2}}(e^{(n)}) \cap K = \{e^{(n)}\}$ is a singleton, so every element of $K$ is isolated in subspace topology aka $K$ is a discrete space but compact discrete spaces are finite.
Translating everything to topology might be helpful if you're as scared of analysis as I am
That is possible, I'm finding topological definitions easier to parse than analysis definitions
Algebra >>>>>>>>
Hard DISAGREE
Then you are lost
The final exercise on our second problem set is to prove Arzelà-Ascoli and I'm like "wats a sequence"
06:29
@BalarkaSen given a vector bundle can we always produce a spherical bundle?
@LeakyNun Yeah, choose a fiberwise Riemannian metric, and then look at bundle of unit vectors.
I guess I should think about this categorically
so a GL(n) bundle versus an O(n) bundle
I suspect we can use the def. ret. GL(n) -> O(n)
Reduction of the structure group from GL(n) to O(n) is essentially the same as choosing a fiberwise Riemannian metric yeah
oh really
06:32
y0 @Leaky @Alessandro
(I didn't even check what "this" is)
Hi @Edward
always think categorically
(how do you say this in Italian)
We don't say it, we're mostly sane
06:43
@EdwardEvans I'm going to watch a lecture series by Markus Banagl
Oof
Ill habe hin next semester lol
Have him
Cool!
What's he teaching
Alg top hehe
Yeah next semester I have the holy trinity
Algtop, alggeo, ANT2
06:46
Lol
Altho this Semester I’m taking a seminar on ANT2 material lol
Because it was supposed to be offered as a lecture but for whatever reason it wasn’t
Pig
Pig
what's ANT2?
Algebraic number theory 2
So class field theory lol
Pig
Pig
ah i see, that's pretty cool
:D the Seminar is just on local cft via Lubin-Tate theory, but I think we do global in the lecture course
Pig
Pig
06:49
do you understand it?
i feel like i never understand the proof
the statements make sense and at least the questions are natural
but cohomology is something i can't think of by myself and lubin tate feels very ad hoc to me
:(
We haven’t proven it or formulated the statements yet, it’s the third week of term lol
Pig
Pig
ah cool
But yeah, I can link the paper weβ€˜re going from if you want
Pig
Pig
oh that's cool, sure thanks
06:51
@Leaky Did you end up reading my formulation of spectral sequences using cosheaf homology lol
not yet
Pig
Pig
@EdwardEvans that's interesting, i only saw the one from cassels frohlich before
@Pig in fact all weβ€˜ve done in the seminars so far is to prove Galois theory of infinite extensions and then define projective limits (which seemed like a weird order to do it in lol)
Also yeah that paper is a refinement of a book by Iwasawa and iwasawa theory is kinda big in Heidelberg number theory department
Pig
Pig
i see
06:54
@Balarka why is the Hausdorff distance so painful to work with
07:14
@EdwardEvans umm... a much easier example of Heine-Borel failing would be any infinite set with discrete metric.
This is just the example in my lecture notes :P
(To be honest though, that's exactly what you did. The ambient space $\ell^2$ is irrelevant because the subspace you chose was discrete.)
07:32
@MikeMiller Not much indeed, but they remark that they assume connectedness of the groups whose lifting they want to give, which means that their representation will be in U(P) instead of all of Aut(P). But then again, I don't know if not-connected groups are ever considered in this context.
 
2 hours later…
09:41
Well there is about 11 people in this room for now.
Use the Weierstrass M-Test to prove that each of the following series is uniformly convergent on the domain given.
$\sum x^n(1-x)/n$ on the domain $[0,1]$. $M_n=1/2n^2$ using differentiation and $A$.
The $A$ I mentioned states that: Let $a_n=(1+1/n)^n$. $a_n<a_{n+1}$. $2\le a_n$, for all n.
How is $M_n=1/2n^2$?
Guys can you do it?
@robjohn can you explain me this?
I have problem with this question.
${x^{n+1}(1-x)\over n+1} /{x^{n}(1-x)\over n} = ?$
@Astyx I need to translate the latex wait
@Astyx you mean using ratio test?
yes
I want to understand the answer 1/2n^2 . How was it derived?
Ok, so differentiate $x^n (1-x)\over n$
09:52
x^n-x^(n+1)/n
wait I will do it
I am starting from scratch lol
x^(n-1)-x^n
did it
Then what I do lol
prove 2\le a_n?
I mean using that sequence of function and provd it greater or equal to 2?
@Astyx It seems I need to be able to read French lol
Finally reading EGA?
@Astyx then what should I do after differentiating?
@Alessandro Thom, rather :P
Find when the derivative cancels
This happens at critical points, ie a minimum or a maximum
Hopefully this will be a maximum (which you can check by computing the function anywhere else)
U mean that thing i find derivative of =0?
@BalarkaSen What for ?
I have done it before lol ur same step
It shouldn't be too hard actually. I can understand a little
Need a good dictionary probably that's all
09:59
Well I'm here if you need me !
Thanks!!
$x^(n-1)=x^n$
x^n/x=x^n\implies x/sqrt[n]{x}=x
1/sqrt[n]{x}=1
sqrt[n]x=1
so x=1
lol
sorry for showing how I solve it is embarrassing
so I plug it to original equation and it get 0 all over the place XD
@Astyx x=1
I hope this is max or I need to graph it on desmos
You made a mistake somewhere
I have to go right now
Might come back later
lol
I will go home to do it
I am on bus and gonna vomit
For now I think I need to read my geometry paper instead of solving this which is gonna make me vomit
@Astyx when you are back please write @StupidKid so that I know u r online
or may be I get help from someone else
10:20
Can anyone try to explain me where did I did wrong
since $x^(n-1)-x^n=0$ then x^(n-1)=x^n then x^n/x=x^n then x/sqrt n x=x then sqrt n x =1
or did I did mistake in derivative?
but no it is roght
ok I will go home and check
10:38
You made a mistake computing derivatives
The derivative of $x^n$ is $nx^n$
@StupidKid
@BalarkaSen @LeakyNun You don't need a metric to produce the associated sphere bundle
It's $(E \setminus 0) /\Bbb R^{> 0}$, where the positive reals act by scaling
10:57
@Astyx wait what? x^n is nx^(n-1) wait may be I need to look interval
@Astyx u r wrong its nx^(n-1)
@StupidKid there are two ways. Using the derivative, find the maximum of $x^n(1-x)/n$ is at $x=\frac{n}{n+1}$. Then we are looking at $\left(\frac{n}{n+1}\right)^n\frac1{(n+1)n}\le\frac1{2n(n+1)}$. Apply the M-Test.
@MikeMiller ah, thanks
@StupidKid The other way is to notice that $\sum\limits_{k=0}^\infty x^k(1-x)=1$ for all $x$. Then $\sum\limits_{k=n}^\infty x^k(1-x)/k\le\frac1n$ for all $x$.
@StupidKid Yes I made a typo. It's not $x^{n-1}$ though
@robjohn Thanks. Looks like you might be correct I will check that.
@Astyx Well the derivative I evaluate was correct I think lemme check that in a moment
11:06
How do you get that second inequality ? @robjohn
@StupidKid No it wasn't. You're meant to find a $n+1\over n$ somewhere, so that the maximum is at $x = {n\over n+1}$, not at $1$ as you claimed
@Astyx The sum of all the terms without the $k$ in the denominator is $1$, so the sum of the terms with $k\ge n$ in the denominator has to be at most $\frac1n$
Oh my bad, I misread that
You're right
Guys how are u able to read latex?
@Astyx I will check that again
@StupidKid See the link for "LaTeX in chat" in the upper right of this page?
some help please: If f,g$\in{L^1}$, can someone give me a case where the convolution f*g is not continuous at 0.
11:13
Upper right ? I am using mobile version
@StupidKid Install "Start ChatJax"
@StupidKid here is the link tinyurl.com/cfqcvpc
does anyone have experience with measure theory
@StupidKid Click on the three horizontal lines at the top left of the mobile version, choose "Info" and then you can see the link for "LaTeX in chat"
or just use the link that learning_mathematician posted
There is no info lmak
and the link that learning mathematician send I followed instruction and nothing works
@StupidKid when you click the StackExchange symbol, the three horizontal lines, the top item on the dropdown menu should be "Info"
@StupidKid on the page you got to you have to follow the directions at the bottom for your mobile version, I bet.
11:22
Ype I followed
It says make new bookmark
And copy paste all the code in url
Nothing happened
some help please: If f,g∈L1, can someone give me a case where the convolution f*g is not continuous at 0.
@StupidKid you need to click on that bookmark while in this room
@robjohn I did it. But didn't work.
Then scroll back to some of the MathJax
ok I will do it again
11:27
@StupidKid I just added a new bookmark in my mobile browser and it's working. You pasted ALL that text into the URL field of the new bookmark?
You clicked on the bookmark as if you were going to go to a new page?
I stayed on chat and clicked bookmark
I edited the url
did copy paste
and done
and bookmark is gone
$$\sum_{k=1}^\infty\frac1{k^2}=\frac{\pi^2}6$$
Use the bookmark. It should bring you right back here, but you should see the MathJax rendered.
wait I haven't installed mathjax
Do I need to install mathjax
11:36
There's no MathJax to install.
Do I need to remove bookmark completely and paste that code or I need to add /and paste it?
First, add the bookmark. Replace the URL with that large amount of text from the bottom of the web page, save the bookmark. From this room, use the bookmark as if you were going to another page.
Wait there is not written save bookmark. It just goes away.
when does it just go away?
gotta go for a bit... be back in a few minutes
ok
there is no save button btw
11:46
what browser are you using
Chrome
This is kinda pissing me lol
back
ok, have you tried dragging the link to the bookmark bar as the site says?
that should work just fine in chrome
I hope jesus comes flying to me and fix this issue lmao
I know that others using Chrome have installed the ChatJax bookmarklet and it works.
11:50
I use Chrome, never had any problems with it
@Thorgott they are using the mobile browser. No drag and drop
@Thorgott you can't drag in mobile
@EdwardEvans You can use the bookmark to see MathJax in chat, right?
may be I need to copy paste robjohn past message of the question and put in latex compiler
Yes
Dragged Start Chatjax onto bookmark bar, clicked it, works fine; dunno about the mobile browser
11:52
@EdwardEvans Oh no there's an heretic among us
wait wat
also, nice that you wrote "an" heretic and not "a" heretic
oh, mobile is yikes
Should I smash my tables so that it work properly πŸ˜‚πŸ˜‚πŸ˜‚
I got primitive brain.
@EdwardEvans It's not like I know grammar, it just sounded better to me
Or I make a new open source All in one compiler for chat .
11:55
@StupidKid: can you look at the URL for the bookmark you added?
@Alessandro usually you only use "an" when the next word begins with a vowel, but for whatever reason you also use "an" for words beginning with an "h"
(I was arguing that using chrome is heresy)
probably smth to do with French
Even for words beginning with an "h" followed by a consonant?
(are there even such words)
There are in Croatian
lmfao
i can't think of an example in English
11:57
@robjohn Ok lemme tell. I changed url with that code. Then there is no save button so I touch and it is gone. And bookmark was not saved. I made in another in folder. It was there but unusable.
And I again touch the star then it's url is changed.
Are there any god who can make video of instruction lmao.
I don't use Chrome, so I can't give an exact step by step explanation of installing the bookmark. Perhaps someone else who has installed it on Chrome could help.
Or I am gonna make a add ons for latex for chrome.
I have installed it in Safari many times, but not Chrome.
However, I know there are others who use Chrome that have installed it.
Wait I can't even make addons for chrome since mobile version web store isn't available and for now my PC is completely destroyed.
@robjohn I apologize for wasting time lol.
I hope someone who has installed in Chrome will be able to help
12:16
So I found derivative was $x^{n-1}-x^n-x^n/n$ and as @Astyx said was wrong lol
but @robjohn u mean to evaluate $x=n\over n+1$ is maximum? or u just said to plug it in?
Plug it into $x^n(1-x)/n$
but why plug it?
because that gives the maximum over $x\in[0,1]$
wait how you get the maximum? Taking derivative and getting 0 of it?
12:22
$x^{n-1}-x^n-x^n/n=0$
was this the equation?
No, $x^n(1-x)/n$
Hello @robjohn good to have you back in this chat!
@Jasper Thanks!
@Jasper Do you use the Chrome mobile browser?
0_0 but in order to get the maximum x u take derivative of $x^n(1-x)/n$ and take 0 if it.
@StupidKid yes
12:25
but $x^{n-1}-x^n-x^n/n$ is derivative of that
@robjohn Nope! But I think he should be able to figure out himself after a while. There is also the difference between the version on a computer and the version on a phone. I don't use either regularly, so I don't know about either.
@StupidKid yes, so $x=\frac{n}{n+1}$ is where $x^n(1-x)/n$ is maximum.
how you get that? U used wolfram to get that?
@StupidKid solve $x^{n-1}-\frac{n+1}{n}x^n=0$
dudeeeeeee u really used I saved minutes of hardwork time lmao using wolfram alpha
I was solving by had all the time
12:32
@MikeMiller Good point. I wanted to have the sphere bundle naturally sitting inside the vector bundle, but even then maybe only a fiberwise norm suffices.
@StupidKid I have never used Wolfram Alpha in my entire life. I do everything by hand.
I am lazy dog . I mistakenly evaluate derivative wrong and then forgot to make it in alternative form then evaluate it. I my brain was so laggy that I didn't even check if I wrote it wrong lol.
@Alessandro Doubting myself again: if $S \subset C^0(K)$ (continuous functions on a metric space $K$) then $S$ is bounded, because $S \subset C^0(K) \subset B(K)$ (bounded functions on $K$) and for $f \in S$ you have $\lVert f \rVert_{\sup} = \sup_{x \in K} \lvert f(x) \rvert < \infty$
Just because elements are bounded in norm doesn't mean you can find a uniform bound for all elements in $S$!
oof
then I have to actually do some work
12:37
wait is $K$ compact? Or is $C^0$ the set of continuous functions vanishing at infinity?
$K$ is compact lol
Take $S$ to be the set of constant functions $f_n(x) = n$ for every $n \in \Bbb N$
@robjohn one more question I know inequality looks right. Did you get it by $a_n\le a_{n+1}$ method?
$S$ is compact as well actually; this is for a converse of Arzelà-Ascoli
I feel so sorry for the poor f*ckers carrying me on the problem sets hahahaha
compact implies (totally) bounded in any metric space
12:40
ohhhh right we have some characterisations of compactness in the notes
It's worth proving that statement on your own
Compact iff totally bounded complete but the forward direction is easy to do on your own
I guess I take a covering of $S$ by open balls, turn that into a finite subcover by open balls and then swallow it up with a big ball
@Balarka do you want to think about something ugly some beautiful metric topology? I don't understand if I'm trying to prove something false or if I don't know basic calculus lol
@robjohn I kinda didn't get the inequality lhs is just by plugging maximum value and how right had side was derived
Unnecessarily complicated, @EdwardEvans. Why not choose an appropriate cover from the beginning?
Swallowing with a big ball is a good idea.
@Alessandro I am thinking about something else but if it's not too demanding you can shoot.
12:44
A coarse equivalence between two metric spaces $X$ and $Y$ is a function $f$ such that there exist two functions $g_1,g_2:[0,\infty)\to [0,\infty)$ going to infinity, with $g_1(d_X(x,y))\leq d_Y(f(x),f(y))\leq g_2(d_X(x,y))$ for all $x,y\in X$
(so for example quasi-isometry is the special case in which $g_1,g_2$ are linear)
Right
Makes sense
Now I have two metrics $d$ and $d'$ on the same $X$ such that the identity is a coarse equivalence. Are $(K(X),d_H)$ and $(K(X),d'_H)$ also coarsely equivalent? ($K(X)$ are the compact subspaces of $X$ and $d_H$,$d'_H$ the Hausdorff distances associated to $d$ and $d'$)
Oh god
I would guess yes, but the computations are awful and I keep messing them up lol
It certainly does make sense, yeah.
Hausdorff distance is minimum of sup{x in A} inf{y in B} d(x, y) and sup{y in B} inf{x in A} d(x, y) right
12:49
maximum instead of minimum
Ah, thanks, of course.
There's a few equivalent definitions on wiki, some look more manageable en.wikipedia.org/wiki/Hausdorff_distance#Definition
This sounds like the best for computation to me
Ah damn, I need to leave for a while, I forgot about a thing I need to get done, I'll be back in a while, sorry about that
I don't know where exactly to start because not like $g_1, g_2$ are increasing. Maybe one needs to take $g_1' = \sup_{[0, x]} g_1$ or something
Similarly for $g_2$
12:52
@robjohn thanks now I understand and I also understand I was fool by doing wrong algebra and calculus lol
πŸ˜‚πŸ˜‚πŸ˜‚
I look forward not doing wrong math. All step was right except miscalculation.
i know rhat if $f\in D$ where $D$ is an integral domain, is irreducible, then $f\in D[x]$ is irreducible
what about primes?
Are you all professor in math department?
Or students?
@Alessandro Yeah I'm sure you need to muck around with $\sup_{[0, x]} g_i$'s although I haven't computed anything
But maybe you already knew that
I thought u guys were professors
12:58
same should hold for prime elements
multiply two polynomials and apply the prime property to the coefficients recursively
@BalarkaSen Yeah I guess. I think that's what a finsler metric is
Right someone told me about those before
I dunno anything

« first day (3563 days earlier)      last day (1755 days later) »