« first day (605 days earlier)      last day (4712 days later) » 
00:00 - 21:0021:00 - 00:00

00:02
Can we close a few among this, this, this, this and this?
@robjohn André didn't think so either :)
@tb Actually, I had started commenting on his answer, citing my previous answer, and thought to myself, this is a decent answer on its own.
Thanks executioner Zhen Lin!
What does 92% mean in CW answers like this?
How much remained from the last edit?
@anon Like, 92% of the characters here were introduced by that user?
This also needs a-closin'
00:08
technically the first wasn't about approximation, but the same ground is covered
Only 150 yesterday. I don't think I've gotten an acceptance for quite a while.
I guess 2 days ago.
Might as well be years.
Brian Scott got 7 acceptances yesterday.
Well, at the rate he cranks out answers, this is no surprise. He has already overtaken Didier and it won't be long that he catches up with joriki and Gerry.
user19161
@robjohn You can beat him by trying to publish 7 papers while he is doing that. :-)
00:21
@WillHunting I wish
Oh God, let's not talk about papers.
Major annoyance...
user19161
@DylanMoreland Except toilet paper and newspaper. :-)
01:16
It might be better to not star messages about other users. It seems to set off drama cycles more often than not.
Or do it, but keep in mind that you'll have to go through the process of $X$ quits $\Rightarrow$ "$X$ wasn't so bad" $\Rightarrow$ "let's star another message asking $X$ to come back" $\Rightarrow$ "good to have you back, $X$" $\Rightarrow \cdots$.
I feel like a fraud when I write answers about stuff I don't know much about :D
 
1 hour later…
02:34
zz
03:05
Hmmm... is there a way to show that for an exact functor $U$, $(R^n F) U \cong R^n (F U)$?
03:58
zzz
04:09
so alone
04:19
isn't everybody
any chance you'd be willing to look at a pattern?
what kind of pattern?
trying to figure out how to derive the c=2 and c=3 cases
the c=1 cases are easy enough to construct given n
where are these numbers coming from?
an earlier program of mine solving a problem
trying to find a pattern so i can figure out values for high and c
without needing to calculate them directly etc
04:32
like, did you ask strangers for these numbers, or is there an actual method that produced them?
method produced them
HI @anon
looking at a bunch of numbers and grasping for formulas that produce them doesn't sound like my idea of fun. hey Raj
it's part of deriving an optimal algorithm for solving a difficult problem
brute force low-parameter cases, figure out pattern to exploit
sounds like even less fun now :P
04:34
solve high-value parameter case
but seriously, I don't know what the numbers mean, what they represent, so in having no insight I'm left with basically some IQ-ish puzzle checks and pure luck.
yes
at this point what they represent likely won't help much
if you must know they are the counts of distinct xor=0 positions in a nim variant based on initial parameters
which equate to the sum total of winnable positions (ie. no matter what opponent does, i win)
@anon : are you into real analysis
well, I know it moderately
04:53
Here @anon
Hi @paradox
@Rajesh: Isn't it kind of myopic or alienating to jump straight into talking about "Cf" without first carefully defining what the "C" means?
I have defined
under 'Definition'
Or wait. Was your #2 the definition of #1?
yes i mean they both mean the same
2 defines 1
thats all i meant
i agree it is a bit idiotic to write that way
@anon
When we write something like "the following two are equivalent," we are making a lemma or a proposition, not a definition. For that you just want to say "$Cf(x)$ is the maximum number of times $f$ is differentiable at $x$."
05:02
yes
agreed
I don't know why i thought like that when i was writing it
I had a strange sense of common sense then...anyway thanks for pointing out and clearing my mind
05:14
@RajeshD: Alright, I skipped the closure under + section but I think I understand the question now. I might read the given answer / edit the question for readability / tackle the question in the next week sometime.
thanks @anon
@anon : did you find it interesting in any way
not particularly, no
@anon : I have a strong motivation behind it
oh?
i mean on the given class of functions
Let me explain it to you and see what you'd say
Hi @Antonio
05:26
Hi Rajesh. How are you?
fine what about you
I'm good. Just dropping by the chat to see what's up. I might go watch a movie soon.
Oh which one ?
@anon : are you awake ?
Yes.
What r you doing then
05:30
The Cooler, with William H. Macy
Laughing to myself deviously and without shame, knowing one of Gerry's recent answers is totally and utterly wrong.
Mwuahahahaha.
Gerry Myerson ??
@anon : then why don't you downvote it
the second he comes back on mse and checks it he'll know it's wrong and delete it, so there's no point
05:46
Ok bye guys later
bye
 
1 hour later…
07:13
Hi.
 
2 hours later…
09:07
@Fx I would say that yes. The usual convention is that repeated indices are to be summed over, so more explicitly, your $f$ seems to be defined as $$f(\vec{a}) = \sum_{k=1}^n \sum_{i=1}^n \sum_{j=1}^n S_{ijkk} a_i a_j$$ (where I assumed that all indices run from $1$ to $n$.)
(oh, now I see that your question was answered on physics.SE). Never mind.
09:25
@tb Hi.
He has been posting questions from a different handle and answering them from this handle!
Hi. Well, I would expect a little more cleverness from a guy who studied CS.
(but maybe it was pre-internet... :))
If you saw, there were integrals he asked and answered them in less than 5 minutes!
Of least importance, he has been downvoting my answers every day. (An almost confirmed fact.)
@tb: I'm slightly confused about acyclics. How can you define them before you have a derived functor?
@ZhenLin You're not the only one that is confused... There's a lot of silly stuff in the literature. The best definition (rather a sufficient condition) I'm aware of is in the Added bit of my answer here.
(see the theorem)
Ah. So one first a subcategory on which $F$ is exact. I see. What is the condition (1) about though?
09:40
You need that at various points in the argument. One place is when you try to look for a replacement of the Horseshoe lemma (for the long exact sequence).
Hm, OK.
Basically the conditions guarantee that $\mathcal{A}$ is closed under all the constructions you need when verifying that you have a universal $\delta$-functor by defining it using an $\mathcal{A}$-resolution and taking homology.
I am wondering where one would get all the required lifts/extensions needed to define the functor if one doesn't have the lifting/extension property of projectives/injectives...
You build them using push-outs and pull-backs.
Ah. The hard way then, much like doing generalised-element-chasing without enough projectives.
09:48
Yes. Basically the point is that you construct the derived functor by taking the colimit over all $\mathcal{A}$-resolutions. A derived functor is a Kan-extension, after all.
Ha, that's news to me! I should learn that point of view sometime.
I think the basic idea goes back to Buchsbaum here but I don't know where that is written up in more modern terminology. The derived category approach to that is due to Deligne and is well explained in Keller's notes on derived categories and their uses.
10:05
Ah, thanks.
Right now I'm stuck on a different problem though... I need to figure out why sheaf cohomology is independent of the base ring.
 
1 hour later…
11:26
Morning everyone.
@MattN very early morning :-)
@robjohn Hello King Robjohn the first : ) Not so early here : )
Good morning
Morning Nimza
@MattN 4:30 here :-)
11:32
Do you now which branch of mathematics works with optimal forms of objects? For example optimal plank form etc?
@Nimza what's up?
@robjohn Do you live without sleep?
@tb ayt?
@MattN Rob is a machine 8-).
He also has a built-in CAS.
@JonasTeuwen Brian Scott is a machine...
11:33
@robjohn nothing interesting
@JonasTeuwen What's a CAS?
Computer Algebra System (like Mathematica)
I see.
I'll be back later. I wanted to ask the teddy something but he doesn't seem to be around.
Later folks.
@robjohn says one machine about the other :)
Oh, I missed Matt...
11:49
@tb wait a minute, someone kicked out my power plug. I have to reboot. :-p
@tb No, Matt is here and he'd like to know whether you watched the film.
@MattN No, I haven't. I tried, but the face of Jim Carrey was too much for me to take at that moment. I'll try another time.
@tb How far did you watch until you reached that decision?
30 seconds?
Never mind : )
11:53
Saw that. :)
What? I think you are imagining things.
Rob
Rob
@robjohn
How many hours of sleep do you average per day,
if you don't mind me asking?
@Rob probably 4 to 6
@tb You'll get a carrot if you watch 30 minutes. If by then you are still put off by his face, never mind. But I'm quite sure you'll end up watching it to the end.
Ok. I'll be back later. Have to work on my additive combinatorics thing.
12:17
Pie for everybody! It is a good day.
12:31
Am I missing something, or are the OP and the first answerer missing the point here?
@JonasTeuwen is that $\pi e$ for everybody?
Even the people commenting seem to be lacking proper clues.
I can breathe easier, Didier has added his approval :-)
12:50
Those exclamation marks annoy the hell out of me
@tb I wish he'd stop that! ;-)
@robjohn me too!!!!!
Ah, now I'm saying it! Now, I've said it again, ahhhh! -Knight who says Ni
glorious spam!
sorry, I seem to be channelling Monty Python this morning.
:4045060 :)
@robjohn it took me a while...
He uses ! like others use \rm
Hmm... != $-1$ rep
13:04
????^
Is that "Not equal to $-1$ rep''?
@KannappanSampath Just a suggestion for tb's dislike of chessmath's !s
I don't want to be punished for serial downvoting...
Although I considered it :)
@tb I am very close to proving Sylvester and Jacobi Inertia formula! Thanks for bringing that to my notice. I see that theory of bilinear and quadratic forms is very rich.
I am enjoying it so much.
@Rob (=Skull) What are you?
@KannappanSampath Yes, it still is a very active area of research. Voevodsky earned his medal also for proving stuff about quadratic forms.
I see. Let me look up his name.
13:12
(to look up, I mean)
Hah, so kind of you. Thank you.
I wonder how one would come up with such things!
What kind of things?
That "Explaining [....]". I am more into believing that requires skill! : )
13:23
Is having a sense of humor a skill? Guess so...
Yes, most certainly. I know that I lack that. But yeah, I appreciate that.
13:43
This question needs a better title. But I'm not sure if "counting permutations without fixed points" is a good one, since the asker may not understand it.
13:54
We have an Iyengar question now.
Hi @ymar
@KannappanSampath Hi. He seems to be a nice guy, and honest, but I'm afraid I don't understand this question of his.
@ymar Hmm, In the online persona of people, we have no way of gauging someone's hnesty IMO, but as for nice, I might suggest you review your definition.
@KannappanSampath I'm not sure why I should.
@ymar It's not that you should but you may.
@KannappanSampath I understand you were suggesting he wasn't nice at all. I haven't noticed that.
14:08
zzzz
14:44
@KannappanSampath I don't see how to salvage that question.
15:09
@leo: re: your comment here. You may be interested in this thread for a derivation of the identity $m(E) = m_\ast(E \cap A) + m^\ast (E \smallsetminus A)$ from scratch without using any topological notions.
Got a bottle of Pepsi with Didier on it!
3
15:26
Hi Mariano.
leo
leo
@tb NIce. I have [what's the past of see] at some point :-)
@tb, there is a small typo in 5. in the first equation you forget a $m^\ast$
at the beginning
and hi all
@leo thanks, but I don't see where you mean. In this line:
$$m_\ast(E \cap A) + m^\ast(E \smallsetminus A)
\geq \sup{\{m_\ast (F \cap A) + m^\ast(F \smallsetminus A)\,:\,F \subset E \text{ measurable, }m(F) \lt \infty\}} \quad?$$
and hi.
leo
leo
@tb indeed
the code is fine
I must be blind. I don't see a $m^\ast$ missing.
leo
leo
in my browser that line don't have the first $m^\ast$
I'm using IE 9
:-(
this is'nt my computer
15:39
I see...
Have you tried shift-refresh or whatever the equivalent of IE of reloading a page without resorting to the cache is?
leo
leo
yep
and it didn't work?
leo
leo
nope
stupid question, I know :)
leo
leo
this browser is very bad
ie10 is better
however I use Chrome
15:44
I don't know. I don't think I've ever used IE.
Okay, I gotta go. See you soon!
leo
leo
see you!
16:08
@ymar Can we do some bilinear forms?
@KannappanSampath I remember very little of that...
16:30
Hmph, fine. I'll then do that on my own.
@KannappanSampath There :-)
Ah, thank you very much.
Hi Antonio
Is this "Show Math as>TeX Commands" working for people?
@robjohn, I've been trying unsuccessfully to extend your proof here to x >= 1 without success.
redundantly, apparently
16:37
And, is the Math in the comments printed in bolder font?
On any page?
It works for me on the page I just linked.
@AntonioVargas Yeah, I got a simple way to get it to 1.4, but I need to work more on it.
@KannappanSampath on the main site or in chat?
On the main site.
@KannappanSampath I think they both work for me.
Let me see here as well: $ab$ is $ab$.
16:40
works for me
For me, it opens a new window and I click that it is gone!
Have you tried a different browser?
@KannappanSampath You get this: i.sstatic.net/59Dmo.png
@KannappanSampath or not?
@WhatsInAName hi
16:48
Hi WhatsInAN.
...ame.
@robjohn Yah.
17:13
Sorry, I went AFK as my computer had to die because of the battery.
@robjohn Yes, I do get that.
17:31
@KannappanSampath but clicking on the "TeX Commands" does nothing?
@robjohn No, it does something, it creates a new window. But when I click on the window, there is nothing happening.
It just blinks back to this window.
17:46
@KannappanSampath have you tried restarting your browser?
I haven't; let me try that now.
question: is it true that not only all reflections about a hyperplane/line are similar, but even more: unitarily/orthogonally similar?
No, chrome has started to suck or MathJax team needs to wake up.
mathjax fails me ALL the time....it just quits every few lines or so
@KannappanSampath perhaps you should try reinstalling chrome. I'm on the newest version and things work ok.
17:53
Hmph, too much of work. But, before that, let me try hard refresh and cache clear ways of doing things before I reinstall newest chrome, as you say. But, still, Thank you for the suggestion.
Is this your version too: 18.0.1025.142? @AntonioVargas
I have only had downvotes in a row; and casting close votes. Not writing answers makes me feel that I am not doing OK! sigh
Is anyone good with identifying patterns in numeric data?
I'm trying to extract a relationship and having difficulty
@KannappanSampath It turns out that I wasn't on the newest version after all. I was running 17.0.963.83m, but when I checked the about window it decided to update for me. I assume I can look forward to MathJax errors too once this update completes?
Hmm, well, please let me know. If that is the case, I think we can take it to the meta.
("that"="it"=buggy mathjax.)
18:01
Will do.
Apparently, I tried, to instruct the new window, to show up as a new tag; viewing that as a tab works OK. But, we used to get a small screen within the screen.
@DavidWheeler That is known. Everyone has to run the bookmark periodically. For some reason the event that was used to trigger the update does not happen in the same way.
@KannappanSampath That function works fine for me on Firefox
I see. Let me check that and report in a minute.
Yes it does work in FF, but not in the chrome I am using.
@robjohn thanks for the reply. often i feel invisible.
@DavidWheeler Where are you? I can't see you any more ;-)
18:26
@KannappanSampath ok, just updated, now I have the exact same error you describe. Joy.
Oh, so I have to describe the error in a meta post.
But, may be, I'll do it later, I guess. I should do some work for RL.
@KannappanSampath once the window pops up you can right-click it in the taskbar and select "maximize" and it will show up. But obviously this is annoying. Please do post it to meta sometime.
Sure, I'll.
18:45
@robjohn i am answering a question on another forum about reflections in euclidean n-space. although i have never actually studied this topic, i feel confident in my ability to bluff my way through it
What's the question?
You can always answer those questions with «ok so let R be a root system, let R^+ be a set of positive roots, S the set of simple ones, ...» and by the time you have set up the notation they lost interest.
If they follow you that far, they already show some stamina :)
@MarianoSuárezAlvarez i have no idea what you just said..it sounds lie-ish
if they do stay, then «let g be a semisimple algebra, h a cartn, b a borel, and so on.....»
you can olways deflect questions about reflections that way :)
18:53
lol, this was a relatively simple one, if $\phi$ is orthogonal, and $s_\alpha$ the reflection by $\alpha$, show $\phi s_\alpha \phi^{-1} = s_{\phi(\alpha)}$
it seems like the same logic as conjugating a k-cycle in Sn is at work here
Well, just decompose your space into $\phi(\alpha) \perp n$ where $n$ is a normal vector to $\phi(\alpha)$. Then show that $\phi(\alpha)$ is fixed under both maps and $n \mapsto -n$ under both maps.
Math.SE is becoming painful. : (
It is interesting to see all the all the versions of stuck on this site: stucked, stack, stock, etc.
I write an answer. I insert this > to emphasize and chrome says "Shut up!"
yes, i decomposed the ambient n-space into the line and the hyperplane orthogonal to it.
there was a previous result showing $\phi(H_\alpha) = H_{\phi(\alpha)}$
well, then there's not much left to do, is there?
Now, it's randon!
perhaps named after Johann Random, who used to measure casino winnings?
Well, there was Randon, Radom, Random, the fourth attempt will be okay, I hope.
19:03
@tb, well, some algebra, but everything is linear, so it's just fussing with tex mostly
I see.
i found it convenient to write $v = \phi(w)$ since invertible linear endomorphisms are surjective.
Once again! It died!
19:23
@KannappanSampath what died? MathJax?
@DavidWheeler There is not much to them. A little linear algebra and you should be a grand bluffer :-)
No, the page where I tried to answer. I put in > to emphasize and chrome says, "Shut up!".
@KannappanSampath Ouch.
I am off to have lunch with my wife. BBL
who would want to have a browser who tells you to "Shut up!"?
I know, where are my priorities :-)
Have a delicious meal and see you once again.
19:25
Later, robjohn!
@tb who needs a browser to tell you to shut up? Just ask me :-)
see y'all later.
I've never seen a message of the kind. I'm used to messages that I can't parse but not such messages...
I don't understand?
Did you find it offensive or something? I am sorry.
@robjohn i like linear algebra...it's very "categorical" in that everything which ought to be true, in fact, is
@KannappanSampath Oh, no, not at all! Sorry, I was just speaking of generally impenetrable error messages software tends to give me. For example, have you ever seen ten pages full of xypic complaints just because you messed up some braces? It is impossible to find that information out from those error logs.
19:33
I see. Glad that you did not find it offensive.
Hello guys! I've got a simple algebra question.
@KannappanSampath I tend to say something long before I flag unless it is blatantly inappropriate.
Please give me a hint for this problem
OK. Noted.
Let $R$ be a unital ring with ideal $L$ such that $L^2\neq L$. I need to prove that $Hom(R/L,\pi)$ is not surjective where $\pi:R\to R/L$ is a standard quotient map
19:36
My advisor said that he'd rather do algebraic topology than analysis and probability theory 8-).
He gave me Kallenberg's book on probability theory :-).
: D
And I want a pony.
It doesn't mean I get one.
@Norbert What does $\operatorname{Hom}(\text{ring}, \text{homomorphism})$ mean?
applying covariant $Hom$ functor to $\pi$
Can anyone help me with a pattern?
19:47
I guess I've used that before. So you want to show that there is a map $f\colon R/L \to R/L$ which is not of the form $\pi \circ g$ for some $g\colon R/L \to R$.
Moreover I know that it is possible to prove that $f=1_{R/L}$ will fit
@MattN I'm in a charitable mood today...
@Norbert I believe it; what's your example, though? Just curious.
This is a hint fromt the book
@Dylan So, for the even case, it's just one more element right?
If $n$ was even, $D_n$ would have $n+1$ elements of order 2?
$(|D_n|=2n)$
19:57
@KannappanSampath This is my belief.
Oh, well, mine too. : )
@Norbert Hm. These are supposed to be ring homomorphisms, right? You have some elements $x \in L - L^2$, but it seems hard to me to produce a ring homomorphism out of an element. Modules are much more flexible in this regard.
Yes every morphism here is a morphism of modules over ring R
@Dylan I have added that bit about even ness.
20:16
zzz
@AntonioVargas I would like to mention you also confirm that bug? Shall I?
@tb Yeah... either that or you're bored : ) But I know what you could do about that.
@KannappanSampath absolutely. I'd be happy to comment on the post as well.
Oh, thank you.
@AntonioVargas Here we go.
Rob
Rob
20:53
ಠ_ಠ
What is that a reaction to?
00:00 - 21:0021:00 - 00:00

« first day (605 days earlier)      last day (4712 days later) »