« first day (1818 days earlier)      last day (3202 days later) » 

11:00 AM
@robjohn there is a problem though. I think it's not hard enough to dedicate it to Ramanujan. :D
 
OK, I don't remember. The kneejerk reaction is to glue all outside faces together, but that won't make the right type of thing.
 
oh, sorry, I meant to say obtaining S^3 from \Delta^3 by identifying pairs of faces of \Delta^3.
 
I know.
 
otherwise, gluing all faces apparently work
 
I mean, S^3 is the 3 ball with the outside identified to a point.
Yes.
 
11:07 AM
if you have done an exercise from chapter 0 before, you should be able to do this neatly.
 
The join of S^1 thing, you mean?
 
nods.
think of S^1 as an interval with endpoints identified. and then take join of intervals, modulo appropriate identifications.
\Delta^3 is the 3-simplex
 
OK, I was getting completely confused.
Yes.
OK, so it's trivial.
Nice!
 
what is trivial?
 
The simplicial facegluings just come from the S^1 gluings.
 
11:20 AM
yes, so what are the gluings on \Delta^3?
 
Pairs of adjacent faces?
Well OK, that is the only way one can glue faces.
 
by adjacent, if you mean gluing the pairs joined by en edge, then yes.
here's a straightforward way to see it, which relates to Hopf fibration :
 
Any pair is joined by an edge?
 
sure.
but that's surely not the only way to glue pairs of faces. one can twist one face once and paste to opposite face.
 
Strange: The accepted and most-upvoted answer to that question fails to make its point. There are other answers (not by me) that IMHO deserve a better ranking.
 
11:25 AM
I suppose.
 
ok, take a 3-simplex, cut open into two prisms by cutting along a little square. the identifications you found makes the two prisms into two solid torii $S^1 \times D^2$. the little square is boundary of the two torii.
so your space is two copies of $S^1 \times D^2$ glues along the boundary $S^1 \times S^1$ by the map that pastes the meridian to the longitude.
$S^1 \times D^2 \cup_\partial D^2 \times S^1 \simeq \partial(D^2 \times D^2) \simeq \partial(D^4)$ which is just $S^3$, so you're done.
these kind of decompositions of 3-manifolds into solid genus g surfaces glued along their boundary by some diffeomorphism are called Heegaard decompositions.
 
Why does the first $\simeq$ hold?
 
point-set topology. recall what $\partial(M \times N)$ for manifolds $M$, $N$ is.
 
Oh yes, I vaguely remember.
I don't know manifolds
 
manifolds are just hausdorff spaces locally homeomorphic to $\Bbb R^n$.
an open ball D^n is the same as R^n
 
user147690
11:33 AM
@Chris'ssistheartist I have just learned a method to do something un-fun and show offy, find an exact root of $x^3-6x^2+15x-13=0$
 
I need to go off for a while to eat.
 
oh, sure.
 
This is helpful, btw.
 
I have to go too.
 
user147690
Later pal
 
11:35 AM
Will talk later about hopf fibrations.
 
Thanks.
Excellent.
Hopefully then I will be more into homology than now.
 
@AlexClark Glad for you.
 
user147690
@Chris'ssistheartist One of them is $x=2+^3\sqrt{\frac{\sqrt5 -1}{2}} - ^3\sqrt{\frac{\sqrt{5}+1}{2}}$
 
user147690
I can only see it getting more painful from here :P
 
@AlexClark Ah, the golden ratio involved, right?
 
user147690
11:40 AM
Yep :)
 
Interesting.
 
user147690
Good catch!
 
And the golden ratio conjugate, of course.
 
user147690
Does the golden ratio come up much in your work? What about fib numbers?
 
I have some series and integrals involving golden ratio and fibonacci numbers that are ready to be added to my book, but not too many.
 
user147690
11:47 AM
That's actually pretty cool. Do you already have chapter titles in mind?
 
They are just numbered, but not decided about their names yet. Maybe I'll do it later.
 
user147690
Would be cool to group topic concepts, like series, limits, integrals involving the golden ratio, or involving the fib numbers etc
 
I find non-mathematical things to do far harder like putting name to the chapters. :-)
 
user147690
Haha too true
 
:-)
@AlexClark Yes, I think of that. :-)
All my powers are gone when I leave math and attend other non-mathematical parts of the book. :D
Actually this is the hardest part of my book that will give me headache.
 
user147690
11:51 AM
Haha I can imagine. I changed out of an engineering major so 1) I wouldn't have to work in groups, 2) I wouldn't have to write any report/discussion etc papers
 
user147690
Math is so much nicer to work on
 
user147690
Anyway I must go now, I'll leave you to it :)
 
OK :-)
I love to work alone too.
 
12:16 PM
Hello!!! I have found the eigenvalues and the eigenspaces of the following matrix and I wanted to know if I am right.
$\begin{bmatrix}
2 & 0 &0 \\
-3 & 3 &2 \\
4 & -2 &-1
\end{bmatrix}$.

I have found that the eigenvalues are 2 and 1 and the eigenspaces $V(1)=\{\bigl(\begin{smallmatrix}
0\\
1\\
-1
\end{smallmatrix}\bigr)x | x \in \mathbb{R}\}, V(2)=\{\bigl(\begin{smallmatrix}
1\\
-1\\
2
\end{smallmatrix}\bigr)x | x \in \mathbb{R}\}$
 
Huy
@evinda: wolframalpha?
 
@Huy Does it find the eigenspaces?
 
Huy
Yes.
 
Are eigenspaces the same as eigenvectors? @Huy
 
Huy
One thing is a vector space, the other is a vector.
BTW, if you at some point don't have access to wolframalpha or something similar, you can always check such results by plugging into the equation it should satisfy, namely $Ax = \lambda x$.
Since we're only in dimension 3, you can do it in your head.
(and it's all integers)
 
12:38 PM
I checked it, it is right. @Huy
@Huy We have the linear map $F: \mathbb{R}^3 \to \mathbb{R}^4$ with $F(1,0,0)=(1,-1,0,2), F(1,1,0)=(1,0,1,2), F(0,0,1)=(2,-1,1,4)$ and we want to find the basis of the image of $F$. Do we have to consider the matrix $\begin{bmatrix}
1 & 1 &2 \\
-1 & 0 &-1 \\
0 & 1 & 1\\
2 & 2 & 4
\end{bmatrix}$ and apply Gaussian elimination?
Or do we have to do something else?
 
Huy
@evinda: A basis, not the basis. What can you tell me about the image of $F$ and a basis in general?
 
A basis consists of linearly independent vectors.
In order to find the basis of the image of F do we find the vectors that form these three vectors: (1,-1,0,2), (1,0,1,2), (2,-1,1,4)? @Huy
 
Huy
Yes, you have to see if then span of those three vectors can be written by fewer vectors.
 
How can we do this? Using Gaussian elimination? @Huy
 
Huy
That is a typical method, yes.
 
12:50 PM
At this matrix: $\begin{bmatrix}
1 & 1 &2 \\
-1 & 0 &-1 \\
0 & 1 & 1\\
2 & 2 & 4
\end{bmatrix}$ , right? @Huy
 
Huy
Yes, but can you say why you look at this matrix in particular?
 
@Huy Because it consists of the vectors of the image?
 
Huy
So?
 
@Huy So we can find which of the vectors are linearly independent?
 
Huy
Why?
What is the link between linear independence and Gauss elimination?
 
1:03 PM
@Huy We consider the matrix that has the vectors of the image as columns. The vectors will be independent if we do NOT get a row of all 0s.

I found this matrix:$ \begin{bmatrix}
1 & 1 &2 \\
0 & 1 &1 \\
0 & 0 & 0\\
0 & 0 & 0
\end{bmatrix}$

So the vectors are lineraly dependent.
@Huy But how can we find a basis?
 
Huy
Are $\begin{pmatrix} 1\\0\\0 \end{pmatrix}$ and $\begin{pmatrix} 0\\1\\0 \end{pmatrix}$ linearly dependent?
 
No, they aren't. @Huy
 
Huy
But using what you said just before, you would conclude that they are.
 
At the Gaussian elimination, we found two rows are 0s. Do we deduce that all the basis consist of two independent vectors? Or am I wrong?
 
Huy
You need to understand why you apply Gaussian elimination. Then you will have answers for all those questions.
 
1:12 PM
The voting (and acceptance) patterns on the answers to this question give me the creeps.
 
@Huy We apply Gaussian elimination to find the rank of the matrix. Right?
 
Huy
You can find the rank of the matrix using Gauss, but you're looking for a basis, not just the rank. Why can you use it to find a basis?
 
I am confused right now. Could you give me a hint? @Huy
 
@AlexClark what are $+^3$ and $-^3$?
@ccorn Do you not like the question?
 
1:29 PM
hi again @Alizter
 
@robjohn I like the question, but the accepted answer had previously failed to give an actual proof. Yet it had the most votes by far. It has now been repaired. I like many of the other answers, and I find that Jack's answer (which was right from the beginning) deserves to rank higher. Other answers are nice too.
 
1:59 PM
When there's a $\LaTeX$ error, this shows up which is pretty cool but it's only visible for a very short time!
 
@Huy Is it right as follows?

We see that $\begin{pmatrix}
2\\
-1\\
1\\
4
\end{pmatrix}=\begin{pmatrix}
1\\
-1\\
0\\
2
\end{pmatrix}+\begin{pmatrix}
1\\
0\\
1\\
2
\end{pmatrix}$ and that $ a \begin{pmatrix}
1\\
-1\\
0\\
2
\end{pmatrix}+ b \begin{pmatrix}
1\\
0\\
1\\
2
\end{pmatrix}=\begin{pmatrix}
0\\
0\\
0\\
0
\end{pmatrix} \Rightarrow a=b=0 $.

So a basis of the image of F is the following:

$\left \{ \begin{pmatrix}
1\\
-1\\
0\\
2
\end{pmatrix}, \begin{pmatrix}
1\\
0\\
1\\
2
\end{pmatrix}\right \} $
 
@MikeMiller The proof of Godel's theorem is brilliant. Now I want to learn mathematical logic :P
I don't pretend to assume all of the proof, but I certainly get what he's trying to do.
 
@ccorn timing has a lot to do with when answers get votes, and once an answer has votes, it tends to get more than the answers that don't have votes. Sad, but true.
@ccorn the rich get richer...
 
@robjohn Most importantly, the flaws of that question's richest answer have now been rectified.
So I removed my downvote (which puts me at 3999 score. I had accidentally crossed the 4k barrier yesterday night with a LHF, but other answers got better, so I could delete mine again. Which is a good thing; it would have made my answer list look dull. Have to concentrate on the interesting questions again.)
 
2:15 PM
just realized I wrote "assume" instead of "understand". weird.
 
i got what you meant, tho, so it's fine
 
@robjohn Hi!!!
Could I ask you something about linear algebra?
 
Ask away. Someone might be able to help.
> Just ask; don't ask to ask.
 
We have the linear map $F: \mathbb{R}^3 \to \mathbb{R}^4$ with $F(1,0,0)=(1,-1,0,2), F(1,1,0)=(1,0,1,2), F(0,0,1)=(2,-1,1,4)$ and we want to find the basis of the image of $F$. Do we have to consider the matrix $\begin{bmatrix}
1 & 1 &2 \\
-1 & 0 &-1 \\
0 & 1 & 1\\
2 & 2 & 4
\end{bmatrix}$ and apply Gaussian elimination as follows?

$\begin{bmatrix}
1 & 1 & 2\\
-1 & 0 & -1\\
0 & 1 & 1\\
2 & 2 & 4
\end{bmatrix} \to \begin{bmatrix}
1 & 1 & 0\\
-1 & 0 & -1\\
0 & 1 & -1\\
2 & 2 & 0
\end{bmatrix} \to \begin{bmatrix}
 
That seems correct, @evinda.
Congrats on 4k, @ccorn!
 
2:22 PM
in a very brief way, you assume that $\mathsf{PA}$ is $\omega$-consistent and construct a formula $F(\bar{n}, \langle \varphi \rangle)$ for a statement $\varphi$ and a natural number $n$ such that $\vdash F(\bar{n}, \langle \varphi \rangle)$ implies $n$ is the Godel code of a proof of $\varphi$. turns out $T(\langle - \rangle) = \exists x T(x, \langle - \rangle)$ is a schema. now tarskis theorem says that $\mathsf{PA}$ with a schema is inconsistent which is a corollary of diagonal lemma
 
\exists
 
ah, better.
 
but yeah, it's charming
 
indeed.
a simple proof, but conceptually very deep which proves something quite interesting
 
@Khallil So we can make operations by column to apply Gaussian elimination, right?
 
2:29 PM
I think it's possible yea. It'd be the same as performing row operations on the transpose of the matrix you constructed from the vectors that were the result of applying $F$ to the given vectors in $\mathbb{R}^3$ (which as far as I can tell, form a basis for $\mathbb{R}^3$).
 
is it required to know some axiomatic set theory to learn mathematical logic? (or the other way around?). i am not planning to read it right now, but well... i just realized it's not as non-mathematical as some people say it is. i guess i'd like to read a bit of this and a bit of that at some point of time
 
@Khallil thanks :-)
 
The other way around.
 
ah, i see.
 
You should punch whoever said mathematical logic isn't mathematical, because that's silly.
 
2:30 PM
haha
 
It's in the name!
 
i wonder if my motivation behind really reading up the proof of Godel's theorem today after the discussion with you and Karl was to learn homotopy type theory at some point of time. i think i'd be rather happy if it wasn't.
shivers
speaking of, mathematical logic intersects with higher category theory somewhere, doesn't it? pretty weird.
 
Something something topos.
Something something dark side.
 
@evinda Do you need an orthonormal basis, or just a basis? If you just need a basis, the columns of the matrix will do. However, since the columns are dependent, you do need to eliminate one.
 
@MikeMiller yeesh.
 
2:39 PM
Can I ask what you mean by 'topos', @MikeMiller?
 
@MikeMiller it's just illogical...
 
Nope.
 
hahaha
well, @Khallil, the definition is involved
 
@robjohn Just a basis.
So you mean that we can justify it as follows?

We see that $\begin{pmatrix}
2\\
-1\\
1\\
4
\end{pmatrix}=\begin{pmatrix}
1\\
-1\\
0\\
2
\end{pmatrix}+\begin{pmatrix}
1\\
0\\
1\\
2
\end{pmatrix}$ and that $ a \begin{pmatrix}
1\\
-1\\
0\\
2
\end{pmatrix}+ b \begin{pmatrix}
1\\
0\\
1\\
2
\end{pmatrix}=\begin{pmatrix}
0\\
0\\
0\\
0
\end{pmatrix} \Rightarrow a=b=0$.

So the following is a basis of the image of F:
$ \left \{ \begin{pmatrix}
1\\
-1\\
0\\
2
\end{pmatrix}, \begin{pmatrix}
 
and i don't know enough about toposes (taking anon's policy) to give you an easy explanation
 
2:41 PM
 
@evinda any two columns of the $4\times3$ matrix would do.
 
@Khallil: It's a type of category. You could define a category and all the words involved so that you know what they mean, but then you'd have to justify "Why do I care about a ____ _____ _____ category with ____s?" And that's a much harder question.
 
How do we deduce that we have to take any two colums for a basis? @robjohn
 
@evinda because any two columns, since they are independent, span the space.
 
@robjohn So is my above justification right?
 
2:50 PM
@evinda yes.
 
@robjohn @Khallil Nice, thank you!!! :)
 
Huy
The story goes that Gauss was on Riemann’s defense committee for his Habilitation (super doctorate). In those days, the candidate was asked to submit three topics in advance, with the implicit understanding that the committee would ask to hear about the first topic (the actual thesis was on Fourier series and the Riemann integral.) Riemann’s third topic was “On the
Hypotheses which lie at the Foundations of Geometry.” Clearly he was hoping that
the committee would select from the first two topics, which were on material he
Is this true?
 
I didn't like that book much.
 
Huy
@MikeMiller: I just want to check a proof in it.
 
I see. I think that story is true. I've read it somewhere else, at least.
 
3:01 PM
interesting fact.
 
Huy
Namely, my standard solution suggest to look up the proof that the Hopf fibration $f: S^3 \to S^2$ is a Riemannian submersion in that book, that's why. I find that story pretty cool though.
 
ok, i gotta go
 
Huy
Why did you not like it, @MikeMiller?
 
He likes computations way too much for my taste. I frequently got bogged down in symbol-pushing.
The book I liked was the one with three authors where one of them was Gallot.
 
Huy
I see. My prof seems to be a big fan of Lee and do Carmo.
 
3:06 PM
I never read them. Gallot leaves a lot to the reader which helped me build intuition. On the other hand, my taste might be skewed, since I'm not a geometer.
 
Huy
Neither am I.
 
Huy
3:17 PM
Oh, now that you're here I actually have a question, @MikeMiller: I want an isometric immersion of $\mathbb{R}^2 / \mathbb{Z}^2$ into $\mathbb{R}^4$. A candidate would be $$f(x,y) = \frac{1}{2\pi}(e^{2\pi i x},e^{2 \pi i y}).$$ So I have to verify that the pullback of the standard metric on $\mathbb{R}^4$ by $f$ is the standard metric on $\mathbb{R}^2/\mathbb{Z}^2$. I can compute the pulled back values $g_{11} = g_{22} = 1$ and $g_{12} = 0$. Is that already enough?
 
Sure, metrics are symmetric.
 
Thanks, @MikeMiller.
No problem, @evinda.
 
Huy
@MikeMiller: I'm asking because prior to the exercise I didn't compute the $g_{ij}$ for the standard metric on the torus, so I was surprised to find it is actually just $\delta_{ij}$, as in $\mathbb{R}^n$.
@MikeMiller: The exercise which precedes this one is just a general proof that a group acting freely and properly discontinuously on $(M,g)$ by isometries induces a Riemannian manifold $M/\Gamma$ such that the covering map is locally an isometry, so there were no explicit computations needed.
 
@Huy: Well, when one says the metric on the torus, they mean the metric such that $p: \mathbb R^2 \to T^2$ is a local isometry, so by definition the metric (at least pointwise and under this identification $T_x \mathbb R^2 \cong T_{p(x)} T^2$) is the same.
Right.
 
Huy
I see.
So whenever I have such an $M/\Gamma$, the $g_{ij}$ of "the standard metric" will be $\delta_{ij}$.
Since we obtain a metric on $M/\Gamma$ by pulling back locally.
 
3:23 PM
I wouldn't say that. Now you're using the fact that the metric on $\mathbb R^2$ looks like that.
but eg the metric on the hyperbolic disc is not $\delta_{ij}$
 
Huy
Ah, well, if $M = \mathbb{R}^n$ of course.
Sorry, pretty much all examples so far have been of the form $\mathbb{R}^n / \Gamma$, that's why.
 
There are not many $\Gamma$ such that $M \to M/\Gamma$ isa covering map
 
Huy
For $M = \mathbb{R}^n$ or in general?
 
For $M = \mathbb R^n$.
 
Huy
I see.
That's interesting.
 
3:27 PM
For $\mathbb R^2$, you can only get the Klein bottle, the mobius band, the 2-torus, and a cylinder.
But there are infinitely many non-homeomorphic manifolds $\mathbb H^2/\Gamma$.
 
Huy
Ok.
I don't like $\mathbb{H}^2$ so far.
I hardly have any geometric intuition for all those calculations I'm doing.
Like computing circumference and area of a ball of radius $r$.
 
Hyperbolic space has a far richer geometry than Euclidean or the sphere. So, of course, it's harder.
 
Huy
=_=
 
3:42 PM
Are you going into your third year of undergrad, @Huy?
 
Huy
I'm continuing my MSc, @Khallil.
 
Ah, so you've finished undergrad?
 
Huy
I've finished my BSc, yes, if that's what you mean.
 
Was that earlier this year?
 
Huy
It was in the beginning of this year, yes. I already had finished enough courses for my BSc and only needed to finish my thesis. Due to lack of self-discipline, I only submitted the thesis in the beginning of this year. :P
 
3:46 PM
@Huy: You're doing your MSc in mathematical physics, yes?
Hi @AndrewT.
 
Got it! I didn't know that you had to submit a thesis for your BSc, @Huy.
 
Huy
@MikeMiller: There is no MSc in mathematical physics at my university. Officially, I'm doing it in pure mathematics. But the MSc for mathematics allows to choose from almost all mathematical/physical courses, so I choose a lot from mathematical physics because I'm very interested in them.
@Khallil: I think that depends on the university you're at.
@MikeMiller: There's also a MSc in applied maths at my uni. The "bad thing" about it is that MSc in applied maths requires at least one seminar and one semester paper, whereas the MSc in pure maths only requires one seminar (and more courses). I prefer courses over writing papers, so that was the reason I chose to go with MSc in pure mathematics.
(not the only one, but one of them and probably the simplest to explain without trying to explain many more regulations at my university)
 
Sure.
 
Huy
I could have studied physics and gone into theoretical physics too, but I would still have been obligated to work in laboratory for a semester or two during undergrad studies, and I can assure you there's few things more dangerous than me in such an environment.
@Khallil: You're starting your second year soon?
 
Yep, hopefully in October, @Huy.
 
Huy
3:54 PM
Depends on your exam results?
Did you already take them or are when will you have to?
 
Oh, I already have my results. I've made it a habit of saying hopefully so as to not jinx anything in the future, @Huy.
 
Huy
I see.
Did you ace them? :)
 
I've been growing more and more superstitious recently. Not too sure why.
How do you define acing them, @Huy?
 
Huy
Are you satisfied with the results, personally?
 
That's a tough question. I'm not really satisfied because I could've worked a lot more.
I missed loads of lectures in the second term due to pure laziness.
 
Huy
3:59 PM
:(
But now you know what you can do better next time! :)
And I hope you will!
 
Yep! The same with you!
 
Huy
Indeed, I think I've never been satisfied with my results so far.
Except for algebra, where I got a good grade out of nowhere.
Every other course there's something I wish I had done differently. Started studying earlier, studying some subject better, looking at more examples, etc.
 
That's a strange coincidence. I only aced one module and that was abstract algebra.
 
Huy
:D
 
Me too. My analysis module was worth 20% of my entire year and I went to about the first 10 lectures out of 40.
 
Huy
4:03 PM
We have a spreadsheet online available to the students, and the exam was oral. So many people who had their oral exam in e.g. algebra that year would describe their exam: what was asked, how did the professor behave, how did the student feel, etc. The algebra exams had the worst "reviews" by far and actually made me afraid of the exam. But the prof was the nicest person ever to me.
What courses are you taking in fall, @Khallil?
 
@anon: Geometry guy responded to our comments without pinging us.
 
I'm taking Vector Analysis, Analysis 3, Algebra 1, Intro to PDEs and I'll be writing an essay on a topic of my choosing that we don't learn about in the second year, @Huy. (Maybe Spanish too)
 
Huy
No complex analysis? cries
 
That comes at the end of Vector Analysis, @Huy!
 
cool
 
Huy
4:11 PM
Looks more like an intro to it, at the end of the Vector Analysis, no?
 
your school moves at a nice pace
@Huy: Many schools stop complex analysis courses at residue analysis. That course covers roughly what the (1 quarter) UCLA undergrad complex analysis course does.
 
Huy
I see.
 
Yep, it's an intro.
 
Huy
@Khallil: You said you already took an abstract algebra course. What was that about? (because you're taking Algebra 1)
 
This is from the contents page of the notes from a few years ago.
 
4:14 PM
Hi, can anybody tell me the difference between spectral graph theory and algebraic graph theory please :)
 
It was an intro to abstract algebra. Basic intro to groups, binary operations, Lagrange's theorem, rings, fields, cosets, symmetric groups and quotient groups. I took Linear Algebra this year too which was to do with vector spaces, linear maps, matrices/eigenvalues.
 
Huy
Ok.
 
Algebra 1 expands on Linear Algebra and Algebra 2 expands on Abstract Algebra.
 
Huy
You have a typo there.
:P
 
:-P
 
Huy
4:16 PM
I assume you didn't do the Sylow theorems in abstract algebra yet?
 
Nope. That's in Algebra 2!
 
Huy
Ah, ok.
 
Finitely generated abelian groups are a standalone chapter at the end of Algebra 1 which is kinda strange. I'm looking at that first because I need to review my Linear Algebra before doing the other chapters.
Supposedly Algebra 2 is one of the hardest modules in the second year.
Averages in the past few years have been at about 50%, @Huy.
 
Huy
@Khallil: Your algebra 2 module is somewhat an equivalent of what I had a really good grade in here. I really still don't know why, because I didn't feel like I had a very deep understanding of any of it.
@Khallil: Over here, we basically do groups in Algebra 1 including Sylow theorems, then we do rings and fields in Algebra 2, leading to a bit of Galois theory. After those two courses, both are tested together, orally.
 
Gentlemen, I have a basic linear programming question but do not wish to intrude on your conversation!
 
4:21 PM
Oral exams sound a lot better to me. I feel like they reveal more of a mathematical understanding than plugging in formulae and rearranging stuff, @Huy.
 
I wouldn't know much about linear programming
 
Basically I have this function $f_i(u_i)$
 
Huy
@Khallil: They are a lot more relaxed and if you don't understand something or didn't learn some particular chapter (lack of time, no understanding at all), you can tell the professor as soon as he asks about it and pretty much all of them so far have been understanding and proceeded with a very different question. Of course, that rejects a chance for a perfect grade, but I think it's very fair because you can still get a good grade by showing that you understood pretty much everything else.
 
How do I start tex?
 
Huy
4:23 PM
@Khallil: Usually we are just asked to explain proof ideas, proofs, examples, etc, and when a prof realizes a student is really good, he asks something that requires thinking over what has been covered in the course and exercises.
 
$$o(u_i) = [f_1(u_1), f_2(u_2), f_3(u_3)]$$
There is a matrix with three elements and I need to maximize it. Inside is the function that can depend on $u_i$
So in general terms, can I think of this as maximizing three sub-functions?
The matrix throws me off
Normally you have one function that you maximize, etc.
 
I think oral exams can be terrifyingly stressful, even with kind interviewers.
 
Huy
@MikeMiller: Most profs here try really hard to make it the opposite, and most succeed, I'd say. I used to hate oral exams.
 
i got an oral algebraic topology exam in 9 days...my first oral exam ever
 
i don't mind oral exams per se. what i struggle a lot with is writing anxiety, which isn't great when your oral exam is predicated on 1) writing a paper, 2) organizing a presentation
 
4:38 PM
@MikeMiller why is the kernel of the cellular boundary map $H_n(X^n, X^{n-1})\to H_{n-1}(X^{n-1}, X^{n-2})$ free?
when $X$ is a CW complex
 
Subgroups of free Abelian groups are free abelian.
 
5:17 PM
 
How might I prove that if $a$ is an arithmetical function with polynomial growth, then if for some $s \in \mathbb{C}$ the Dirichlet series $D(a, s) = 0$, we have that $a(n) = 0$ always?
 
a(1)=1, a(2)=1, a(n)=0 for n>2 has polynomial growth and 1+1/2^s=0 has a complex solution but a() is not identically 0
 
Well then … I guess my homework has an error in it.
 
5:38 PM
what is an arithmetic function in this context? it seems hard to believe that anon's a is arithmetic
oh, is it just a function $\mtahbb N \to \mathbb C$?
 
Hey there Mr. @MikeMiller. I've been being exposed to some topological topics lately and it's been pretty interesting (all at a very very basic level)
 
mm?
 
Surfaces and knots, nothing too fancy
Although I'm not quite sure what's the correct response to 'mm?' :)
I just know you're one of the resident topologists and thought I would share my admiration of the subject, basically.
 
5:57 PM
those are good
I'm always frustrated by first topology courses that obsess over the definitions and basics like compactness, separability hypotheses, etc, but never actually do any geometric topology
so it's good to hear you're learning some of the fun stuff
 
Yeah, that was my one and only topology class - in one ear and out the other. But I find some nice 'expository' lectures by Devadoss
While lacking a great deal of precision, I'm certainly getting a feel for things that were always quite mysterious when I encountered them in passing
 
he's nice
 
that should say I 'found' some expository lectures
 
It was nice! And I know my advisor taught algebraic topology a semester or two after I graduated, so I'm planning to ask him about it; see if I can work through the material
I haven't been able to sit down and read Hatcher, for whatever reason. I tried, but lost steam before long.
 
6:04 PM
it's hard to just jump in, for sure
i think a lot of people start with Munkres's algebraic topology section in his topology book
 
Really? Interesting
 
munkre is better as an introduction
i learnt munkres before doing hatcher
 
I'll have to check it out then
 
what did you learn about surfaces and knots?
i see you're around @SohamChowdhury. you should be asleep by now :P
 
Mostly just playing around with knots, but learned of the classification theorem for surfaces - pretty impressive!
 
6:14 PM
indeed it is.
 
@BalarkaSen indeed
 
how was your day?
 
Balarka, is Hatcher exercise 20 from 2.1 obvious?
The obvious isomorphism only seems to work if it's CS rather than SX.
 
I wouldn't call anything obvious.
It's not hard.
Use the long exact sequence.
 
Given that transfinite ordinal multiplication is non-commutative, should the factorial be defined by (n+1)!=(n+1) * n! or by (n+1)!=n!*(n+1)?
 
6:28 PM
In that case, my problem is with 21.
 
well, yuck.
but you can construct an explicit chain map, sure.
 
Yuck? Just take the suspension of your chains.
 
night, chat.
 
you have to triangulate your prism
which is bit of a pain, if you don't know Hatcher's proof of homotopy invariance, which @Alyosha doesn't
 
No, but the suspension of some Delta^n is not something of the form Delta^m.
 
6:30 PM
decompose it into \Delta^m's
look at Hatcher's proof of htpy invariance of H_*, like I said
 
Oh right, the C_n map needn't be bijective?
 
it's literally two $\Delta^{m+1}$s.
 
oh, gah, suspension.
right, take union of the cones.
i was thinking of multiplication by an interval
 
Mike, so just mapping to one of them works? I was confused as thought the C_n map musg be surjective.
 
subtract the images.
 
6:33 PM
why would it need to be surjective? and why would you subtract them?
 
It felt like something would go wrong.
 
you need a map $C_n(X) \to C_n(SX)$. take a singular simplex, take suspension, subtract the images of the maps coming out of the cones.
@Alyosha there is no set-theoretic assumption (i.e., being bijective or anything) on the chain maps for it to induce isoms on homology
 
Obviously, but I guessed that there might be here.
 
i guess we're essentially doing mayer-vietoris when we do that suspension proof.
@Alyosha make sure you do 22 afterwards. it's essentially cellular homology.
also, if you like thinking about pathological examples, let me know after you finish off problem 26.
i'll be back after half an hour.
 
Unless I've mistaken you for somebody else, how's Cambridge @Alyosha?
 
6:48 PM
I'm doing them now.
It's nice, though there is not much interesting stuff like above in year 1.
Also I find it pretty hard to talk to the professors much.
 
7:03 PM
Is that because they are so busy with their own research and talks, or are they not as approachable as you were expecting?
(Also, I hope results went well!)
 
@Alyosha which one, 22 or 26?
 
7:34 PM
22. Though actually not yet.
@Khallil Thanks, and I am probably just bad at approaching.
 
7:57 PM
Hello!! Could someone take a look at my question:
0
Q: The existential theory is undecidable

Mary StarLemma 1. For any $x$ in the ring $F[t,t^{-1}]$ ($F[t,t^{-1}]$: the polynomials in $t$ and $t^{-1}$ with coefficients in the field $F$), $x$ is a power of $t$ if and only if $x$ divides $1$ and $t-1$ divides $x-1$ (the divisibilities are meant, of course, in $F[t, t^{-1}]$). Lemma 2. ...

?
 
8:39 PM
hey
 
Hello @KarimMansour
 
so we have two representation of C* algebra as called equivalent if for representation $(\pi_1,\mathbb{H_1})$ and $(\pi_2,\mathbb{H_2})$ there exists a unitary operator such that $u\pi_1(a) = \pi_2(a)u$
I don't understand I thought unitary operator act in the same space for example action of $\pi_1(a)$ the codomain will be in $H_1$ so u will be in $H_2$ once it act on $\pi_1$ now on the left hand side we have $H_2$ and that is acting on u hmm
I don't understand
can someone explain ?
Hi @MaryStar
 
It means for $U: \mathbb H_1 \to \mathbb H_2$ to be unitary. Unitary maps make perfect sense between different spaces.
In any case, unitary maps are isomorphisms of Hilbert spaces, so two representations can only be equivalent if the codomains are isomorphic as Hilbert spaces.
 
oh I see
 
8:55 PM
My 100th answer is an easy one.
 
@Chris'ssistheartist: Wow... I just got my Mathematica re-registered and it runs about twice as fast. That is probably because this laptop has a quad-core running at 2.5 GHz while I think my other machine was a dual-core running at 2.5 GHz.
 

« first day (1818 days earlier)      last day (3202 days later) »