« first day (584 days earlier)      last day (4731 days later) » 

00:03
I can't decide which one I like the most. Those I looked at are essentially epsilon variations of each other.
Because the principle's the same, and it's so compelling to use that argument that you can only disguise it so much.
Is "agoodguy" a troll?
@AsafKaragila The annoying thing is that I was stuck at something seemingly unrelated and it took me a hell of a long time to see that I was just looking for those darn families...
I can't imagine that one comes with such a reasonably advanced material and then fails to answers that question.
@tb Well. My email is not just for pdfs and personal problems you want to discuss! :-D
00:09
Can I e-mail you with my personal problems, Asaf?
@JonasTeuwen You can try.
Ft. Let me get something.
@AsafKaragila :) Well, the main problem was the re-casting of the question in those terms; after that was done, the problem was resolved instantly.
After the fact it looks soo obvious :s
@tb I see. I know that often mathematicians prefer to try on their own and not ask other people for help. I can tell you that several times I began writing an email, which essentially made me put the question into exact details - and solve it on my own.
I know that effect too well... That's why I ask so few questions on this site. While writing them up I solve them :)
@JonasTeuwen well, it really depends on how you're taught complex analysis. Our prof lulled us into sleep for about two months by massaging formal power series. When I started realizing that the action had begun, it was already over. :)
00:16
That is a very handy skill when computing integrals.
@tb There are so many "in bed" jokes one can turn your message into...
@JonasTeuwen don't forget that continuous functions are Riemann integrable :)
Can't I get a PhD by compiling some integral tables? It is quite entertaining.
@tb Yes, but then your norm is only defined on Riemann integrable functions right? What is the "extension"?
@AsafKaragila thanks for spelling it out, I was aware of it.
@JonasTeuwen The Riemann integral gives you the $L^2$-norm, right? So the completion is $L^2$. Who wants to know that the completion consists of classes of measurable functions? :)
00:20
@tb Jonas might be drunk, and did not notice. It's just my public service... :-)
I wonder if there is something circular in that definition, as if you take the $L^1$ that won't work I think.
But I forgot why.
Must be the Port Ellen substitute.
@AsafKaragila I see: The König doing grassroot campaigning.
@JonasTeuwen It will. You probably have regulated functions in mind, but there the issue is that you take the uniform completion of the step functions in order to guarantee that the limit function is still integrable.
@JonasTeuwen Put differently: The Riemann integral gives you a functional on $C[0,1]$. So the measure's already there by Riesz-Markov.
Yes, I realised this some seconds ago. Oh well.
Damn! For the first time ever I need to use colored markers and I can't find my girlfriend's markers!
@AsafKaragila Hmm, I thought you could always call people. : )
00:31
She's asleep it's 2:30am.
It is important enough to wake her up.
What's a man without colored markers?
What's a man with colored markers (if he's lucky) but without girlfriend?
@JonasTeuwen Well... a straight man, I'd think.
I always carry at least one with me.
@tb Very happy.
I can wake her up, sure. I could also procrastinate and continue playing chicken invaders pointlessly!
00:33
^ sounds like a plan :)
Excellent choice, Sir.
I'll go for Lagavulin. Because I don't have any Port Ellen yet.
@AsafKaragila How I wish you give up Chicken Invaders.
That's a lame game. :p
Is not!!
00:35
Have you tried something like Counter strike, or may be GTA series or something .....?
Hm. Another alarm.
I think I'll go to sleep and that's it.
Goodnight!
Good night
@AsafKaragila Good night. : )
Grad alarm it seems?
They are bombing the militants?
00:39
@JonasTeuwen here
A grad alarm? Is there a swarm of grad student zombies running in the streets?
Okay, I should be going too. Good night!
Good night!
EISBÄR!
00:58
@tb Good night. : )
01:10
Asaf is going to pounce, methinks.
 
1 hour later…
02:28
@Mariano Can you assist me with GAP please?
I setup GAP but I just cannot query anything into it, it replies with some error message.
So, I'd like it if you can query your GAP system for those groups G such that G and Aut G are abelian?
@MarianoSuárezAlvarez Thanks for trying. : )
There are 200 of size at most 200
The cyclic ones :)
@MarianoSuárezAlvarez Oh, so, the order of the groups are bounded by 200?
No, I limited the search at 200
I guess the only such groups are the cyclic groups
02:36
@MarianoSuárezAlvarez I should attempt a proof. This question was asked in a paper in American Math. Monthly.
a group G satisfies your conditions iff its primary components satisfy them
so it is enough to suppose that |G|=p^r for some prime p
(In fact, IRC they said this was not interesting or something. : ) )
then the group is a direct sum of cyclic groups of the form Z_{p^k}
@MarianoSuárezAlvarez I am not getting this point. Can you explain why so, please?
if there are two isomorphic sumands, then Aut(G) is not abelian
suppose G is an abelian finite group
and let G_p be the p-primary part
that is, the subgroup of elements killed by some power of p
then G is the direct sum of the G_p
and Aut(G) is the direct product of the Aut(G_p), because an autom. of G must map each G_p into itself.
Needs a proof but I think I am seeing one. So, ok.
So if G is finite abelian with abelian Aut, then each G_p satisfies the same conditions
of course it needs a proof :)
and conversely, if all the G_p satisfy the conditions, the observations made imply that G does too
Ah, yes. You put all of this under that carpet? : )
no, I am trying not to ruin all the fun for you :)
02:42
@MarianoSuárezAlvarez Sure. Thank You. But, I did not think along these lines at all. : (
this trick will come to you more naturally with time
I am just decomposing G into simpler parts
Yes. So, here we are also having the fact that Automorphism preserves the order of the element. So, this seems to be more natural. Is this correct line of thought for this choice of decomposition?
yes
automorphisms do not mix the different G_p
(that is why Aut(G)=$\prod_p$Aut(G_p)
Yes. So, we have simplified the case to $|G|=p^n$ for some prime $p$.
indeed
now a p-primary finite abelian group G is the direct sum of cyclic groups of the form $Z_{p^n}$.
You can easyly show that $Aut(\mathbb{Z}_{p^n}\oplus\mathbb{Z}_{p^n})$ is not abelian
and from that, that if in the decomposition of $G$ as a direct sum of cyclic groups there are repeated summands the autom. group is not abelian.
02:48
@MarianoSuárezAlvarez I'll attempt a proof. So, we have essentially solved the problem, right?
so your group must be of the form $\mathbb{Z}_{p^{n_1}}\oplus\mathbb{Z}_{p^{n_2}}\oplus\cdots\mathbb{Z}_{p^{n_r}}$ with $n_1<n_2<\cdots<n_r$.
@MarianoSuárezAlvarez How are these cyclic?
they aren't
unless r=1
you have to prove that r=1 :)
Yes, that's why I am wondering too.
@MarianoSuárezAlvarez Oh, sure. I'll prove. Thank you for taking it this far. : )
02:51
I hit at this problem after reading a paper by Diaconescu. Let me fish out a link.
Sorry that's Deaconescu
@MarianoSuárezAlvarez Here's the link, at last. : )
Hey Ben, How are you?
@MarianoSuárezAlvarez I understand if $M$ is a $\mathbb{Z}$- module then we have an isomorphism $\operatorname{Hom}(\mathbb{Z}, M) \cong M$
@KannappanSampath Not bad
But I have been told the same is true if we replace $\mathbb{Z}$ with any commutative ring
I used the assumption that $M$ is an $A$- module then a homomorphism of $A$ - modules $f : A \longrightarrow M$ is completely determined by $f(1)$.
It is true if A is a ring
It's breakfast time. Bye all of you. Have a good day.
03:00
@MarianoSuárezAlvarez If $A = k[t]$ is a polynomial ring then shouldn't my homomorphism $f : A \rightarrow M$ be completely determined by say the image of the indeterminate $t$ in $M$?
@KannappanSampath Bye enjoy your dosa
@BenjaminLim Yes, my favourite. : )
it is determined by the image of $1$
@MarianoSuárezAlvarez I don't really see why.
(the image of $t$ will be the image of $1$ times $t$)
well: try to prove it :D
Well yeah that's obvious I tried to use that
but then if you want to know what is say the image of $t^2 + 1$ in the module
then it is $f(t)^2f(1)^2 + f(1)$
03:02
I claim: given a ring $A$ whatsoever, and an $A$-module, two $A$-linear maps $f$, $g:A\to M$ which coincide on $1$ are in fact equal.
but then we don't know what is $f(t)$ yet
no
where do you get that from?!
f is a map of modules, not rings
moreover $f(t)^2$ simply does not mean anything
for $f$ takes values in $M$, which is a module.
Oh sorry It should be $f(t^2 ) + f(1)$
whoops
suppose $f:A\to M$ is a map of left $A$-modules such that $f(1)=0$.
then if $a\in A$, we have that $f(a)=f(a\cdot 1)=a\cdot f(1)=a\cdot0=0$.
Do we need to talk about left/right modules can we assume $A$ is commutative?
03:06
if you delete the left I said and pretend that $A$ is commutative, everything I said works
Oh Mariano I got it
$f(t^2)$ is just $t^2f(1)$
Oh crap yes I was confused over the multiplication :D
that is good
as soon as you unconfuse yourself about that, the better
Yeah I forgot that now $A$ is viewed as an $A$ module not a ring :D
03:07
and it seems to have happened quite soon, so everything is cool
:)
One more thing
I have been told one does not simply define the product of two submodules
well, it is not Mordor...
but in $\mathbb{Z}$, given the submodules $(2)$ and $(3)$ we can define the product of submodules just like the product of two ideals?
what do you mean by «define the product of two submodules»?
sorry I am addicted to that phrase
well I have been told it is not possible to define it
But what if we define it like the product of two ideals
03:09
the thing is, the question does not make sense really :D
Where $M_1M_2 $ is the set of all finite sums $\sum x_iy_i$ where $x \in M_1,$ y \in M_2$
if a module has a product, then you can multiply things in it
if not, not
Oh crap
we cannot multiply two elements in a module
shit forgot again it's an abelian group under addition
i am going nuts: rings, modules, algebras......
03:10
heh
it stabilizes after a while: don't worry :P
Two many algebraic structures
I just started learning modules this morning :D
well, you are allowed ot be overwhelmed by the multitude of definitions for about 6 months
so you have plenty of time
I see at the end of chap 2 in AM I need to know homological algebra?
you can simply skip that
no one reads AM from cover to cover
(I would suggest reading a different book, in fact...)
how will I know which parts to skip and which not to? I here it is the canonical beginners text in AC
03:14
yes, that's why most people end up hating commutative algebra
ahahahahhahaha
@MarianoSuárezAlvarez I found exercise 26 in chap 1 to be super rad
I confess not to know the problems by heart :)
Well
If you have C(X)
X a compact Hausdorff space
C(X) the ring of all real valued continuous functions
then the exercise is to show that there is a homeomorphism between X and Max (C(X))
the rad part was that the topology on X was constructed out of nothing
that's cool indeed
it was constructed out of the hard work of a few generations of mathematicians :P
the best part was how we already had a basis for Max (C(X))
Then by the Urysohn Lemma constructed a basis for X out of nothing
I had never seen anything that rad before
@MarianoSuárezAlvarez Do you know the history of a problem like that? For example how it arose?
it comes from functional analysis
its code name is Gelfand duality and/or Gelfand-Naimark theorem
which areas? I would like to check it out
03:23
WIkipedia surely talks about this
yes checking it out
Historically, this arises from Fourier analysis
Thanks for the context. Kannapan has started a commutative algebra room where we discuss AM. I told him it is not possible to do AM without knowing general topology
"knowing general topology" may mean many things
youcan do AM with very little general topology
Well I think you need to be familiar with at least material of chapter 2 Munkres
@MarianoSuárezAlvarez I should get back to work. Been talking too much :D
Thanks again for your experience.
03:42
I have just thought too long about this problem, but I think my answer should be convincing, even if lacking some of the rigor that I usually like to give to answers. After having thought about it for a long time, I saw this and said, "of course!"
04:15
Hi @rob
@RajeshD Hey there. How is your day going?
just started
after a break fast
An Oat meal with no sugar and a small pich of salt
I am low on power....i'll back after a while
Why 21 upvotes for it !......looks like there is a lot of change in voting patterns
04:37
@RajeshD I think a lot of the voting frenzy was because the problem is hard to think about using normal tools. The problem is pretty simple, but you have to use simpler optimization techniques. I think that the simplicity of the answer will prevent the voting frenzy to continue to my answer :-)
Off to get dinner. BBL
 
1 hour later…
05:52
@robjohn, what you wrote is more an argument than a proof... :P
06:15
hey folks
anyone still here?
@K, hey
@Jeff You did not ping me. The first three letters are required by this @system for identifying someone to ping.
@kan, hey :D
@Jeff You did! : )
06:18
spose i received over 100 poiunts in a day and i look at my reputation and it lists the questions. but those questions aren't changed, or voted on, or anything...
@MarianoSuárezAlvarez that's sort of what I was saying by lack of rigor. I am working on trying to add that.
and you also get 100 point 'associated bonus'. where did all that come from?
also, spose some gave me a -2. what was it for?
I wonder where he is getting the problems from...
Robert Israel and Gerry's post often are caught by the poor quality posts filter and I have no choice :/
attribution would be nice
06:28
@MarianoSuárezAlvarez Who do you mean?
@Jeff Your answer was downvoted because it did not sound satisfying to the person who did it. And, they are expected to drop in a line as to why they downvoted the post. But most people don't.
@MarianoSuárezAlvarez I see. : )
@kan how come the down vote doesn't appear on my screen?
@Jeff I mean, you should be able to see it on the rep page, no?
@kan it's there now. last time i looked there were no up or down votes on my answer.
06:31
@Jeff to whom are you speaking?
the OP is wrong though. my answer may not be a proof, but it's not wrong, either. sheesh
Conjugacy in statistics is beyond my comprehension though.
@rob, talking to @KannappanSampath
@Jeff Can we start talking about something particular? Which question and which post of yours is giving you a head ache?
06:33
@KannappanSampath, several of them are. How about the +100 'associated bonus' I have in my profile? I can't tell where that came from?
@Jeff Likely to have got it from the network when you crossed some fixed rep. points. I think even I got some such bonus.
@Jeff okay :-) I haven't gotten a bounty for quite a while, so I was wondering (since your comment immediately followed mine)
@rob Is there a notion of conjugacy in statistics?
okay, i guess i'm outtie here for now. have a weekend everyone
@Jeff Bye. Wishing you a good weekend.
06:53
Hey Ben.
Just did the first two sections of Chapter 2 and the exercises from Munkres.
@Mariano Would like a discussion about closing a question as exact duplicate. Are you here?
what about it kanna?
@anon Should this be closed as exact duplicate of the question whose answer I have linked in my answer there?
I would so that no, those are not quite the same question.
@anon In which case, does my answer really answer the question?
It does not. Counting is not the same as listing.
07:04
@anon Well, the answer I had linked gives a way to list all the classes.
Oh, okay.
@Kanna A partition of n is something like (a1,a2,...) with the entries' sum being n. The number of partitions of n is p(n). So "is equal to the partition of n" is bad English. Also, I could have swore there was a closed-form for p(n) in the news recently...
@anon I'll fix that. About closed-form, I am not sure...
Thinking of which, thanks for fixing the exponent. : )
np. it's clearly the reason for the downvote.
I mean, people should allow small room for errors. I mean nobody deliberately makes such errors. And this is not gross as well. :/
Are you serious that $p(n)$ closed form remark?
yes.
07:11
Can you please point me to some reference?
5
Q: Closed-form Expression of the Partition Function $p(n)$

JérémieI feel like I have seen news that a paper was recently published, at most a few months ago, that solved the well-known problem of finding a closed-form expression for the partition function $p(n)$ which enumerates the number of integer partitions of $n$: does anybody have the reference of this pa...

@anon I removed my comment about that...
Thanks for the pointer.
07:29
Still I'm not convinced that it is not duplicate. : (
@Kannappan: Re-reading, to me it looks like what the OP wants is set partitions of a set X of size n quotiented by the equivalence relation x~gx where g is the action of $S_X$ on partions of $X$.
Actually, scratch that, I have no idea what he is talking about.
Let me finish my lunch and see what this is.
His comment below my answer makes no sense whatsoever
08:05
I am going to sleep.
(nap, yeah.)
08:39
@robjohn After reading your answer, I am impressed with the question too..(no complaints) !.........But i did not understand at one point...How did you get (3) from (1) and (2)...a small elaboration is required for me to appreciate
@KannappanSampath lucky to have a siesta !
Hey @anon : Watz up Myan ?
nada rajey.
How do you know that
know what
that people at home and close friend call me 'raje' (short form)
?
I didn't.
08:47
the what is nada rajey ???
But it's rather predictable.
darn.....
I thought 'Raj' sounds stylish
so @anon : Whats your name If i may ask ?
Rumpelstiltskin.
08:51
r u kidding
:)
you are a tounge twister !
Rumpelstiltskin is the eponymous character and antagonist of a fairy tale which originated in Germany (where he is known as Rumpelstilzchen). The tale was collected by the Brothers Grimm, who first published it in the 1812 edition of Children's and Household Tales. It was subsequently revised in later editions. Plot In order to make himself appear more important, a miller lied to a king, telling him that his daughter could spin straw into gold. The king called for the girl, shut her in a tower room with straw and a spinning wheel, and demanded that she spin the straw into gold by morn...
@tb tb tb !
Now you don't have any excuses
I think this should be closed as duplicate of this
@robjohn It's interesting to see the difference of the reactions here and on MO. Why 22 upvotes and only $\pm 1$ for you, by the way?
Hi, Rajesh, what's up?
@tb nothin...i just wanted to show you this It is simple but I made it look tedious
Thanks, I will take a look later, but I'm not quite in the mood for reading it in detail right now, my brain hasn't really started up, yet.
09:05
okay
09:32
@RajeshD Are you still there? I've now looked at your argument, but I'm pretty confused by it, to be honest.
For instance, I do not understand this:
> The minimum value of $n$ = sum of, the number of times $f_1$ is differentiable at $\tau-x$ and the number of times $f_2$ id differentiable at $x$, $\forall x \in (0,1)$.
Hi, Asaf
Still on your quest for color markers?
Good thing you remind me, I'll ask my girlfriend.
Couldn't you have let me loaf around for a while? I just woke up!
Now I have to work...
This reminds me of a conversation I overheard in the lift to the library: A: do you use highlighters? B: Yes I started using them recently. A: Good, they're immensely practical. You can see immediately if you're reading something for the second time
@AsafKaragila Don't worry, you'll find plenty of ways to avoid that :p
@tb Oh, of course I will. I'm a smart guy when it comes to procrastination and loafing around.
Good. Now to email Magidor and ask him which of these theorems we already covered in class, because I cannot remember!
@tb It's not the first time he's been doing that.
Once he did that after his answered turned into CW. I flagged another answer which was CW-ified to be un-CW and mentioned his answer and that someone should look into that.
I was hoping to write an answer to that new question on AC, but I simply don't understand what on earth does that guy want me to answer.
@AsafKaragila I don't understand this question at all.
Which one?
Ah. I thought you meant my question, because I didn't ask one and it seemed weird.
8-).
So GEdgar was trolling me!
10:16
Morning everyone.
Guten Morgen!
Guten Morgen, Asaf.
morning
Hello Teddy. Look at all the sun!
Yeah :)
10:19
Got any plans to go to the lakeside and play Hacky and drink beer with your buds?
(Or is that not your idea of "enjoying the sun"? : ) )
That seems to have left him speechless...
I'm in serious want of dexterity when it comes to any kind of juggling. The only thing I really could handle was the diabolo. No I'm amply satisfied by just sitting in the sun (provided it's warm enough, which it currently isn't) :)
I am unfamiliar with the concept of a cold sun.
Never been skiing?
Nope.
The only time I've been abroad was in Ireland and the sun was still warm (late September).
10:24
: O
@AsafKaragila you'll find out what it is when you go visit your metal friends in Norway :)
Asaf has metal friends in Norway? Heh.
@tb Well, I used to have several friends from Norway related to the metal scene. I've since cut ties with "everyone" several times so by now I'm not in touch with any of them.
My integral got starred : D
And? Did you compute it? : ) I saw Jeff had a go.
Well there was another volley around 2:30 (one hit in the city somewhere) and another around 6...
And the problem is that I'm living right by the alarm horns, so I can't just ignore them and keep on sleeping.
10:31
Notation question: given a cardinal $\kappa$ how do you usually denote the cardinality of the iterated powerset, that is $\kappa_0 = \kappa$ and $\kappa_{n+1} = 2^{\kappa_n}$?
$\mathcal P^\alpha(\kappa)$, if you want $\alpha\ge\omega$ then you have to specify what happens at limit points though (direct limit usually works fine).
There's a variation on $\beth$ numbers in which you also note the starting point. That could come in handy too if you prefer it that way.
That would be $\beth_{\alpha}(\kappa)$?
I think so. I've only see that used on Wikipedia though, never in books or papers. It's best to also define that in a line or two.
@AsafKaragila the problem with that is that I've seen people use this for the set of subsets of cardinality equal to $\alpha$
(even though it strikes me as slightly nonsensical)
That would be a subscript index, usually.
Although that too is nonstandard since $\mathcal P_\kappa(\lambda)$ means all the subset of $\lambda$ of cardinality less than $\kappa$.
10:38
Those guys would write $P^{\leq \kappa}(\lambda)$ for that
How nonstandard of them.
I do know the notation $[\lambda]^\kappa$ for "all sets of size exactly $\kappa$"
Thanks, I'm not running the applet, obviousy :)
You're funny : )
I have very strong feelings that the Wikipedia article on Beth numbers is full of mistakes.
And mysterious. The plug in is just too convenient to not be run.
10:41
Quick question on algebra: "Describe the set of equivariant maps $G/H\to G/K$." Would I be correct saying they are $xH \to xvK$ for each element in the set of $v$ such that $vHv^{-1}\subseteq K$ quotient'd by the action of $H\cap K$?
@AsafKaragila Yes, that's what I encountered most frequently. Thanks, that's about what I wanted to hear, I'll just write down the iterative definition since I don't seem to need to use that systematically.
Where are you using it? if I may ask.
I've written up the isomorphic classification of some special types of Banach spaces and for one type there's a cardinal invariant of this form coming up.
I see. Sounds like fun! :-D
I'm gonna go and kill some chickens now (not literally). I'll be back shortly...
I see. Sounds like fun! :-D
10:45
: )
(actually, I should have written $\to xv^{-1}K$ I guess.)
You're right, anon.
Cool, thanks.
@tb It is fun.
Moreover I fear that my thesis might be in danger, they are releasing Chicken Invaders 5 soon!

« first day (584 days earlier)      last day (4731 days later) »