« first day (2728 days earlier)      last day (2299 days later) » 

1:00 AM
Oh, you're right
Sorry
 
2
Q: How can a probability density function (pdf) be greater than $1$?

NewmanThe PDF describes the probability of a random variable to take on a given value: $f(x)=P(X=x)$ My question is whether this value can become greater than $1$? Quote from wikipedia: "Unlike a probability, a probability density function can take on values greater than one; for example, the unifo...

TIL
 
But it can't be negative, right?
 
correct
 
Then I think your inequality is false
Let $f(x)=p(x)$ be $2$ on $[0,\frac12]$ and $0$ everywhere else
Then $\int f(x)=1$ but $\int p(x)f(x)=2$
 
niice
 
1:05 AM
@MeowMix forgot to say, I liked your visualization.
@MeowMix did you just use HTML, CSS, and vanilla JS?
no css frameworks?
 
pmfs and pdfs are really the same thing at the end of the day
you just have to interpret them rightly
 
1:23 AM
it's just like the difference between mass and mass density, really. The nucleus of an atom has a finite mass, but it's all packed into such a small volume that the density is very high.
 
how many densitys is an atom?
 
don't know off the top of my head...hmm
I'll be boring and look it up :p
"Nuclear density is the density of the nucleus of an atom, averaging about 2.3e17 kg/m^3." (Wikipedia)
 
lol
thats a really freaking big number
 
If I wanted to estimate it, I'd start from 1 nucleon having a mass of roughly 1 GeV/c^2 and a radius on the order of (I think?) 1 femtometer.
But then I'd need to multiply stuff out and blah blah blah
 
If you cannot explain something in simple terms, you don't understand it.
This really bothers me
 
1:29 AM
By comparison, the density of water is 1000 kilograms per cubic meter. So the nucleus is about about 10^14 times as dense as water
 
sure, you can't realy on your implicit inner definition to communicate that you understand it
but the whole point of scientific language is that you don't have to explain in a long paragraph every time you would normally want to use jargon
Didn't Voevodsky have a quote to the contrary of Feynman's?
I'm googling everything and can't find it.
 
@Semiclassical I was thinking more that it is the difference between Lebesgue measure and counting measure
 
Maybe it was the Einstein quote about explaining to an 8 year old?
 
but, uh, to-MAY-to, to-MAH-to, I suppose
 
@XanderHenderson eh, it's the same principle regardless
$\int_V p(x)\,dx=1$ doesn't imply $p(x)<1$
 
1:33 AM
$\int_A \,\mathrm{d}P$ :P
the measure of any set must be less than 1, but the Radon-Nikodym derivative needn't be so
which actually seems like a reasonable way of giving intuition to moment generating functions
if you are happy with the Radon-Nikodym derivative ;)
 
My intuition for moment generating functions are "generating functions are awesome"
 
@Semiclassical They are!
 
Hi all;
I'm doing a number theory problems and I'm having some trouble
P: A certain natural number is congruent to 4 (mod 9), congruent 1(mod 5), and congruent to 5(mod 8). a) Show that the number is congruent to 1 (mod 3)
So far, my thoughts have been:
 
@Mitch That doesn't mean that you can't use jargon, but it means that you should be able to explain what each bit of jargon means
On the other hand, when you're teaching someone something, you shouldn't hide the jargon from them, either. Explain the concept, and when that's done, give the concept a word ("jargon").
 
1:48 AM
Since 9 is a multiple of 3, the residues of any natural number modulo 9 will have a onto relationship with the residues of any natural number modulo 3.
As, described by this diagram:
 
> “Triboluminescence. Triboluminescence is the light emitted when crystals are crushed…”

I said, “And there, have you got science? No! You have only told what a word means in terms of other words. You haven’t told anything about nature – what crystals produce light when you crush them, why they produce light. Did you see any student go home and try it? He can’t.

“But if, instead, you were to write, ‘When you take a lump of sugar and crush it with a pair of pliers in the dark, you can see a bluish flash. Some other crystals do that too. Nobody knows why. The phenomenon is called “tribolumi
 
I looked at the hint on the back of the book, and it just says, "Use what you know about the number modulo 9"
Anyone know if I'm on the right track, or if anyone could provide some hints, that would be greatly appreciated
 
@DarkRunner Well, you said it was 4 mod 9, right?
(So it's one of 4, 13, 22, 31, etc.,)
 
@AkivaWeinberger, right so it's any number in the form of 9k+4
 
Mhm, so now take that mod 3
 
1:55 AM
Oh! wow
I feel so dumb
 
was just about to say that
the first line was all you needed
 
Wow
k thanks people!
 
if you know what a number is say mod 15 you know what it is mod 5 and mod 3
the opposite of the CRT
that happens to be easier
if i have a topology group and want to make a room on the site for that can i?
 
Lets say that we have the hyperreal number h: 2, 3, 4, 2, 3, 4, ... (2, 3, 4 repeated), is a h necessarily an integer no matter what ultra filter we choose on N? (I.e. equal to either 2, 2, 2, ... or 3, 3, 3, ... or 4, 4, 4, ...)

If we choose an ultrafilter such that {n: h(n) = 4} is quasi big, then we can't choose {n: h(n) = 2} and {n: h(n) = 3} can't be quasi big right? So if i is 4, 4, 4, 4, ... then {n: h(n) = i(n)} would be quasi big and therefore h = i, but we could do the same thing if we choose 2 or 3 to be quasi big in our ultra filter. My question is, is it always the case that
 
So technically I finished my CS project but it's ugly
so I have until midnight to un-uglify it
 
2:03 AM
@AkivaWeinberger un-uglify
 
@WilliamOliver Yes, $h$ is necessarily an integer.
 
I like this statement
 
It will either be $2$, $3$, or $4$.
The intersection of two quasibig sets is quasibig, right? So it can't be more than one of those
 
Sorry to disturb again, but I understand that if you know what a number is mod x, you know what it's residue is for all mods that are factors of x. But what if a number is a multiple of x?
 
Since the union of finitely many quasismall things is again quasismall, it can't be none of them
@WilliamOliver Another way to think about it is to notice that it satisfies h = floor*(h)
 
2:08 AM
Like if we know x= 1(mod 5), how can I show it's also congruent to 1 (mod 60)?
 
Like, its floor is itself, which means it's a (hyper)integer
(And it's not infinitely large, so it's just an integer)
 
@AkivaWeinberger Thanks! Was my reasoning correct? I guess we would have to choose either {n: h(n) = 4}, {n: h(n) = 2}, or {n: h(n) = 3} to be quasi big because for every set $S$ either $S$ or $S^c$ has to be quasi big. So once we choose one, the other two would have to be not quasi big. Since for every quasi big set $S$, if $S$ is a subset of a set $B$ then $B$ must be quasi big, therefore no subset of $2, 3$ for example, can be quasi big.
 
@DarkRunner you can't, because that's false without further conditions
 
What is floor* ?
 
@DarkRunner You know how even numbers end in 0, 2, 4, 6, or 8?
 
2:09 AM
one can quite easily come up with numbers which aren't congruent to 1 mod 60 but are congruent to 1 mod 5.
 
Suppose $\textbf{x},\textbf{y}$ $\in$ $\mathbb{R}^{n}$, $\textbf{x}$ and $\textbf{y}$ nonparallel. Prove that if $s\textbf{x} + t\textbf{y} = 0$, then $s=t=0$. My attempt:
If $s\textbf{x} + t\textbf{y} = 0$, then $\textbf{x} = -\frac{t}{s}\textbf{y}$ This is a contradiction as $\textbf{x}$ and $\textbf{y}$ are not parallel. Therefore the only solution is $s$ and $t$ are $0$.
Did I miss anything and/or is more rigor required?
 
@WilliamOliver If $f$ is a function from $\Bbb R$ to $\Bbb R$, then $f^*$ is its extension to the hyperreals, defined by $f((a,b,c,\dots))=(f(a),f(b),f(c),\dots)$. I don't know if it's standard notation
But it's just extending a function $f:\Bbb R\to\Bbb R$ to a function $f^*:\Bbb R^*\to\Bbb R^*$ (where $\Bbb R^*$ is the hyperreals)
 
Ah gotcha
Thanks a lot!
 
@WilliamOliver Right
@WilliamOliver The fact that hyperreal extensions of functions exist is essentially the reason why hyperreals are so useful.
A function $f:\Bbb R\to\Bbb R$ is continuous at $x$ iff, for every hyperreal $y$ infinitely close to $x$, we have that $f^*(y)$ is infinitely close to $f^*(x)$.
 
@AkivaWeinberger Yeah that floor function proof is super useful and elegant, I like it.
 
2:15 AM
(I'm considering the real number $x$ to be the same as the hyperreal number $(x,x,x,\dots)$. I guess theoretically you could call that $x^*$, but that feels like too many stars)
@WilliamOliver Here's something interesting, by the way.
Define $N$ to be $(1,2,3,\dots)$.
 
@CookieToast That's a good idea, but note that in writing $s/t$ you're implicitly assuming $t\neq 0$
 
So $N>5$, for example, because $5=(5,5,5,\dots)$, and a quasibig subset of $(1>5,2>5,\dots,5>5,6>5,7>5,\dots)$ is true, right?
 
And would simply specifying as such be ok, since I'm showing a contradiction only if $s,t$ $\neq$ $0$? @Semiclassical
 
@WilliamOliver And similarly, $N$ is bigger than any real, so it's infinitely large
Now, let $f(x)$ be $x^2$.
 
Not quite. You need to prove that both of them must be zero.
 
2:18 AM
@AkivaWeinberger right
 
$N$ and $N+\frac1N$ are infinitely close together, right? (That is, their difference is infinitely small, or smaller than any positive real)
But $f^*(N)=N^2$ and $f^*(N+\frac1N)=(N+\frac1N)^2=N^2+2+\frac1{N^2}$.
That is, $f^*(N)$ and $f^*(N+\frac1N)$ are not infinitely close together, since their difference is $2+\frac1{N^2}$.
But $f(x)=x^2$ is continuous! Doesn't this contradict what I said above about continuous functions?
 
Oh, wow, interesting
 
The resolution is that $f$ is called continuous if it's continuous at every real point $x$.
In other words,
 
Hmm... Well if we first assume $t$ $\neq$ $0$, then we have $\textbf{x} = -\frac{s}{t}\textbf{y}$. $s = 0$, $t \neq 0$ doesn't work because then you'll have $\textbf{x} = 0$. If we then assume $s$ $\neq$ $0$, then we have $\textbf{y} = -\frac{t}{s}\textbf{x}$. $t = 0$, $s \neq 0$ doesn't work either because then we'd have $\textbf{y} = 0$ And we already know we cant have $s,t$ both $\neq 0$ because then $\textbf{x}$ and $\textbf{y}$ are parallel.
Does that cover it @Semiclassical?
 
$f$ is continuous if, for every real $x$ and every hyperreal $y$ infinitely close to $x$, we have that $f^*(x)$ is infinitely close to $f^*(y)$.
One of them needs to be real.
Still, that leaves us with a question
 
2:23 AM
Where did you assume $\mathbf{x},\mathbf{y}$ are nonzero?
 
Oh thats really interesting, so it is technically allowed for two infinite numbers to be both infinitely close and not infinitely close?
 
It's true that $\mathbf{x}=0$ would be a problem, but why? The problem as you wrote it never specifies that.
 
It's allowed for two infinite numbers to be infinitely close (like $N$ and $N+\frac1N$) but have their images in the function not be infinitely close (like $N^2$ and $(N+\frac1N)^2$), yeah.
But there's a question, which is,
 
Ooh right of course
 
What do we call functions for which, for every hyperreal $x$ and hyperreal $y$, if $x\approx y$ then $f(x)\approx f(y)$? (Using $\approx$ to mean infinitely close)
 
2:24 AM
Ah crap. I guess I would say "Since $\textbf{x},\textbf{y} \in \mathbb{R}^{n}$, then they are not necessarily zero. Hm...but that means $s=0$ or $t=0$ is possible a solution if $\textbf{x}$ or $\textbf{y} = \textbf{0}$ right? @Semiclassical
 
Is there a word for such functions, where we can do it even if they're both infinitely large?
Turns out, there is: It's called "uniformly continuous".
And, you might remember from analysis, that $x^2$ is not uniformly continuous.
 
Well, I think the question is to which vectors a zero vector is parallel.
 
Ah thats interesting!
 
So, continuity is equivalent to, $\forall x\in\Bbb R,\forall y\in\Bbb R^*,x\approx y\Rightarrow f(x)\approx f(y)$.
 
Wait...since $\textbf{x}$ and $\textbf{y}$ are assumed to be nonparallel, they cant be $\textbf{0}$ right? Because by the definition, any vector is parallel to the zero vector?
 
2:26 AM
And uniform continuity is equivalent to, $\forall x\in\Bbb R^*,\forall y\in\Bbb R^*,x\approx y\Rightarrow f(x)\approx f(y)$.
 
That's what I'm wondering, yeah.
 
So that's the little hint where we can restrict $\textbf{x}$ and $\textbf{y}$? This is from Ted's book, so I don't know if that helps.
 
I mean, technically I still have to prove that that's equivalent to the usual epsilon–delta definition. But it's true.
 
The definition he gives for parallel is $\textbf{x}$ is parallel to $\textbf{y}$ if $\exists$ $c$ $\in$ $\mathbb{R}$ such that $\textbf{x} = c\textbf{y}$
 
There you go, then.
 
2:28 AM
Er, I should have written $f^*$ in both cases. But I guess it's not really necessary
 
If $\textbf{x} = 0$, then $c = 0$ satisfies any $\textbf{y}$
 
Right.
 
Hmm, yeah I didn't even see that little hint until you pointed it out. Gotta read the questions more carefully
 
@AkivaWeinberger Thats extremely interesting! I am definitely seeing non standard analysis as much more useful than standard analysis
 
Thanks @Semiclassical :)
 
2:29 AM
np
 
@WilliamOliver Yeah, and it shows that when you're really rigorous with infinitesimals, unexpected things can happen
 
Ok, now help with part (b): Prove the Riemann Hypothesis :P
 
gl
 
Extra credit if you can get it in under a year!
 
Incidentally, I just gave you a nonstandard-analysis proof that $x^2$ is not uniformly continuous. It's instructive to try to turn that into a standard-analysis proof that $x^2$ is not uniformly continuous (with the epsilon–delta definition).
 
2:30 AM
cookie promises he will give u a phd
prove $x^2 $ is not uniformly continuous is not bad
 
It's not too hard; the two proofs end up looking almost identical, except for a change in wording. (At least, I remember them being almost identical... it's been a long time since I've done it.)
 
heck I'll give you 2
 
life's too short to worry about RH
 
@AkivaWeinberger i belive you can do it rather easily by contradiction on an assumtion that a delta holds for all values
 
@WilliamOliver Also, do you know any topology? Specifically, do you know what "compact" means?
I was asking William
 
2:33 AM
@AkivaWeinberger Yes I do
 
sorry
 
Although I guess I can share it with you if you're familiar with hyperreals, it's quite cool @Faust
@WilliamOliver Right, there's a nonstandard analysis definition of compact as well.
 
I know of them i dont understand them very well
 
So if $X$ is a subset of $\Bbb R$ (really you can do this with any topological space it turns out), you can define $X^*$ as the set of things of the form $(a,b,c,\dots)$ where each of those is contained in $X$. Right?
 
hai
 
2:35 AM
It turns out that, $X$ is compact if every element of $X^*$ is infinitely close to some element of $X$.
 
Hi guys; I'm working on a mods problem; If anyone could help, that would be great!
 
What do you mean exactly by infinitly close?
 
@AkivaWeinberger Ah that makes perfect sense!
 
For example, $(0,1)$ is not compact, since $(0,1)^*$ contains infinitesimals such as $(1,\frac12,\frac13,\dots)$, which is infinitely close to $0$ but not infinitely close to anything in $(0,1)$.
 
i see
@DarkRunner just ask
 
2:36 AM
Similarly, $[0,\infty)$ is not compact, since $N$ from before is in it but it's not infinitely close to any real.
 
@Faust OK, Thanks
$Find\quad { 10 }^{ 10 }+{ 10 }^{ 100 }+{ 10 }^{ 1000 }+...+{ 10 }^{ 10000000000 }(mod\quad 7)$
 
And $[0,1]$ is compact, since you can take the "standard part" of anything in $[0,1]^*$ and land in $[0,1]$.
 
So my first intuition is
 
Beautiful!
 
intresting
 
2:38 AM
(The "standard part" of a hyperreal is the unique real infinitely close to it, if one exists (i.e. if it's not infinitely large).)
 
Well, one thing you can do is reduce is to 3^10+3^100, etc.
But that doesn't really help
 
@WilliamOliver We can use this to prove the extreme value theorem.
But it might take me a minute to remember how.
 
@DarkRunner what is $10^{10} \mod 7 $
or $3^{10} \mod 7$
 
@AkivaWeinberger Well, I have to go now, but thanks for showing me all of these awesome definitions using hyperreals! Far more intuitive if you ask me
 
You're welcome! And thank you, it's fun sharing this stuff
 
2:40 AM
@Faust I'm not sure; I'm trying to find some pattern in the residues;
Let's see
 
Yes very informative @AkivaWeinberger
 
@Faust Did you see the thing I wrote above about continuity and uniform continuity using the hyperreals?
 
i read it yes
 
Arright
Cool innit
 
intresting ^^
 
2:42 AM
I don't think there's any pattern in the residues; If there was, the above problem could be reduced really easily
Let me continue, however
 
it looks like each term is congruent to 4
yeah im going with 4
 
Wow! I found a pattern in the residues; Ok now it should be easy to simplify
 
so you have 4 -3 +4 -3
 
@Faust Let me check
 
10000000000/2 mod 7 is the answer
maybe no 2
 
2:46 AM
Wait, I'm confused
 
ok
 
So the residues of modulo 7 have a period of 7, right?
 
$ 4\equiv -3 \mod 7 $
and each term is congruent to 4
 
Because we have 10 (mod 7) = 3, 10^2(mod 7 = 2), 10^3 (mod 7 ) = 6, 10^4== 4, 10^5(mod 7) = 5, 10^6 (mod 7) = 1
Oh, wait! it's acutally a period of 6!
I calculated wrong
 
?
you start at 10^10
 
2:47 AM
Yeah, ok! I got my method, one second let me calculate it
 
$10^{10} \equiv 4 \mod 7 $ and $4^{10}\equiv 4 \mod 7 $ so every term is just 4...
 
OK, so the answer is 1, right?
Because 36 (mod 7) =1 ?
Yeah; my method was to see that the period of the residues of modulo 7 is 6, so take the modulo 6 of the power of the first few terms, and you see that their residue mod 7 is 4, so by induction, it holds for all 9 terms. So, all the terms will have a residue of 4. Therefore, you have 4*9 (mod 7)
 
should be $4^9$
 
@Semiclassical Part 2 asks to show if $a\textbf{x} + b\textbf{y} = c\textbf{x} + d\textbf{y}$, show $a = c$ and $b=d$. My attempt:
We have
$$a\textbf{x} - c\textbf{x} = d\textbf{y} - b\textbf{y}$$
$$=(a-c)\textbf{x} = (d-b)\textbf{y}$$.
Let $s=(a-c)$ and $t = (d-b)$. Then we have the same case as in example (a), and the only solution is $s,t = 0$ which implies $(a-c)=0$ and $(d-b)=0$ which implies $a=c$ and $d=b$.
How'd I do?
 
but both are congruent to 1
i have no idea how your using induction
 
2:51 AM
@Faust You mean 4*9, right?
 
Eh, I think you're making life too hard.
 
Well, anyway, I got 1(mod 7), is that right?
 
shit yes
 
What do you get if you just move all the terms on the right (in the first equation) to the left and arrange by like terms?
 
gj
 
2:52 AM
@faust cool thanks!
 
@Semiclassical I have this innate fear of my proofs being too weak, since I have no instruction on formal mathematics. You are undoubtedly right though
 
@TedShifrin I feel like my communication skills need work.
I recently had a classmate challenge me to write clearer. He said my writing was overcomplicated.
 
how do i show that if F is compact there are $ x,y \in F $ so that $|x-y| = d(F) $
 
@TedShifrin I'm not terrible. But I have been trying to communicate some of my medical ideas and, even the smartest people I know, they have trouble understanding me sometimes. So I need to find ways to improve. Any ideas?
 
@StanShunpike it may sound stupid but when i write up a math assignment my goal is to always fit it on one page. it usually doesnt happen but i think its made me a better mathimatician
 
2:54 AM
@Semiclassical you just get $a\textbf{x} - c\textbf{x} + b\textbf{y} - d\textbf{y} = 0$?
 
if you arrange that in like terms, that's $(a-c)\mathbf{x}+(b-d)\mathbf{y}=0$.
 
@Faust One thing i've learned recently is like, even if i don't like the notation a pset gives me, i still use it now. because i realized, when TAs read the psets, they expect the notation they gave, even if its shitty.
@Faust so there's definitely room for improvement in how i communicate my math too
the page limit might be a useful idea
 
But what did you already prove about $s\mathbf{x}+t\mathbf{y}=0$?
 
Isn't that what I did above?
https://chat.stackexchange.com/transcript/message/42412080#42412080
 
Sure, but my point is that you don't need to redo the argument.
 
2:56 AM
Or is there something different?
Oh, gotcha. I don't need to restate the whole first half :P
 
Right.
Once you've written the above, you can immediately use part (a) to conclude that $a=c$ and $b=d$, full stop.
 
I guess with the amount of rewriting I was doing, I might as well prove $1+1 = 2$ while I'm at it :P
 
@StanShunpike i have autism so i think in a bit of a weird way to say the least. For awhile there it was incredibly difficult for me to communicate about mathematics with someone who didn't have a PhD cause they simply couldn't understand me. i did find the one page thing helped also getting very clear on the definitions and making sure i had memorized there exact meaning helped alot. (don't think of it as a page limit more of a goal that you hope to reach at some point)
 
Theorem: $s = t = 0$: Proof: Let Axiom be the 5-tuple of letters of the english alphabet denoting a ... (5000 lines later) therefore $s = t = 0$
 

« first day (2728 days earlier)      last day (2299 days later) »