« first day (1750 days earlier)      last day (3568 days later) » 

00:00
I would start with a disclaimer, then ...
My students trip over this a lot.
So suppose $X$ is a metric space with metric $d. Let $\phi : X \mapsto X$ and let $c<1$ st $d(\phi(x),\phi(y)) \leq cd(x,y)$ for all $x,y \in X$.
So $\phi$ is a contraction because....it keeps reducing the distance between $x$ and $y$ by that amount?
Hmm...Rudin then has a theorem this implies it must contract to a point.
That's cool!
@TedShifrin is this relevant for the implicit function theorem or inverse function theorem?
I'm trying to figure out why you and Rudin both talk about it. And now that I sorta get the gist, I think I can now ask that question
Ah....*things start to click*
@TedShifrin what do you think of Serge Lang's books?
00:18
a complete metric space, i presume...
you can prove the inverse/implicit function theorems using a contraction.
@copper.hat yes complete. Really? Hmm. I think this is what Rudin does for the inverse function theorem. If i recall correctly, you told me this the other day.
if i recall correctly, the map $x \mapsto x-Df(x)^{-1} f(x)$ is a local contraction.
sorry, the $x$ in the derivative should be fixed at $x_0$.
sorry gotta go in a hurry.
back
back @TedShifrin
which rudin is that
baby rudin or grad rudin ?
elements of real analysis
that is a must read
I glanced over it last semester
very nice
00:27
@KarimMansour i am starting to get more out of it as i learn more.
I am reading Principles of Mathematical Analysis. I dunno if that's the one you meant
oh, yeah, that
The most natural way of proving the inverse function theorem is to get the inverse as the solution of a fixed point problem, @Stan. There's also a proof of Contraction Mapping in the first section of what I sent you.
i got the structure right
00:28
yeah
___ of ____ analysis
I saw the proof before that I liked
1 moment
for inverse function theorem
@TedShifrin i probably wouldn't have read about it except it was in what you sent :P so then i inquired a bit. I think I am starting to get the idea.
@MikeMiller lol
@TedShifrin do you like analysis?
@TedShifrin I guess I don't really understand what the inverse function theorem is saying....or rather why it's important. When i learned about vector spaces, we assumed the existence of inverses. This comes up in abstract algebra too. So why do functions have this theorem? Can't functions be vectors? What does the inverse function theorem give me that i couldn't get just by working with a function space?
00:33
You're mixing apples and oranges, @Stan. Go back to single-variable calculus and ask when a (differentiable) function has a (local) inverse. Try to generalize.
@StanShunpike: i would echo what @TedShifrin wrote above. you can also find a 'parameterised' verssion of the contraction mapping theorem that is useful in many contexts, such as proving continuity of solutions of an ode with respect to some parameter.
Yes, @Karim.
@StanShunpike: think of linear problems. if $A$ is invertible, then $Ax =b$ has a local inverse (hence global, of course, since linear).
same for the implicit function theorem. If Ax+By=0$, and $A$ is invertible, then you can write $x = - A^{-1} B y$. see the resemblance to the ift formula for the derivative.
Hello @copper.hat
Are you familiar with algorithms?
@TedShifrin @copper.hat okay, if the idea is to make claims about the relationship between the derivatives of two inverse functions, then i get it.
00:39
@evinda: that's a bit broad, and i am without pencil & paper :-), what sort of algorithms?
BTW, @Stan, there are plenty of non-invertible linear maps, so I don't know what your linear algebra statement meant. Indeed, the point of the inverse and implicit function theorems is that for $C^1$ functions, what is true for the derivative at a point is locally true for the non-linear function locally.
No, @Stan, the point is to claim existence locally of an inverse function.
@StanShunpike: it is an extremely useful result.
Note the example at the beginning of section 2 of what I sent you. For a differentiable but non-$C^1$ function, even $f'(0)>0$ does not imply a local inverse function for maps $\Bbb R\to\Bbb R$.
@copper.hat Undirected graph G=(V,E), weights of edges and a subset T of the vertices.

Output: The minimum spanning tree at which the vertices of the set T are leaves( The tree can also have leaves from the set V-S)

I want to write an algorithm that solves the above problem and runs in time O( E logV)
Could you give me a hint what I could do?
@TedShifrin yes i remember that. I will reread it again now that I understand contraction mapping better and see what new things I learn this time around
00:41
sorry @evinda, without my cormen rivest & stein nearby this is not my natural domain :-(.
@copper.hat Ok.. no problem... :) Which is your domain?
somewhere in the control/optimization (as in continuous) domain. or analog circuit design...
there is a connection :-)
It helps to do some rigorous multivariable analysis before jumping into this stuff, @Stan :) BTW, did you settle your econ problem yet?
No, I just finished a set due today. Hiatus. I plan to do it tonight :D hence i am asking questions
to try to understand B better
@TedShifrin What do you mean by rigorous?
I mean, I can do surface integrate, line integrals, etc
And total derivatives
I mean the rigorous definition of derivative in the multivariable setting, plus some understanding of the chain rule, norms, etc.
00:47
And that sort of thing
Integration is irrelephant here.
@TedShifrin: i like that misssspeiling
I did it on porpoise.
Yes, having read Rudin, I feel I have some things to learn to up my calculus to this level. But that's why I'm wrestling with this stuff. Learning :D
00:48
Some sense of (aqueous) humor helps.
@StanShunpike: have you dealt with lagrange multipliers?
That's what landed us in this mess, @copper.hat :)
Yep, tho @TedShifrin may disagree
I gave him some interesting exercises on that.
00:49
ahh, i see. i was going to suggest it as a good example of the use of the ift.
more really the implicit function thm, unless I'm missing something you're thinking of.
thats what i meant, sorry
i think of them as being much the same
ok, @Stan, I'll leave you in pieces for now.
a commodian?
 
2 hours later…
02:24
the contrast between the thrust of this answer, and the name of its author, gives me a bit of a chuckle:
1
A: Can I combine the wave and heat equations?

YesNo, one cannot obtain a solution of this PDE by adding a solution of heat equation to a solution of the wave equation. (With linear PDE, we can combine solutions of the same equation to make new ones; but your situation is different). Your PDE is known as damped wave equation and is solved here....

02:51
@KarimMansour no, I will
03:03
Extremely pressing question: how does one say $\sup$? "soup" like Spivak or 'sup?
user147690
Well Supremum(atleast in Australia) is said starting with 'Sup', so I would say it is 'sup', like from 'supper'.
user147690
'sup' 'prem' 'em'
No, soup, not sup.
Like superior :)
user147690
@TedShifrin What? You say superior with 'soup' at the beginning, in America?
user147690
03:16
Not sure if joking, can't tell on internet, but the last thing makes me almost certain you are
Come on, Alex, you're making it really hard for me to not make any comments about taking pronunciation advice from an Australian xD
user147690
:'(
Nope, I never joke. Well, not about this.
user147690
I still can't tell lol
user147690
03:17
@ted Do you say it like that?
Aww, too far? It was all in good fun. But in the States, even my funky Russian professor said "soup" for sup(remum)
user147690
@pjs36 No not too far haha, the face wasn't serious. Weird, we say it exactly as the audio clip in that link says it
user147690
Also what would you call a list like:

Commutative rings $\supset$ integral domains $\supset$ Integrally closed domains $\supset$ unique factorization domains $\supset$ principle ideal domains $\supset$ Euclidean domains $\supset$ fields $\supset$ finite fields
i wouldn't
user147690
A chain of properties or something?
03:20
I've never heard superior pronounced suh-perior.
user147690
That's how we say it here in straya
@AlexC: I'd be sure to spell principal correctly.
user147690
user147690
@TedShifrin Sure
user147690
Noone knows what to call such a list?
user147690
03:23
List of mathematical objects? Feels very strange, but wiki says: "Principal ideal domains are thus mathematical objects"
I remember someone begging for something like that for topological spaces or something on /r/math.
user147690
Chain of class inclusions it says in one of the subpages. Is that good?
why do you care
i mean, i guess you could call it that, but I don't really see why you would ever name it
user147690
Why not? If I talk to people about it, how would I refer to it? How do I write my notes up about it?
"All these kids going on about inconsequential things early in the morning . . ."
03:27
about what? the study of chains of class inclusions?
user147690
@MikeMiller No about the properties of each of the 'classes(?)' and how all of the latter properties are properties of the former (in the relevant chain of class inclusions)
"Every Euclidean domain is a PID"
user147690
Indeed
Quick question: can I use $(ab)^n = a^n b^n$ in the exercises of the first chapter of PMA?
user147690
Yes
03:33
And $(a^b)^c = a^{bc}$?
user147690
If you look back, you will see what he has shown, I can't remember for sure what he has given you, but I imagine all of the normal properties you would work with are given
I don't think this is proven back there. Regarding exponents, he only shows $[\exists!y] \;y^n=x$
and $(ab)^n=a^nb^n$
for integer $n$
user147690
Well $a^b=a\times a\times \cdots\times a$ so $(a\times a\times \cdots\times a)^n=a^n\times a^n\times \cdots\times a^n=a^{(n+n+\cdots+n)}=a^{bn}$
user147690
So it comes straight from that property you were given
^ Yeah, I did it.
user147690
03:41
Cool
I meant $(a^b)^c = a^{bc}$ for real $b,c$ at first though, but what you wrote was how I started the solution.
I think I'll skip the $\mathbb{C}$ and $\mathbb{R}^n$ problems. We did some in school.
Although the ones near the end are hard.
similar argument for rational exponents; for real exponents you need to take limits, but it should be fine
Yeah.
03:57
@MikeMiller, I have a question
This question here: http://math.stackexchange.com/questions/1290573/how-to-prove-a-linear-transformation-is-onto-if-it-is-one-to-one

Would one way of approaching this be to recognize that a linear transformation $T: \mathbb{R}^n \rightarrow \mathbb{R}^n$ is a special type of group homomorphism preserving the additivity of $\mathbb{R}^n$? Hence, we could just apply the isomorphism theorems?
There are lots of injective, non-surjective group homomorphisms.
why not just use the isomorphism theorems for vector spaces?
Oh yes of course. I'm just so used to thinking about homomorphisms surjectively by throwing away everything but the image.
My linear algebra is really rusty too. I desperately need to review things.
04:03
I actually learned the first isomorphism theorem as a statement about vector spaces before I learned it for groups
@SamuelYusim, could you be more specific? I see generally where you're coming from, but haven't thought about the statement for vector spaces, at least I don't think I have.
The Rank-Nullity theorem, though, sort of resembles it.
well, you can define a quotient of a vector space by a subspace in a really intuitive way if you're good at group theory
and yeah, you can prove it from rank nullity
To be honest, I'm not sure I've ever "grokked" quotients in terms of group theory. The coset definition doesn't seem to be related to the quotients from, say, topology or ring theory where you're essentially "gluing" points together.
so basically let $V$ be a vector space. then if $T: V \to T(V)$ is a linear map then $V/ker(T) \cong T(V)$ exactly as you'd expect
I don't know topology so all my intuition goes through cosets
but really what's going on is you're setting a bunch of stuff to be "equal" and dealing with the consequences just as you would with rings
Ok very nice, I like that statement. How should I be thinking about $V/\ker(T)$?
04:10
if $V$ is an $F$-vector space, then just think of it as $F^{\dim V - \dim \ker(T)}$
But Kaj, with quotients of a group, aren't you just "gluing" everything in a coset together, so you forget, say, $gN$ exists other than as a solid blob in $G/N$?
That's a fair point @pjs36. Oh this is definitely making more sense!
That makes sense as a way of thinking about it since the cosets partition the group.
Wohoo! I'm finding things that I was only computationally proficient with are making more sense now, intuitively.
Unfortunately, I'm not gaining any new ground, but I'm appreciating the ground I've been on much more :)
Are we talking about the analysis realm @pjs36 ?
To a small extent, yes. But more so some basic algebra. But I should emphasize some.
04:16
hi guys
I was pleasantly surprised I actually answered a very basic analysis question the other day; it was really to convince myself that I could.
I dislike analysis :P
that's the only reason I've ever done analysis
04:18
Well, I find it rather dry I guess I should say
Yeah, I'm terrible at it. I've been trying to convince Ted to sell me his multivariable math book for cheap on the downlow, but to no avail.
we should go to ted and tell him we must have it for free
I was always able to get by, but it was always on a really basic symbol-pushing level; I just had an idea about how to get all the symbols to line up, not so much why they were doing that.
basically my problem is that it's far too technical for what it is and that all the proofs use a different magic trick
intuition to doesn't come easily in analysis
04:20
someone once said that if you eat corn by going along the cob horizontally then you're an analyst and if you eat corn by rotating the cob vertically then you're an algebraist
At my school analysts ate in spirals, algebraists in horizontal rows... it must all be a scam then. Or location dependent :)
But that really was a conversation though, so that's pretty funny it was elsewhere
I guess it's just a weird part of the folklore
Now that makes more sense
I have Ted's multivariable book :)
04:25
And logicians eat corn in loose spirals. Link
Cover and all, @Kaj?
LOL, yes @pjs36
It's his algebra text that is falling apart on me.
haha, that's funny yet terrible. I imagine the construction quality was brought up in class several times, or just here on MSE chat?
Oh it was indeed
I've used the algebra book very, very heavily. So maybe that makes sense.
I should also read ted algebra book 2
04:31
@Karim, I wouldn't recommend it if you've already taken algebra. It's truly for a first go around.
But if you haven't taken algebra yet, it's really not bad at all.
yeah I took 2 algebra classes did pretty good but want to perfect my algebra skills this summer by reading DF
@KajHansen
I found DF to be reasonably approachable after 2 semesters of algebra.
yeah I read it like a comic book now
04:33
I haven't read even 5% of it yet, but every now and then I reference it when I need a little more depth on something, and it's always there for me.
I want to cover until algebraic geometry this summer @KajHansen
I've been attempting Aluffi, but Isaacs has some extremely terse algebra books, if you're into that thing - group theory, algebra, and character theory, at the least
so far I finished the first 2 chapters
I really, really like Artin's 3rd edition. Especially the Galois theory chapter was very lucid.
oh I see I heard alot of people talk about artin I should look at it too
ted told me it takes a geometrical approach
04:35
haha, Ted and his geometry
but @KajHansen I would def recommend DF its very very nice also its problems are very good since he makes you do some problems that come later in text.
mhmm, I have a copy of my own
I'm taking algebra for a 3rd time this fall. I'm very excited; it's been my favorite subfield of math thus far.
Is it a "topics" kind of class, or what's the deal, @Kaj?
I don't get to take any algebra this fall
@pjs36, it's a graduate course. I'm excited, but also fairly anxious since I've only ever taken undergrad courses until now.
04:38
what's it on?
@SamuelYusim, the course description is:
"A course in groups, fields and rings, designed to prepare the student for the algebra prelims. Some topics covered include the Sylow theorems, solvable and simple groups, Galois theory, finite fields, Noetherian rings and modules."
@KajHansen 3rd edition?
interesting
Interesting indeed. We had Alg I and II at my school, then it was all "topics" class after that
that'd be a really useful course
04:40
But I'm sure you'll do great, @Kaj, I wouldn't be too anxious
yeah, those things are all reasonable if you make sure not to lose track of what's going on
Well I'll be @octatoan. I could've *sworn* the 3rd was the latest. I was referring to this: http://www.amazon.com/Algebra-Edition-Featured-Titles-Abstract/dp/0132413779

Which I guess is in its second.
So there's no 3rd edition, right?
also I don't think I've looked at a comprehensive exam in algebra that didn't have a sylow theorem question
I guess not @octatoan
On the bright side I recognize all those words and can say something about them. It'll just be in a lot more depth than what I already know right now.
04:43
yeah, that's why I think it'd be a great course
@KajHansen That's a really great feeling.
yeah I am taking that course too in the fall @KajHansen
Very exciting @KarimMansour. Hopefully we'll see each other in here from time to time and compare experiences
"I resisted including group representations, Chapter 10, for a number of years, on the
grounds that it is too hard. But students often requested it, and I kept asking myself: If the
chemists can teach it, why can't we?"
hey
04:48
yeah that would be gr8
@KajHansen
where is @DavidWheeler
lol, what's that quote from @octatoan ?
Artin 2e, preface
@robjohn how can I increase the amount of bounty I put on my question?
actually group presentation is presented in section 1.2 of DF
hahaha
section 1.2
xD
04:49
@anon could you help?
I love the quotes in Artin
Karim: Artin was talking about representations: Presumably these are presentations, but the second time around (I kid)
haha
isn't presentation same as representations @pjs36 ?
Presentations are the $\langle x, y : x^2 = y^n = 1\rangle$ ways of defining a group, representations are homomorphisms into groups of matrices
04:56
Like writing elements of cyclic groups $C_n$ as $\begin{bmatrix}\cos 2\pi/n& \sin 2\pi/n \\ -\sin 2\pi/n & \cos 2\pi/n\end{bmatrix}$, that's a representation of $C_n$
Man, I shouldn't attempt to tex at night, I'm just not up to it...
its alright @pjs36 it happens xD
05:11
@Gigili what's up?
presentations are representations in the colloquial, nonmathematical sense of the term "representation," but not in the technical, mathematical sense of it
@anon I need your help
okay
Asked a question, awarded a +150 bounty... still nothing
Haha!
No idea really
05:23
why stalking people @LeGrandDODOM xD
Doesn't matter right now
The only thing that matters is my thesis defense :|
@anon Have a link?
yeah I'm looking at it
but this works math.stackexchange.com/users/181853/gigili which is really weird
@Gigili I am not familiar with things like dictionary learning (or much CS at all really). My advice would be to add in background on what the concepts in the paper actually are (like what dictionaries and dictionary learning are, etc.) one stage at at time for the next few days (i.e. in multiple edits spread out over time), even if only to get more exposure. also reach out to anybody who can help you IRL.
@LeGrandDODOM :O !
05:29
@Sawarnik :O
@anon Sounds like a good idea.
Can anyone think of a simple solution to this? math.stackexchange.com/questions/1281770/…
OK thanks
sure, sorry I can't help more
@LeGrandDODOM Also, "wtf" is a bit rude.
05:30
@Gigili Are you doing your Phd?
No, master's thesis
@Gigili not really, it just expresses surprise, and it's not even directed at you or anything you've done but the situation with your accounts
@Gigili :D .. which univ?
@paramanand r you here?
^ Are you by any chance the Idris of the language Idris?
05:42
@robjohn are you there ?
@robjohn in the sequence $u_n(x) =|x|^{\alpha}$ when $|x|\geq \frac1n$ and $n^{-\alpha},$ for $|x|<\frac1n$ so when $n$ tends to $\infty$ we have $|x|^{\alpha}$ for $|x|\geq 0$ and $\infty, $for $|x|<0$ we know that |x| is positive so the secand case is refused and then the limite of $ u_n$ is $|x|^{\alpha}$
i don't understand how we use the monotonicity convergence in order to find the limit of u_n ? @robjohn
hello Idris
hello Paramanand
I will try to copy then past my text for you
Sorry man for thinking you as a student. You should give some more info on your profile
dont worry!
here is the text Dear Paramanand, I\ wish to show how one can compute the limit B of problem
1 only by using basic limits! Assume that the basic limits (which can be
computed by LHR) are known:%
\begin{equation*}
\lim_{x\rightarrow 0}\frac{\sin x-x+\frac{x^{3}}{6}}{x^{5}}=\frac{1}{120},%
\text{\ \ \ \ \ \ \ \ \ and\ \ \ \ \ \ \ \ \ \ }\lim_{x\rightarrow 0}\frac{%
\sin ^{-1}x-x-\frac{x^{3}}{6}}{x^{5}}=\frac{3}{40}.
\end{equation*}%
Note that one can write%
\begin{eqnarray*}
B &=&\lim_{x\rightarrow 0}\frac{2x-\sin x-\sin ^{-1}x}{x^{5}} \\
looks very good
I think you should pose this as an answer to math.stackexchange.com/questions/437926/…
06:02
Apparently "soberification" is a mathematical term. Hilarious. math.stackexchange.com/questions/1290662/…
Oh thank you, this post was unknown to me
i updated my profile
i think i have done the answer you were looking for when you did post your question!
@KajHansen The more you know . . .
well i will format the answer to be posted in a moment
ok i will upvote when it comes up
06:25
Is it correct to say "$f'$ is a section of $\pi_A$"? (Terminologically, I mean.)
@KajHansen Indeed.
Armstrong has some nice quotes too.
The coolest one I recall was Poincare's, which is in French, but the gist of it is "Geometry is making good logic out of bad figures", iirc.
@BalarkaSen can you answer my previous question?
Which question?
Is it correct to say "$f′$ is a section of $\pi_A$"? (Terminologically, I mean.)
This.
Depends on what $f'$ and $\pi_A$ are.
06:40
Random function and the natural projection respectively.
I dunno what you mean by "terminologically"
@SohamChowdhury Also depends on what you want it to mean
As in, is that sentence correct?
@TobiasKildetoft Right-inverse:
@SohamChowdhury A section is usually supposed to be of a short exact sequence
Or fiber bundles.
@SohamChowdhury then yes
06:41
@BalarkaSen I suppose it'll take me some time to understand what you mean.
:)
(noting that it should also have whatever extra structure the others functions have)
@TobiasKildetoft $f' : A \rightarrow A \times B$ and $\pi_A: A\times B \rightarrow A$
@SohamChowdhury that is not what I mean
Although section is essentially a right-inverse, we assign the name to the things I mentioned above. The origin of the name comes from seeing what it does to vector bundles, really.
Can you explain, @TobiasKildetoft?
06:43
I mean that for example a section of a continuous function should itself be continuous
There is no other "structure" AFAIK.
Oh, that.
No, no other such properties.
@BalarkaSen Cuts them up?
Yes, kind of.
I know nothing about bundles yet, though.
Anyway, is there any, um, structure that fails to be a category because $\text{Hom}(A,B)$ and $\text{Hom}(C,D)$ aren't disjoint (for unequal $A,C$ etc. obviously)?
@SohamChowdhury If you have such a thing, you can always turn it into a category anyway
by just attaching the domains and codomains to all morphisms
@TobiasKildetoft Can you explain?
Can you add data to a morphism like that?
06:49
@SohamChowdhury Just replace the elements of $\operatorname{Hom}(A,B)$ by triples $(A,f,B)$
it is posted with some extra explanation of how the computations are computed and do not fall from the sky!
@TobiasKildetoft Oh, I understand.
Thanks.
@SohamChowdhury in practice, this is never an issue
This works because the set (or class?) of morphisms can consist of anything, right?
Not just ordered pairs.
@paramanand it is posted with some extra explanation of how the computations are computed and do not fall from the sky!
06:51
Right, it could be anything at all
Homs are just sets
They needn't have any extra structure.
@BalarkaSen they need not even be sets
though I am not sure I ever saw anyone consider categories where the Hom's did not form proper classes
So a hom can consist of dissimilar things?
06:52
and of course, we almost always restrict to locally small categories
Locally meaning?
what's your definition of dissimilarity?
@SohamChowdhury Yeah, they can really consist of anything. The important thing is that we have rules for composing them
that for any objects $A$ and $B$, $\operatorname{Hom}(A,B)$ is a set
@BalarkaSen Like not all n-tuples, or not all diagrams, or whatever.
(a small category is one where the objects also form a set)
06:53
@TobiasKildetoft Yes, I know that.
What's "locally"?
I don't get it. I don't know how you can define a good notion of similarities unless your Homs are categories too
@SohamChowdhury the thing I said after "that for" (I forgot to add what that was in response to)
(In which case, you get something close to a 2-category)
@BalarkaSen Basically, what I meant is this: can the same hom contain a 2-tuple and a 5-tuple?
so you're specifying that your morphisms are tuples?
06:55
@TobiasKildetoft Oh.
@SohamChowdhury Sure, there are no rules other than that we must be able to compose them in some way we specify and that composition must follow some rules
what the homs "actually" are is not important at all
@BalarkaSen Not necessarily, just that they are all instances of the same thing (like 2-tuples for example, or diagrams, or whatever.)
oh, sure.
@TobiasKildetoft Yes, that answers my question.
So it's not necessary that the morphisms are all similar, right?
but it still won't make sense to say "same" thing unless you give your Homs extra structure.
06:58
@SohamChowdhury The reason they often tend to be similar objects is that then it is easier to give a uniform description of the compositions, rather than having to describe it for each pair
Okay, I see.

« first day (1750 days earlier)      last day (3568 days later) »