« first day (672 days earlier)      last day (4356 days later) » 

5:02 PM
zhen lin's bookmarklet is working
 
@tb Ah yes. Thank you very much.
 
@MarkDominus They explicitly do not want such tag implications. See also this blog post on "meta tags".
 
the cloudfront url is down. I will change the URL in my bookmarks, because I know that the cdn.mathjax.org url works.
bbl
 
Your bookmarklet works fine for me @robjohn.
 
Thanks. danbooru explicitly bans subjective and meta-tags with very few exceptions. Tags are required to describe exactly what is visible in the tagged picture. I think that's another reason they have been successful.
Otherwise you get a lot of pictures with the useless tag "gross" or "sexy" or whatever.
 
5:06 PM
I see.
 
They also make better use of the tag wiki than we do. If you're not sure if some tag applies, there is sure to be a fairly clear description of it, with examples.
Oh well, it doesn't matter because our tags are not going to go in that direction.
Jeff Atwood sure can be doctrinaire about some curious things.
 
There's not that many users that actively worry about tagging. You should probably talk to J.M. or Martin Sleziak if they happen to be here.
Willie Wong is the moderator who is most involved with tagging, as far as I can tell.
 
I'm mostly just thinking aloud.
 
Going to cook awesome delicious dinner. bbl
 
If you have a look at , most of those questions don't have high view counts.
I.e. not too many people look at them, only a few of them vote - no consensus is reached...
 
5:17 PM
right, thanks.
It also bugs me that I can't even suggest a tag synonym until I have some number of points scored in that tag.
 
I did not know that.
But as I've learned here, mods can make synonyms, so in case of emergency, it is possible to create a synonym even without people having some rep in the particular tag.
 
"Users with more than 2500 reputation and a total answer score of 5 or more on the tag, can suggest tag synonyms."
So if there is some obscure tag X that is used occasionally but which should be a synonym for Y, then most users who notice it are effectively prevented from pointing this out.
Because you can't get 5 points on tag X without answering a question in it, and X is not used often enough for that to happen.
 
0
Q: DuckWord Lewis Method

Yatin KI know when a rain hits an International match in world Cricket The match if unplayable then its been decided by a method called Duckword Lewis method i wanted to know as to how this method was derived and how it works ?

Hi , Everyone
Please look into my question
 
ohh no
@skullpatrol: is here
 
5:22 PM
It's Duck*worth* Lewis. Have you tried WIkipedia?
 
ok
 
also, not number theory
 
i will edit it
so
hmm
 
Okay, I've updated all copies of my bookmark to use the unbroken url.
 
sorry
 
5:24 PM
@YatinK You got that right, skullpatrol is in the house.
 
:P
 
If you are using my bookmark for MathJax, please go here or here or here and reinstall it.
16
 
@robjohn What if I think I might be using your bookmark for MathJax but I'm not sure?
 
@MarkDominus the old one seems not to work because the URL embedded in it is broken. If you see the LaTeX rendered in chat, then you're okay.
 
I see $\LaTeX$ rendered in chat, but new equations aren't rendered. I have to execute the script explicitly to render new $\LaTeX$. Is that expected behavior?
Or sometimes it gets rendered, and then unrendered immediately.
 
5:32 PM
@MarkDominus If that is the case, then you're okay
You can try Zhen's bookmark which re-renders the LaTeX periodically
 
@ZhenLin: I think the ajaxComplete event is getting posted, but then the MathJax is reset soon thereafter. It may be that the ajaxComplete trigger was moved or something was added after it.
 
No, the ajaxComplete event is not getting triggered for received messages.
Only sent messages.
 
still problems with MathJax?
 
The mystery is really more about how the chat works than how MathJax works.
 
5:39 PM
@robjohn Fixed. You are so awesome! Hail King Rob the Square!
3
 
so
@ZhenLin any comments on that exam?
 
Disastrous.
 
yup similar for me
 
Umm, it doesn't work for me.
 
I thought it was horrendous. I think i answered 1 question
 
5:43 PM
When I click on the bookmark in the toolbar, it goes to a page instead of rendering the page.
 
the worst part is that he put the twisted cubic on the exam
He gave the solution for that, so we have no excuse for not knowing it...
 
which question was that?
 
Q3b
 
I did 3 but I waffled a tiny bit
Im pretty sure I got the r=1 and r=3 bit
and I didn't now how to show every vector space was free, so I showed it in the finite dimensional case and said that because V is the direct limit of its submodules that might have something to do with it...
 
@PaulSlevin & @ZhenLin : have you guys ever attended the same class together?
 
5:47 PM
we have some common exams
I couldn't even parse the language for a lot of it. I wish he would jst stick to commutative algebra
 
Thanks, just wondering :D
 
every vector space is free by a Zorn's lemma argument
you should know that, being a set-theorist :p
 
I know but I've never looked at it
its just something people have talked about
I am more of a chapters 7,8,9 of Jech - theorist
 
I mean, you just do the standard thing
 
I invented my own extremely bizarre argument
 
5:49 PM
let $\Sigma$ be the set of linearly independent subsets of $V$ partially ordered by inclusion, etc.
 
ah shit i bloody did that first!!!!
 
I mean, it's not at all obvious to me that the direct limit of free modules is free
 
(its not I don't think )
I had to write something
Did you talk to anyone that found it easy / not hard?
 
not so far
everyone seems to think it was quite hard
 
yeah
that is of course good
it is depressing I am losing about 10-15% every time I sit an exam
 
5:54 PM
Does your University have retests?
 
nope
I don't think so anyway
I'm nt sure what happens if you are ill
I mean I'm pretty sure I will pass thought, my expected average is about 53% across all the exams
including today
 
All or nothing is so old school :(
 
as long as I don't truly balls up Operations Research
" Let R be a ring. A connected component of Spec(R) is of the form
V (I), where I is an ideal generated by idempotents such that every idempotent of
R either maps to 0 or 1 in R=I "
some columbia notes I found. Guess I got that question wrong wahh
 
@PaulSlevin There are some liberal schools now that not only allow retests, but also have open book exams with the option of being able to leave and go to the library to find info, even take home exams are becoming popular.
 
6:14 PM
Yeah, I had a vague idea of what was needed to do Q1a, but Q1b put me off
Totaro has mastered the art of writing questions with an easy half and a hard half
 
@robjohn I missed that :(
 
@skullpatrol just testing something
$$\psi(x)+\gamma=\sum_{k=0}^\infty\left(\frac{1}{k+1}-\frac{1}{k+x}\right)$$
 
@robjohn Oh, are you in favor of open book exams?
 
$$\Theta = \mathrm{d} \theta + \theta \wedge \theta$$
 
@skullpatrol I have no objection against them
 
6:26 PM
@robjohn How about take home exams?
 
hard half and a hard half to me
I think exams are good but they are only good if they actually reflect the work you've done
like if you have studied the course you should be able to answer something
But some exams I've seen it wouldn't matter if you studied for 4 million years before them
 
Funny thing in Cambridge is, there are people who say that exams should be, well, like that one. Problem-based tests of "understanding" rather than "knowledge".
 
well they should all be like that. its absurd that some are easy and other are brutal
others*
What I mean is that
they should be similar
 
definitely
 
otherwise you can inadvertently completely screw yourself
by picking the wrong courses
 
6:33 PM
$$\psi(x)+\gamma=\sum_{k=0}^\infty\left(\frac{1}{k+1}-\frac{1}{k+x}\right)$$
 
yes... but that's a well-understood principle, surely?
 
yes but
it's not very fair
I guess they tell us that. Part III is not fair, get over it
 
that's what normalisation is for...
 
yeah I guess
I hope it gets done
anyway I am spent. literally goign to bed now
 
Would someone post some LaTeX please?
 
6:35 PM
$ \mathrm{Goodnight.}$
 
goodnight!
 
LaTeX :D
 
$$\exp x = ({\textstyle 1 - \int})^{-1} 1$$
 
Drat! I got my bookmark to work when I post LaTeX, but not others :-(
as soon as I type something, yours render.
 
Yeah, that's how it should work if you hook into ajaxComplete.
I haven't had the time to track down how the chat is loading new messages. If I could figure that out we could hook into that instead.
 
6:37 PM
Why is $$f\left( x\right) \equiv \sum_{k\geq
1}\frac{c_{k}}{\left( x+a_{1}\right) \left( x+a_{2}\right) \ldots
\left( x+a_{k}\right) }.\tag{A}$$ http://math.stackexchange.com/q/123632/752
 
@ZhenLin The Ajax code is all compressed so it is hard to read.
 
Yeah... you can pass it to a prettifier, but all the function and variable names have been encrypted.
 
@ZhenLin bleah!
 
Probably the easiest thing for us to do is post a question on the main StackExchange. As a hypothetical programming question. Hah.
 
What Zhen said
 
6:40 PM
obfuscation is good and obfuscation is bad
 
Well, it's not so much obfuscation as it is compression, to be fair.
 
@ZhenLin the names are encrypted as part of the compression?
 
Sure. If you rename variables so that they're all one or two letters long, that counts as encryption, right? :p
 
@ZhenLin that's what happens when you obfuscate Java code.
 
Surely not, because the function names have to stay the same...
 
6:42 PM
@ZhenLin only the public ones
 
Right, but most are public, no...?
It seems difficult to write object-oriented software using mostly private methods.
 
Not private, but protected or package-protected
 
ah
 
and those can be obfuscated for some software protection
 
but in principle, protected functions should also have unobfuscated names, because they could be invoked by subclasses.
 
6:47 PM
Let F = \overline{\mathbb{F}_{3}}(t). Are there any irreducible, separable cubics in F[x]?
 
@ZhenLin If they are intended for use by classes outside the program, then yes, but those are mainly pubilic
Most obfuscation programs let you specify functions to be left unobfuscated and whether to obfuscate protected methods
 
But it seems like an exercise in futility, somewhat. The Java bytecode (and MSIL) is just too structured...
(irony!)
 
@ZhenLin There are some obfuscators that try to rewrite the code to make it less structured.
 
@ZhenLin Problem-based tests of "understanding" rather than "knowledge". Seem to me to favor the argument for open-book exams don't you think?
 
Yeah, I would expect any half-decent one to do that.
 
6:51 PM
and without the names, the purpose of a section of a large program is hard to determine
 
But there's only so much you can do when everything has a type annotation!
The ultimate way to obfuscate Java should be to compile it down to native code, statically link, and strip out symbols.
 
@ZhenLin that is hard to do in Java
the compiling is usually at runtime
I think most implementations use a JIT compiler
 
Sure, but by the same token it can be done ahead of time.
 
@ZhenLin in Java?
 
The GNU Compiler for Java (GCJ or gcj) is a free software compiler for the Java programming language and a part of the GNU Compiler Collection. GCJ can compile Java source code to either Java Virtual Machine bytecode, or directly to machine code for any of a number of CPU architectures. It can also compile class files containing bytecode or entire JARs containing such files into machine code. History Almost all of the runtime-libraries used by gcj come from the GNU Classpath project (but compare the libgcj library). As of gcj 4.3, gcj integrates with ecj, the Eclipse Compiler for Java....
 
6:58 PM
How can one even know there exist such things as Fréchet spaces, weak$^\ast$-topologies, Radon measures and not be able to figure this out?
 
The bytecode is not really compiled code as one normally thinks of it. However, the compiling to machine code is nice, but not portable, and definitely not Java
 
@robjohn I know what the bytecode is. I read the JVM spec many years ago back when I had thoughts of doing computer science. :p
 
@tb The first comment is wrong. Lebesgue first proved that
 
@tb I've heard of all those things but I can't immediately figure it out either!
 
@ZhenLin I wasn't trying to denigrate, I was just commenting on their use of "compiled"
 
7:02 PM
@tb What do you think of open book and take home exams in Mathematics?
 
@tb Perhaps he decided to learn the more basic stuff first.
 
I dunno. I don't really think of Java as being a way of writing platform-independent apps anymore...
 
@robjohn It was addressing the typo "Reimann". Actually it was Riemann who first proved that result. You don't need Lebesgue measure to define null sets.
 
@tb I know that, but I read that it was Lebesgue who proved it. I will have to check my sources.
 
@robjohn It's the content of §5 here.
 
7:05 PM
here it is called "Lebesgue's criterion for Riemann integrability"
that is what must have confused me
 
Never mind.
 
@robjohn I know that people call it that way, but it really was Riemann, I think. Maybe people thought that argument was a bit too "handwavy"
 
@tb however, I had thought I'd heard it elsewhere, too. I am trying to read that section. It definitely talks about null sets, not countable?
 
I'm still trying to figure out what MathJax has to do with the game of Jacks ;-)
 
7:17 PM
@ZhenLin: I have changed .ajaxComplete(function(){MathJax.Hub.Queue(["Typeset",MathJax.Hub]);}); to .ajaxComplete(function(){setTimeout(function(){MathJax.Hub.Queue(["Typeset",Mat‌​hJax.Hub]);},1000);}); in my bookmark and that makes it so that every time I type something, all the LaTeX renders.
and it keeps the LaTeX I type from immediately reverting (it stays renedered)
However, it seems that ajaxComplete is not called by others typing.
 
Hello everybody!
 
Hello.
 
If I'm not mistaken, a unit ball in $L_{1}$ is not weakly compact?
 
No the unit ball is weakly compact if and only if the space is reflexive.
 
thanks
 
7:23 PM
Good night.
 
@MattN hi
 
@MattN Good night
 
And is the space $C^{} = BV$ reflexive? (I think that $C^{*}$ is a space of finite-additive measures, but I don't know anything about it's conjugate)
 
good-day mathaholics and reputation-chasers!
 
@DavidWheeler good evening
 
7:48 PM
 
@robjohn I looked in one of my old history books (by Walter, no online version available): there the situation is presented as follows. Riemann's student Hankel fleshed out the passage I linked you to. Unfortunately he made some mistakes, which subsequently led Smith to find the fat Cantor sets (found independently by Volterra in his construction of the function named after him). The situation was clarified only Lebesgue, Vitali and Young who independently proved the "Lebesgue criterion".
3
 
Hi guys!
 
Help me please: the unit ball in BV[0,1], is it a weak*-compact? (It isn't weak-compact since BV is not reflexive)
Hi @JonasTeuwen
 
@skullpatrol Buuhuhhuuuuuuuu
 
8:06 PM
@N3buchadnezzar I'm proud of it ;-)
 
Oh, I was just saying hi.
 
OK :D
 
8:18 PM
What is weak*-compact? I keep seeing it, but I don't know how to look it up.
never mind, I think I found it.
here should anyone else care to look
 
@MarkDominus it's the topology of pointwise convergence of linear functionals so $f_i: X \to \mathbb{R}$ converges to $f$ if $f_i(x) \to f(x)$ for all $x \in X$. The most important result is weak*-compactness of the norm unit ball in a dual Banach space (Banach-Alaoglu Theorem) -- all that's probably on the wikipedia page you found.
 
My second (unofficial) supervisor is... awesome.
 
why? did you have some beer and coffee together?
 
Why?
Is that a rhetoric question?
Because the man has taste.
 
presumably a rhetoric question :)
 
8:26 PM
8-).
 
@tb thank you.
 
@MarkDominus M Turgeon recently wrote a really nice answer containing the proof of the Alaoglu theorem (under the heading "instructive proofs in functional analysis").
2
 
Thanks. I don't think I have enough background to understand the statement though.
I will put it on the list of thing I need to investigate.
I already needed to learn how the double-dual space is isomorphic to the original space.
 
Brr, would there be a way to compute $\partial_x e^{f(x) L} u(x)$ for some unbounded operator $L$?
Is there even a way to compute $e^{f(x) L} u(x)$. I have an integral kernel for $e^{tL}$ 8-).
 
8:48 PM
Has someone read Truesdell's Essay on the $F$ equation?
Namely $$\frac{\partial}{\partial z}F(z,\alpha)=F(z,\alpha+1)$$
 
@MarkDominus The main use of this result is "existence via compactness". For example you can rephrase the solution of certain differential equations as a (unique) solution to a minimization problem for which you can find good approximants. Compactness coming ultimately from that abstract result then gives you the extistence of a minimizer with which you can then work further to understand the differential equation and its solution.
(Very roughly)
 
9:02 PM
Does anyone here know how math graduate schools view the general GRE and the math GRE subject test? Are they a big deal, like the LSAT is for law school?
 
My impression was that although a bad score on the GRE could count against you, a good score could not count in your favor.
 
So as long as you don't do poorly, it's more a formality?
 
I should probably not have said anything, since I really don't know and have not looked into this since about 1990.
 
Oh that's all right, I was just curious. Thanks.
 
@tb Thanks for the research! above the call of duty
 
9:14 PM
No problem -- I wanted to know the details myself :)
 
@anon twas I :-) I was just poking to see if you had seen my comment on your answer.
@tb with no votes
 
That, too. MathJax was still compiling when I saw the green checkmark appear :)
 
so i have a curiousity. is
$$
\int \sqrt{\tan^5 x} dx
$$
integrable and if it is, is it hard to integrate?
 
@tb that is amazing.
 
Soup?
 
9:18 PM
@Eugene wolfram spits out a mess but it is elementarily integrable, it seems. At least if you trust SW.
SW = Stephen Wolfram.
 
@tb yikes. it was a challenge given by my friend. very mean spirited one looking at this now.
@tb thanks!
 
@Eugene I am writing on a integral document, and yeah. That one is a mess =)
The cubic root is nicer, and the square root is even nicer. But still requires some trickery to be solved. The intital step is to use $u=\sqrt[a]{\tan x}$
 
oh well at least i didn't spend too much time on it.
 
@Eugene it is equal to $$\frac23\tan^{3/2}(x)-\int\sqrt{\tan(x)}\,\mathrm{d}x$$
 
For a more interesting question is $$\int_0^{\pi/2} \sqrt[\Large a]{\tan x} \, \mathrm{d}x$$ solvable for all a>2 ? ;)
@robjohn Parts?
 
9:23 PM
@robjohn hm..
 
I have a little problem: will a support function of open neighborhood of zero in $C[0,1]$ be positively defined?
 
@N3buchadnezzar nope, just noting that $\tan^2(x)=\sec^2(x)-1$
 
I meant does the integral converge, not if it is solvable. but meh =)
 
@N3buchadnezzar The case $a=2$ converges.
 
@N3buchadnezzar It converges for all $a>1$
 
9:25 PM
@PeterTamaroff for $a\in[2,3] \, \Rightarrow \, I=\pi/\sqrt{a}$
 
i found pete clark's reply on this very insightful. i have a lot to think about now.
 
Gah, I hate my nett, obviously this only holds for a integer.
 
@N3buchadnezzar what?
 
@N3buchadnezzar Have you tried Leibniz Rule?
 
is math really a young man's game still these days?
 
9:37 PM
Never was, never will be.
 
@PeterTamaroff You would rather integrate $$ \int_0^{\pi/2} \left( \tan x\right)^{1/a} \log\left( \tan x\right)\,\mathrm{d}x $$ ?
 
@tb that makes me feel better.
 
One never knows what will work out better!
@tb I see that you disagree with GH Hardy then.
 
@Eugene It's one of those overemphasized things from Hardy's apology, written by a sad old man who saw himself unable to rise up to his mathematical power from his earlier days.
 
@tb yes i read hardy's math apology recently (a gift from my professor) and it made me a little freaked out.
 
9:41 PM
@tb I see his apology as a lament or something of the sort..
 
he certainly was a very good mathematician though.
 
@Eugene Sure.
 
@Eugene No doubt. I liked the book, but I don't like how some highlights are taken out of context.
 
@tb i'm glad you liked the book. maybe someday i'll appreciate it more.
 
I know quite a few mathematicians who did really good work after sixty.
 
9:44 PM
@tb i had this is discussion with my professor and when i mentioned that he said sure but they did their best work in their youth
@tb oh well. maybe i'll just take his advice and just do math instead of talking about it.
@tb thank you for your replies.
 
@Eugene I simply don't believe in the myth. Maybe it is true that younger people are more daring than older ones and that their early results were more surprising because they were unexpected (and coming from someone people didn't know already).
 
@Eugene thanks for that! Funny that the picture on Ellenberg's homepage was taken by Kowalski who is my neighbor (he lives about 200m away from me)
 
@tb emmanuel kowalski?? wow! i heard him speak in 2010 in madison as part of our distinguished lecture series.
it was on compressed sensing.
that guy is amazing
 
Yes, he's really cool
I only saw two talks of his. But unfortunately both were disrupted by his brats.
 
9:56 PM
@tb his brats?
@tb i'm guessing the both of you are colleagues?
 
@Eugene Yes, he had his kids with him and told them to sit in the back of the room and be quiet. Obviously, his mathematical authority surpasses his parental authority by a huge amount :)
 
@tb lol
 
@Eugene Not really. He's a full prof while I'm still lingering along as a post doc.
 
@tb well i think that qualifies as being colleagues
@tb anyway thanks again for the cool reply.
 
Oh, it was quite funny the first time, the second time it was a bit annoying.
I would really have loved to see more of his work on hyperbolic threefolds.
 
10:02 PM
can't you look at some of his papers?
 
Sure, I could have. But the talk was nicely constructed towards a completely different climax...
 
and luckily for me his kids did not tag along during his madison lecture.
@tb yes i thought he was very good at giving talks.
 
Oh, he certainly is. Anyway, I should do some stuff now, I'll be back a bit later.
See ya!
 
@tb ok! bye! have a great day!
 
 
2 hours later…
11:46 PM
hi all
 

« first day (672 days earlier)      last day (4356 days later) »