« first day (3493 days earlier)      last day (1532 days later) » 

12:24 AM
I think I got them, N is conditioning on $X$, thus, $f_{X,N}=f_Xf_{N\,|\,X}$
 
12:51 AM
back to the first problem, Let $Y=N-X$, find the joint distribution of $Y$ and $X$. This should be $f_{Y,X}=P(Y=N-X=y,X=x)=P(N=x+y,X=x)=P(X=x\,|\,N=x+y)P(N=x+y)$
 
@Thorgott quick question if you are still around: D&F define an algebraic closure of $F$ to be an algebraic extension $K$ such that every polynomial in $F[x]$ splits completely over $K$.
This seems to admit arbitrarily large closures?
I mean to ask, what is it in this definition that stops us from considering say $\mathbb C(x)$ as the algebraic closure of $\mathbb R$? Why is it that this definition somehow implies minimality of $K$?
 
$K$ being an algebraic extension of $F$ places a severe restriction on the size of the extension
 
OH
I didn't even notice algebraic.
Thanks. That makes total sense now.
:)
So merely $x$ would not be algebraic over $\mathbb R$ and yadda yadda.
Oddly enough I had the same issue with the definition in D&F of normal extension.
"algebraic extension which is a splitting field for a family of polynomials".
I kept on wondering what the difference of being a splitting field for a family and a polynomial was, but I kept on skipping "algebraic".
 
The cool thing is that you can indeed have arbitrarily large algebraically closed extensions, but an algebraic closure embeds in any of them. So you can think of an algebraic closure as the "smallest" algebraically closed extension (and this smallness is captured by being itself algebraic over the base field).
 
That is a neat way of putting it.
D&F kind of hides such subtleties.
 
1:10 AM
I prefer to define an algebraic closure as an algebraically closed algebraic extension for that reason, but D&F prove that this is the same in the next proposition.
Interestingly, even if $K/F$ is algebraic and every nonconstant polynomial over $F$ has a root in $K$, then $K$ is an algebraic closure of $F$.
This is a considerably weaker hypothesis than having the nonconstant polynomials split, so this fact is actually a bit more involved to prove.
A neat consequence of this is that in the construction of algebraic closures that goes back to Artin (also the one given in D&F), you can actually stop after the first step instead of iterating the construction.
 
I like the Artin proof.
I think I read it first in one of Conrad's notes.
 
Yeah, it nicely generalizes the construction of adjoining a root
Those notes also contain the proof of the fact I mentioned above
Another cool variant is to attempt constructing a "maximal" algebraic extension like here: www2.im.uj.edu.pl/actamath/PDF/30-131-132.pdf
 
Speedy
Does Zorn pose as just a helpful tool here or is there an unconstructive element being played off of?
 
1:26 AM
Another cool variant I learned from the user moderator of the Basic Mathematics chatroom is to well-order the irreducible polynomials and split them by transfinite recursion.
This last variant actually gives a concrete way to construct an algebraic closure without any choice for finite and countable fields, as we can always well-order these.
 
you can't prove existence of algebraic closures for all fields in ZF, so there is some nonconstructive element to it @anakhro
my favorite proof for the existence of algebraic closures uses the compactness theorem from logic
 
Wild.
 
Uniqueness and existence of algebraic closures only requires the ultrafilter lemma and whether it implies the ultrafilter lemma is still open, according to MO
 
Hi folks. Using the direct comparison test, what function do I compare $1/\sqrt{x+e^x}$ to?
 
direction comparison test for?
 
1:32 AM
For the integral $\int_1^\infty 1/\sqrt{x+e^x} dx$
I need something whose denom is bigger. But the only benchmark we have is integral of $1/x^p$
 
$\text{I think}\le\text{I am}$
If we put $\text{I think}$ and $\text{I am}$ on two separate axes, we'd get a Cartesian plane
 
You want to find a function that's pointwise larger, so you want a smaller denominator. Taking roots is monotonic, so you want something that's smaller than $x+e^x$. Is there a likely candidate? Does it work?
 
@LukasHeger hei
 
For the fact that $K/F$ finite means $K/F$ splitting field $\iff$ each irreducible $f\in F[x]$ with a root in $K$ splits completely, is finiteness only needed for $\Leftarrow$?
 
@LeakyNun hi
@anakhro if you allow families of polynomials, this holds without assuming finiteness
 
1:39 AM
@LukasHeger was hast du gelernt
 
@Thorgott Oh right. I got it backwards (for a change).
 
@LukasHeger splitting field for families, or families of such $f$?
 
@anakhro splitting fields are always finite (if you allow a single polynomial)
 
@LeakyNun working on my undergrad thesis
 
@Jeff even if you wanted something bigger, there's $e^x + e^x$
 
1:41 AM
@Thorgott Well, $\sqrt x$ is a smaller denominator (that is, $1\/sqrt x$ is larger). But $1\/sqrt x$ does not converge.
 
I thought splitting fields are not necessarily finite....
Otherwise they are algebraic, and thus they are normal
 
a splitting field of a family of polynomials is not necessarily finite
 
Right, so $x+e^x>x$ is too weak of an inequality. What happens if you try $x+e^x>e^x$ (note that this is not a bad idea, because the $e^x$ term dominates the sum for large $x$)
 
a splitting field of a single polynomial is finite, though
 
@LukasHeger was schreibst du in das These daruber?
 
1:43 AM
Does calling K a "splitting field" for F necessitate "for a single polynomial"?
 
A splitting field for a single polynomial is generated (as a field extension) by the roots of that polynomial, all of which are algebraic over the base field. Being generated by finitely many algebraic elements means being finite (this is an equivalence, in fact).
 
depends on who you're talking to, I guess @anakhro
 
@LeakyNun Modulformen, Elliptische Kurven, Galoisdarstellungen
 
I don't even know anymore.
 
@LukasHeger and what's the unbutchered version of my question?
 
1:44 AM
@Thorgott Yes, so $1/\sqrt{x+e^x} < 1/\sqrt{e^x}$, but I think (from the instructions) that I need to use a comparison to $1/x^p$.
 
@LeakyNun "Worüber schreibst du deine Arbeit?"
 
close enough, I guess
 
@anakhro I personally never say splitting field without saying splitting field of what. If you want to say splitting field (without qualification), you can just say normal
 
but now normal allows infinite
 
Normal = splitting in either case for the finite case.
So for the question I guess it doesn't matter since finite is assumed?
 
1:46 AM
I don't see how to make that work @Jeff , the exponential comparison works though
 
from taylor expansion $e^x \geq \frac{x^2}{2}$ for $x \geq 0$
 
Well, we (obviously) have the integral test which i can use to prove $\int_1^{oo} e^{-x/2} dx$ converges.
@Thorgott Maybe the hint was for the other direction, since the full problem is determine the convergence of $\int_0^{oo} 1/\sqrt{x+e^x} dx$.
 
@LukasHeger hast du Algebraische Topologie gestudiert?
 
*studiert
 
what why
 
1:51 AM
ja, ich habe algebraische topologie 1 und 2 gehört
 
denn was ist eine Kofibration
 
*Kofaserung
 
why on earth is it studeirt
 
Well, $e^x\ge x^2/2$ is too weak, but $e^x\ge x^3/6$ does the job, though on the other hand you can get the convergence of $\int_1^{\infty}e^{-x/2}dx$ directly from FTC, which is more straightforward imo
 
by e^x >= x^2/2 I believe he means e^(x/2) >= x^2/8
 
1:53 AM
@Thorgott Agree with the last. Already typed that up.
 
@LeakyNun alle Verben, die auf -ieren enden, bilden das Partizip 2 ohne ge-
 
:o
ich hab niemals diese Regel gehort
 
Verben auf -ieren sind normalerweise Fremdwörter (bis auf wenige Ausnahmen wie verlieren), vielleicht kommt das daher
Hey @Amin
 
verlieren ist klar kein Fremdwort
 
Hey Lukas and everyone, how's it going?
 
1:55 AM
wait lieren isn't a verb?
 
pretty well, thanks. And yourself?
 
oh, I see, taylor after taking the square root
that works indeed
 
@LeakyNun no, but liieren exists (though it's unrelated to verlieren)
 
Doing alright, gonna finish up some AG and hopefully get quizzes graded
 
@Jeff the integral over $[0,1]$ is absolutely no issue, since there is no pole
 
1:57 AM
What are you up to?
 
@Thorgott Well, there is that, too! :D
 
@Amin still writing my undergrad thesis
 
@LukasHeger if $U \subseteq V \subseteq \Bbb C$ are open sets, what does the cokernel of $\mathcal O(V) \to \mathcal O(U)$ look like?
 
Nice, good luck
What's it on exactly? I remember you were recently working on some computational things
 
it't not really computational
I'm writing on the Galois representation associated to Hecke eigenforms
the existence of these was conjectured by Serre and proved by Deligne
if you reinterpret modular forms as automorphic forms for $\mathrm{GL}_2$, that's a case of global Langlands
and I also do some kind of comparison with local Langlands (at least for the unramified primes)
@LeakyNun no idea in general
 
2:04 AM
@LukasHeger schreibst du deine Arbeit auf Englisch oder auf Deutsch oder auf Italianisch?
 
Englisch
lol
 
lol
 
Hey
Does anyone here know about the miller rabin test ?
@LukasHeger Hey
 
If $K$ is a field, is there an easy argument for $K(X)\not\cong K(X,Y)$ (rational function fields)? I can argue using transcendence degree, but there might be something more direct.
 
Purtroppo il mio italiano non è tanto buono, che posso scrivere la mia tesi in italiano. Un'altro problemo sarebbe che il mio supervisore non parla italiano. @Leaky
 
2:09 AM
@LukasHeger have you ever used the program macaulay2?
 
@LukasHeger qui e il tuo supervisore?
 
@Thorgott do you mean as extensions of $K$? Otherwise I think $K=k(X_1,X_2, \dots)$ is a counterexample
@LeakyNun Si chiama Böckle
@JackOhara I haven't
 
@Thorgott essentially using transcendence degree: if X maps to f(X) and Y maps to g(X) then g(f(X)) = f(g(X))
 
@LukasHeger it is a good one if you are intrested in AG
 
but g(X) != f(Y)
oops what am I thinking about
the relation isn't g and f but yeah you can find a relation
 
2:12 AM
@JackOhara probably, I don't know
 
OK, folks, using direct compare on $\int_1^{oo} 1/\sqrt{\left(x^5+5x^2+6\right)^{5/16}}$. What do we compare it to? It's smaller than $1/x^{15/32}$, but that's no help, since that integral diverges.
 
then maybe it diverges!
the trick is to just say that eventually x^5 dominates
so you can replace the other two terms by x^5
and obtain a smaller divergent integral
 
@LeakyNun I need to show why x^5 dominates, though. But hold on a sec.
 
yeah, as extensions of $K$, should've made that clear
 
I can't do everything for you
x^5 dominates because higher powers always dominate
one cannot focus on syntax and ignore semantics
 
2:18 AM
@LukasHeger yo that's pretty cool!
 
@LeakyNun Huh? I'm working on it now, not asking you do anything. I don't understand this syntax vs. semantics comment at al.l
 
@LukasHeger do you know in maths there's a set that contains itself
 
@LeakyNun doesn't seem like a well-founded statement to me
 
@LukasHeger pt = {pt}
 
fair enough
 
2:48 AM
@LukasHeger I think the function field in countably many variables you gave is a "minimal" counterexample for isomorphism as fields. If $K$ has finite transcendence degree over its prime field $F$, then one can still argue by transcendence (over $F$) that $K(X)\not\cong K(X,Y)$.
 
3:02 AM
Hi there,
any hints why the following limit is equal to one?
 
Can you simplify $\sum_{n=-N}^N1$?
 
@Thorgott It seems to me equal to infinity?
 
not the limit, just the term $\sum_{n=-N}^N1$ for a fixed $N$
 
If N=2, I see the summation as 5 or 2N+1?
I see it now.
thanks
 
indeed, it's $2N+1$, now ask yourself why
 
3:19 AM
+1 for N=0, and from -N to 0 I have N ones and from 0 to N, I have N ones
or |-N| + N + 1
 
yup, you're summing $1$ $2N+1$ times :)
 
got it thanks.
 
 
8 hours later…
11:22 AM
Are the even #s a subsequence of the positive integers ? I am thinking it lacks cofinality because there's no element comparable to 1
It is not cofinal right ? So it's not a subsequence ?
Can anyone confirm that thanks.
 
11:54 AM
The way I am reading it there should be an element less than or equal to 1 in the subsequence, thru the relation......
Should I instead be reading that, 1 and 2 are the first in the sequences ????
@LeakyNunmy u available or are u busy????
@educ can you help ??
 
12:46 PM
hey chat
you think there is much work to be had as a mathematics typist?
 
 
1 hour later…
1:54 PM
Hi to everyone! Do anyone ever heard of this version of Spectral theorem?
(Spectral Decomposition). Let E be a complex Banach space and T ∈ L(E).
Assume that σ(T) = σ1 ∪σ2, where σ1, σ2 are compact disjoint sets. Then there are closed spaces E1, E2 with:
1. E = E1 ⊕ E2;
2. T(E1) ⊂ E1 and T(E2) ⊂ E2;
3. σ(T|E1) = σ1 and σ(T|E2) = σ2.
If yes, can you please tell me where to find.
 
 
1 hour later…
3:03 PM
@MatsGranvik Hi do you know how to code in mathematica?
 
3:20 PM
@JackOhara Yes short programs.
 
@MatsGranvik I would like to ask you if you have written or can write Miller Rabin test for primility testing, i did not find on the web such thing
I can provide you with the details on the test ofcourse if you do not know about it
 
@JackOhara I have heard of the Miller Rabin test. Most of my programs are things I have thought out myself, I have never really programmed other peoples work.
 
@MatsGranvik it is not a work , just something useful for me haha
I do not work, am a student
I have everything written down, just have no experience in using codes in mathematica
 
I am not an expert on the Miller Rabin rest, but looking at the Wikipedia page I judge that you could program this in Microsoft Office Excel.
Input #1: n > 3, an odd integer to be tested for primality
Input #2: k, the number of rounds of testing to perform
Output: “composite” if n is found to be composite, “probably prime” otherwise

write n as 2r·d + 1 with d odd (by factoring out powers of 2 from n − 1)
WitnessLoop: repeat k times:
pick a random integer a in the range [2, n − 2]
x ← ad mod n
if x = 1 or x = n − 1 then
continue WitnessLoop
repeat r − 1 times:
x ← x2 mod n
if x = n − 1 then
continue WitnessLoop
return “composite”
return “probably prime”
What I meant with other peoples work, is other peoples creative ideas, not work-work like a job or task.
 
@MatsGranvik I see thanks !
@AlessandroCodenotti Hi
 
3:30 PM
Hi
 
where in Italy do you live?
I just heard the news about the virus spread there, you have any idea?
Here in Canada is also spreading and it is not looking good
 
I live in one of the most affected regions, but there are no cases in the province I live in so far. Apart from a few villages the situation is looking pretty good I'd say, as long as it doesn't start spreading in a big city we should be fine
 
Hope so ! stay safe
wait what
 
(I actually live in Germany since I'm doing my Masters there, but I happen to be back in Italy now, not the best time to go back home)
 
Oh never mind, I missunderstood what you wrote first time
 
I see, but it is eveywhere i think
@MatsGranvik Super ! thanks! , I can try to modify it a bit for my use
 
3:47 PM
@genescuba first: yes, those three outcomes are the only ones possible. Second: the only cases I could see replacement being an issue are the last two. But you specified that, upon drawing the mint the first time, you’d put it back in the bag. So you do replace it.
That is, I see nothing in the problem statement which prevents you from drawing the Dane mint twice. It’s certainly unlikely, but not forbidden.
 
4:07 PM
I'm so pleased I was able to make progress over the past year and write a pretty concise and coherent question :) math.stackexchange.com/questions/3560611/…
my new year's resolution of being more mathematically precise is looking do-able
thanks adderall
this one too even though it's kind of a moot point math.stackexchange.com/questions/3559324/…
 
4:53 PM
Hey guys a simple question, is there any difference between "polynomial chaos" and "homogeneous chaos" in the context of Wiener chaos?
 
Generally, how does one use a (non-linear) decomposition operator to split a smooth manifold into a ring-like structure?
I guess I should first ask if it's possible to do that for a linear operator
and maybe it's better to consider the smooth manifold to actually be a variety in the context of algebraic geometry
If $X$ is an affine algebraic set defined by an ideal $I$, then the quotient ring ${\displaystyle R=k[x_{1},\ldots ,x_{n}]/I}{\displaystyle~~~~ R=k[x_{1},\ldots ,x_{n}]/I}$ is called the coordinate ring of $X$. If $X$ is an affine variety, then $I$ is prime, so the coordinate ring is an integral domain. The elements of the coordinate ring R are also called the regular functions or the polynomial functions on the variety
 
5:41 PM
Could a moderator open this - math.stackexchange.com/questions/3558240 ?
 
This is not the right place to look for moderators :)
But it looks like you posted an answer yourself. So shrug
heya Stan
 
@TedShifrin hey ted! how r u?
i'm going to see beethoven 9 tomorrow
very excited!
 
Oh cool. And hear, presumably :P
 
hahahahaha :') yeah primarily that
 
How's life in the stat lane?
 
5:48 PM
ehhh, I'm objectively not as good as most of my peers and am always in the bottom of the class. But on the other hand, I'm learning a ton and very proud of my willingness to continue to study hard even when I do poorly.
So I'm not sure how to feel :') but moping wont make me a stronger student
 
Well, if you're learning, that's good.
 
So question, I have a friend who had trouble learning math due to a learning disability growing up
And she wants to start trying to learn math by studying online
and is trying to pick and choose what topics she should learn
she plans to be a lawyer
and maybe work in government
and although she says she doesn't need math
she just wants to overcome this challenge
 
She needs to do OK on the LSAT. I don't know what math is on that.
 
do you have any suggestions for which areas to pick and choose from?
yeah that makes sense
 
She already is in college?
 
5:52 PM
yeah
 
So she did the SATs OK.
 
yeah good at standardized tests for some reason
i think she's naturally capable
 
Oh, OK ...
I just googled. No math on LSAT other than basic percentages, etc.
My personal choice would be some basic probability. Things like conditional probability and understanding false positives/negatives on drug testing, etc. I think this stuff is important for doctors, lawyers, etc.
 
She said she was gonna start with algebra and then learn trig. and i was like "I think trig is a waste of time unless ur doing physical science because areas like calculus and derivatives you encounter more frequently. didn't use trig once in econ" Is that bad advice?
 
Yeah, I don't think she should do stuff just to prove to herself she can do it. I think it should be things she might enjoy or profit from learning.
 
5:55 PM
exactly
 
Of course, basic numeracy and basic math with fractions, percentages, etc., is essential.
I would actually opt for basic probability/stat over tons of algebra/trig. Understanding functions, of course, would be good.
 
interesting, is that because it tends to show up in professional settings?
 
It's so important in the real world altogether. I don't know what kind of law she'll end up in, but it seems to me all sorts of legal stuff uses probability/stat. I know mathematicians who've been called as witnesses in trials for such things.
 
Really? What kind of question would a court want to ask a mathematician?
 
Well, things like proving that something the prosecution alleged was highly unlikely ... with a conditional probability argument. I don't remember specifics.
Of course, the defense had all sorts of data to feed into that probability argument.
 
5:59 PM
wow interesting
 
I mean, a statistician is probably more germane here, but it's the same stuff.
Here's a crazy remark. Actually learning some proofs in mathematics would be better training for law school, since legal arguments are basically proofs. One reason law schools love math majors is the strength in logic and proofs that math majors must have. So she might actually want to do a bit of that just to improve that aspect. Not super abstract things, but understanding contrapositives and proofs by contradiction would be so helpful.
 
actually that might also help build confidence too
cuz she's very good at arguing and logic
i have discussed math with her occasionally and she grasps it very quickly once she gets it
and is very logical
 
Great.
 
so does that mean choosing a probability online course with proofs?
my first exposure to proofs was with real numbers
so I was wondering where u think she should start
 
No, those were separate ideas.
 
6:05 PM
unless u count middle school geometry lol
 
I am totally unfamiliar with on-line options.
But Euclid's proof that $\sqrt2$ is irrational is a standard place to start.
Assuming one knows what even and odd numbers are.
 
@TedShifrin aren't you one of the online options :')?
 
No.
 
One should never separate even numbers from odd numbers, it makes the numbers unnatural.
 
It's probably not right for her, but my standard recommendation for math students wanting to understand more about proofs ("intro to higher math" type courses) is Houston's How To Think Like a Mathematician. I like his book.
 
6:10 PM
cool i will pass on this advice. :) thanks ted! ok gotta go meet with my adviser about coursework for next quarter. ttyl amigo!
 
TTYL.
G'day, @Semiclassic.
 
Hi
@TedShifrin @StanShunpike a somewhat famous example was during the OJ trial, where a defense witness quoted that the probability of one spouse killing the other was small. But that’s the probability with no conditions attached. The relevant probability is: if your spouse is murdered, what is the probability you did it? And that is substantially higher
 
Oh, that's a good one.
 
Hmm, seems like I’m misremembering a little. See the wiki article on “prosecutor’s fallacy”: en.m.wikipedia.org/wiki/Prosecutor%27s_fallacy
Specifically the section regarding examples for defense rather than prosecutors
 
6:26 PM
I suspect this is quite related to my false positive/negative computations.
 
Hello
If C is compact in (X,d) then there exists $x,y\in C$ such that $d(x,y)=diam(C)$
without using max argument
 
What does "without using max argument" mean? The definition uses "max" !!
 
6:42 PM
@TedShifrin I meant without using the fact the a continuous function on a compact set attains a maximum
 
LOL ... this is like asking to tie your shoe without using your hands.
That's the right proof. What do they want you to use?
 
@TedShifrin properties of supremum, I suppose. I thought of choosing $x_n,y_n \in C$ such that $d(x,n,y_n)>diamC- \frac{1}{n}$
 
It's stupid, but you can do it with the definition of compactness and triangle inequality.
OK, go on with what you're doing.
 
Then by sequential compactness one can find subsequences $(x_{n_k})$ and $(y_{n_m})$ that converge to some x and some y respectively
 
Good. So you're done?
 
6:46 PM
@TedShifrin no. I think I need to make the indices the same
 
No you don't.
But you can arrange that if you insist.
 
@TedShifrin may you elaborate on why I don't need to arrange the indices?
 
Because all you need to do is produce the points $x$ and $y$.
But I see why you want the indices the same.
You want the easiest way to find $d(x,y)$.
 
@TedShifrin yeah
 
So this is a standard technique. Don't find subsequences separately. Find one that works for $x_n$. Now what can you do?
 
6:57 PM
@TedShifrin Okay, so by sequential compactness, I find a subsequence for $(x_{n_k})$ that converges to some $x$. I construct a subsequence for $(y_{n_m})$ by setting $n_m=n_k$?
 
No, that might not converge.
 
@TedShifrin yes, but by compactness, it has a subsequence which does
 
OK, that's not what you wrote.
 
7:17 PM
heya @Rithaniel
 
Hey Ted
How goes it today?
 
Mostly fine, and you?
 
Doing okay. Just got home and debating between stats HW and finishing the grading for calc
 
Well, I hope there's less yelling at your debate ...
 
Ah, nah, the two sides are very vocal
It's been a long week. Three homeworks all due in quick succession. Some had to get pushed back
 
7:22 PM
You're talking about all the grading you have to do?
 
Well, I have homeworks to do as well, not to mention the grading
 
Aren't your grading hours limited to a certain number per week? They can't dump arbitrarily huge things in your lap.
 
The grading is for two sections. About 80 students. 3 problems apiece
 
This is why so many calculus courses have on-line homeworks these days.
 
Yeah, I have limited hours, but it's not unreasonably much homework
 
7:25 PM
OK. Sometimes instructors are totally not reasonable, whether with undergraduate graders or with graduate graders.
I say do a little grading and then make sure you get your own stuff well on its way.
 
These are freshmen, though, so you don't usually just get simple, easy-to-point-out mistakes. More often than not, you end up staring at what they wrote just trying to figure out what they were trying to do
Also, yeah, my HW should be my priority right now
 
Let $C$ be compact. Suppose $C$ is non-empty. Choose $x_n,y_n\in C$ such that $d(x_n,y_n)>diamC-\frac{1}{n}$. By compactness, we may find $(x_{n_k})$ in $C$ which converges to some $x\in C$. Consider $(y_{n_k})$. This sequence contains a subsequence, $(y_{n_k_l})$ which converges to some $y$. Thus, $d(x_{n_k_l},y_{n_k_l})$ $\rightarrow$ $d(x,y)$. But, $d(x_{n_k_l},y_{n_k_l})$ $>diamC-\frac{1}{n_k_l}$ . As $l\rightarrow \infty$, we obtain $d(x,y)= diamC$.
 
Yup, that's right, @topologicalmagician.
 
@TedShifrin perfect. Thanks so much.
 
Well, actually you have $d(x,y)\ge \text{diam}\,C$, right? But then ...
 
7:31 PM
@TedShifrin we can't have $d(x,y)>diamC$ because $diamC$ is the supremum.
So equality must hold
 
Yes, of course. I was just quibbling over the last step of your proof.
Of course, $\text{diam}\,C-1/n<d(x_n,y_n)\le \text{diam}\,C$ to start with. And if equality held there, you'd be done.
 
@TedShifrin yeah, thats what I had in mind.... MSE banned me for asking more than 50 questions per month, so I have to wait lol. Almost all my questions are proof verifications lol
 
You do ask too much :)
 
haha, yeah I'm aware
 
But at least you generally don't just post homework with no effort, as so many others do.
And now we're getting garbage answers, too.
 
7:38 PM
@TedShifrin I usually don't ask for homework questions, just questions I find interesting in a book or online or something I thought of or clarification on a theoretical aspect I'm trying to understand from lectures. I try to refrain from asking homework questions
but occasionally I also do, just not as much
 
I agree, although sometimes I have told you just to stop and think.
 
Hi, I'm having some trouble with finding the image of the function $f: (2, \infty) \to \mathbb{R}$ given by $f(x) = \frac{x}{1+2x}$.. I found the inverse of this function and its domain which is $(-\infty, \frac{1}{2})$ and $(\frac{1}{2}, \infty)$, but i'm not sure how to use the fact that the domain of the orignial function was restricted to begin with. Could anybody help, please?
 
@Abwatts: Do you see that this is a decreasing function that goes to $0$ as $x\to\infty$?
Oh, you just changed it.
 
Yes, sorry. I made a typo.
 
I would recommend doing a little algebra first. $x=\frac12(1+2x) - \frac12$
Well, now what?
 
7:42 PM
did you intend to have y in the brackets, and then solve for the inverse function?
 
No, I don't care about the inverse function. I'm trying to get you to see the graph.
What's the graph on $[0,\infty)$?
After you see it, you can use your inverse function stuff to be rigorous about the answer.
 
so it's basically a line from $[0, \infty)?$
 
No. You have $\dfrac x{1+2x} = \dfrac{\frac12(1+2x)-\frac12}{1+2x}$. So ... ?
Therefore, $\dfrac x{1+2x} = \dfrac12\big( 1-\dfrac 1{1+2x}\big)$ ... is what you should be telling me.
 
can a set of discrete, partially true information, possibly in the form of logical statements in a causal dynamic process yield, through a combination process, completely true information (imply some more global statement)?
 
I see.. Could I instead use the fact that the image of this function without a restricted domain is $(-\infty, \frac{1}{2})$ and $(\frac{1}{2}, \infty)$ and then use the fact that the domain is $(2, \infty)$?
to get the image of the function with that restricted domain?
 
7:50 PM
Are you going to use the intermediate value theorem as part of your argument?
It seems to me that my approach is more primitive than yours.
 
Well, I'm not really trying to prove that this is the image, but rather just find it.
 
So you're making things too hard when you do the image. Then you have to understand where those two pieces come from.
 
I know that the image is supposed to be $(\frac{1}{3}, \frac{1}{2})$, but I'm not sure how to find it, unfortunately..
 
I'm telling you how.
Oh, that answer is wrong.
At $x=2$ you get $2/5$, and as $x\to\infty$ the function approaches $1/2$. So the image of the open interval is $(2/5,1/2)$.
My algebra (or calculus) shows that the function is increasing on the interval.
 
Oh, that makes much more sense now. That was the answer that was listed in my textbook..
 
7:55 PM
I watched the debate last night...it was ugly
kinda funny too though
 
@TedShifrin I think I understand it now, thanks!
 
You're welcome.
 
8:09 PM
3
Q: Does anyone know what this diagram could be about?

geocalc33Does anyone know what this diagram could be about? I found it about a year ago on some blog and I tried to relocate the source of the picture but was unable to. My best guess is that maybe $R(x)$ and $G(x)$ are ring-like structures, $\mathfrak{D}^*_x$ and $\mathfrak{D}_x$ are some operators, $f_...

 
 
2 hours later…
10:21 PM
I don't know what other context to put
I think it's a valid diagram
@LukasHeger I didn't see what you wrote?
 
11:25 PM
Umm @TedShifrin
Would you care to take a look? math.stackexchange.com/questions/3561474/…
 
@TedShifrin Hey Ted, do you know how to write small codes in mathematica?
 
11:54 PM
@Fuzzy: I answered.
@Jack: What do you mean by "small codes"?
 
The convergence may not be uniform, but can't you justify that exchange using DCT
 

« first day (3493 days earlier)      last day (1532 days later) »