« first day (2328 days earlier)      last day (2599 days later) » 

3:00 PM
I don't remember him saying anything about the convergence, but I'll reread.
 
the point is the "Taylor" series has constant coefficients which grow factorially
so it obviously can't converge
but for a while, it looks like it's going to
 
Aha
 
Hi, everybody.
y u no answer my path integral question?
 
@DanielSank gimme teh path integralz?
=P
 
because no one has the link
 
3:05 PM
4
Q: What is the link between path integral source terms and the propagator?

DanielSankConsider a diffusion process defined by $$\frac{\partial \phi}{\partial t} = D \frac{\partial ^2 \phi}{\partial x^2}$$ where $\phi$ is the probability density of a particle's position and $D$ is the diffusion coefficient (or whatever it's called). Denote the transition probability to go from $(0,...

@0celo7 False.
 
it's false now
 
Hey, @dmckee @ACuriousMind @DavidZ @JohnRennie or anyone who knows about chat:
 
but you can't overturn causality
 
I just clicked "hide messages" on a user in one of my rooms and all their messages disappeared. Is there a way to undo that?
 
@DanielSank do you happen to be familar with github stuff, cause I am trying to download a library archive from a specific github ruby code and I have no idea how to do it
 
3:08 PM
@Secret Yes, I know github reasonably well. I know almost nothing about Ruby though.
What OS are you using?
 
@Secret my sister used to work there
 
The background is that there's a program that requires tcllib1.18tar.gz to install but none of the tcllib1.18 download sources (the tcl library hub, the sourceforge mirror etc.) has the correct sha256 checksum. I figure if I can somehow extract that download from that tcltk.rb code in github it will be my final chance to get the file

I am using a mac, version Sierra
 
@DanielSank So what's the issue with computing the inverse of $A$? Is it not the direct sum of inverses of blocks?
 
@DanielSank This is the Link somehow I need to get that particular sha256 tcllib1.18 there
from this:
resource "tcllib" do
url "https://github.com/tcltk/tcllib/archive/tcllib_1_18.tar.gz"
sha256 "6a87881f545afb69c1130f60984b5d35cc22f1593b0835b982871c188fde3de8"
end
 
apparently not
hmm
In mathematics, a block matrix or a partitioned matrix is a matrix that is interpreted as having been broken into sections called blocks or submatrices. Intuitively, a matrix interpreted as a block matrix can be visualized as the original matrix with a collection of horizontal and vertical lines, which break it up, or partition it, into a collection of smaller matrices. Any matrix may be interpreted as a block matrix in one or more ways, with each interpretation defined by how its rows and columns are partitioned. This notion can be made more precise for an n ...
 
3:11 PM
btw the direct downlad by using the url above in the code also give me a tcllib1.18 with a wrong sha256 checksum
 
@DanielSank I'm missing something. Why can't you use that to invert it?
 
There's a guy managed to did it somehow described here
yas375 commented on Oct 3, 2016
Ended up by copying the content of that formula into a gist, fixing SHA there and installing from the gist. It did work!
 
direct sum of a bunch of those guys
 
but I don't know how to download from a gist. I also have gist and homebrew installed on my mac
(basically, most of this sounds like alien language to me thus I don't really know what to do to get that file with the correct sha256)
 
@0celo7 Where in the question am I asking for the inverse?
@Secret You're asking a lot of stuff all at once. Can you narrow the question?
 
3:15 PM
@DanielSank You said you don't know $A^{-1}$. There seems to be some comments trying to invert $A$. I don't understand why it's not trivial.
 
@0celo7 I want to know how $A^{-1}$ is related to the Green's function for the problem.
If you can answer that by solving for the inverse explicitly, I'll be very happy and probably give you a large bounty.
 
@DanielSank Ok the short version is that I need to get tcllib-1.18.tar.gz with the folllowing checksum 6a87881f545afb69c1130f60984b5d35cc22f1593b0835b982871c188fde3de8 and I don't know how to get that from the ruby code posted in this github link via mac terminal commands:
and all other sources of tcllib-1.18.tar.gz (including the official site) all have the wrong checksum
 
I don't understand why you mean by get a file from ruby code.
 
@DanielSank because a greens function is an inverse linear operator on a Banach space of functions, and you're approximating that linear operator with a matrix
So the approximate inverse (approximate green's function) is the inverse of the matrix
 
If I interpreted the code correctly, it seems somehow it grabs the tcllib-1.18.tar.gz from a directory, and then somehow put this checksum on it as shown
 
3:20 PM
@DanielSank is that what you're looking for or am I still off base?
 
@0celo7 Ok well the Green's function for this case is $$\sim \exp \left( - \frac{x^2}{4 D t } \right)$$
Can you explain how this is related to that $J_i J_j (A^{-1})_{ij}$ term in the problem?
@Secret I don't know Ruby.
 
@Secret what's wrong with cloning the repo?
 
Oh, the greens function and solution operator are not the same. The solution operator, your A^-1, is essentially the distribution associated with the Green's function, i.e the integral weighted by the Green's function
Do you want to see an explicit demonstration of that?
@DanielSank am I wrong to think that your matrix is block diagonal with [[2,-1],[-1,2]] as the blocks?
 
@0celo7 It's not block diagonal.
It's got stuff on the diagonal and both first off-diagonals.
Otherwise inversion would be trivial.
@0celo7 Yes plz.
 
Then you wrote the question very poorly.
You wrote a block diagonal thing
 
3:25 PM
@0celo7 Thank you.
Did you read the title?
 
Yeah?
If I'm trying to show this explicitly I need to invert A, so I need to know what A actually is
 
@EmilioPisanty that repository only contains the ruby code files, and I am not terribly sure what to do with them to get the library archive file I need after downloading them
 
this? $$A_{ij} = \left[
\begin{array}{cccc}
2&-1&&&\\
-1&2&&&\\
&&\ddots&&\\
&&&2&-1\\
&&&-1&2
\end{array}\right]$$
obviously not a block matrix
 
Yeah. That looks like it's suggesting a block diagonal matrix
 
@Secret you want to be looking here
 
3:27 PM
@0celo7 I'll add more elements to make it more clear...
...working...
 
@0celo7 no it doesn't
 
@EmilioPisanty you're being obtuse on purpose
 
it's quite clearly a tridiagonal matrix with 2s on the main diagonal, -1s on the upper and lower subdiagonal, and zeroes elsewhere
 
If you write two blocks and dots, what the hell else is it supposed to be
 
presumably that's what you meant, @DanielSank?
write it as $$A_{ij} = \left[ \begin{array}{cccc} 2&-1&&&\\ -1&2&-1&&\\ &&\ddots&&\\ &&-1&2&-1\\ &&&-1&2 \end{array}\right]$$ if it makes you happier
 
3:29 PM
@EmilioPisanty Correct.
@EmilioPisanty do you understand what that post is trying to ask?
 
Aha
Much better
 
@DanielSank have yet to read the post
 
Everyone seems to be caught up with the form of $A^{-1}$ whereas I'm trying to ask more generally how this matrix relates to the propagator.
I don't care about the exact form of $A^{-1}$ beyond how that form helps me understand how it's related to the propagator/Green's function. The problem I used to introduce the subject is incidental.
 
@0celo7 either way, you've seen how the original notation did its job by communicating what was meant
 
Is there a way to delete messages from a room I own?
 
3:31 PM
@DanielSank Do you particularly care about your boundary conditions?
i.e. would introducing -1s on the top-right and bottom-left elements be bothersome?
 
@EmilioPisanty Wellllllll, the boundary conditions are what lead to the presence of the $J$ term in this case.
 
if you do that then maybe you can solve explicitly for the inverse
 
@EmilioPisanty Periodic conditions?
 
@DanielSank yes
 
@EmilioPisanty I don't reaaaally care about solving for the inverse.
I keep saying this :-\
I want to know how the $JAJ$ term is related to the propagator, if at all.
 
3:33 PM
@EmilioPisanty no, he wrote a block diagonal matrix then complained he couldn't invert it. I know that's not the question, but it was written in there.
 
The file in https://github.com/tcltk/tcllib/releases has checksum=9988b4385403c2aac78743fd3fce2d22e82686a56e6ca25942cb83c7d9e641db but the required checksum is 6a87881f545afb69c1130f60984b5d35cc22f1593b0835b982871c188fde3de8

the library archive is not found in the repository itself github.com/tcltk/tcllib
 
Complained isn't the right word there
But whatever
 
0
Q: Should discussions on topics which disturb long time users of the chat room be banned?

2017As some of you might know about the "argument" which took place between me and another long-time user of the hBar about discussion of "JEE related stuff". As far as those discussions are concerned, they are mostly related to Physics, Math or Chemistry at the high school/ Olympiad level (you can c...

 
@Secret yeah, I get the same checksum
if that makes you feel like you're not going crazy
 
@0celo7 That comment you just posted in meta is ridiculous.
 
3:36 PM
but that is patently the file that was intended, or at least, that is patently the canonical homepage for the file that was indicated, delivered over https
 
The meta post is ridiculous.
 
The only effect of that post is that someone (me) had to flag it, and now a moderator needs to deal with the flag. You have succeeded in nothing but creating work for other people.
 
so... you should seriously consider the possibility that the indicated sha256 is wrong?
 
If your personal amusement is worth more to you than other people's time, then perhaps I am starting to understand why you keep getting suspended.
2
 
No, you created work by flagging it
 
3:37 PM
@0celo7 Yeah, ok, you can go on with that in you brain. Hope it works out for you.
 
I suspect so, but I have no idea how to modify it cause it seemed to be automatically calculated

There's also a guy in the github posting:
yas375 commented on Oct 3, 2016
Ended up by copying the content of that formula into a gist, fixing SHA there and installing from the gist. It did work!

But that's alien language to me, I don't exactly know how he install from a gist
For more info, I have homebrew installed on my mac, however I am not sure how to do this "install from gist" thing
 
@DanielSank My current problem is that I know the relation for a relativistic field theory, but for this non-relativistic version the (integral kernel of the) inverse of the thing in the exponent is different from the propagator. I suspect this might go away if you turn this essentially "Hamiltonian path integral" into a Lagrangian path integral, but I'd need to work that out for this specific case.
 
@ACuriousMind o_O
Is that even possible for a diffusion process?
 
I don't recall/know
 
What does "relativistic" mean?
 
3:44 PM
@ACuriousMind is the relation you're thinking of basically what I said above?
 
@DanielSank That the e.o.m. is also second order in time, and that you consider a slightly different path integral. Then you get $\square^{-1}$ (d'Alembert operator; $\partial_t^2 - \nabla^2$) in that exponent and the integral kernel of that operator is precisely the propagator.
@0celo7 I have not read through chat
 
@ACuriousMind I guess I'm wondering this: if I have a differential equation and I know the Green's function, isn't there some generic relationship between that Green's function and the stuff that shows up in a path integral representation?
I think you're saying "yes, but only if {conditions}".
 
Yeah, I'm saying "yes, but only if you consider a certain path integral". "Path integral" is not unambiguous, there are several things you can compute by these. You are computing the propagator itself in your case, and in the field theoretic cases I'm thinking of you use it to get a partition function and expectation values of observables
(where the two-point correlation function is the propagator, as a special case, but in your case it doesn't look like you're computing the path integral with the insertion of two $x(t)$, and I'm not entirely sure it's the propagator in this instance, anyway.)
 
How does one even compute a propagator for a general PDE
I'm sure there's a Fourier resolution in "nice" cases
 
There are also probably people with a much better understanding of this because the path integral is more of a formal symbol than an actual method ot compute stuff to me, anyway.
I never deal with cases where you can actually compute the path integral - every time you can, it is because it degenerated into some other, more tractable objects.
 
3:54 PM
@2017 By the way, deleting your account in protest is not constructive. If you want to change some aspect of the site, you must stay and work constructively for that change. Leaving increases the chances that things stay the same. I did not leave when I was frustrated that the users here dismissed applied physics questions. I stayed and worked for change.
If you leave you accomplish absolutely nothing.
 
@ACuriousMind Considering that no mathematician has yet been able to give a definition of what a path integral generically is, yes :P
 
@ACuriousMind Yes, but that's always the case.
 
@BenNiehoff Precisely, I think of it more as a good heuristic to find the objects you actually want to compute (such as invariants in many topological and supersymmetric theories)
 
You can compute path integrals explicitly in certain cases.
 
In the Wiener path integral, we know the answer because we can solve the diffusion equation and all other cases are reduced to that one known case.
@BenNiehoff The Wiener measure is actually well understood!
 
3:56 PM
@ACuriousMind that's a nice way of thinking about it
 
@DanielSank Only in low dimensions
 
as far as I can tell, a "path integral" is really just a collection of procedures that physicists do, most of them more or less algebraic
 
@ACuriousMind Yeah but people also use it to actually compute scattering amplitudes!
 
I guess the Feynman rules are just heuristic anyway because the series tend to explode?
 
@BenNiehoff Yep.
 
3:57 PM
@DanielSank Have never heard of this Wiener measure, what is it?
 
@DanielSank I've already sent out the delete request. If there is an option, I'll rejoin later, after seeing the response.
Anyway, thanks for your suggestion.
 
@0celo7 The Feynman rules don't have much to do with the path integral, they're just the "recipe" for computing the terms in the perturbative expansion, which exists in both the path integral and the canonical formalism
 
@BenNiehoff it's the path measure for Brownian motion
 
^ that
 
The actual definition is very bad.
 
3:58 PM
ah, ok, I might actually expect that to be more tractable
 
They're not heuristic, they just compute the perturbation series, which does tend to explode - but not because it is heuristic, but because it is a perturbative expansion which you don't expect to converge anyway
 
because it doesn't require the "cancellation of highly oscillatory phases" that quantum path integrals do ;)
 
@ACuriousMind I learned the rules from Zee who uses path integrals
 
Yeah, you can derive them from the path integral formalism, but they're not bound to it
 
But I think Weinberg uses magic to derive them
 
3:59 PM
Well, @ACuriousMind, now I'm trying to make sense of your post about why we use density matrices in subsystems and in statistical ensembles of pure states.
 
Fucking S matrix and cluster decomposition or something :P
 
If you've got the LSZ formula and Wick's theorem, you can figure them out without mentioning path integrals
 
and many people did!
 
It's more of a stroke of genius there, but it's possible
 
5
Q: How to connect these two formulations regarding the need for a density matrix in quantum mechanics?

wonderingI found these two formulations: The density matrix is: 1) "needed if we consider a system that is part of a larger closed system." 2) "needed for a system to be in a statistical ensemble of different state vectors." What is the link between them bringing one to see their equivalence?

What's $\mathbb{C}(|b_j \rangle)$?
Vector space spanned by $|b_j \rangle$?
 
4:01 PM
@DanielSank A mathy notation for the one-dimensional space spanned by $\lvert b_j\rangle$
 
Ok and what's circle-with-a-plus-in-it?
 
Direct sum
 
@EmilioPisanty Yes, that's true. But also, there is a fair chance that he can return when $t > t_{\rm Relaxation (Anger)}$
 
Cartesian product for vector spaces
 
\oplus
 
4:02 PM
@0celo7 Ohhhhhhh
 
In the case of Hilber spaces, the completion of the direct sum.
 
I always thought that was denoted $\times$.
 
Depends on how cool you want to look. They're equivalent symbols.
 
i.e. $\mathbf{V} \times \mathbf{W}$.
@0celo7 Thanks, I never knew that.
 
@0celo7 They are not (but they are in this case :P)!
 
4:02 PM
@TheDarkSide I read Auger and was completely mystified
 
I thought it depended on whether you were emphasizing their vector space structure or their topological structure
 
@ACuriousMind what?
@BenNiehoff should be clear from context
In theory people give a crap about that but in reality people just do what they want
 
Is $t_\mathrm{Auger}$ the time it takes for a site newcomer to fall into Chris White's role, violently expelling some other newcomer in the process?
 
@ACuriousMind in your answer, you motivate the partial trace by saying that for a state $$|\chi \rangle = \sum_{ij} c_{ij} |a_j \rangle \otimes |b_j \rangle$$ the right way to not care about the second space is $$p(|a_i \rangle) = \sum_j |c_{ij}|^2 \, .$$
Why?
 
(cf. Auger effect for background)
 
4:04 PM
well, I rarely describe flat space as $\mathbb{R} \oplus \dotsc \oplus \mathbb{R}$
 
The entire post hinges on that assertion.
 
@0celo7 $\times$ denotes a product, while "direct sum" is a name for a coproduct that is also a product, or sometimes just a coproduct. In the case of vector spaces, the two notions coincide for finitely many terms, but the infinite direct sum of vector spaces is "smaller" (has an injection that's not a bijection) into the infinite Cartesian product
 
@ACuriousMind sure, but we're talking about two vector spaces here.
 
That's why I said "but they are in this case"
 
Ok. Just making sure
 
4:05 PM
Emilo: Lol, my chemistry school just talked about that effect in the context of Gadolinium complexes as binary caner therapy agents in one of the PhD seminars today
 
maybe I should try sneaking $n \times \mathbb{R}$ into a paper and see what the editors think
 
@BenNiehoff but that isn't wrong
 
Oh hey, since there are mods here: what is kick-mute in chat?
 
@DanielSank Well, $\lvert c_{ij}\rvert^2$ is the probability that the system is in $a_i\otimes b_j$
 
Windows is proprietary malware
There is no system but GNU
 
4:06 PM
@ACuriousMind Yes.
 
and Linux is one of it's kernels
 
That's a good point.
 
@EmilioPisanty :) (Also, thanks for the link but I know a bit of Physics too)
 
So, if I don't care which $b_j$ the system is in, and only care about it being in $a_j$, basic probability says I have to sum up all the distinct probabilities for the way in which it can be in $a_i$. That's what $\sum_j \lvert c_{ij}\rvert^2$ is.
 
We're summing all the probabilities where the first system is in $|a_i \rangle$.
Yeah I guess it makes sense that you do an incoherent sum.
Fair enough.
 
4:07 PM
@BernardoMeurer Certainly you can improve that with some sort of recursion
 
@TheDarkSide yeah, well, I was a good bit into my PhD when I learned about it
 
@BenNiehoff is string theory plagued by the same kind of unrigorous mysticism that QFT is or is it better?
 
@DanielSank It's...what it says on the tin. It kicks the user from the room and prohibits them from returning for a period of 1,5,30 mins for the 1st, 2nd, 3rd kick.
 
@EmilioPisanty :)
 
I wonder if e.g. DanielSank/ACM/Ben could belt out a definition from the top of their heads
 
4:08 PM
@BenNiehoff Use GPLv3 and avoid Tivoization of your software! Protect the users' freedom!
 
@ACuriousMind How's that different from suspension?
 
@DanielSank It's only for the room they were kicked from
 
@EmilioPisanty I think I figured out a way to fix it: After homebrew get that tcl-tk.rb file, I opened textedit and then replace the (should be correct) checksum with the wrong checksum (because we know the file it downloads is correct, thus we copied that checksum and paste it in where the sha256 line in the tcl-tk.rb file is. Now it managed to get through. Thanks!
 
@EmilioPisanty Of what?
 
@DanielSank the Auger effect
 
4:09 PM
@ACuriousMind Suspension is network-wide?
 
@0celo7 It depends which aspects of string theory...obviously QFT still turns up, so it's still there
 
A suspension is for all chat rooms, and can only be imposed by moderators.
 
@DanielSank Yep
 
A kick can be carried out by every room owner.
 
@EmilioPisanty The thing with phonons?
@ACuriousMind Got it.
 
4:09 PM
and as for string field theory, well, we're not even quite sure what it is yet
 
AFAICT I cannot, even as an owner, delete messages. Is that true?
 
@EmilioPisanty Definition of what?
 
@DanielSank @TheDarkSide I rest my case
 
@BenNiehoff statements like that amuse me
 
@DanielSank You can move them to rooms called "Trash", which are there only for that purpose
 
4:10 PM
I love it when people invite me to trash
 
@EmilioPisanty It's an accident that I knew that.
 
@DanielSank are you trying to kickmute someone
 
well, there is one SFT that has been written down (by Witten of course), but it's for bosonic open strings (or maybe it was closed ones? I forget)
 
"John Rennie invited you to join "Trash" "
Love it
 
@0celo7 I'm trying to move rubbish out of my weekly featured post room.
Still haven't figured out how...
 
4:11 PM
@DanielSank If you click on the room menu, you should get a dropdown menu in which you can select "move messages"
 
You know @ACuriousMind your argument about summing over $j$ is sensible but I still don't see how to recover it from the axioms I know about quantum.
 
Do that, select all messages you want to delete, then choose one of the "Trash" rooms as the destination
 
@EmilioPisanty Haha. Nah, @DanielSank is still occupied with his main point right now, kicking someone :)
 
@ACuriousMind Ahhhhh, thanks.
@TheDarkSide wut?
The Auger effect has something to do with valence band electrons/holes recombining through interaction with the phonons. It's important because it is the reason for efficiency loss at high powers in LED's. I lived with a theorist who explained this theoretically using DFT.
Manos Kioupakis.
 
@DanielSank Nope sir. Just a freak parallel discussion. When you've kickmuted whoever is one your agenda, maybe you'll read the transcript again.
 
4:15 PM
@TheDarkSide I am not kicking someone. I just needed to trash some messages.
 
Thank God.
 
@DanielSank You're having trouble because the notion of mixed states uses classical probabilities. The quantum way to see the partial trace is the correct operation is what I do in my footnote: You combine two systems by $\rho_A\otimes \rho_B$ and then you observe that the inverse operation is the partial trace, i.e. $\mathrm{Tr}_B\circ (-\otimes \rho_B) = \mathrm{id}_A$. In fact, this is one of the properties defining the partial trace in an abstract algebraic way.
So you have no other choice - you want an operation that reverses "combine these systems", you get the partial trace, period.
 
This doesn't answer the question. — DanielSank 22 mins ago
@DanielSank - Didn;t want to clog the comment section there.
But I think it answers it implicitly.
 
@ACuriousMind I got stuck on the part where it says that the partial trace is needed because it reproduces (1).
I was trying to understand why (1) has to be true.
Now you're giving a more complex argument, which I will try to understand.
Unfortunately, I forgot to bring paper to the cafe, so I might have to do this later :-(
 
@DanielSank Ah, yes, that's because I was focused on the classical probability notion of mixed states there. Now that you explicitly asked how to do this staying within the quantum formalism, I think the argument I just gave is the way to go.
 
4:25 PM
Basically, if I read it right, what @dmckee is trying to convey through his grown up approach is - yes, no one owns it, we won't force you, still it would be nice if you don't do it.
Or perhaps that's what I understood.
 
@ACuriousMind Just want to double confirm something here. Is what is happening in this formula

$$\gamma (\vec{x}_1,\vec{x}_2;\vec{x}_1',\vec{x}_2')=N_e(N_e-1)\int \Psi^*(\vec{x}_1',\vec{x}_2',\dots ,\vec{x}_{N_e}) \Psi(\vec{x},\vec{x}_2,\dots ,\vec{x}_{N_e})d\vec{x}_3\cdots d\vec{x}_{N_e}$$ we are basically taking the partial trace of $N_e-2$ of the $N_e$ electrons in the $N_e$ electron density matrix?
 
That's not a density matrix, it's just a probability density, but yes, it's the same reasoning - if you've got a joint probability density $f(x,y)$ and you don't care about $y$, you get the density for $x$ by $\int f(x,y)\mathrm{d}y$. Nothing mysterious there.
 
I see
 
4:48 PM
@JohnRennie Howdy
 
@BernardoMeurer Afternoon
 
@JohnRennie See if you like this, new British band
 
@BernardoMeurer I struggle with angry bands. I guess I'm an aging hippy at heart.
 
@JohnRennie Ha, that's interesting
I quite like angry bands
 
My brother (18 months younger than me) likes bands that make your soul bleed. His latest obsession is the Violent Femmes. You and he should meet up a gig some time :-)
 
4:58 PM
He might like Death Grips then
Is he also in Chester?
 
No, he's a biology teacher in London
 
Ha, guess science runs in the blood :)
 
Well my mother was a bacteriologist ...
 
@EmilioPisanty Here's the neat proof that "bounded sequences have convergent subsequences" can only hold in finite dimensional normed vector spaces. It's weirdly constructive and pretty amazing!
 
@JohnRennie Dayum, is everyone in science in your family?
 
5:01 PM
@EmilioPisanty Notation: open ball is $B(x,r)$, closed ball is $D(x,r)$. We want to show that if $(x_n)\subset X$ is a sequence contained in some $D(0,r)$, then $(x_n)$ has a convergent subsequences. Since normed vector spaces are first countable, this is equivalent to showing that $D(0,r)$ is compact in $X$. Since $D(0,r)\approx D(0,1)$, we show that $D(0,1)$ being compact implies $\dim X<\infty$.
 
@BernardoMeurer No, my dad was just a businessman
And my niece wants to be a journalist
 
She could be a science journalist
 
Assume $D(0,1)$ is compact. Consider the covering of $D(0,1)$ by translated open balls $B(0,1/2)$. By compactness, we have $D(0,1)\subset S +B(0,1/2)$, where $S$ is a finite set. Let $L=\vee S$ be the linear span of $S$. Then $D(0,1)\subset L+B(0,1/2)$. Note that $L$ is finite-dimensional, hence closed in $X$.
 
@0celo7 this in an arbitrary normed vector space?
 
Can you imagine John, your niece working at Popular Science? What a pride eh?
 
5:03 PM
@EmilioPisanty Yes. Completeness is not assumed.
 
@0celo7 you lost me at "first countable"
 
Now we can iterate this relation. We have $B(0,1)\subset L+B(0,1/2)$. By scaling, we obtain $B(0,1/2)\subset L+B(0,1/4)$. By induction, we have $B(0,1/2^n)\subset L+B(0,1/2^{n+1})$. This implies $D(0,1)\subset L+B(1/2^n)$ for any $n$.
@EmilioPisanty Do you want the definition or an explanation of what it does?
 
@BernardoMeurer Sadly, while she's good at science she has no great love for it.
 
@JohnRennie That probably makes her a perfect fit for PopSci :P
 
@0celo7 not particularly fussed. More of an "if you need to invoke something like that then it's no longer all that simple afaic"
 
5:06 PM
I have an unusual amount of friends in journalism
Mostly sports though
 
@BernardoMeurer being a good science journalist is a lot harder than you think. If you just want to sensationalise I'd guess that's pretty easy because you just make evertything sound like magic.
 
Now that last inclusion means that an $x\in D(0,1)$ is at most $1/2^n$ away from $L$. Since $n$ can be arbitrarily large, we have that $x\in$ closure of $L$. But since $L$ is closed, $x\in L$. Thus $D(0,1)\subset L$, and $L$ is all of $X$.
 
But if you want to inform as well as entertain, then that's hard.
 
@JohnRennie I know, I know, that;s my exact criticism to PopSci
 
@EmilioPisanty First countability is a condition that means convergence of subsequences is equivalent to compactness in the covering sense.
All normed vector spaces, manifold, basically everything are first countable.
 
5:08 PM
with reference to SMBC's "The Talk"
 
@0celo7 so first countability is this magic property that lets you prove some radically different theorem and pretend that you were talking about the original property?
=P
 
@BernardoMeurer A lot of my self answered questions are basically an attempt at science journalism and I find it really hard to do
 
@EmilioPisanty Yeah. But it's very easy to prove in most cases :P
 
@JohnRennie Science journalism is hard because science nowadays is, mostly, hard. And you need to find a way to explain these complex ideas in a way that is simplified but not too awfully deformed. that's tremendously difficult
 
@BernardoMeurer Agreed. That's what I found really hard when writing the Q/As
 
5:10 PM
@EmilioPisanty First countable means that any point has a countable neighborhood basis. A neighborhood basis is a set of open sets such that any open set containing the point also contains one of those neighborhoods.
For metric spaces, just take balls with radii $1/n$
 
Why will $D(0,r)\approx D(0,1)$ i.e. why will a closed ball of arbitrary radii be the same as a closed ball with radius of 1?
 
@Secret the map $x\mapsto \frac{1}{r}x$ is a homeomorphism
 
@JohnRennie It's a big part of being a good teacher/professor too
 
ah ok
 
@0celo7 like I said, you lost me at first countable
more accurately, you lose me at first countable
it's not that I haven't seen the term or that I can't wikipedia it
 
5:11 PM
@EmilioPisanty Ok, then we're just proving Heine-Borel implies finite dimensions.
 
it's that my attention span spontaneously shrinks to zero when it comes up
 
:(
 
well, not zero, but pretty darn small
That said, yes, your construction is pretty neat.
@0celo7 this includes arbitrary metric spaces?
 
@EmilioPisanty Yep. As I said, $B_d(x,1/n)$ forms a neighborhood basis for each $x$.
 
nevermind, it seems so
@0celo7 you lost me at neighbourhood basis
in the above sense
 
5:15 PM
If you give an open set $U$ containing $x$, I can find a $B_d(x,1/n)$ inside of $U$.
 
@0celo7 gotcha
now, can we talk about Auger electrons or something physicsy?
=P
 
@EmilioPisanty Btw, first countability implies that the topology is determined entirely by its convergent sequences.
@EmilioPisanty what's an Augur electron?
 
The Auger effect is a physical phenomenon in which the filling of an inner-shell vacancy of an atom is accompanied by the emission of an electron from the same atom. When a core electron is removed, leaving a vacancy, an electron from a higher energy level may fall into the vacancy, resulting in a release of energy. Although most often this energy is released in the form of an emitted photon, the energy can also be transferred to another electron, which is ejected from the atom; this second ejected electron is called an Auger electron. The effect was first discovered by Lise Meitner in 1922; Pierre...
 
@0celo7 An electron whose motion follows a prophecy, clearly ;)
Also dubbed the Nostradamon.
 
@ACuriousMind The Augur in Skyrim was pretty damn disappointing
I don't even remember what he did
 
5:19 PM
@BernardoMeurer: have you ever heard of a band called The Soft Boys?
 
@DanielSank So there's a solid-state version? Huh.
I mostly meant the atomic process
But presumably you mean this?
> The most prevalent mechanism is a three-particle interaction, two electrons and one hole, or two holes and one electron, in which an electron-hole pair recombines releasing its energy nonradiatively by promoting the remaining particle into a higher energy state.
I guess that's close enough that it earns the name
but really, if you're not ionizing and detecting the electron, you're cheating
 
Pictures are extremely misleading in illustrating compact sets:
 
@Secret good, we need more topology talk in here
They are! It's strange that "finite size" sets don't have to be compact
What's even stranger is that there are bounded metric spaces that are not compact
@Secret do you have a specific question?
 
Balarka is the topology expert, I sorta get inducted in topology via the maths chat and munkres. Currently trying to be more comfortable in determining convergence of sequences

Noncompact spaces are easy to think about in some topologies, such as (0,1) in the standard topology, you pick a collection so that they overlap pairwise and then it is easy to see that any subcollection will left the set uncovered

No I don't have a question currently, your proof flows fine
 
@Secret You should think about how to prove that a finite-dimensional subspace of a normed vector space is closed. The proof is nontrivial.
I doubt you can find it in Munkres. It's a functional analysis thing
@Secret Actually, think about: if $X$ is finite dimensional, then $D(0,1)$ is compact.
 
5:33 PM
hey hey
 
@JohnRennie Have not, I'll give them a listen
 
5:48 PM
@0celo7 I have removed you from the ignore list. I expect that you won't restart the arguments. I won't, from my side.
 
rob
5:59 PM
Friendly request: let's not use the chat to discuss what's on-topic for the chat. For JEE stuff there's a current meta post open, and there's also a meta chat room which we've started to use for these meta-discussions.
I'll move some messages to the meta chat room here in a minute.
 

« first day (2328 days earlier)      last day (2599 days later) »