« first day (3697 days earlier)      last day (1327 days later) » 
00:00 - 18:0018:00 - 23:00

6:00 PM
plurisubharmonic functions
If only i did more kahler geometry :((
 
that's right
 
Aha, Astyx, c'est une belle histoire.
 
Bon je dois aller manger
à plus tard ou à une prochaine !
 
Bon appétit
 
@anakhro that's good
been hitting the rap game hard lately trying to make it
 
6:03 PM
Ted, can you somehow phrase torsion in terms of curvature.
Say, of a vector bundle.
 
Have you read the MO thread on torsion
 
No. Is there a particular one about that?
 
$$\Huge{lim \ n\ \rightarrow \infty \frac{{4n} \choose {2n}}{{3n} \choose {n}}}$$
any ideas?
 
Yup. Cartan understood it :) You think of it as analogous to curvature for the turning of a vector but now for the base point of the tangent vector (affine connection).
 
@AnindyaPrithvi Develop ${n\choose k} = {n!\over(n-k)!k!}$
 
6:17 PM
@Astyx then?
 
Simplify the ratios
 
But torsion in the Riemannian case makes sense only for the tangent bundle, not general bundles. There are different notions of torsion, e.g., for projective connections.
 
@Astyx try
 
I thought you were eating, @Astyx.
 
I ate already
@AnindyaPrithvi What do you mean ?
 
6:18 PM
@Astyx I cant simplify
 
Five minutes! What kind of Frenchman are you?!
 
A busy one :p
@AnindyaPrithvi Use the Stirling approximate if you have to
 
shakes head
 
(you probably do)
 
@Astyx NOpe
 
6:19 PM
What do you mean "nope" ?
Also please stop pinging me
 
It should fall to summation of a function which will be converted to an integral
I have done a question prior to this
@Astyx OKAY
@Clarinetist how's it transparent
 
@AnindyaPrithvi I would request you to write your question in a normal font size rather than what you're doing. This just discourages even more people from trying to help you, and looks horrible.
 
I agree with @Sayan. And learn the basics of LaTeX/ChatJaX, while you're at it.
 
So do I
 
6:24 PM
@TedShifrin $\textrm{Yeah yeah I know}$
 
That's a mature response.
Stirling's formula should work fine. Have you tried it?
 
Hi all, quick question. Let's say I have a union of two intervals $(a, c] \cup [d, b) \subset \mathbb{R}$. How can I show that it cannot be written as a finite union of open intervals? I strongly suspect that this has to do with some facts from topology that I'm not aware of.
 
@TedShifrin I have tried a variation of the said problem which had 3n,n and 2n,n
 
You don't even need Stirling
If you expanded the binomials as I recommended
And then simplified the factorials
 
@Astyx It's not that easy
 
6:25 PM
You get something which you can prove to be $\ge 2^n$ by looking at it
 
The factorial ratios wont reduce
 
It's way more elementary than Stirling
So what do you get ?
Once you've simplified as much as possible
 
@Clarinet: Why are you messing with the union of the two intervals? Just do one.
 
If $X: M\rightarrow TM$ is a smooth vector field such that $X_p=0$ and $f: \mathfrak{X}(M)\rightarrow C^{\infty}(M,\mathbb{R})$ is a $C^{\infty}(M,\mathbb{R})$ linear map, does it follow that $f(X)(p)=0$?
 
Anyhow, any union of open intervals is an open subset of $\Bbb R$, so you can't do it with any number of open intervals.
 
6:27 PM
I meant $X$
@Astyx
 
@Astyx it goes as product of $(1+1^-)(1+1^{--})....(1+1/2)$ as I reach n...also, a mistake in writing the question, I meant the whole expression to the power of 1/n
it should be a finite limit
I'll rewrite
 
Ok go a step back
Don't expand the factorials
 
@orientablesurface: What do you think?
 
I think no @TedShifrin
 
limit of n to infinity, $$ logX=\frac{1}{n} \log(\dfrac{4n \choose 2n}{ 3n \choose n})$$
 
6:29 PM
What do you know about such maps that are linear over $C^\infty$?
 
Oh that changes everything
you're going to need Stirling approximation
I don't know any other method
 
@TedShifrin My topology background is extremely weak (I never actually took a class on it). So if I'm getting what you're saying, with $\mathbb{R}$ under the standard topology, any union of open intervals is open, and what we have here is half-closed intervals (which aren't open), so I can't represent the union above as a disjoint union of open intervals, done.
 
Right. And having the union just confuses it. You can't do one at a time; hence you can't do the union.
This isn't reallly topology. It's basic real analysis. :) When you're in $\Bbb R^n$, it's basic analysis. :P
 
@Astyx The previous method was like opening factorials and obtaining the integral of $\log (1+1/(x+1)$ from 0 to 1 which gives the value of logX
 
I hope I don't regret taking measure theory this semester. It seems like the prof expects us to know quite a bit of topology coming in. I'm a bit annoyed at the fact that my analysis classes in $\mathbb{R}$ and $\mathbb{R}^n$ did not cover topology.
 
6:31 PM
I just think stirling would fail considering the limit is finite
 
Stirling would work
 
You definitely need the basics, Clarinetist. You need open, closed, compact, basic facts about continuous maps.
 
Well it depends on what you mean by Stirling
But my Stirling definitly works
 
@Clarinetist How did they do analysis in $\Bbb{R}^n$ without doing basic topology?
 
LOL @ Astyx's Stirling.
 
6:32 PM
Should be nearly 2.368
 
what conditions would I need to impose on $f$ for it to hold?
 
The best Stirling there is @ Ted
Everybody says so
 
@SayanChattopadhyay See Protter and Morrey's text, skip the section on basic topology
 
@AnindyaPrithvi It's not far from that
 
@Clarinet: You'd better read that stuff now.
 
6:34 PM
note that i'm trying to show that if we have a $f: \mathfrak{X}(M) \rightarrow C^{\infty}(M) C^{\infty}(M)$ map, then there exists a smooth one form $g$ such that $g(X)=f(X)$ for all smooth vector fields X
 
@TedShifrin Thanks for the tip. I'm probably going to take a few days off and get Munkres as well as another book I have out.
I don't think it's impossible to overcome, but it will take some time.
 
Oh interesting, this is the first time I am looking at an analysis course that doesn't use the usual textbooks.
 
Right, @orientable. There is a basic lemma that you should have seen (I presume it's in Lee) that characterizes tensors as such maps that are linear over $C^\infty$. It's in every differentiable manifolds course/book.
@Clarinet: You don't need to be so fancy as to do stuff with Munkres, although having seen a basis for a topology, for example, will be helpful in measure theory.
 
haven't seen it. @TedShifrin . I will look now
 
Ok I see what you meant
 
6:36 PM
@orientable: There's a standard trick, multiplying by a bump function living at the point in question.
 
Worked
 
If you do it carefully you can show it's the integral of a certain function
 
Did stirling use the fact that if an integer is to be evenly broken such that the product is maximum.....the broken piece should have size [n/e] where [] is G.I.F.
 
I have no clue what that means
 
@TedShifrin Perhaps I'm oversimplifying it, but to me, a topological space is just another type of collection of subsets of a set like you see in measure theory with rings, semirings, algebras, $\sigma$-algebras, etc. But yeah, I'll definitely be getting through the basics. I'm going to at least learn what the terms are.
My list includes: topological space, open, closed, connectedness, compactness, basis for a topology, interior, closure, subspace/product/quotient topology, maybe some things on metric spaces.
I -think- that will suffice
I'm glad I did some studying already over the summer, since I hadn't learned about the subspace topology and was confused when one of the texts I was using to study used it without explaining
 
6:48 PM
@Clarinetist another great topology textbook is Mendelson's book. It's a Dover book, so it's like 15 USD.
It's also short. It starts with motivation from metric spaces and then generalizes to topology. It's a very nice book and highly recommend it to anyone wanting to learn topology in a smooth, but succinct manner.
 
Thanks @anakhro! I recognize that cover... I wonder if I can find that among my hundreds of books
 
Might be!
 
@anakhro I have Gamelin and Greene, another Dover text. But I think I'll get my hands on Mendelson. Thanks so much
 
Mind you if you have other texts, you might as well try learning from those, but if you have the money to spare and don' mind Yet Another Topology Textbook, then I guess why not.
 
6:54 PM
@TedShifrin so I realized I wasn't making sense last night, we know all the geodesics through a point
So then transitivity of the action of the isometry group should actually tell us what geodesics look like in general
 
Thanks all for your help! I'll leave you with a nice tidbit that I learned since when I was last here
This is one of the most ambitious books I've ever seen, titled "Algebra, Topology, Differential Calculus, and Optimization Theory for Computer Science and Machine Learning:" cis.upenn.edu/~jean/gbooks/geomath.html
It is currently at 1,951 pages.
 
Dayum
 
Past the point of knowing the very basics (defn of topology, continuity, metric topologies, product topologies, subspace topologies, bases, and maybe closure/interior) it starts to get to the point where you can learn whatever you want. The standard topics after that are connectedness, compactness, Hausdorff spaces, and quotient spaces, which I would expect to be covered in any intro course.
After that you get into more specialized territory
I like Hatcher's notes precisely because they're so short and cover nothing more than they need to.
 
I get that impression, thanks @MikeMiller . I'll look into Hatcher
Most of the people whom I've known who like topology have been into knot theory
 
They're very preliminary notes and don't have as many examples as you might like
 
7:03 PM
@MikeMiller I have plenty of resources for examples. I would be perfectly fine with a streamlined Definition-Proof-Theorem-styled text
Wow, that's amazing. 59 pages?!
 
Hey Mike, what's up?
 
@Clarinetist It really is nothing more than what's needed
Not much Amin, lounging and reading, yourself?
 
Pretty much same on my end
Trying to get some math done, might've amped things up a bit much this semester tbh. But so it goes. Are you guys still in person or what's the deal?
 
7:46 PM
What are you doing this term? @Amin
 
Nah we're entirely online. I mostly don't mind but it does slow us down a lot.
 
Probability, number theory, algebraic geometry, some reading on automorphic forms with my advisor, and a symmetric spaces reading group
What about you?
Mike: Yeah we started hybrid and well... turns out students are bad at not partying. So for at least the next 2 weeks we're fully online
 
My university is also fully online, but some of the courses have seen improvements because of that. :P
 
@AminIdelhaj I'll start my PhD in October
 
Yeah you mentioned, with the descriptive set theorist/dynamics person
 
7:53 PM
Right
 
That's hype
How does PhD work over there? Do you take classes or do you just work with your advisor
 
The latter
I will take some classes but just because they sound cool :P
 
Yeah for sure
Here there's a certain number of classes you're supposed to take, basically I'm taking 3 per term this year, took only 2 per term last year, and third and fourth year 2 per term
Mostly math though next year I might try to do some ML and/or stats for the sake of getting jobs lol
 
Ah I see
It depends on the university here, in some places they have "PhD courses" and you need to take a few
 
 
2 hours later…
10:05 PM
If $\{M_i \mid i \in I\}$ is a collection of modules, how is $\bigoplus_{i \in I} M_i$ defined? Does it consist of all tuples with at most finitely many nonzero entries?
 
Yes
Or as their coproduct if you like to think categorically
If you have a map out of each $M_i$ you get a map out of the direct sum just by summing all of them, so it has the right universal property
 
And the tuples are in fact functions $f : I \to \bigcup_{i \in I} M_i$ such that $f(i) \in M_i$ and $f(i) \neq 0$ for at most finitely many $i \in I$?
 
10:29 PM
@AnindyaPrithvi $\begin{align}\frac{\binom{4n}{2n}}{\binom{3n}{n}} &=\frac{(4n)!}{(2n)!(2n)!}\frac{n!(2n)!}{(3n)!}\\ &=\frac{\color{#C00}{(4n)!}\color{#090}{n!}}{\color{#C00}{(3n)!}\color{#090}{(2n)!}}\\ &=\frac{\color{#C00}{(4n)(4n-1)\dots(3n+1)}}{\color{#090}{(2n)(2n-1)\dots(n+1)}}\end{align}$
$n$ factors on top and bottom and the ratios of each corresponding pair is greater than or equal to $2$.
@AnindyaPrithvi $X=\frac{64}{27}$
 
00:00 - 18:0018:00 - 23:00

« first day (3697 days earlier)      last day (1327 days later) »