« first day (1725 days earlier)      last day (3288 days later) » 

12:38 AM
11 hours ago, by Incurrence
I have a group $G$ defined inductively $G^0$ is the group of upper triangular matrices, with $1$'s on the diagonal, and $G^1 = [G^0,G^0], G^{i+1}=[G^0,G^i]$
$G=G^0$ and I want to prove that $G^n =\{1\}$ at some $n$
I have played around, and the inverse is long and doesn't seem to have an obvious simplification(from being an ugly set of sums and products produced by the augmented identity method)
I have done some examples on 4x4 matrices with mathematica and I can see it works
We introduce a $0$ superdiagonal when we obtain $G^1$
Perhaps a proof could restrict attention to removing the superdiagonal and then the diagonal above that, while treating the remaining upper triangular elements as irrelevant
 
1:29 AM
So @TedShifrin why is Rudin going to be challenging for me? I mean it is. I am not understanding the implicit function theorem. But I can read John Lee's books on manifolds so I don't get why I am having more trouble with Rudin. Rudin has some weird notations tho, or at least ones I haven't seen
 
1:44 AM
Hello! What is the sum of $1^k + 2^k + \ldots + n^k$, assuming $k$ is a positive integer?
 
1:58 AM
Thanks!
 
r9m
2:25 AM
@Chris'ssis which problem was that? (I have totally forgotten ... sorry :( ... )
 
 
1 hour later…
3:32 AM
@robjohn I saw you on campus this morning :)
 
@MikeMiller Have you talked to Terry Tao?
 
@MikeMiller Did you? Where was I at the time?
 
@Incurrence Sure, he's human like the rest of us :)
@robjohn You were talking with a colleague, on the sidewalk between Powell and the physics building
I would have said hello if you were alone
Not the physics building - the building that's after IPAM, coming from the math dept; I was going the opposite way
 
@robjohn Oh I just wanted to ask how well he socialises out of curiosity
 
@MikeMiller The new "upside down basket" building?
 
3:42 AM
I don't remember...
 
Oh that was meant to be directed at Mike whoops
@robjohn Do you think you could give me a hint on my problem above?
3 hours ago, by Incurrence
11 hours ago, by Incurrence
I have a group $G$ defined inductively $G^0$ is the group of upper triangular matrices, with $1$'s on the diagonal, and $G^1 = [G^0,G^0], G^{i+1}=[G^0,G^i]$
$G=G^0$
I can see that when I do each iteration of $G^i$ I lose the next diagonal up
 
@MikeMiller I was just having some chai, then went back to proctor an exam.
 
But that is using mathematica for computing the steps
@MikeMiller I chose tensor products of finite groups lol
@MikeMiller I'll have 10days ish from Monday to learn about them enough for a 5 minute presentation
 
 
3 hours later…
6:19 AM
@robjohn, thanks again for the hint last night. It proved to be just what I needed to finish the problem I was working on.
 
 
1 hour later…
7:25 AM
Greetings
@r9m it's about this one $$\int_0^{\infty} \frac{\cos(x)}{x} \left(\int_0^x \frac{\sin(t)}{t} \ dt \right)^2 \ dx$$ and the cubic sister. :-)
 
Its given that the $span(a_1,a_2.......,a_n)=V$ where V is a vector space so ${a_1,a_2,a_3........,a_n}$ is a basis for V , so since the basis is finite,V is finite dimensional right?
 
@r9m There were months when I didn't know how to do it elementarily. Finally my research opened amazing simple doors to crack them all. :-) Indeed, without having at hand a proper tool, that is proving to be horrible. I initially did that on 6 pages or so, and using CAS.
 
@Incurrence cool.
 
Can anyone check that i am right or not?
@Balarka HI!!! sorry for tommorow i was feeling really sleepy
 
@r9m then, bang-bang, the proper gun killed it easily. This is definitely a good example where without having at hand all the proper tools, things become horrible.:-)
 
7:30 AM
@Rememberme The definition of finite dimensionality of V over F is the existence of a finite basis of V over F.
 
So am i right
 
Yes, it's a definition. Haven't you read it in Hoffman-Kunze?
By the way, can you prove that if a basis of $V$ over $F$ has cardinality $n$ then any other basis has cardinality $n$?
Otherwise the concept of dimension doesn't really hold.
 
@Balarka to prove this i have to assume that there is a basis which has cardinality n-1 and then prove that this cannot be possible right ?
 
of course, but that's just the beginning of the proof. you didn't read in it Hoffman-Kunze?
if you skip around like this, all you're going to learn is a bunch of words.
@Rememberme oh, no, actually that's not it :P
you'll just end up proving that there is no basis of cardinality n-1. you have to prove that there is no basis of cardinality m $\neq $ n.
@Remember Have you done matrices carefully? Chapter 1?
If not, go back and fill up your gaps. It'll help later when you do linear transformations.
 
7:47 AM
I am thinking of some other way.......Tell me is this right or not.....Let me take a subset W of V and lets say that all of it basis have the same cardinality n-1 then since it is a subset all these basis will be in V but by the theorem we know that dimW<dimV now if i take the basis whose cardinality is n-1 as the one which tells the dimension the inequality does not hold but if i take the basis whose cardinality is n then the inequality holds.@BalarkaSen
So by this inequality V cannot have Basis of Cardinality n-1 and since any other cardinality will also disprove the inequality the only cardinality will be n
I might be talking nonsense so please don't get angry
@BalarkaSen
 
@Rememberme you're using later theorems to prove previous ones. dim V isn't even defined if you can't prove that cardinality of basis is an invariant of vector spaces. so you're proof is ambiguous.
just read the theory carefully, @remember. study the book thoroughly.
hi @iwriteonbananas
 
hey balarka
remember this problem:
Let $G \approx \langle a,b \mid b^{-1}a^3b = a^5 \rangle$.
Let $H$ be a finite group and $\varphi:G \to H$ be a homomorphism.

Then $g = a^{-1}b^{-1} a^{-1}bab^{-1}ab \in \ker \varphi$.
 
yeah.
did you solve it?
 
i asked on MSE and got a good answer
but i was wondering
is $g$ trivial?
i've tried for an hour to prove that it is not
but couldnt generate a contradiction
 
probably it isn't. but i am unwilling to prove it :P
 
7:54 AM
okay hehe
 
@BalarkaSen IF i can prove this Let V be a vector space which is spanned by a finite set of vectors P1, . . . , Pm. Then any independent set of vectors in V is finite and
contains no more than m elements then i can prove what you said right?
 
sure.
 
OK great.....i will prove this then
 
there is essentially no difference between this and my statement.
 
Ok this is just a form without dimensions
@Balarka i think i have got an idea i think it will be enough to show that every subset of V which contains more than m elements is linearly dependent right?
Ok then this is proved
Haha got it
 
8:08 AM
@iwriteonbananas That group is an example of a Baumslag-Solitar group, and they have a pretty nice linear representation, although normally not isomorphisms, so if you are lucky you can just calculate the matrix product and see if it is trivial. Sadly if it ends up being trivial you still won't know if it is inside the group.
 
@robjohn these days the very good results come one after another! It's just a flood of them. :-)
 
@Rememberme Have you covered matrix multiplication?
 
@DiscipleofBarney interesting, i'll do that now
 
Yes using linear transformations and also dot product@DiscipleofBarney
 
@iwriteonbananas I was going to get @Rememberme the "practice" of doing the matrix mutliplications of that product
 
8:15 AM
haha sounds good
 
Which product
 
23 mins ago, by iwriteonbananas
Let $G \approx \langle a,b \mid b^{-1}a^3b = a^5 \rangle$.
Let $H$ be a finite group and $\varphi:G \to H$ be a homomorphism.

Then $g = a^{-1}b^{-1} a^{-1}bab^{-1}ab \in \ker \varphi$.
 
I haven't yet learned about kernel
 
@DiscipleofBarney interesting.
 
Replace the $a$ with the matrix $\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} $ @Rememberme
 
8:17 AM
@Rememberme where is your proof?
 
No i just wrote it....tell me is my idea right
 
and $b$ with the matrix $ \begin{pmatrix} 3/5 & 0 \\ 0 & 1 \end{pmatrix}$
 
@DiscipleofBarney shouldnt it be 3/5 ?
 
and the inverses with the multiplicative inverse of the matrix
 
@Rememberme yes, but prove it.
 
8:19 AM
@Rememberme Calculate the element $g$ in the quoted text with those replacements
 
lol
 
horrendous
 
sorry pal
 
I think the sciences would call this "undergrad" (or even "grad") work @iwriteonbananas @BalarkaSen @MikeMiller
 
8:20 AM
no, their computations are usually obnoxious in different ways
 
Clean these beakers!
 
@DiscipleofBarney are you planning to kill me with those huge calculations
 
@Rememberme I just want you to practice :P
 
find a better representation for him to practice on
this one's not going to work
 
I will do it but let me first write a proof a show its pic to @BalarkaSen@DiscipleofBarney
 
8:22 AM
in any case, unless there's something special about this group, one should just give up
word problem's not solvable etc
 
i don't care about this problem anyway.
 
True, although this is a one relator group so it should be @MikeMiller
 
why is it algorithmic for one relator groups?
interesting
 
@Remember i have a lot of work to do. i'd love to look at your proof after, say, a few hour or so.
 
i don't have a reference for this
but someone could find the algorithm and plug it in
 
8:24 AM
Its a famous theorem of Magnus
 
Fine i will ping it
 
i'm not interested in the theorem that there is an algorithm, but rather a nice one in front of me :p
 
Can someone help me with understanding the semi-direct product?
 
@DiscipleofBarney fwiw, the matrix product does end up being trivial :(
 
If we have two normal subgroups of $G$, $N,H$, such that $G=NH$ and $N\cap H = \{1\}$
Then we have a direct product
E.g. $N\times H \cong G$
Well it's isomorphic to
If only one is normal, we have a semi direct product, is this correct?
 
8:28 AM
@Chris'ssis Can you relate this sum to anything else?
$$\sum_ {n = 1}^\infty (-1)^{n + 1}\frac {\cos\left (\frac {4\pi} n \right)} {n}$$
 
@Incurrence right
 
@iwriteonbananas Yah, just put that in wolframalpha
:(
 
Can you explain the sentence: The natural embedding $H\hookrightarrow G$ composed with the natural projection $G\twoheadrightarrow H$ is an isomorphism?
 
@MatsGranvik hmmm, that $n$ under cosine is bad there. Finding a closed form? Not sure how at first sight.
 
it means $H \hookrightarrow G \stackrel{\pi}{\to} H$ is an isomorphism
 
8:30 AM
The natural embedding is just the identity map from $H$ to $G$, right?
 
@Chris'ssis Yes, but I know it converges based on numerical evidence.
 
where $\pi$ projects $NH$ to $(NH)/N \cong H$.
 
@MatsGranvik Yeah, I'm sure of it.
 
@Incurrence yes.
 
@MatsGranvik How did you get that?
 
8:32 AM
And the natural projection is just $G=NH$ and its the category thing I learnt I guess:

$$\pi: (n,h)\mapsto (0,h)$$ or something, I have forgotten
 
@Chris'ssis From the Greatest common divisor Fourier transform on the von Mangoldt matrix, second column.
 
@MatsGranvik Ah, I see.
 
@Balarka....there we go
 
8:33 AM
@BalarkaSen So we take the quotient group of $G$ modded $N$ out
Ok
 
@Incurrence right.
 
Me??
 
No me @Rem
 
Oh.......:p
 
you're learning about splitting of exact sequence right now, @incurrence. the statement above is equivalent to the embedding being a section of the short exact sequence $0 \to N \to G \to H \to 0$.
 
8:37 AM
How does $0$ map to $N$?
Oh
 
how could 0 ever map to N?
 
It is embedded
 
the inclusion of the identity.
 
So we are doing embeddings and then nautral projections?
 
@Balarka is my argument right?
 
8:39 AM
i'm just wrapping everything you are doing with abstract-nonsensical language. a short exact sequence is a bunch of homomorphisms with 0s at the ends and kernel of some map equal to image of the next map.
 
hehe, abstract nonsense
 
now it's a theorem that if there is a section of a short exact sequence, then it splits and the middle group is a semidirect product.
don't worry about it, it's just a language, @Incurrence.
 
And the last dot point here is the first isomorphism theorem? (equivalent conditions) en.wikipedia.org/wiki/Semidirect_product
 
not quite, it relates to the short exact thingy i was talking about.
 
Or the second last one
I swear someone said the first isomorphism theorem is there
 
8:45 AM
of course there is, but it's not all.
a short exact sequence $0 \to N \to G \to H \to 0$ is equivalent, by first isomorphism theorem, to an isomorphism $G/N \cong H$
 
Hmmm
Well I can see just the part $G\to H$ with the secondary fact that $G=NH$ with $N\cap H$ being equivalent
 
@Remember your proof goes above my head. you say $\alpha_j$ as scalars and then the next moment you express $\alpha_j$ as linear combination of $\beta_i$s.
@Incurrence the $N \to G$ map is just the embedding.
i.e., has kernel $0$. that's why there is a $0$ at the start.
 
I am really sorry @Balarka its a writing mistake those are vectors
 
Hmmmm are those arrows normally giving more information?
Oh wait I see
Wait no I don't
How would I discern that $G$ isn't embedded into $H$
From your short exact sequence
 
@Balarka is it right now?
 
8:50 AM
a chain of homomorphisms $\cdots \to G_{i-1} \stackrel{f_i}{\to} G_i \stackrel{f_{i+1}}{\to} G_{i+1} \to \cdots$ is exact if $\ker f_{i+1} = im f_i$
 
In fact $0$ could be embedded in $N$, and $G$ could be smaller
@BalarkaSen Oh okay, let me contemplate this
 
@Rememberme i am not willing to verify your proofs if you don't provide me a typo/loophole-free proof.
sorry.
 
Sorry for that pls check thats the only mistake
 
if those are vectors, then $\sum x_i \alpha_i$ doesn't make sense anymore
are $x_i$ scalars now?
 
I think i have switched scalars and vectors....oh my gosh i will give you another one perfected
 
8:54 AM
i have to go now, sorry.
 
@BalarkaSen Thanks your your help
 
Does anyone what math.stackfaq.net is?
 
@Fermésomme Not sure, it seems too functional to be a scrapper
 
Good thing the login part doesn't seem to be working
 
@Incurrence It even has a chat room with the same name. I'm worried what I'm doing there :)
 
9:09 AM
I am going to ask a question there and see if it turns up here(or even there)
'Not Found!'
It doesn't have any java-script I think
Yep no javascript, so it is a really good scrapper
 
it isn't limited to mathematics stackfaq.net
 
"whyfaq" is Stackoverflow.
 
You look so young @ADG
 
it brings up surprisingly few google results... probably just a scrapper(?)
@ADG I don't understand the point of that proposed site, competitive math problems are welcomed on math.se (as long as the competition is not an ongoing one of course), isn't it the same for other disciplines that already have a site?
 
ADG
9:17 AM
@Incurrence :D
@Alessandro yes I know Math.SE is very welcoming and very good, I like it, therefore I helped people and gained some 11K rep. :D
@Alessandro but there are other reasons too, I'll explain you after 15 min, sorry, I'm having lunch.
Here are soem of them:
> Phy.SE considers check my work off-topic, which are even show-my-work homework questions
> Many people would actually do other's homework in feeling of learning more
> Everything would be under one's knowledge level, because much on separate science sites has gone far and wide
> We can't have separate 100's of site for each competitive exam's subject
(note that show-my-work would be neessary there too)
> Some separate subject's site would be eternally in beta due to less audience
@Alessandro
And I'm talking about IIT JEE AIPMT BITSAT VITEEE etc.
@santiago you follow me everywhere but you don't say a word?
 
ADG
I'm feeling like I'm talking to myself :(
> The Indian Institutes of Technology Joint Entrance Examination (IIT-JEE) was an annual engineering college entrance examination in India. It was used as the sole admission test by the 16 Indian Institutes of Technology (IITs) and Indian School of Mines Dhanbad (now getting converted into IIT).[1] The examination was organised each year by one of the various IITs, using a round robin rotation pattern. It had a very low admission rate (about 10,000 in 500,000 in 2011).
 
I see, but it still looks like the example questions would fit in the sites for maths, chemistry and physics respectively
 
Usually people here are working on stuff simultaneously and check back each time they need the PC
 
@Alessandro one of the reasons I asked my discussion question about the proposal
 
It was closed, but I since added my progress.
 
9:32 AM
@ColonelPanic Yes it is good now
 
@iwriteonbananas I am in the process of learning some small cancellation theory, there are some algorithms that work on some groups (they satisfy some "small cacellation" condition), so if the group ends up being suseptable to the algorithm, and is not awful I will attempt to figure out if that element is trivial. (after I learn the relevant stuff I will look at it)
 
@Incurrence thanks :) would you vote to reopen? I think it's a fun and interesting problem, expected it to be welcome. But I understand this site would vote to close Fermat's last theorem "show your working"
 
@ColonelPanic I don't think I have enough reputation sorry, but I have posted a comment about it here: chat.stackexchange.com/rooms/2165/reopen-undelete-close-delete
 
9:40 AM
@Incurrence cool no worries, I'm sure it'll work out in the end
 
@Incurrence You missed the 80 votes
 
I'm excited to read the solutions
 
@DiscipleofBarney Haha indeed I did
@DiscipleofBarney I am usually to busy to remember to do them
 
ADG
@ColonelPanic I solved it few years ago
and asked same question on SE here... w8
see [this](http://codereview.stackexchange.com/questions/86771/beautiful-code-which-helped-me-understand-concept-of-chasing-objects)
-
 
@Incurrence I think I am going to try to shoot for 100 next week.... I have not been looking at closed questions still.
 
9:48 AM
@DiscipleofBarney Hahaha you'll overtake me in no time
 
ADG
solved that question
$vl/v^2-u^2$
anyone here?
 
@iwriteonbananas A quick calculation, if I didn't screw up, shows that the group satisfies the condition $C'(1/6)$, so the algorithm should work. Now all you got do is wait long enough for my scattered brain to figure some of this small cancellation theory stuff.... :D
 
r9m
@Chris'ssis are we dealing with the $\mathfrak{Re}$ part or the $\mathfrak{Im}$ part of it ? :)
 
10:03 AM
@r9m Absolutely no. Only simple real methods.
 
r9m
@Chris'ssis :o I might have read from mid-conversation ,... I must be missing the context :| .. what was that about?
 
@r9m $$\int_0^{\infty} \frac{\cos(x)}{x} \left(\int_0^x \frac{\sin(t)}{t} \ dt \right)^2 \ dx$$ that you said once you didn't see a solution without the use of CAS. It was posted on I&S.
 
r9m
@Chris'ssis HOLY-HELL!!! How did you kill that one elementarily? :O ..
 
@r9m I was thinking that these days I probably reached the maximum creativity in my life. :-)
 
r9m
@Chris'ssis and we both know that's probably not true ;)
 
10:07 AM
@r9m You'll find that or the cubic versions or both in my book. I promise that. You'd be amazed by its simplicity! :-)
@r9m :D
 
r9m
@Chris'ssis I think I have had enough of this book-teasing :P lol ... when will it be available? :D
 
@r9m :-)))) Well, I cannot tell you a date, but there it will be available at some point (100%).
@r9m It's much work to do.
@r9m Wait a second ...
 
r9m
@Chris'ssis :o what kind of an answer is that? :( .. some point, will it be published by the end of this year? :) (plzzz)
 
hi. I have used the FFT analysis tool in audacity to tune my guitar, since I can observe the peaks in the graph, and the other component frequencies, but how does FFT actually work?
 
@r9m I also finished this one in the spirit of the art
3
A: Closed-form of $\int_0^1 \frac{\operatorname{Li}_2\left( x \right)}{\sqrt{1-x^2}} \,dx $

sos440My attempt. This is by no means closer to the answer, but I want to address several equivalent forms that might be helpful for future calculations. First, from Landen's identity of the following form $$ \mathrm{Li}_2(z) = -\mathrm{Li}_2\left(-\frac{z}{1-z}\right) - \frac{1}{2}\log^{2}(1-z), \qu...

 
r9m
10:11 AM
@Chris'ssis you mean $(3)$ from sos's answer? :)
 
@r9m No, but the main integral. $$\int_0^{\pi/2} \operatorname{Li}_2 (\sin(x)) \ dx$$
 
r9m
@Chris'ssis okay :D
 
@r9m I also did the version with trilogarithm. :-)
 
r9m
@Chris'ssis that means you have some new secret weapon at hand? :D
 
@r9m I'm incredibly happy these days! They were such good days!
@r9m lolllll :-))))) (maybe)
 
r9m
10:15 AM
@Chris'ssis I envy those who live in the complacency of not knowing the fact that you are going to publish a book :P
 
@r9m lol, what do you mean? You suggest some wouldn't like me to publish a book? :-)
 
@BalarkaSen I saw my proof and found my mistake the thing is that alpha is a vector and the x's are scalars....
 
Curious, how long is the book going to be or, maybe a better measure, how many problems and will you be including solutions or will it just be a problem book @Chris'ssis
 
r9m
@Chris'ssis I mean knowing that you are going to release a book at one-point is not better than the state of ignorance (where one does not know you are going to release a book sometime)
 
@DiscipleofBarney It will contain about 300 problems and solutions (integrals, series and limits only), major part of them being created by me.
 
r9m
10:18 AM
@Chris'ssis If I suggest the later ... I am a moron :P
 
@r9m :D
@r9m It's hard because I need to do the whole thing alone, even the English part until some point when I'll contact an English professor from my country and ask for support.
 
Awesome, how do you plan on publishing it(pdf on the arxiv, self publish, find a publisher etc)?
 
@Rememberme how do you know that there exists scalars $x_1, x_2, \cdots, x_n$ such that $\sum_{j= 1}^n A_{ij} x_j = 0$ for all $i$?
 
@Chris'ssis you know English right?
 
@Rememberme Yeah, but not well enough for publishing a book. I need to have my texts verified.
@DiscipleofBarney By a publisher (Springer if possible).
 
10:21 AM
Oh @BalarkaSen thats a theorem which I learnt if you want I might try proving that too....
 
r9m
@Chris'ssis hmm ... I won't bug about the details :P but the sooner it comes out the happier I will be :)
 
i don't know which theorem you are talking about.
state the theorem!
 
@Chris'ssis I am mostly speaking out of my ass, but I am pretty sure a publisher would get you an editor(s) which could help with some of the english
 
@r9m To be honest, I'm very glad for any such book that is out. Inside Interesting Integrals was a very good book to me too. I mean one doesn't need to show in a book how academic one may be, but to send the message to the readers in a very enjoyable way.
 
r9m
@Chris'ssis agreed !!!
 
10:24 AM
@DiscipleofBarney I never published books before, but only some articles (a part of them are about to be published).
 
Do you know Upper Central series @Balarka?
 
yes
 
@r9m I loved that book. It makes you smile often. :-)
 
Is this related to my nilpotent group problem?
 
If A is an m X n matrix and m < n, then the homo- geneous system of linear equations Ax = 0 has a non-trivial soloution@BalarkaSen
 
10:25 AM
i forgot what your problem was
 
7 hours ago, by Incurrence
3 hours ago, by Incurrence
11 hours ago, by Incurrence
I have a group $G$ defined inductively $G^0$ is the group of upper triangular matrices, with $1$'s on the diagonal, and $G^1 = [G^0,G^0], G^{i+1}=[G^0,G^i]$
$G=G^0$
 
@r9m Keep in mind this (it remains recorded on MSE): you would love a lot my way to that integral I mentioned above. :-) (I wanted to have this message here and at the proper time to remind it)
 
I want to show that $G^n = \{1\}$ for some $n$
 
r9m
@Chris'ssis just one request I have as an Indian reader ... please don't leave the non-trivial problems as an exercise :P @Balarka might get the pun :P
 
@r9m All have solutions with no exception. :-)
 
r9m
10:27 AM
@Chris'ssis YESSS !!! :D
 
@Rememberme yes, then i guess your solution is okizay.
 
@r9m I also include this one $$\int_0^{\pi/2} \operatorname{Li}_2 (\sin(x)) \ dx$$ and depending on the space, I might also add the trilogarithm version. Hope to do it to have them both there!
 
So I have proved it.......Haha!!!!!!!!
 
r9m
@Chris'ssis okay :) ... I have loads of exams this week .. :| (last set of exams in my final semester) .. after that I'll try to pick up the axe that I dropped in the river at one point in time :)
 
@r9m One more thing
@r9m It will also contain the evaluation of $$\sum_{n\ge1} \left(\frac{H_n}{n}\right)^3$$ :D
 
10:30 AM
@Incurrence Looks like a crazy problem.
 
@Incurrence Do you have a presentation for that group (maybe from previous exercises)?
 
@r9m hehe, OK!
 
r9m
@Chris'ssis yea !! that is one dragon to slay :) $\displaystyle \int_0^1 \frac{\operatorname{Li}_2 (x) \log^2 (1-x)}{x}\,dx$ .. and rest of the stuff on RHS are manageable by MZV algebra :)
 
@BalarkaSen I have been trying to solve it for days, it was on my last assignment
@DiscipleofBarney I don't. It is just upper triangular matrices with 1's on the diagonal, using commutator ABA^{-1}B^{-1}
 
@r9m :-)
 
10:33 AM
And each iteration wipes out one more diagonal
Going up from the super diagonal
 
ADG
anyone missed me ;)
 
@r9m I have a pretty simple way there.
 
r9m
@Chris'ssis btw I used your identity(way) (one you used in killing the Au-Yeung one) :)
 
@r9m Good! I have a different tool there. :-)
 
@Incurrence I guess then you will end using some clever stuff with the inverse of $I+N$, $N$ nilpotent and $I$ the identity, but I don't really feel like working through the problem and don't have a clear idea of wear to go
 
10:35 AM
@DiscipleofBarney Fair enough, but what is the inverse of I+N if it is easy to explain
 
r9m
@Chris'ssis will you add that to to your book too?
 
@r9m Yeap. The cubic version and the Au-Yeung series are definitely a must there.
 
r9m
@Chris'ssis awesome!!
 
@Incurrence Think about it as a geometric series $1/(1-x)$, or $1/(1+x)$
 
@Incurrence $1 - N + N^2 - N^3 + \cdots \pm N^{n-1}$
 
10:36 AM
Hmmm
 
@Incurrence Since its nilpotent eventually the tail is 0
 
r9m
@Chris'ssis many great people are self-educated :) ..
 
@r9m in mathematics? Excepting Ramanujan? :-)
 
r9m
@Chris'ssis yes :) & yes ..
 
@r9m Banach also (not sure)? I knew that Stefan Banach was s self-taught mathematician.
 
r9m
10:39 AM
maybe ... I don't remember specific names atm //
 
@r9m Anyway. Ramanujan remains the famous example. :-)
 
Ramanujan isn't the only mathematician around, @Chris'ssis :P
 
r9m
^^ true that!
 
@BalarkaSen Yeap, I also love Euler much ... ;)
 
definitely. Euler, Riemann, Gauss. they are classical guys.
 
10:42 AM
@BalarkaSen Ah, yeah, Riemann never to forget. The same about Gauss.
@r9m in middle school already we were pushed so much to learn with hard math stuff ... I don't say that was a wrong thing, but the way things were done I never lked. The hours were held with much much fear you're going to be smashed by bad marks.
 
r9m
I could have used some focus on mathematics in my middle school :P I learnt nothing :P
 
even if you did focus, @r9m, you wouldn't have learned anything.
 
@r9m We all were under a terrible pressure all the time. It's not a good thing to experience such feelings in middle school.
 
r9m
@BalarkaSen probably true :P
 
if I ask for a simplistic definition of a FFT, would my question be downvoted?
 
10:46 AM
it's not a comment on your intelligence, @r9m, but rather on our educational system.
i personally think you'd make a good mathematician.
 
@r9m The professor used to say: "you see this, I doubt any high scool student would do that or an undergraduated". It's good to teach hard math but not with so much pressure. One had to work like hell.
 
@DiscipleofBarney great, thank u for the effort! can u provide a reference for what C'(1/6) means?
 
r9m
@Chris'ssis I don't like pressure .. it's an useless baggage :( .. the only way people survive pressure is possibly by forgetting about it and focusing on work at hand :)
 
@r9m Yo, what's up ?
 
@r9m I mean to work like hell to remain alive at those hours. Yeap, true, no need for such baggage.
 
r9m
10:50 AM
@LeGrandDODOM me from bed :)
 
@iwriteonbananas You've studied Lefschetz fixed point theorem?
 
@iwriteonbananas here is the wikipedia page, also there is the book Combinatorial Group Theory by Lyndon and Schupp. But basically the idea is that groups that satisfy this condition have a small amount of cancellation when relations are multiplied, so you get a bunch of control over what identity elements can look like. The small cancellation is one of the things that makes studying certain problems in free groups easy.
 
@BalarkaSen no, but i think i saw that name somewhere in hatcher toward the end (am i mistaken?)
 
@r9m In one of the days, the professor asked at the blackboard a pupil and asked him to says some theorems, and since he didn't know, he pushed him with the head to the blackboard. Then asked the best girl in the class about other questions, and since she didn't know, he gave her a hand over nose until she began to bleed. It was much terror in that class.
 
r9m
@BalarkaSen btw I heard there has been earthquake at Kolkata ? :O
 
10:53 AM
yes, it is in hatcher. i was about to ask a question, nevermind.
 
@iwriteonbananas And it gives a geometric way to study/think about those sorts of problems
 
r9m
@Chris'ssis :O !! you should have reported the incident to police/appropriate authorities :O (that's not pressure ... that's plain torture)
 
@DiscipleofBarney ok, pretty cool
 
@r9m yeah, but i didn't feel anything.
 
@r9m I'm not the type of person able to learn in such an environment. People must learn with pleasure, not for fear. It was sad. That story continued for years.
 
r9m
10:56 AM
@BalarkaSen guys on fb are posting all these pics (south city mall has got cracks on the wall)
 
i am tired of all this fuss about it.
 
F4z
does this chat support latex?
 
r9m
ah! okay ...
 
no good algebraic topology questions today
 
@iwriteonbananas I am actually pretty sure this small cancellation stuff will be able to help me solve a problem that I have been thinking about on and off for around 2 years, so I might be able to get myself to focus long enough so that (hopefully) I will have the knowledge to do your problem within the next couple of days.
 

« first day (1725 days earlier)      last day (3288 days later) »