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

12:34 AM
Let $M$ be a riemannian manifold. If $f:\mathfrak{X}(M)\rightarrow C^{\infty}(M)$ is $C^{\infty}(M)$ linear then does there exists a smooth covector field $\omega$, such that $\omega(X)=f(X)$ for all smooth vector fields $X$?
 
do it locally
 
such a $\omega$ exists, right? @LeakyNun
 
I don't know
check the details
 
12:50 AM
You want to show that if $X_p=0$ for some smooth vector field $X$, then $f(X)(p)=0$
The map $\omega\mapsto(X\mapsto\omega(X))$ is clearly injective and $C^{\infty}(M)$-linear, so surjectivity implies that it gives an iso $\Gamma(T^{\ast}M)\cong\Gamma(TM)^{\ast}$, which is pretty
 
 
3 hours later…
How would we prove that $p_{k-1}^2 \gt p_k$ where $p_k$ is the kth prime?
I can't seem to prove it through induction
 
@Mathphile use the fact that for a positive integer $n$ either it has a prime divisor less than $\sqrt{n}$ or it is prime.
what a deceptively simple looking problem
 
3:55 AM
@Sophie not sure how I can use that fact in the proof
Is it possible to prove this using induction?
 
4:08 AM
@Mathphile wow apparently I misremembered it. Look here: math.stackexchange.com/questions/1594162/…
haha Robert Soupe commented "What a maddeningly simple problem!"... exactly how I feel about it
 
woah this proof is much more complicated than I expected it to be
 
 
1 hour later…
5:10 AM
hello
 
5:59 AM
how to remove rows in a pandas DataFrame which is not available in other DataFrame ?
 
6:15 AM
@VikasUkani you should ask this at stack overflow. This is the wrong chatroom.
 
any convex folks in here :-)
 
 
2 hours later…
8:18 AM
Does the usual de Rham isomorphism $H_\text{sing}(M;\mathbb{R}) \cong H_\text{dR}(M;\mathbb{R})$ still hold if I replace the real coefficients in singular cohomology by complex coefficients and consider $\mathbb{C}$-valued differential forms on the real manifold $M$?
 
aren't you just tensoring with $\Bbb C$ over $\Bbb R$
 
Yeah, I thought so too, I guess I'll have to look up the universal coefficients theorem again.
 
they're fields
everything works well with fields
 
So for fields I can squeeze the tensor product into the homology functor, right? Like $H_\text{dR}(M;\mathbb{R}) \otimes_\mathbb{R}\mathbb{C} = H(\Omega_{\text{dR}}(M;\mathbb{R}) \otimes_\mathbb{R} \mathbb{C}) = H(\Omega_\text{dR}(M;\mathbb{C}))$
 
yes
 
8:51 AM
Alright, thank you
I just read about hodge structure from Milne's notes, and this makes much more sense now
 
 
3 hours later…
11:35 AM
Hello!! Does someone of you have an idea about my question about differential equations?
0
Q: For which $f(x)$ does the solution exist for an arbitrary $c>0$?

Mary StarWe have the problem $$y''+4y=f(x), \ y(0)=0, y(c \pi )=0$$ with $c>0$ and $f(x)$ an arbitrary smooth function. For which values of the parameter $c$ has the problem alswaysan unique solution? For which $f(x)$ does the solution exist for an arbitrary $c>0$ ? For the first part we have to check w...

 
 
3 hours later…
Anonymous
2:30 PM
If the positive subseries of a series diverges to $\infty$ and negative subseries diverges to a finite value, is there any standard way of showing that any rearrangement of the series will also diverge to $\infty$? I think it is similar in spirit to the Riemann rearrangement theorem though I can't find it in a textbook
 
much easier than Riemann rearrangement
you can bound the partial sums below by the partial sums of the positive terms minus the finite value of all the negative terms and this goes to infinity
 
Anonymous
2:45 PM
@Thorgott Ummm, not sure I understand. Let's try to do the proof like this. Suppose there exists a rearrangement of the series $(a_n)$ that converges to a finite value $L$, but its positive subseries diverges to $\infty$ and its negative subseries converges to a negative finite value.
 
Anonymous
In this specific rearrangement, how do we proceed to show that it's invalid?
 
Anonymous
Is there any theorem like every rearrangement of a convergent series converges to the same value?
 
Anonymous
Umm, no I guess that's unconditionally convergent
 
Anonymous
Oh, I guess the triangle inequality could be helpful in an $\epsilon-\delta$ proof
 
I don't see a good reason to do this by contradiction
 
Anonymous
2:56 PM
@Thorgott What's your approach?
 
Anonymous
I think we have to show that there exists no rearrangement of this form that converges to a finite value. This sounds like a contradiction proof to me
 
I outlined mine above
You can also just show that every rearrangement diverges to $+\infty$ directly
 
Anonymous
@Thorgott I noticed, but there you are only showing that specific rearrangement diverges to $\infty$
 
Anonymous
That is, one with all the negative terms clubbed together at the beginning
 
no, take any rearrangement, look at a partial sum (which is a finite sum), separate that into positive and negative terms, bound this below by adding all the other negative terms (here we use that any rearrangement of just the negative terms converges to the same value) and then observe that lower bound goes to $+\infty$ (here we use that any rearragement of just the positive terms diverges to $+\infty$)
 
Anonymous
3:04 PM
Which theorem gives us this "any rearrangement of just the negative terms converges to the same value"?
 
Anonymous
Also why "any rearrangement of just the positive terms diverges to +∞)"?
 
Anonymous
I mean, it makes intuitive sense but I can't pinpoint the theorem
 
first one is the standard fact that absolute convergence implies unconditional convergence
don't know a reference for the second one, but it's an easy fact
 
Anonymous
@Thorgott Oh, it's absolutely convergent as all the terms of the negative subseries have the same sign right?
 
Anonymous
@Thorgott Do you know a simple proof?
 
3:10 PM
yes (and since it's convergent by hypothesis)
yes, you should try proving it yourself
 
Anonymous
@Thorgott Hint please? :P
 
Anonymous
Suppose we just have that $(a_n)$ diverges to $\infty$
 
Anonymous
I do a rearrangement
 
partial sums of both the series and the rearrangement are increasing sequences, so you just have to show unboundedness of one implies unboundedness of the other
 
Anonymous
@Thorgott Ummm, but how do we know that the rearrangement is increasing?
 
3:24 PM
all summands are positive
 
Anonymous
@Thorgott We don't know all terms of $(a_n)$ are positive though
 
Anonymous
Some might be negative too
 
Anonymous
But still all add up to $\infty$
 
"any rearrangement of just the positive terms diverges to +∞"
this is what we're talking about, no?
 
Anonymous
@Thorgott Oh yes!
 
Anonymous
3:27 PM
Oops
 
4:56 PM
How can I topologically show the 600-cell has 600 sides?
The assumptions are: tetrahedral cells, 2 cells per face, 5 cells per edge, 20 cells per vertex
Euler's identity in 4D is $C-V+E-F=0$
Solving for $C$, knowing a tetrahedral cell has 4 faces, 6 edges, and 4 vertices,
I get $C-\dfrac42C+\dfrac65C-\dfrac4{20}C=0\\$
But the left-hand size simplifies to $0$
so this is true for all $C$
So what gives
 
5:12 PM
each cell has 4 faces so in total there are 2400 faces, if not for the fact that each face belongs to 2 cells so we double-counted by a factor of 2, so there are in fact only 1200 faces
similarly there are 600 x 6 / 5 = 720 edges?
yeah wiki confirms 720 edges
@AkivaWeinberger
 
But how do you find 600 in the first place
 
what does 600-cell mean
 
1
A: general solution using variation of parameters

doraemonpaulIn fact this just involves some elementary functions simplifications. By variation of parameters, you can get the particular solution is $y_p=\sin x\int_0^xf(x)\cos x~dx-\cos x\int_0^xf(x)\sin x~dx$ Note that the particular solution can also rewrite as $y_p=\sin x\int_0^xf(t)\cos t~dt-\cos x\i...

Could anyone look at my comment on this post?
> The variation of parameters methods has no limits in the integral but you have put them. Does that make a difference?
 
6:06 PM
1 hour ago, by Akiva Weinberger
The assumptions are: tetrahedral cells, 2 cells per face, 5 cells per edge, 20 cells per vertex
It means that^
From that information, how can I determine the number of cells
 
6:22 PM
@AkivaWeinberger I thought 600-cell means it has 600 cells
 
7:11 PM
@LeakyNun Right yes but pretend I didn't know it's called that
 
7:27 PM
yeah I see your point, I don't know
@AkivaWeinberger what if it isn't a topological property
S^3 looks like R^3 with all infinities identified right
so imagine you draw a tetrahedron inside, and take its complement
I think the outside is also a tetrahedron
so I think you can "triangulate" (in a very loose sense) S^3 with 2 tetrahedra
 
Sure but that's two cells per edge
 
oh, I forgot those restrictions
@AkivaWeinberger why don't we start with 3D solids
why does the cube (3 faces per vertex, 2 faces per edge) have 6 faces
 
The biggest difference
is the Euler characteristic of S^3 is 0
and the Euler characteristic of S^2 is 2
Let's do the cube
$V-E+F=2$
$\dfrac43F-\dfrac 42F+F=2\\$
$\left(\dfrac13\right)F=2\\$
$F=6$
 
ok, fair enough
 
Compare
3 hours ago, by Akiva Weinberger
I get $C-\dfrac42C+\dfrac65C-\dfrac4{20}C=0\\$
That gives $0C=0$
which is unhelpful
 
7:40 PM
right
so the closest analogue is S^1
when in fact you do have infinitely many regular hollow polygons
 
so is the 600-cell the only triangulation of S^3 that satisfies those properties?
can I subdivide each tetrahedron?
 
If you delete a tetrahedron,
all its edges suddenly have only four cells
so if you substitute back in a subdivided tetrahedron
it has to only bring that back up to five
 
but you subdivide all of the tetrahedra
 
I feel like that'll increase the cells per edge
 
7:43 PM
the S^1 analogue is breaking each line into two, so an n-gon becomes a 2n-gon
 
@AkivaWeinberger does passing to the convex hull help you?
 
Of what?
 
the 600-cell in $\Bbb R^4$
 
The 600-cell is already convex, no?
I mean I guess you add in the inside
 
7:44 PM
that's what the convex hull is, yeah
 
I'm not convinced that 600 is unique, but again I don't know anything
> The convex regular 4-polytopes were first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. He discovered that there are precisely six such figures.
ok then it should be unique lmao
 
The proof of uniqueness of platonic solids in 3D uses Euler chi, so that's Akiva's point
It doesn't seem to detect the number 600
in 4D
 
right, that's the problem
 
I didn't think though
 
(what if it isn't a topological problem but a trigonometrical one)
 
7:48 PM
So if they're geometric tetrahedra then I think you can do geometry
If they're bendy topological tetrahedra then I dunno
 
Meh the convex hull contains exactly the information that the 600-cell itself does
 
I feel like all topological ones should be isomorphic to the geometric one. If that's true, that could be a proof
I kinda want a pure topology proof though
 
Why is classification of platonic solids the same problem as classifying finite subgroups of $\mathrm{SO}(3)$ (except degenerate cases like cyclic and dihedral) but different one dimension up?
 
especially 'cause in 3D they're so nice
 
we're stepping into triangulation theory
 
7:50 PM
$\text{SO}(4)$ has quite a number of finite subgroups... they are all compact $3$-manifold groups.
 
Is that true? I didn't know that
 
Elliptization, right?
 
Needn't act freely
 
Oh yeah, I forgot about that.
 
They're all 3-orbifold groups, for sure, but I'd guess that only some are 3-manifold grourps
 
7:52 PM
This has to do with branching over $S^3$ with branching locus a bunch of points.
Analogous to one dimension down
You're right
So maybe the reason Euler chi fails is Riemann Hurwitz is useless in 3D
Manifolds have zero Euler characteristic
For platonic solids in 3D you can do a Riemann Hurwitz proof on branched covers $S^2 \to S^2$
 
Hi @Paul
 
Hi @Paul, long time no see!
 
A shorter period of time than the last gap at least
 
True
How are you doing? Still working on ggt?
 
7:57 PM
How many vertices are at most a given distance away from the origin
 
Yah @AlessandroCodenotti
 
@PaulPlummer I learnt the proof of existence of the Cannon-Thurston maps for hyperbolic normal subgroups
lol
 
@AkivaWeinberger theorem: if Mike and Balarka can't come up with an answer in 10 minutes, the answer is difficult
7
 
^ this is provably false
 
Cool, I don't think I know the proof, is there a nice idea to it? I know that normal subgroups are distorted so it isn't totally obvious
 
8:00 PM
@AkivaWeinberger you might find an answer in Coxeter: Regular Polytopes
@BalarkaSen why are all polyhedra spheres lol
why can't I have one that looks like a torus
 
I should have learned the classical case by now... not sure why I haven't
 
@PaulPlummer nice, what kind more precisely?
 
@PaulPlummer There are two parts to the story, one is coming up with a coarse section $G/N \to G$, and the other is constructing a ladder -- I think both ideas are pretty cool
I haven't digested the ladder stuff very thoroughly yet though
 
Most the the GGT stuff I work on is in someway related, or maybe only inspired by, work on mapping class groups of surfaces. One thing is I am trying to come up with a new proof that quasiisometry of a curve graph of a surface (V=isotopy classes of curves, edge if they have disjoint representatives) is finite distance from an actual graph automorphism
 
@LeakyNun Convex polyhedra
A convex manifold-with-boundary is homeomorphic to a ball
 
8:08 PM
This is already known, but I think there is a more elementary proof
And the known proof actually uses a similar statement already proved for MCG, which is a bit weird since normally proofs go in the other direction (understand geometry of curve graph can give understanding of MCG)
 
Hey @Paul
 
Hi
It is sort of GGT mixed with low dim geometry/topology
You are done with your thesis right @AlessandroCodenotti?
 
Yep, I was left with a few open questions about asymptotic dimensions, but I need to wrap it up
I'll think about some stuff in between descriptive set theory and topological dynamics for my PhD I think
 
That is cool stuff
@BalarkaSen Are you reading a paper on it?
or like a lecture
 
@PaulPlummer Mahan is offering a hyperbolic geometry course, and he's doing this stuff now lol
 
8:17 PM
Makes sense, he is like the leader in C-T maps
 
Hi. How can I solve $\lim_{x \to 0} \frac{(1-\cos x)}{\tan(x-\pi)}$ without l'Hopital's?
 
Has he said anything about C-T maps not existing for some subgroups?
 
No, he hasn't gone into that. He ended C-T stuff by stating general results on metric bundles
This is his work with Sardar
This week he's moving on to cube complexes
 
Oh Sardar is involved in this stuff? Didn't know that. Whenever I have heard Sardar speak he talks stuff about wreath products and stuff.
 
@AlessandroCodenotti I recently answered a question where someone was wondering about partitioning reals into borel subsemigroups. Turns out there are not really interesting partitions when you restrict to such subsets.
 
8:21 PM
Yeah his PhD thesis is where metric bundles got introduced
Clean idea
Anyway I don't know hyperbolic geometry
 
Coarse hyperbolic geometry?
 
thats what i meant hah
 
I have gotten by with very little
It is all just intuition anyways :D
 
i am a simple man i just want to understand what happens if you randomly walk away
 
8:24 PM
Ah, random walk stuff, know very little of that
 
@PaulPlummer do you have a link? Sounds interesting
 
@AlessandroCodenotti The "unqualified" question where it is proved that there are weird partitions (using choice) and this question
I was surprised that the "ball model" of randomness is so hard to prove stuff in @BalarkaSen
For example, showing that hyperbolic elements are generic by counting inside radius $n$ balls
 
Thanks, I'll read it later!
 
It is pretty elementary, just uses a bit about measurable sets
@BalarkaSen Here is an interesting open problem. In MCG of surfaces there is a classification into elements finite order, reducible, irreducible/pseudo-Anosov, and the irreducible elements have lots of "hyperbolic behavior". It is and open question whether or not these are generic in the ball model. Weirdly it is known that a positive proportion are irreducible in the ball model.

It has been known for a while that random walks generically end at irreducible.
 
8:59 PM
@PaulPlummer How hard is it to show that finite order elements can be represented by finite order diffeomorphihsms?
 
9:16 PM
@PaulPlummer Hm, weird. What's the right "boundary" of the MCG?
You said it's something-something-hyperbolic so I assume that notion somehow makes sense
Random walks are best understood as harmonic functions on the boundary, hence my question
I'd also be interested in an answer to Mike's question - no clue how to see that
Actually what is the boundary of Teich($\Sigma$)? Can this S^(6g-7) be interpreted somehow? What's a limit of complex structures yo?
Seems like nonsense lol
 
9:38 PM
@MikeMiller Guess: Take any finite order MCG element $f : \Sigma \to \Sigma$; $f^n$ is isotopic to identity, so average a hyperbolic structure on $\Sigma$ using $f$ to get $f$ to be an isometry
Does that work?
 
@MikeMiller It isn't exactly easy to see and does take work. The classification basically goes through the action on Teichmuller space, finite order case corresponds exactly to fixing a point
 
scary
 
I think it takes about a page in the primer (Farb and Margalit) once you have all the definitions and stuff
but it is supposed to all be analogous to the torus case where teichmuller space is the hyperbolic plane
Showing that all finite subgroups arise as the isometry group of some surface is harder
(and I don't know the proof, I know it uses teichmuller theory stuff)
There isn't a right boundary for MCG but there are useful ones. Teichmuller space has projective measured laminations as a boundary
 
Hm ok
 
and pA have north south dynamics.
 
9:46 PM
Ah nice
 
pA's are also exactly the hyperbolic elements acting on the curve graph, which has boundary as the space of ending laminations
 
so they are automatically dense in the boundary which is a start
the random walk statement feels like it says it has "harmonic measure 1" on the bd
but you're doing some ball model so idk
 
Hi, a @Balarka, @Paul
 
Hi @Ted
And bye as well because I have to wake up for class tomorrow
 
9:50 PM
There is also other "intrinsic" hyperbolic behavior. For example you can get a quasi-axis orbit from pA acting on the mapping class group and these axis have a property called (weakly) contracting, which basically means balls disjoint from the axis project to "small" diameter sets. For hyperbolic spaces there is a uniform bound and when that happens you get the strongly contracting property
 
@BalarkaSen This sounds basically like it's the proof Paul just gave
 
Yah, I think the idea is basically the same
 
I guess there's no notion of averaging in Teichmuller space though is there?
 
From what I understand all the ball model stuff that we know goes through strongly contracting property stuff and doesn't appear to apply when we only have weakly contracting (it is open if there are strongly contracting geodesics)
 
Is being free on a finite set equivalent to finitely generate?
 
9:54 PM
@Hawk: Certainly not equivalent!
 
You're getting into material that is too hard for me Paul
 
I don't know @MikeMiller
 
more context please @Hawk
are you talking about groups/modules/vector spaces?
 
I am literally staring at the definitions and i don't see any difference (module)
 
passes the baton to Thor
 
9:56 PM
Is Z/2 the free Abelian group on one generator
 
There is definitely more to show with Balarka idea but I suspect if you dissected everything you could probably translate it to that
 
one generator is finite...
 
What does free mean?
 
it can be written as a linear combination over the set
 
Huh?
 
9:59 PM
so in my case, a finite set
so if M is a module over A, it is free if it can be written a s linear combination of elements in A.
*on the set A, (over a ring R)
 
First of all, your sentence is terrible. "It can be written"?
Second of all, no, that's not the definition.
You've defined what it means for a set to generate.
 
Okay i just opened my book and to quote it says R-module F is free on subset A of F if every nonzero elements x can be written as x = r_1a_1 + \dots + r_na_n
 
It doesn't say that, no
You've missed a word
 
the r_is are unique
 
Ohhhh ... To quote, eh?
 
10:04 PM
as well as the a)is
 
Now figure out what the difference is.
 
they don't have to be unique i guess...?
 
Hint: There's an important word when you study modules. That word is relations.
 
do they (finitely generated) and free on a finite set ever coincide?
 
With vector spaces, do you know the difference between saying a set forms a basis for $V$ and that the set spans $V$?
 
10:07 PM
the latter may have more vectors than needed
 
I.e., there may be non-trivial relations among them.
 
It's true in the context of linear algebra that a finitely generated module (over a field $k$) is necessarily free on a finite set --- you learned this in your linear algebra course, probably with different language. But Ted is pointing out an important distinction. Even in the linear algebra context, a finite generating set is not the same thing as a finite set which freely generates the vector space.
 
Tomorrow is the 268th birthday of Adrien-Marie Legendre if anyone was interested in knowing
 
Wow. A mathematician who's older than I !!
 
@TedShifrin do i not have it right?
 
10:11 PM
You had it right
 
haha well I don't know what shape he would be in or if he has a grave but they put his name on the Eiffel tower
 
We're just quicker to respond when we see an error, because that's more worrying :)
 
Well, not quite right.
You could have a non-free module that is singly generated.
 
(Right for vector spaces, though)
 
Yes, right for vector spaces ... I'm sorry I muddied the waters but I thought it was the right thing to do.
 
10:15 PM
so that analogy lifts to module is what ted is suggesting to me. free module on a finite set is finitely generated, but not necessarily the other way.
 
Correct!
 
ok, thanks.
 
Think about the case of Z/2 carefully and that will help
 
 
1 hour later…
11:27 PM
Hi! So i have a very specific goal in mind, but while i don't find it hard to explain (in my post) I'm unsure on how to explain it/portray it as clearly on the question itself...

The goal being: I have a very long integer (30+ digit long or so) and I'm trying to find the best way (be it, algorithm, theory, etc) to find the shortest calculation (as in, something that is shorter than the actual integer, *and* would give the same integer *back* as a result) which give the previously mentioned integer as a result.
how could i make the above as a non-confusing question?
(not asking for the answer to this here, just on how to format this into a question that would fit the goal clearly)
(I didn't post any of what i said above yet, and try to picture it in my mind right, so that i don't waste anyone time, sorry if that wasn't clear!)
 

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