« first day (4370 days earlier)      last day (946 days later) » 

00:34
@Bob Did you try plotting the points?
Bob
Bob
@copper.hat What points would you plot?
@copper.hat I think my model is wrong.
Percentage vs log of net worth maybe. I would look at the data before creating a model.
now's the time to hawk my cryptocurrency, the only proven way to get into the top 1% in 2019 or any other year
Bob
Bob
@copper.hat I think that is a good idea
i heard lesliecoin was plagued by insider trading
00:49
i've got the defamation suit against you and ted ready to go. you just can't do this to my currency.
Bob
Bob
@copper.hat The reason I think my model is wrong is if you use it to find the wealthiest family in America, you get a very large number.
i don't think much about wealth these days. i think more about its absence.
Bob
Bob
That is a depression thought. You have a PhD. You should be well paid.
hopefully i will have one member of my family back tomorrow night. my 19 yo son is flying back from croatia via frankfurt & boston on his own, his first international alone. i hope it all works out.
living in the bay area is a good antitdote
Bob
Bob
it almost certainly will
00:52
i'm a worrier
Bob
Bob
I understand
My return from Croatia to SD 5 years ago was well over 24 hours.
Bob
Bob
what does SD stand for?
san diego?
@leslietownes I will sue you for defamation.
Bob
Bob
00:53
@TedShifrin any other comments about my post?
Indeed.
Model seems unmotivated. I already was skeptical.
Bob
Bob
I tend to agree
I may post an answer stating that.
Copper’s suggestion to investigate things more graphically takes me back to high school science labs.
Bob
Bob
and I think it is a good suggestion
I am going to sign off for the evening
thanks for the help
good night
Take care.
00:59
good luck
@TedShifrin Were you in Croatia for work?
Work? Hell no. Long after retirement. Beautiful country.
Glued to hearing #8.
i think the main effort of the hearings is to legitimately remove trump from running, so his followers will vote for another republican instead.
I think the point is to try to save democracy from seriously flushing down the toilet. The guns are all out there.
This is infinitely bigger than coward Tromp.
01:20
josh hawley, track star.
i wish i had your confidence in the intent...
i'll be happy if it gives people funny video clips so they can humiliate each other in their primaries. that hawley clip is one for the ages.
of course, whoever primaries him is going to be worse, and win.
tucker carlson
 
2 hours later…
03:08
In Spivak chap. 14, problem 1 which consists of finding derivatives of integrals using FTOC Part I and other tricks, why don't we first need to check that the integrand is continuous before applying FTOC?
For example, find the derivative of $F(x) = \int_a^{x^3} \sin^3 t ~ dt$
We let $f(x) = \int_a^x \sin^3 t ~ dt$, and then since $\sin^3 t$ is clearly continuous on the reals, we can apply FTOC to $f$.
sure, yes. it's not so much that you don't 'need' to check any hypothesis, it's just easy to check the hypothesis and so maybe not the focus of attention.
And note that if $g(x) = x^3$, then $f(g(x)) = F(x)$ so $f'(g(x))g'(x) = F'(x) = (\sin^3 x^3)(3x^2)$
@leslietownes I don't think it is though..
I mean, for the other examples
maybe it isn't. i don't have have spivak in front of me.
My point is, when given exercises like this am I supposed to check that it satisfies FTOC, even though it's clear that we need to use FTOC to solve the exercise
Or is it just an exercise in applying FTOC without worrying about if we can even apply it
for that example, sin^3 t being a continuous function plus some theorem tells you it has a differentiable antiderivative and then the FTC applies.
that kind of thing might depend on the instructor, to be honest.
03:12
@leslietownes Instructor being Spivak
What does he want?!?
we don't have the option of asking him. which book is it?
Just his Calculus book, chapter 14
i'd assume it is mostly an exercise in symbolic manipulation, with a background understanding that because the inputs are not 'ugly' the theorems will apply to them. but i've never taught out of that book.
I would assume so as well (and so I didn't bother proving the integrands are continuous), however the dilemma I keep thinking of is that when you do apply FTOC 'in the real world' i.e. not computing symbolic manipulation out of a chapter in a textbook, you will not always know if the integrand is continuous
So should I be preparing for such a scenario by making sure that the integrand is indeed continuous or... what exactly?
03:27
you would need to check that the hypotheses of the relevant result apply...
there's something beyond this, polite proofs, which is, the FTC holds under very general and subtle conditions, if you replace the riemann integral with another integral more suited to the purpose. the conditions in spivak are sufficient for FTC to apply but not necessary.
but in practice, the functions people run into 'in the real world' do not test these extremes.
and the spivak result will work just fine.
He wants you to observe that all the integrands are continuous. No big deal. On an exam, I want you to tell me that without belaboring it.
There are later problems where subtleties are pursued.
03:52
@TedShifrin Without belaboring it as in, without proving it?
Yes. We know sums, products, compositions, etc.
As I said, where there are subtleties later, you should prove details.
04:10
@TedShifrin So for example, to prove we can apply FTOC I to find $F'$, where $F(x) = \sin \left( \int_0^x \sin \left( \int_0^y \sin^3 t ~ dt \right) ~ dy \right)$, we would go something like: Define $g(x)$ by $\int_0^x \sin(f(y)) ~ dy$ where $f(y)$ is defined as $\int_0^y \sin^3 t ~ dt$. Then $F(x) = \sin(g(x))$. $\sin$ is continuous, so we need to check if $g$ is continuous.
Then I suppose we need to check if $\sin(f(y))$ is integrable
errythang in site is continuous, inheriting its continuity from sin(t)
Well, $\sin$ is continuous, so we need to check if $f(y)$ is integrable
And $f(y)$ is integrable because $\sin^3 t$ is continuous
@leslietownes Hmm, can we say that?
Ah yeah I guess
No, wait.
@leslietownes I don't think we can say that so easily. $f(g(x))$ is only continuous if $f$ is continuous at $g(x)$ and $g$ is continuous at $x$
g is continuous because g(x) is the integral of a continuous function from 0 to x. the FTC tells you that g is even differentiable.
and the thing being integrated is continuous because . . .
it's layers of versions of the same theorem. i don't know the specific hypotheses used in spivak.
@leslietownes But you still need to reason through $\sin(f(y))$ being continuous
(above is how I did it)
because sin is and f is
04:20
I know, but you can't conclude that without making sure that $f$ is
But you said they inherit it from $\sin(t)$
yes. this is what i meant by, it's layers of applications of the same thing.
sin(t) being continuous tells you that f(y) is continuous tells ou that sin(f(y)) is continuous
The integral of an integrable fn is continuous. Proved in previous chapter. You’re belaboring.
@TedShifrin But my point is that I am checking that the fn is indeed continuous, without proving it
04:39
I’m on mobile, pardon the lack of proper annotation.
but which is more proper to write? 3 = k(mod0) or 0|(3-k)
or do I have that wrong… now I’m confusing myself…
You wrote that $0$ divides $3-k$, which is probably not what you want.
Yeah that’s what my brain just clicked…
Did you mean to write $3 \equiv 0 ~ \pmod k$?
basically I found a pattern in a problem. That deals with mod3
Okay, so meant to write $k \equiv 0 \pmod 3$, which says that $k$ has remainder $0$ after being divided by $3$
We can write this like so: $k - 0 = 3c$ for some $c \in \mathbb{Z}$, or using the other notation: $3 \mid k$
04:50
Yes? I’m sorry… pure mathematical notation like that is hard for me to read/comprehend.
$a \mid b$ means $a$ divides $b$, or into other words there some integer which we can call $c$ such that $\frac{b}{a} = c$, so multiplying by $a$ we get $b = ac$.
it's genuinely confusing, especially at first. particularly as computer languages have a "mod 3" function and saying a = b mod 3 might actually refer to computing a value of that function in such languages.
whereas in the pure math world it's just a relation, __ = __ mod __ having a meaning without __ mod __ necessarily being given a meaning.
Yeah. But when talking about infinity and finding a pattern that dis includes 1/3 of all infinity when that third is a multiple of 3…wait it might be a 1/6 of infinity…
3*1, 3*3, 3*5… 3, 9, 15… that’s effectively every 6 numbers…
No it's not
Yeah it is, they e just been shifted 3 numbers
04:59
I think you might be interested in reading up on what are called equivalence classes
But it doesn’t matter because the Even counterparts can’t be reached either, so… yeah. 1/3 of infinity
But back to the original question. Which method for writing a formula for Mod3 is preferred?
 
2 hours later…
06:54
Can someone give me a simple python coding challenge for constructing a function like f : ℕ×...×ℕ → ℕ ?
Because I have no idea how to code and trying to start from scratch.
07:10
Probably the wrong forum...
07:23
If $F(x) = \int_{-\cos x}^{\sin x} \frac{1}{\sqrt{1 - t^2}} ~ dt$ for $x \in (0,\pi/2)$, one can check to find that $F'(x) = 0$. So I suppose you could argue that $F(x)$ is constant. But how do you then argue that the value of $F(x)$ does not depend on the value of $x$?
Maybe I'm being dumb, but could it be a different constant... depending on the $x$?
08:15
@copper.hat I guess you are right that Math.SE is the wrong forum for asking this question, but thanks for your response =)
08:53
if we find the integral, it comes out to be $\frac{\pi}{2}$ for all $x \in (0,\pi/2)$ so it is not dependent on $x$. Also it has to be same constant for all $x$, if it will be a different constant for say $x=\frac{\pi}{6}$ and $x=\frac{\pi}{3}$ then it will become a discontinuous function and it will not be differentiable for all values of $x$, which is not the case.
Please correct me if i am wrong!
09:16
what happens to the initial conditions in this answer ? physics.stackexchange.com/questions/528020/…
10:04
any set theorist here?
 
1 hour later…
11:12
I wonder what could be the equation of this curve?
looks like two parabolas
does it have closed form?
this is called Decartes map
Folium of Descartes
In geometry, the folium of Descartes is an algebraic curve defined by the equation x 3 + y 3 − 3 a x y = 0 {\displaystyle x^{3}+y^{3}-3axy=0\,} .The name comes from the Latin word folium which means "leaf". == History == The curve was first proposed and studied by René Descartes in 1638. Its claim to fame lies in an incident in the development of calculus. Descartes...
Question, does none degenerate bilinear form imply positive definite, or does positive definite imply none degenerate ?
It's not the folium of descartes, its just $y = x^2$ for $-1 \leq x \leq 1$ union $x = y^2$ for $-1 \leq y \leq 1$.
@MadSpaces no.
+ve definite implies nondegenerate.
11:41
@holmes Depends on what's the question, just ask
11:53
@BalarkaSen Definite implies none degenerate, got it!
so does a none definite mean it is degenerate, or is there no causality
what is "none definite"
indefinite
then no
you should be able to give easy examples for all of your questions
Alright thanks for the tips
12:19
it is about cardinals and ZFC
I will never know if I can answer your question if you don't ask it
is there a maximum or a supremum of the set of cardinals ZFC can prove to exist?
What do you mean? ZFC proves that for every cardinal $\kappa$ there is a cardinal $\lambda$ such that $\lambda$ does not inject in $\kappa$ (this is already provable in ZF, but then you need AC to prove that cardinals are linearly ordered and so $\lambda>\kappa$)
I'm making this more complicated than it needs to be, just by Cantor's theorem $2^\kappa>\kappa$ for any cardinal
maybe I rephrase it, is there a maximum or a supremum of the set of cardinals that do not imply ZFC consistency?
The least wordly cardinal probably
12:28
I thought so
but are we 100% sure?
I'm not 100% sure of anything
and what about second order arithmetic, what would be the least cardinal that prove it consistent?
13:04
"the" set of cardinals, you probably mean "a" set of cardinals
or, the class of cardinals
I'm reading "Olver - Asymptotics and Special Functions" and, at some point, for $u\to\infty$ the author says that $u-1+2\exp[-2u+2+O(e^{-2u})]+O(e^{-4u})=u-1+2\exp(-2u+2)+O(e^{-4u})$. He is ignoring the term $2\exp[O(e^{-2u})]$, in the sense that (it seems to me) he puts it equal to $1$ in the multiplication. I know that $aO(f(x))=O(f(x))$ for $a$ constant, but I don't understand why that equality holds.
I mean a/the set of cardinals with that property (not all cardinals)
14:24
@Gwyn $\exp O(e^{-2u})=1+O(e^{-2u})$ as $u\to\infty$, and $e^{-2u}O(e^{-2u})=O(e^{-4u})$
(from $\exp x=1+O(x)$ as $x\to0$)
@runway44 Thank you for your help. I am still getting used to this big O notation, especially when used in identities mixed with non-big O notation terms. Now is almost all clear, only one last thing: when you write $\exp(x)=1+O(x)$ as $x \to 0$ you mean that there exists a constant $K$ such that $\exp(x) \le 1+K|x|$ in a neighborhood of $0$?
$\exp x=1+O(x)$ means $\exp x-1$ is $O(x)$ which means $|\exp x-1|\le K|x|$ for some $K$ in a nbhd of $x=0$
Perfect, thanks again)
15:10
Hello, we know that a polar decomoposition of an endomorphism that is in the general linear group (IE it is invertible ) is possible, however, i am asked to find a polar decomposition of an endomorphism that is skew hermetian, without the mention of it being invertible, how to do that?
furthermore i know that i* the endomorphism is hermetian
And then it has all real eigenvalues
Is anybody else having notification issues with the Stack Exchange app? All notifications with @Shaun don't show up for me anymore . . .
Ah . . . I just tried reinstalling the app. It looks like it's no longer on Google Play!
okay i just found out, that the polar decomposition exists even if it is not invertiable, but then it is not unique, how can i find such decomposition? one matrix is easy, but i am not sure how to find the orthogonal one
15:31
Okay, so I found the latest version online. I have just installed it. Please would someone tag me so that I can test it?
@Shaun
mad: how you implement it very much depends on what tools you use. conceptually you want to find an isometry V from the range of |T| to the range of T with T = V |T|. that's uniquely defined on the range of |T|. you then extend that arbitrarily on the orthocomplement if you want a unitary.
How can I become a calculus pro, whatever I learn there is always some question which I ain't able to solve
any tips please?
15:51
Thank you, @MadSpaces. No luck with notifications there . . . I don't know what to do :(
Bob
Bob
16:31
@SHASHAANKB.H. To get good at Calculus you need to do problems. I would work on easy problems and hard problems. Also make sure your answers are correct.
it's fun to do integrals. Well, it was fun to do integrals when I was still in high school at least
@SHASHAANKB.H. are you talking about all of those integral problems? Yeah, you have to "master the craft" so to speak to do what those people do with integrals. It's admirable
 
2 hours later…
18:21
@SHASHAANKB.H. What kinds of problems are you talking about? Routine computations? Proofs/derivations? Word problems? More challenging word problems?
18:39
Essentially the same way you become a "pro" at anything: practice, practice, practice.
There are no royal roads.
18:57
@user4539917 Unless you want to become a hereditary monarch, in which case all you need to do is be born into the family of a hereditary monarch. That seems like a pretty royal road to me!
I believe that those who are born with a silver spoon in their mouths will only remember the shape of the soon.
19:25
I think. First thing to approach anything in math, you need to understand the problem
when you know what you're doing, a lot of those problems become just standard checks
if something more challenging comes by, well, no other option than think hard about it and maybe coming up with a solution
maybe eventually giving up because we humans aren't perfect, and not every smart idea can suddenly appear in our mind
and some things just aren't worth the chase
Lots of (most?) calculus problems don't require "smart ideas."
I guess I was speaking a little bit in general because that's how I see math.
Also, sometimes you just have to do the dirty work, don't forget about it
I'm obviously not smart enough to understand this post. Of course, I know how to do the original question.
Does ~ mean asymptotic equivalence in here?
I assume so.
19:37
It was a logarithm of A that's o(1). Makes more sense
Well, sure.
Hi it's my first time in this chat.
can you please help me with how do we have the line in brackets?
What does it mean to say $T$ has compact support?
Yeah right I should've written that first.
supp(T) = complement of the largest open set on which T vanishes.
So T has compact support when supp(T) is compact
Hmm... but T is a distribution right
19:45
OK, so if you have the $K_n$ as described, how does this relate?
Yeah
They're usually called an exhaustion of $\Omega$.
What kind of set is Omega? This certainly can't happen for just any set
I think omega is given to be open subset of R^n
@Ted do you have a reference of the exhaustion of omega
Not offhand. It sounds like the book you're looking at his discussed it earlier, no?
19:49
Since Omega is open, it's a countable union of closed sets
But what does it mean to say the support is not compact, relative to writing $\Omega = \cup K_i$?
Say Omega = sum of F_i, we can assume F_i is increasing and then cross it with [-i, i]^d where d is the dimension, thus obtaining exhaustion by compact sets of Omega
author explicitly gave an example of exhaustion and that's it. no explanation
@Jakobian I have no idea what you're talking about.
19:51
I'm proving that Omega can be exhausted by compact sets. I thought that was the question
This is just a basic analysis/topology question. If you have a non-compact subset of $\Omega$, why is it contained in $\Omega-K_n$ for some $n$?
D(Omega) is the set of smooth functions with compact support, right
I asked someone few hours ago and he said that a compact set K is not support then on K^c , T doesn't vanish so there exists a phi in D(omaga) s.t. T(phi) is non zero
@Jakobian Yes
But I think he made a mistake, K is not compact then K^c is not the largest open set on which T vanishes
So it is possible that T vanish on K^c
This is not making any sense at all.
I forgot to mention supp(phi) in K^c
19:57
When you say that T vanishes on some open set U, that means if you take a smooth function supported in U, then T is 0 on that function, right?
@TedShifrin can you explain?
@Jakobian Yes
If we couldn't find such phi_n, then the support of T would be contained in K_n
Sorry I made a typo instead of "K is not compact" it should be "K is not support"
so it would be compact
no?
Yes
20:00
Okay. Does this answer your question?
I get it now
thanks
no problem
It's 1:30AM here, my brain is not working properly
@TedShifrin thanks to you too
I used to say that phrase too, with it being late. But then I asked myself, does it really make a difference. Maybe I am even thinking somewhat more clearly?
@TedShifrin what if that non compact set is a subset of K_1?
20:10
I've rarely had a moment of clarity while extremely fatigued, but it has happened.
20:22
@PNDas it’s a closed set, and a closed subset of a compact set is compact.
so you meant non-compact closed set?
Support is always a closed set.
Sorry I didn't know you were talking about support.
I thought it was just arbitrary subset
21:27
$P(X_{n+1}\in A | X_n\in B)$ is not independent of $n$ in general in a homogenous Markov chain?
@Jakobian I believe they are, yes? That's what time-homogeneity means
I think so too, I suppose. But I'm not entirely sure how I'd prove that for this set $B$. Here I can take $A = \{a\}$ for simplicity
Oh, alright, I follow you. Your definition of homogeneity is $\Bbb P(X_{n+1} = a|X_n = b)$ is independent of $n$
Now you want to deduce the above from this.
Is that correct?
Yes, that's correct
Consider the $n!$ points whose coordinates are permutations of $(1,2,\dots,n)\in\Bbb R^n$. Their convex hull is known as the permutahedron. Turns out its ($n-1$-dimensional) volume is $n^{n-2}$
Any way to see this?
($n-1$-dimensional as it lies in the hyperplane $\sum x_i=\sum i$)
Wait that can't be true
$n^{n-2}$ times the volume of the lattice $\{(x_1,\dots,x_n)\in\Bbb Z^n:\sum x_i=1\}$
which works out to $(n-1)!n^{n-2}=n!n^{n-1}$ times the volume of the standard simplex (of points with nonnegative coordinates whose sum is 1)
21:50
I think my question isn't necessarily true, and it's not even what I should be looking at. I'm trying to prove a homogenous Markov chain with finite amount of states has a recurring state, and for this I'm trying to prove that taking an essential state, it also needs to be recurrent
I'll try struggling with it some more
@Jakobian Sorry, I was gone for a bit. Write $\Bbb P(X_{n+1} = a|X_n \in \{b,c\}) = \Bbb P(X_{n+1} = a, X_n \in \{b, c\})/\Bbb P(X_n \in \{b, c\})$. Can you compute the probabilities in the numerator and denominator in terms of the transition matrix, lets call it $P$?
well... not really honestly
I think it heavily depends on the initial state
For me, Markov chains usually have a completely deterministic initial state.
What can you say in that case?
The probability distribution, written as a vector, of $X_n$ on the whole state-space is $P^n \mathbf{v}$ where $\mathbf{v}$ is the probability-vector on the initial state, yes?
No, it should be $vP^n$
That's a matter of convention of how you write $P$ and $\mathbf{v}$. I prefer $\mathbf{v}$ to be a column-vector.
We can go with your convention.
So what is $\Bbb P(X_{n+1} = a, X_n \in \{b, c\})$?
$\Bbb P(X_n \in \{b, c\})$ is simply the sum of the $b$th and the $c$th entries of $\mathbf{v}P^n$.
22:03
It's $P(b, a)\cdot (vP^n)(b)+P(c, a)\cdot (vP^n)(c)$
So now can we hope to give a three-state counterexample? :)
22:15
I think I can bound $P(T_i > n | X_0 = i)$ by $\max_{s\neq i} P(X_1\neq i | X_0 = s)^{n-1}$
where s are in the communicating class of i
If this probability is now $< 1$ then I have what I wanted.
Not sure I follow how that is relevant, Jakobian. I tried it with a 3x3 stochastic matrix and they were't the same for $n = 1$ and $n = 2$.
I mean, for the proof that there exists a recurrent state
Oh, that's your goal.
The expected numbers of visits of a Markov chain to a state $b$, starting at state $a$, is something like $P(a, b)/(1 - P(b, b))$, not?
Geometric series
If $X_{a, b}$ is the number of visits to $b$, starting at $a$, then having $P(b, b) < 1$ for all $b$ in a finite state chain would imply $\sum \Bbb E[X_{a, b}] < \infty$. But this is also $\sum_{n = 1}^\infty \sum_b P^n(a, b)$ which is obviously divergent because $\sum_b P^n(a, b) = 1$
22:45
Let me know if the above parses, its been a while I have done this.
I have a theorem that $\sum P^n(a, a) = P(a, a)/(1-P(a, a))$
I guess I could try and modify the proof to come up with something similar for $P(a, b)$
That's not a theorem, really, just geometric series. That's the expected number of visits to $a$, starting at $a$.
23:12
Well. I don't know where this interpretation comes from and the expectation interpretation. But it's not important at the moment
$\sum_{n=1}^\infty P^n(a, b) = P(a, b)/(1-P(b, b))$ when $P(b, b)<1$, yes
and this gives us what we want if we sum over $b$
Or $\sum_{n=1}^\infty p_{ab}(n) = f_{ab}/(1-f_{bb})$ in the notation I'm using
Thanks anyway
In fact this proves that any essential state in a finite homogenous Markov chain is also recurrent. Which I didn't need but I suppose it's neat.
Avv
Avv
Hello Guys,

why the second order derivative of $f(x,y)$ general is $
\partial ^2f\left( x,y \right) /\partial x^2=f\left( x+\text{1,}y \right) -2f\left( x,y \right) +f\left( x-\text{1,}y \right) $?
First, just do one variable. Second, that is not a derivative — it’s a discrete derivative.
$\Delta f(x) = f(x+1)-f(x)$
What is $\Delta(\Delta f)(x)$?
Avv
Avv
23:29
it's $
\Delta f\left( x+1 \right) -\Delta f\left( x \right)
$
so total is: $
\Delta f\left( x+1 \right) -\Delta f\left( x \right) =f\left( x+2 \right) -2f\left( x+1 \right) +f\left( x \right)
$
Right. Now they shift it back to be centered at $x$.
Avv
Avv
Thank you. Why they shift it back pls?
To make it symmetric about $x$.
Avv
Avv
thank you
23:57
Hello Dr. Shifrin

« first day (4370 days earlier)      last day (946 days later) »