« first day (2714 days earlier)      last day (2604 days later) » 

18:01
16 hours ago, by Silent
How do we get $\limsup \max (a_n, b_n) \leq \max(\limsup a_n, \limsup b_n)$ here?
Please have a look at this!
Are you asking why it's true, or how to prove it? Intuitively it seems sound.
Sup chat
hi
How's the weather where you are?
Good rn
It got hotter
same
google says it's just above freezing here
which is nice
18:13
It was in the low 30s this morning
Maybe high 30s rn
It's a nice day w the sun and stuff too
temperatures in the range of the last week are why I appreciate Farenheit
Last week was hell
23 F makes a lot more sense to me than -5 C
I was out and about in the wee hours and I thought I was just gonna die lol
Hi, Is it true that : $\frac{(m\times n)!}{(m!)^n \times (n!)} \in \mathbb N$ ?
18:15
mostly because, when it comes to creature comfort, 0C is mild compared to 0F
0C is when I leave my gloves at home
0F is when I contemplate transferring schools
@Dattier yes
lol
0F is when I avoid leaving the house if at all possible
18:16
@LeakyNun why ?
@Dattier because it has a combinatorical interpretation
which ?
@LeakyNun
Hmm. $(m\times n)!/(m!)^n$ definitely has a combinatorial interpretation
the number of permutations of mn objects is (mn)!
it's the number of ways to start with m x n people and form them into n groups of m
18:18
ignoring order in n groups of m objects gives you (mn)!/(m!)^n
further ignoring the order of the n groups gives you (mn)!/((m!)^n n!)
(mn)!/((m!)^n(n!))
right. which is what you wrote
Have you a link, please
wiki*
or other
18:19
what?
un lien
Frankly, a link is superfluous.
I proved it without wiki or other sites
We just explained it.
@Dattier je l'ai compris
quand tu parlais en anglais
18:20
Ah, merci
However, if you want to see more detail why (mn)!/(m!)^n counts the number of ways to have n groups of m each, look up multinomials
@Semiclassical yes, how to prove it
Simplest way is to prove is probably inductive.
@Semiclassical can you prove that (mn choose m) is divisible by n?
@Semiclassical wrong reply lol
18:22
Silent is asking about limsup isn't he
more difficult :
oh, yeah
@Silent sorry, wasn't replying to you. got confused
$f\in C^2([0,1])$ with $f''$ convex and $f(0)=f'(0)=0$ is it true that : $f''(1)+6f(1)\geq 4f'(1)$ ?
@silent dunno. It's intuitive but I don't remember enough of lim-sup stuff to say
@Dattier deja vu
18:23
où ?
maybe: form the sequence a1,b1,a2,b2,...
I don't know
@Semiclassical, ok
@LeakyNun where ?
@LeakyNun yes.
18:23
them max(a_n,b_n) is a subsequence of that
@Dattier je l'ai compris quand tu parlais en francais
@Semiclassical genius
@LeakyNun où l'as tu vu ?
@Dattier j'ai dit que je ne sais pas
"deja vu" is an English term
already seen
@LeakyNun
18:25
nvm ?
never mind
in english it's used as an idiom for the experience "I feel like I've already done this before"
particularly when you can't figure out when you would have experienced it before
@Semiclassical thanks
Ah, it's an impression
@Dattier it isn't true
18:31
"I feel..." so it's an impression no ?
@LeakyNun
yes, deja vu is an impression
the trick to that question is that f(x) = x^2 and f(x) = x^3 both give you equality, and other powers give you strict inequality
that motivates me to look for f(x) = x^2.5
and then I found the counter-example
for that reason, analytic functions will fail to be a counter-example
very tricky question, because the common functions that we have in mind are all analytic
x^n gives n(n-1)+6 >= 4n, which does have solution set (-infty,2] U [3,infty)
and then of course there is a bunch of non-analytic function that fails your inequality
@Dattier is my answer complete enough?
guys, would anyone feel like answering my question? math.stackexchange.com/questions/2597207/…
@LeakyNun Bravo, I thouk it'was true
je pensais cela vrai
surement
Y-a-t-il un probleme que j'ai posé et dont tu aimerais connaître ma réponse ?
@LeakyNun
18:39
you knew the answers to your problems?
for many of them yes
only an intuitive answer
@LeakyNun
(mn)!/((m!)^n)(n!)) then
empiric result
@LeakyNun
I'm using this program desmos.com/calculator to draw graphs. I need to draw a sin function. However I want that the range is between $-1/2$ and $1/2$ and not between $-1$ and $1$
Is it possible to write a similiar function?
Y-a-t-il un autre probleme que j'ai posé et dont tu aimerais connaître ma réponse ?
@LeakyNun
18:43
well you only asked two questions
do you rember the little theorem of goldbach
@LeakyNun
weak goldbach conjecture?
why didn't I think before about this silly thing? :P
every odd number > 7 is the sum of three primes?
no, it's a sum finite of different number prime
18:45
oh ok
@LeakyNun : no question ?
what question should I have?
I don't know, I'm not LeakyNun and you're not Dattier
no question, thanks
@LeakyNun : Thanks, see you later
18:52
see you
@LeakyNun false allarm. I need that the curve starts decreasing when $x=Ï€/6$
@LeakyNun : f(x)=2^2.5 so f''(x)=x^0.5 is not convex
f'' must be convex in hypothesis
$f\in C^2([0,1])$ with $f''$ convex and $f(0)=f'(0)=0$ is it true that : $f''(1)+6f(1)\geq 4f'(1)$ ?
f(x)=x^2.5 so f''(x)=k*x^0.5 (k>0) is concav and not convex
19:16
If anyone can code, here is a code example paste.ofcode.org/mUhcMdbnVsjSypn4V2nSmV
the function has to pass thorugh the origin
19:43
Hi. Let $M$ be an $N\times N$ correlation matrix (symmetric, psd, ones on the diagonal). Also let $w_i$ for $i=1,\dots,N$ be nonnegative weights summing up to 2, and $R_i$ denote the sum of the $i$-th row of $M$. Then I wish to maximize $|\sum_i (N w_i-1)R_i|$, and perhaps it's optimal to take $w_1=2$ and $w_i=0$ for the rest. However, the problem is choosing valid $R_i$ (i.e., maintaining psd assumption). Any ideas? Or is there perhaps a better approach?
Is it true that $\frac{(a_1+...+a_k)!}{(a_1!)\times ...\times (a_k!)\times (k!)} \in \mathbb N^*$ when $a_1+...+a_k \mod 2=0$ ?

Is it true that $2\times \frac{(a_1+...+a_k)!}{(a_1!)\times...\times (a_k!)\times (k!)} \in \mathbb N^*$ when $a_1+...+a_k \mod 2=1$ ?
Any german algebraists in here atm? :P
@Mathein you are summoned
@Daminark hahah, I'm just looking for a reference :P
I heard someone needs a German algebraist?
19:53
lol, hey. Kennst du das buch "Galoissche Theorie" von Emil Artin und weißt du ob es eine moderne edition auf Deutsch gibt? :P
Ja, das hab ich bei mir im Regal stehen
hello, I've read many of the questions/answers on generating equal area concentric circles
they are typically math generated
@MatheinBoulomenos hoi, wo hast dus gekriegt/gekauft? Amazon oder so? Oder gibts das einfach bei euch in der bibliothek? hahaha
Habe ich von meinem Vater gekriegt, der hat auch Mathe studiert
@Julius to be clear, what in here is fixed? It seems as if both w and R (and therefore M) are free to be varied
19:54
I'm looking for a simple relationship, like a circle with radius 10 is equal in area to a circle radius? when one is subtracted from the other
I want to draw concentric equal area circles
any ideas?
Ah okey macht sinn, und des ist mit latex gesetzt oder wie?
@Semiclassical, true. I only fix the assumptions on $M$ and $w_i$. So basically I'm looking for the most extreme $M$ along with the weights, in the sense of what I want to maximize
is this a good place for my question? it seems a little simple to write a post about
Also ich glaube ist kein LaTeX, aber das Schriftbild sieht gut aus (keine Schreibmaschine oder so)
Ah passt danke :) Ich such dann eine kopie auf amazon oder so hahaha
19:59
Das ist die Ausgabe, die ich habe: booklooker.de/B%C3%BCcher/…
bitte pass auf mich auf
hoi nur 6€! Ich hätt was teureres erwartet hahaha
das ist nur ein dünnes Taschenbuch
how do I draw concentric circles of equal area?
ah okey, naja versand nach Großbritannien kostet sicher 999€
20:01
is there a more geometry based chat?
@Semiclassical, although another problem where $M$ (and therefore $R_i$) are fixed would also be of interest for me
@Webster Circle area depends only on the radius, so a circle of radius 10 is equal in area to another circle of radius 10
@ÍgjøgnumMeg Muss es unbedingt auf deutsch sein? es gibt das auch auf Englisch: amazon.co.uk/dp/0486623424 (Der Inhalt ist derselbe, auch wenn der Titel irgendwie anders ist)
@MatheinBoulomenos ja ich hätts lieber auf Deutsch, ich hab mich bei der BMS beworben und würd gerne mal meinen mathematischen Wortschatz verbessern
Aber danke dass du hilfst :)
@ÍgjøgnumMeg thank you but I am looking for concentric equal area circles, the outer one minus the inner one have equal areas
20:14
Hello.
Is it true that a sequence of functions which converges uniformly on countably many sets also converges uniformly on the union? Or is this only true for finitely many sets?
It's not true. Every monotonous sequence of continuous functions which converges to a continuous function converges uniformly on compact subsets (by Dini's theorem), but the real line may be written as a countable union of compact subsets, so it suffices to give a monotonous sequence which converges pointwise but not uniformly to a continuous function. Consider $f_n(x)=\frac{|x|}{n}$ (defined on $\Bbb R$)
this converges pointwise and monotonously to the zero function, but not uniformly
Ok thanks. That means only finitely many unions allowed.
on every compact interval, it converges uniformly (which can also be seen easily without Dini's theorem, that's overkill)
Ok.
I'll try to prove it
@Dattier oh lol I thought f has to be convex
20:29
hmmmm
any bibtex experts around? I'm a bit out of my depth
I'm trying to reproduce a certain bibliography item that has multiple papers (all by the same authors) in one citation.
@Julius Right, that's what I thought. I can't comment much atm, but I'd point out that the row sums can be conveniently expressed as $R=Mu$ where $u$ is a vector of ones.
One point of confusion, as well: What is $Nw_i-1$ supposed to be? $w_i$ is evidently a scalar, but then $Nw_i$ is a matrix and so $Nw_i-1$ doesn't make much sense. (It would if $1$ is really the identity matrix, but I'd rather not presume.)
let's work with 10-adics
$\log(1+x) := x - \frac{x^2}2 + \frac{x^3}3 + \cdots$ is convergent when $x$ ends in $1$
what would log(11) look like?
horrifying, I imagine
Suppose that $f : X \to Y$ is a continuous function, and $\{x_n\} \subseteq X$ is a sequence such that $\{f(x_n)\}$ converges. Does this imply $x_n$ converges? I think the answer is no: take $f : (0,\infty) \to (0,\infty)$ defined by $f(x) = 1/x$, and $x_n = n$. Then $f(x_n) = 1/n \to 0$ yet $n \to \infty$.
@Semiclassical ...
But then my response to anything p-adic is "it's probably horrifying" :P
20:44
@user193319 you can have a simpler example :P
Is it true that $\frac{(a_1+...+a_k)!}{(a_1!)\times ...\times (a_k!)\times (k!)} \in \mathbb N^*$ when $a_i \in \mathbb N_{\geq 2}$ ?
@LeakyNun Constant function?
@user193319 precisely
@Dattier interesting question
you should ask it in meain
Dang...I was hoping the answer is yes...Are there any further conditions on $f$ that will guarantee that $x_n$ converges? Perhaps injectivity?
@user193319 well all continuous injective functions are monotonic so it isn't very interesting
20:47
@LeakyNun : I can't
@Semiclassical, $N$ is also a scalar as the matrix $M$ is $N\times N$. And thanks for $R=Mu$, perhaps it will be useful. Now I'm thinking that maybe $M=uu'$ will be optimal as $|\sum_i (N w_i-1)R_i|$ is not only about asymmetry (i.e., one big row with $w_1=2$ and other rows as small as possible) but also about magnitude (which gets hurt if I have both positive and negative entries and want to preserve the psd property)
@LeakyNun I'm no longer thinking about functions over the reals.
@user193319 make your question precise
It's exactly as I asked above except that I'm imagining $f : X \to Y$ to be injective or anything else that will guarantee that $x_n$ converges.
@Dattier why not?
@user193319 define $X$ and $Y$
20:49
Any topological spaces, but we can assume them to be Hausdorff if necessary.
connected?
Hmm...let's say they aren't.
Continuous injective is not enough. Consider the function $f:[0,1) \to S^1$ $f(x)=e^{2\pi i x}$ take the sequence $1-\frac{1}{n}$, the image of this converges, but the sequence itself doesn't
@LeakyNun : when I try, I have this message : "You have reached your question limit"
these spaces are Hausdorff (even metric) and connected
20:51
@Dattier should I ask it for you?
@LeakyNun yes
@MatheinBoulomenos Dang...so there are no conditions we can place on $f$ to guarantee that $x_n$ converges?
@user193319 let $f$ be a homeomorphism :P
@LeakyNun Very complicated!
what is the context?
20:52
if it's an embedding and the limit is contained in the image, then it works
@LeakyNun Very complicated!
0
Q: Multinomial coefficient divisible by factorial of number of terms?

Kenny LauLet $n \in \Bbb N_{>0}$ and let $(a_i)_{i=1}^n$ be a sequence of positive integers. Then, must $\displaystyle \frac {\left( \sum_{i=1}^n a_i \right)!} {n! \prod_{i=1}^n a_i!}$ be an integer? I know that without $n!$ it is just the multinomial coefficient, so it must be an integer. I also know...

@Dattier
@LeakyNun you must precise a_i>1
a_i >= 2
else it's false
what's the example?
@MatheinBoulomenos I have a union $X = X_1 \cup X_2$ and know that $f_n|_{X_1} \to f|_{X_1}$ and $f_n|_{X_2} \to f|_{X_2}$ uniformly. Then $f_n \to f$ uniformly.
21:04
Hey guys, with really strong letters of rec and a GPA > 3.7 as a community college student, do I stand any chance at being accepted to somewhere like Berkeley or UCLA? And if not, what kind of caliber of schools am I looking at?
@MatheinBoulomenos but what do I do if $X_1,X_2$ are not disjoint?
@philmcole yes that works
it shouldn't bother you
I mean I need to define $f(x) = \begin{cases} f|_{X_1}(x) & \text{if } x \in X_1 \\ f|_{X_2}(x) & \text{if } x \in X_2 \end{cases}$
or some sort of $f$
And if I have an $x$ which is both in $X_1,X_2$ what do I do?
you know that $f_{\mid X_1}(x)=f_{\mid X_2}(x)$ if $x\in X_1 \cap X_2$, because on $X_1 \cap X_2$ the sequence converges to both and limits are unique
@LeakyNun : choose : 8=6+1+1, 8!/((3!)*(6!))=28/3
we must choose a_i>1
21:09
@MatheinBoulomenos Makes sense, thank you!
even with a_1>1, this doesn't work. There are plenty of values for which the binomial coefficient is odd
a_1=2, a_2=4, then 6!/(2!*2!*4!)=7.5
21:29
@MatheinBoulomenos : Bravo
22:16
Here's something I wonder now. Suppose I take all entries of Pascal's triangle up to the nth row. What fraction of them are even?
There's a lot of 1's on the boundary, so probably one should exclude those as trivial.
oh man, the title of this article is great: gianpierobiancoli.it/wp-content/uploads/2009/10/beeb.pdf
How can I show that $f_n(x) = \frac{n}{nx+1}$ is bounded on $(0,1)$ for all $n$?
What's x here?
if x=0, for instance, then that's badly false
$x \in (0,1)$
$n \in \mathbb N$.
The title of the above, for those who didn't look: "Zaphod Beeblebrox's Brain and the Fifth-Ninth Row of Pascal's Triangle."
mmkay. what i'd look at is the reciprocal of fn(x)
Well even if $x=0$ there is no problem since $\frac{n}{1} = n$?!
22:22
uh
n=2 would give fn(0)=2>1
so yeah, that's kinda problematic
Ah I think I said it wrong, sorry.
Just to be clear, you're asking why for every fixed $n$ $f_n(x)$ is a bounded function in terms of $x$, right?
I mean not bounded for all $n$ but for each $n$
22:24
so for every single $n$ there is a $M_n \gt 0$ so that ...
so, suppose you look at 1/fn(x)
What's that come out as?
$f_n$ extends continously to $[0,1]$, continuous functions on compact sets are bounded
@Semiclassical I mean the definition of boundness...
@MatheinBoulomenos That's a good argument, thanks!
22:25
well. where I was going is that 1/fn(x) = x+1/n
Let $a_1,...,a_{500}$ a distinct sequence of intergers in $[1,3000]$.
Is it true that exists $a_i\neq a_j$ with $\text{gcd}(a_i,a_j)>1$ ?
so 1/fn(x) lies between 1/n and 1+1/n
and therefore fn(x) lies between n and 1/(1+1/n)<1
...hrm
@Semiclassical Thanks!
oh, yeah. I am done. derp
thank goodness for x->1/x being monotonic :P
@Semiclassical Without that life would be harder haha
22:29
@Dattier there are less than $500$ primes in $[1,3000]$, (430 to be exact) and only one value divisible by no prime, so for some prime $p$, $p$ divides both $a_i$ and $a_j$ for $a_i \neq a_j$
@MatheinBoulomenos : Bravo
Why must algebraic extensions of $\mathbb{Q}$ contain integral elements over $\mathbb{Z}$?
@Prototank well, they contain $\Bbb Z$ at least, but I guess that's not what you're asking
Sure! Haha. If $K\supset \mathbb{Q}$ is an algebraic extension, then apparently there is some $\alpha\in K\setminus \mathbb{Z}$ which is integral over $\mathbb{Z}$. Having that every element is algebraic isn't enough, sadly. When we try to get a common denominator to make the given equation in $\mathbb{Z}$, we affect the leading coefficient.
If something wiggles a lot, does it's tangent bundle take up a lot of space?
That's the question I want to figure out
22:34
I can see examples, though. Clearly $i\in\mathbb{Q}[i]$ is an example of this.
If $K \supset \Bbb Q$ is a proper algebraic extension, then we can choose $a\in K \setminus \Bbb Q$. $a$ is algebraic over $\Bbb Q$, so we have a relation $a^n+q_{n-1}a^{n-1}+\dots+q_0=0$, where the $q_i$ are rational numbers. Choose $k\neq 0$ in $\Bbb Z$ such that $k\cdot q_i \in \Bbb Z$ (take a common denominator), then we multiply the whole thing by $k^n$. We get $(ka)^n+kq_{n-1}(ka)^{n-1}+\dots+k^nq_0=0$, thus $ka$ is integral over $\Bbb Z$
I should have committed to the paper longer... embarrassing >.<
thanks
np
may I ask which paper you're reading?
I am working through old course notes
I see. On algebraic number theory?
22:38
I'm not really an algebraist, either! The only paper I'm reading right now is Hatcher's 3-Manifolds.
@Prototank There, now! We have a good man here
I should read Hatcher's 3-manifold notes too.
I should correct myself, my advisor was Hatcher's student and I'm working through his notes from the original course
@philmcole granted, all you need is continuity. But being monotonic makes the proof easy
@Prototank Ahhh I see
I thought you meant these: math.cornell.edu/~hatcher/3M/3M.pdf
Well, I tried those. Then I asked my advisor for assistance and he gave me his notes.
22:41
Got it
I never got around to studying the thing I linked...
Out of grad school now?
Hi all, this I the last question that I have on this particular proof.
Let $f_k(x) = 1 - \frac{x^2}k+\frac{x^4}{2! k(k+1)}-\frac{x^6}{3! k(k+1)(k+2)} + \cdots \qquad (k\notin\{0,-1,-2,\ldots\})$


$g_n=\begin{cases}f_k(x) & \text{if }n=0\\ \dfrac{c^n}{k(k+1)\cdots(k+n-1)}f_{k+n}(x) & \text{otherwise.}\end{cases}$
, where $c$ is a natural number.

Claim 2: For each $x\in \mathbb R$, $\lim_{k\to+\infty}f_k(x)=1.$

*Now, it follows from claim 2 that each $g_n$ is greater than $0$ if $n$ is large enough and that the sequence of all $g_n$'s converges to $0$.*
How do we get those conclusions that are written in italic?
for the first conclusion: c is a natural number,so $c^n\gt 0$, I can say as n gets bigger $f_{k+n}(x)\rightarrow 1 $. But how about ${k(k+1)\cdots(k+n-1)}$ ? Since k is a rational number it can be a negative number too
@LeylaAlkan What is $k$?
A natural number?
At least you exclude the negative terms in the beginning where you say $k \notin \{0,-1,-2,\ldots\}$
So I guess it's a natural number.
Then the conclusions follow from that.
22:59
No its rational number
because in the proof the functions $f_(\frac 1 2)(x)$ $f_(\frac 3 2)(x)$ are computed
But there is no any mention about k, other than this.
I can give you the link if you want
@CookieToast Great job, Cookie. BTW, taking $y=0$ is quite a bit easier than taking $y=2$ :P Cool technique, eh? If you look through my various problem sets, you'll see that problem appears as a challenge problem a few weeks into the second course.
@Prototank LOL.
It's hard to tell around this chatroom! :)
23:14
Don't blow my covers
I got inspired and started reading the proof of loop theorem from Hatcher
Are you presently finitely covered?
By a sequence of double covers, in fact
That could get infinite ...
Not if the singular disk has a finite triangulation in the first place!!
@EricSilva: The expert I consulted (short of Robert Bryant) doesn't know about the result we were discussing. He thinks it might follow from Cartan-Kähler (which assumes real analyticity, not smoothness). I might have to ask Bryant. Ugh.
Well, you said sequence, Balarka.
23:18
Yeah I wanted to follow up to the covering joke because that's exactly the trick Papa uses to prove loop theorem
My book says "Let $C(a,b)$ be the set of continuous, complex-valued functions defined on the compact interval $[a,b]$ and put $$\langle f,g \rangle = \int_{a}^{b} f(x) \overline{g(x)} dx$$"
Then it tells me to orthogonalize the functions $e^{-x}, xe^{-x}, x^2e^{-x}$ in $C(0, \infty)$
But $[0, \infty]$ is not a compact interval
Gotta love sloppy books :P
Does that mean I can skip the exercise? :O
But the integrals make sense, so the inner product makes sense still, @Lozansky, so don't worry about it. :)
Those functions are all in $L^2([0,\infty))$, so you can still do Gram-Schmidt.
23:28
Not very fond of Gram-Schmidt
Ugh
It's just an inner product on L^2(0, infty) now
I got sniped again
Does Gram-Schmidt still work if you don't normalize the vectors?
You can normalize at the end of everything if you want to, yes.
It only tells me to orthogonalize and I suspect the norms will make it more messy?
Those functions probably won't get too messy ... but it's just a constant at the end if you need to make a unit vector.
23:33
Yeah, not too bad actually
O wow @Ted
I'll keep you posted, Eric. I actually emailed Robert. (Partly hoping to see him when he's in SD for the JMM this week.)
Yeah I'd very much like to hear this story
Yeah, I had some of the details wrong earlier. I sorted it out at 1 AM ... but still don't know the underlying theory.
I should take retirement more seriously.
Geez this quarter is ramping up to be my busiest
23:47
Well, you are still young and eager :P
This is true but it's damn cold and it drains my willpower a bit
It'll be good though it seems like it'll be fun stuff so far
You bitch about heat; you bitch about cold. You need a Goldilocks lesson :P
I'm not only stuck on PDE ... I'm stuck on some of the AoPS complex number homework.
Temperature is definitely one of my difficulties
For your class?
Yup.
I was chatting with the nurse before my oral surgery today. She said she could never survive any place but San Diego. Too cold/foggy in SF, too hot/humid in FL (where she has lots of relatives).
So I reminded her we only had to worry about drought and fire.
Florida has those toxic algae blooms to worry about every once in a while
23:53
No thanks. Plus politics.
Dont even get me started on Florida politics oh geez
Do math instead.
I've gotta read Durkheim rn
So I better go do that
Whoever that be.
I'll keep you posted re $\bar\partial$.
French sociologist
23:56
Doesn't sound very French :P
Wrote influential thing about religion
His first name is Émile for what it's worth
comme Zola.
He came from a long line of French rabbis
Pretty interesting dude

« first day (2714 days earlier)      last day (2604 days later) »